摘要
本文在现有成组多播路由算法的基础上 ,通过最大限度地使用原有的计算结果、以存储空间换取计算时间两种策略 ,获得了计算效率很高的带宽预留的成组多播快速路由算法FGMRA(FastGroupMulticastRoutingAlgo rithm) .使用FGMRA得到的多播生成树总费用与C .P .Low和N .Wang算法 (一种总代价和路由分配失败概率较低的成组多播路由算法 )基本相同 ,计算效率大为提高 .随机网络模型的仿真结果表明 :FGMRA算法快速、稳定 。
Based on existing routing Algorithm,we propose a fast algorithm called FGMRA (Fast Group Multicast Routing algorithm) for group multicast by using two strategies.One is to make the best of calculation in existence.Another is to enlarge the storage spaces to get high speed.Compared with algorithm proposed by C.P.Low and N.Wang,the total cost of multicast trees created by two algorithms is almost equal,but our algorithm is faster.The simulation result shows that FGMRA is fast,stable and efficient,and can be used widely.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2003年第4期569-572,共4页
Acta Electronica Sinica
基金
国家自然科学基金 (No :60 0 0 2 0 0 4 )
关键词
成组多播
路由
带宽
最小代价
group multicast tree
routing algorithm
bandwidth
minimum cost
