J4
• Original Articles • Previous Articles Next Articles
WANG Jing1;LIU Jing-mei1;WANG Xin-mei1;YUAN Rong-liang2;LIU Xiang-yang3
Received:
Revised:
Online:
Published:
Contact:
Abstract: Information Eng. College, Xi′an Univ. of Science & Tech., Xi′an 710054, China; 3. Military Comprehensive Information Network Teaching Office, Xi′an Commun. College, Xi′an 710106, China) This paper presents a new multicast routing algorithm for network coding. The algorithm searches the routing groups from source to each sink by using the Dijkstra reduction network. In the process of searching, link-sharing between different path groups is considered to decrease bandwidth resource consumption and improve load balance. Simulation results show that the routing algorithm is effective, and that its performance is closer to that of the minimum-cost multicast algorithm based on network coding. Finally, mathematical analysis indicates that the algorithm can reduce computation by 40% at least.
Key words: network coding, multicast transmission, routing algorithm, resource consumption, load balance
CLC Number:
WANG Jing1;LIU Jing-mei1;WANG Xin-mei1;YUAN Rong-liang2;LIU Xiang-yang3. Multicast routing algorithm for network coding [J].J4, 2008, 35(1): 71-75.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://journal.xidian.edu.cn/xdxb/EN/
https://journal.xidian.edu.cn/xdxb/EN/Y2008/V35/I1/71
Cited