一种基于带宽和时延约束的分布式组播路由算法

陆慧梅, 向勇, 史美林, 杨敏

电子学报 ›› 2002, Vol. 30 ›› Issue (S1) : 1978-1981.

PDF(510 KB)
PDF(510 KB)
电子学报 ›› 2002, Vol. 30 ›› Issue (S1) : 1978-1981.
学术论文

一种基于带宽和时延约束的分布式组播路由算法

  • 陆慧梅, 向勇, 史美林, 杨敏
作者信息 +

A New Bandwidth and Delay-Constrained Distributed Multicast Routing

  • LU Hui-mei, XIANG Yong, SHI Mei-lin, YANG Min
Author information +
文章历史 +

摘要

针对已有分布式组播路由算法在寻找QoS路由时的低成功率问题,本文提出了一种新的基于带宽和时延约束的分布式组播路由算法-QDMR(QoS-based Distributed Multicast Routing).在为新组播成员搜索连接到组播树的可行路径时,QDMR算法使用RBMF(Reverse Best Metric Forwarding)转发算法代替RPF(Reverse Path Forwarding)转发算法,从而优先搜索满足带宽和时延约束要求的路径,然后才考虑代价的优化.模拟分析表明,QDMR提高了路由搜索的成功率,并且降低了协议开销.

Abstract

Nowadays,many multicast QoS muting algorithms have low success ratio of muting when receivers' QoS require-menu are strict. This paper proposes a new bandwidth and delay-constrained distributed multicast muting called QDMR(QoS-based Distributed Multicast Routing).QDMR uses RBMF(Reverse Best Metzic Forwarding) instead of RPF(Reverse Path Forwarding) in seletting path to in-tree muters. Query message is forwarded if and only if it travels from a path whose reverse mute is a RBMP(Reverse Best Metric Path)from a new receiver to the current node.If RBMPs satisfy the new receivers' QoS requirements,one of them with the smallest hop counts to the multicast tree will be selected as the branch connected to the existing multicast tree. At the end, simulation shows that QDMR improves success ratio of muting reasonably and reduces protocol overheads meanwhile.

关键词

分布式路由 / 带宽约束 / 时延约束 / 组播路由

Key words

distributed routing / delay constraint / bandwidth constraint / multicast routing

引用本文

导出引用
陆慧梅, 向勇, 史美林, 杨敏. 一种基于带宽和时延约束的分布式组播路由算法[J]. 电子学报, 2002, 30(S1): 1978-1981.
LU Hui-mei, XIANG Yong, SHI Mei-lin, YANG Min. A New Bandwidth and Delay-Constrained Distributed Multicast Routing[J]. Acta Electronica Sinica, 2002, 30(S1): 1978-1981.
中图分类号: TP393   

参考文献

[1] Wang Bin,Hou J C.Multicast routing and its QoS extension:Problems,algorithms,and protocols[J].IEEE Network,2000,14(1):22-36.

[2] Chen Shigang,Nahrstedt K.An overview of Quality-of-Service routing for the next generation high-speed networks:problems and solutions[J].IEEE Network:Special Issue on Transmission and Distribution of Digital Video,1998,12(6):64-79.

[3] 赵键,吴介一,等.一类基于源路由的多约束实时组播路由优化控制算法[J].电子学报,2001,29(4):490-494.

[4] Carlberg K,Crowcroft J.Building shared trees using a one-to-many joining mechanism[J].ACM Computer Communication Review,1997,27(1):5-11.

[5] Faloutsos M,Banerjea A,et al.QoSMIC:quality of service sensitive multicast internet protocol[A].Proceedings of ACM SIGCOMM'98[C].Vancouver,Ca,1998:144-153.

[6] Yan Shuqian,Faloutsos M,et al.QoS-aware multicast routing for the Internet:the design and evaluation of QoSMIC[J].IEEE/ACM Transactions on Networking,2002,10(1):54-66.

[7] Chen Shigang,Nahrstedt K,et al.A QoS-aware multicast routing protocol[A].Proceedings of IEEE INFOCOM'2000[C].Tel-Aviv,Israel,2000:1594-1603.

[8] Network Simulator ns-2[EB/OL].http://www.isi.edu/nsnam/.

[9] B M Waxman.Routing of multipoint connections[J].IEEE Journal on Selected Areas in Communications(JSAC),1988,6(9):1617-1622.

[10] S Casner.Major MBONE routers and links[EB/OL].ftp.isi.edu/mbone/mbone-topology.ps,1994.

[11] 史美林,向勇.具有层次结构且规模可扩展的多目标路由算法[J].通信学报,1999,20(增刊):134-142.

基金

国家自然科学基金重大研究计划 (No.90104002)

PDF(510 KB)

1289

Accesses

0

Citation

Detail

段落导航
相关文章

/