摘要
The paper presents a new dynamic Multicast Routing algorithm. Then some experiments have been given to analyze the performances. The result shows that the routing mechanism in this paper successfully solves the QoS routing problems when multiple multicast communications exist and multi-cast nodes change dynamically. The scheme not only guarantees the bandwidth and end-to-end delay op-timizing the cost of the routing tree,but also effectively controls the algorithm complexity for large size of network.
The paper presents a new dynamic Multicast Routing algorithm- Then some experiments have been given to analyze the performances. The result shows that the routing mechanism in this paper successfully solves the QoS routing problems when multiple multicast communications exist and multicast nodes change dynamically. The scheme not only guarantees the bandwidth and end-to-end delay optimizing the cost of the routing tree,but also effectively controls the algorithm complexity for large size of network.
出处
《计算机科学》
CSCD
北大核心
2001年第10期96-99,共4页
Computer Science
基金
教育部高等学校骨干教师资助计划项目
