期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
一种多受限最小代价的动态组播路由算法 被引量:1
1
作者 石坚 董天临 《计算机科学》 CSCD 北大核心 2001年第10期96-99,共4页
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 ro... 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. 展开更多
关键词 通信网 动态组播路由算法 服务质量
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部