计算机应用研究2012，Vol.29Issue(3)：1060-1062,3.DOI:10.3969/j.issn.1001-3695.2012.03.071
链路共享的时延约束组播路由局部平衡优化算法
Delay-constrained multicast routing balanced-optimization algorithm of link-sharing based on local information
摘要
Abstract
This paper analyzed the cost and computational complexity as constructing delay-constrained multicast tree. So as to optimize shortest paths, it proposed a new algorithm of ORLSB ( optimal routing algorithm for link-sharing balance) . The link selection function of the algorithm not only considered the priority of the destination nodes, but also took into account the priority of the low delay path based on local information. Because the multicast tree has fewer possible path, the algorithm reduced the probability of creating multicast tree through the minimum delay path and improved the sharing paths. Simulation results show that this algorithm has balanced cost, delay and computational complexity, and has better overall performance.关键词
最小斯坦利/组播通信/局部信息/链路共享/选择函数Key words
minimum Steiner tree(MST) / multicast communication/ local information/ link-sharing/ selection function分类
信息技术与安全科学引用本文复制引用
刘维群,张程,李元臣..链路共享的时延约束组播路由局部平衡优化算法[J].计算机应用研究,2012,29(3):1060-1062,3.基金项目
河南省科技攻关基金资助项目(102102210441,102102210467) （102102210441,102102210467）
河南省自然科学研究基金资助项目(2008B520027) （2008B520027）
