期刊文献+

基于链路共享度的网络编码多播路由算法 被引量:8

A Routing Algorithm for Network Coding Multicast Based on Shareable Links
下载PDF
导出
摘要 针对网络编码中最小编码子图的构造问题,提出了一种基于链路共享度的网络编码多播路由算法。该算法利用各条链路的共享度不同,依次选择共享度最大的链路加入到多播传输路径中。实验仿真结果表明,该算法与传统的最短路径多播树算法相比,可节省网络资源约6%~15%,能更好地均衡网络负载,结合随机网络编码算法,能够有效提升多播传输的性能。 A muting algorithm for Network Coding Multicast based on Shareable Links (NCMSL) is proposed to achieve minimum coding subgraph for network coding. Taking into account of the link sharing, the algorithm designs the multicast propagating paths on which network coding is applied, and then selects the link with max shareability to construct multicast paths successively. Simulation results show that the introduction of shareable links integrated with random network coding can bring significant benefits for multicast, and can reduce bandwidth consumption about 6% - 15%, while has advantages in banalance of network loads compared with Shortest Path Tree (SPT) algorithm.
出处 《电讯技术》 北大核心 2011年第3期79-83,共5页 Telecommunication Engineering
基金 国家自然科学基金资助项目(60962002) 广西高校人才小高地建设创新团队资助计划项目(桂教人[2007]71号) 广西信息与通讯技术重点实验室资助项目(20904) 2010年广西研究生教育创新计划项目(105931003089)~~
关键词 网络编码 多播路由算法 链路共享度 network coding multicast muting algorithm link shareability
  • 相关文献

参考文献12

二级参考文献46

  • 1Ahlswede R, Cai Ning, Li S Y R, and Yeung R W. Network information flow. IEEE Trans. on Inf. Theory, 2000, 46(4): 1204-1216.
  • 2Lun 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.
  • 3Zhu 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.
  • 4Waxman B M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 1988, 6(9): 1617-1622.
  • 5Fang S C and Puthenpura S. Linear Optimization and Extensions: Theory and Algorithms. Englewood Cliffs, New Jersey: Prentice Hall, 1993, Section 3.3.
  • 6Ahlswede R, Cai Ning, Li Shuoyen Robert, et al. Network information flow[J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216.
  • 7Katti S, Katabi D, Hu Wenjun, et al. The importance of being opportunistic, practical network coding for wireless environments[C] //Proceedings of 43^rd Annual Allerton Conference on Communication, Control and Computing. Monticello: University of Illinois, 2005 : 134-144.
  • 8Katti S, Rahul H, Hu Wenjun, et al. XORs in the air: practical wireless network coding[J ]. ACM SIGCOMM Computer Communication Review, 2006, 36 (4) : 243- 254.
  • 9Li Shuoyen Robert, Yeung Raymond W, Cai Ning. Linear network eoding[J]. IEEE Trans Info Theory, 2003, 49(2) : 371-381.
  • 10Ho T, Medard M, Shi Jun, et al. On randomized network coding [C] // Proceedings of 41^st Annual Allerton Conference on Communication, Control and Computing. Monticello: University of Illinois, 2003: 532-542.

共引文献35

同被引文献99

引证文献8

二级引证文献32

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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