应用层组播共享拥塞链路消除算法  

Congestion Link Shared Eliminating Algorithm for Application Level Multicast

作　　者：王德志[1] 余镇危[1] 王德毓[2] 

机构地区：[1]中国矿业大学研究生院,北京100083 [2]华北科技学院电信系,北京101601

出　　处：《计算机工程》2007年第5期84-86,共3页Computer Engineering

基　　金：国家博士点基金资助项目(20030290003)

摘　　要：应用层组播网络由于是构造在基础网络之上的覆盖网络,因此在应用层组播路由中产生了共享拥塞链路问题。根据共享拥塞链路的不同特点,提出了一种新的基于组播会话流而改变组播树拓扑结构的应用层组播树生成算法,消除组播树中的共享拥塞链路。仿真实验表明,与基于延迟或带宽的同类路由算法相比,此算法在综合考虑组播树的带宽利用率和延迟条件下具有更好的性能。Because an application level multicast is on top of the infrastructure, it produces a congestion link shared problem in the application level multicast routing. A new routing algorithm called congestion link shared elimination （CLSE）, which is based on different multicast session and adjusts the multicast tree topology, is proposed. It can eliminate all congestion links shared in a finite number of iterations. The simulation results show that, comparing with the similar routing algorithm which based on delay or bandwidth constrain, the CLSE algorithm presents better performance with integrated considering delay and bandwidth constrains.

关 键 词：应用层组播 共享拥塞链路 路由算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]