首页> 外文期刊>High Technology Letters >Routing Multipoint Connections in Packet-Switched Computer Networks
【24h】

Routing Multipoint Connections in Packet-Switched Computer Networks

机译:分组交换计算机网络中的路由多点连接

获取原文
获取原文并翻译 | 示例
           

摘要

The problem of constructing minimum-cost multicast trees with end-to-end delay and delay variation constraints to meet the quality of service requirements in high speed packet- switched environments is studied in this paper. The routing problem of the bounded delay a- long the paths from the source to each destination and the bounded variation among the de- lays along these paths is discussed, and then a new algorithm based on Hopfield neural net- works to optimize the multicast tree with delay and variation constraints is presented. The simulations show that the proposed algorithm achieves its best performance in high-speed computer networks.
机译:研究了构建具有端到端时延和时延变化约束的最小成本组播树以满足高速分组交换环境中服务质量要求的问题。讨论了从源到每个目的地的路径上有界延迟的路由问题以及沿这些路径的延迟之间的有界变化,然后基于Hopfield神经网络的新算法优化了组播树具有延迟和变化约束。仿真表明,该算法在高速计算机网络中达到了最佳性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号