一种异构环境下覆盖多播网络路由算法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National Natural Science Foundation of China under Grant No.90104009 (国家自然科学基金); the Natural Science Foundation of Jiangsu Province of China under Grant No. BK2001205 (江苏省自然科学基金)


A Routing Algorithm in Heterogeneous Overlay Multicast Networks
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    由于IP多播在部署上的困难,覆盖多播网络(overlay multicast networks,简称OMN)作为构建通用的多播服务平台的另一可行途径正不断为人们所认可.针对实时多媒体应用对带宽需求的异构性,研讨了异构环境下OMN的路由问题.通过对度约束模型进行扩展,描述了一种新的适应异构环境的OMN网络模型.采用分层的带宽分配策略,提出了一种异构环境下构造OMN最小延时半径多播树的启发式算法--分层的压缩树(1ayered compact tree,简称LCT)算法,并对其性质进行了理论证明和分析.仿真实验结果表明,随着分配带宽的减少,LCT算法能够有效地降低多播树的高度和网络资源使用量,并保持较低的多播树延时半径增幅.

    Abstract:

    Due to the difficulties in deployment of IP multicast, the overlay multicast networks (OMN) are being increasingly recognized as a viable alternative to construct a general multicast service infrastructure. To settle the heterogeneity of bandwidth required by real-time multimedia application, the multicast routing problem in heterogeneous OMN is discussed. A new network model of heterogeneous OMN is described by extending the degree-constrained model. Adopting the strategy of layered bandwidth allocation, a heuristic routing algorithm, called layered compact tree (LCT) is proposed to build a minimum delay radius multicast tree in heterogeneous OMN. The properties of LCT are also proved and analyzed in theory. The simulation results show that LCT could reduce both hops and network resource usage of the tree effectively, and keep a little increase in delay radius while the allocated bandwidth decreases.

    参考文献
    相似文献
    引证文献
引用本文

吴家皋,叶晓国,姜爱全.一种异构环境下覆盖多播网络路由算法.软件学报,2005,16(6):1112-1119

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2003-09-16
  • 最后修改日期:2004-05-08
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号