摘要
针对网络编码中最小编码子图的构造问题,提出了一种基于链路共享度的网络编码多播路由算法。该算法利用各条链路的共享度不同,依次选择共享度最大的链路加入到多播传输路径中。实验仿真结果表明,该算法与传统的最短路径多播树算法相比,可节省网络资源约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