J4

• Original Articles • Previous Articles     Next Articles

Multicast routing algorithm for network coding

WANG Jing1;LIU Jing-mei1;WANG Xin-mei1;YUAN Rong-liang2;LIU Xiang-yang3
  

  1. (1. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi′an 710071, China; 2. Commun. & 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)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-02-20 Published:2008-01-20
  • Contact: WANG Jing E-mail:jingwang@mail.xidian.edu.cn

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: 

  • TN913.1+1