• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Parallel and Distributed Computing >An efficient algorithm for constructing delay bounded minimum cost multicast trees
【24h】

An efficient algorithm for constructing delay bounded minimum cost multicast trees

机译：一种构造延迟有界最小代价组播树的有效算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Multimedia applications are usually resource intensive, have stringent quality of service requirements, and in many cases involve large groups of participants. Multicasting is poised to play an important role in future deployment of these applications. This paper focuses on developing delay-bounded, minimum-cost multicast trees, linking a source to a set of multicast destination nodes. The approach taken in this paper is efficient, flexible and unique in the sense that it cleverly limits its computation only to paths that originate at multicast nodes, thereby avoiding computing paths that exclusively link non-multicast nodes. The simulation results show that the multicast trees produced by the proposed heuristic are of lower cost than those produced by other well-known heuristics, including those which use an expensive k-shortest-paths procedure to minimize the cost of the multicast tree. Furthermore, the results show that, in comparison to other heuristics, the proposed scheme results in a significant reduction in the computation time required to build the multicast tree. (C) 2004 Published by Elsevier Inc.
机译：多媒体应用程序通常是资源密集型的，具有严格的服务质量要求，并且在许多情况下涉及大量参与者。组播准备在这些应用程序的未来部署中发挥重要作用。本文着重于开发延迟受限，成本最低的多播树，将源链接到一组多播目标节点。本文所采用的方法高效，灵活且独特，因为它巧妙地将其计算仅限制在源自多播节点的路径上，从而避免了仅链接非多播节点的计算路径。仿真结果表明，所提出的启发式算法产生的组播树的成本低于其他知名启发式算法产生的组播树，包括那些使用昂贵的k最短路径过程将组播树的成本降至最低的算法。此外，结果表明，与其他启发式算法相比，该方案显着减少了构建多播树所需的计算时间。 （C）2004由Elsevier Inc.出版

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号