一种多受限最小代价的动态组播路由算法

摘要：

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.

关键词：Multicast、Bandwidth、Delay、Cost、Message

所属期刊栏目：28

分类号：TP39(计算技术、计算机技术)

资助基金：教育部高校骨干教师资助计划

在线出版日期：2004-01-08（万方平台首次上网日期，不代表论文的发表时间）

页数：共4页

页码：96-99