期刊文献+

基于网络编码的多播路由算法研究 被引量:3

Study on Network Coding Based on Multicast Routing Algorithm
下载PDF
导出
摘要 网络编码的提出在一定程度上提高了多播通信的传输性能。简要总结了网络编码多播传输理论的研究进展,并对网络编码多播路由问题进行了研究。分析了已有算法的优势及不足,同时考虑影响资源消耗的因素,文中提出了一种基于最短路径和最大共享链路集的网络编码多播路由算法。通过在随机网络拓扑模型下的性能仿真实验分析,发现与传统的IP最短路多播和约简网络下网络编码多播路由算法相比,该算法可显著减少网络带宽资源消耗,同时能够有效均衡链路负载。 The introduction of network coding has improved transmission performance of multicast communication in some extent. The theoretical researches on network coding multicast transmission are briefly summarized,and a research on network coding multicast rou-ting is given. The advantages and disadvantages of the existing algorithms are also analyzed. Besides,considering the factors which influ-ence resources consumption,a new algorithm based on network coding multicast routing of shortest paths and largest share links,is pro-posed. Performance simulation results show that compared with the traditional IP multicast algorithm and network coding multicast under simplified network,this algorithm can significantly reduce the consumption of network bandwidth resources,and can balance the links load efficiently.
出处 《计算机技术与发展》 2014年第5期79-82,共4页 Computer Technology and Development
基金 国家自然科学基金资助项目(61070189)
关键词 网络编码 多播路由 IP多播 共享链路 资源消耗 network coding multicast routing IP multicast share links resources consumption
  • 相关文献

参考文献11

  • 1Ahlswede R, Cai Ning, Li S Y R, et al. Network information flow [ J ]. IEEE Trans on Information Theory, 2000,46 ( 4 ) : 1204-1216.
  • 2Li S Y R ,Yeung R W, Cai Ning. Linear network coding [ J ]. IEEE Trans on Information Theory,2003,49(2) :371-381.
  • 3Zosin L,Khuller S. On directed Steiner tree[ C]//Proc of 13th annual ACM SIAM symposium on discrete algorithms. [ s. l. ] : [ s. n. ] ,2002:59-63.
  • 4Lun D S, Ratnakar N, Medard M ,et al. Minimum-cost multicast over coded packet networks [ J ]. IEEE Trans on Information Theory ,2006,52(6) :2608-2623.
  • 5王静,刘景美,王新梅.基于网络编码的多播路由算法性能分析[J].电子与信息学报,2008,30(11):2605-2608. 被引量:6
  • 6罗莉,覃团发,罗建中,刘家锋.基于链路共享度的网络编码多播路由算法[J].电讯技术,2011,51(3):79-83. 被引量:8
  • 7Ho T, Leong B, Koetter R, et al. Byzantine modification detec tion in muhicast networks using randomized network coding [C]//Proc of IEEE international symposium on information theory. [ s. l. ]: [ s. n. ] ,2004.
  • 8Leon S J.线性代数[M].张丽静,张文博,译.北京:机械工业出版社,2010.
  • 9Yeung R W, Li S Y R, Cai N, et al. Network coding theory [ M]. [ s. l. ] :Now Publishers Inc,2006.
  • 10Waxman B M. Routing of muhipoint connections [ J ]. IEEE Journal on Selected Areas in Communications, 1988,6 (9): 1617-1622.

二级参考文献24

  • 1王东,曾锋,闵应骅.基于链路可共享性的多播路由算法[J].湖南大学学报(自然科学版),2006,33(4):111-114. 被引量:3
  • 2Ahlswede R, Cai Ning, Li S Y R, and Yeung R W. Network information flow. IEEE Trans. on Inf. Theory, 2000, 46(4): 1204-1216.
  • 3Lun D S, Ratnakur N, and Medard M, et al.. Minimum-cost multicast over coded packet networks. IEEE Trans. on Inf. Theory, 2006, 52(6): 2608-2623.
  • 4Zhu Ying, Li Baochun, and Guo Jiang. Multicast with network coding in application-layer overlay networks. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 107-120.
  • 5Waxman B M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 1988, 6(9): 1617-1622.
  • 6Fang S C and Puthenpura S. Linear Optimization and Extensions: Theory and Algorithms. Englewood Cliffs, New Jersey: Prentice Hall, 1993, Section 3.3.
  • 7Ahlswede R, Cai Ning, Li S Y R, et al. Network information flow[J]. IEEE Transactions on Infromation Theory, 2000,46 (4) : 1204 - 1216.
  • 8Koetter R, Medard M. An algebraic approach to network coding[J]. IEEE/ACM Transactions on Networking, 2003,11 (5) :782 - 795.
  • 9Jaggi S,Sanders P, Chou P A, et al. Polynomial time algorithms for multicast network code construction[ J]. IEEE Transactions on Information Theory,20135,51 (6) : 19-/3 - 1982.
  • 10Ho T, Medard M, Koetter R, et al. A random linear network coding approach to multicast[J]. IEEE Transactions on Infor- mation Theory,2006,52(10) :4413 - 4430.

共引文献21

同被引文献17

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部