A Distributed Multicast Routing Scheme with Network Coding in LEO Satellite Networks
Traditional source multicast algorithms in satellite networks have several disadvantages: high computing complexity, slow establishment of multicast routing and long convergence time. In order to cope with these problems, this paper proposes an algorithm (Network coding-distributed multicast routing algorithm, NC-DMRP). The algorithm adopts an iterative computing approach which is distributed deployed among all satellite nodes. Consequently, NCDMRP can produce a source of multicast routing tree more quickly. Furthermore, with network coding the packet loss rate is decreased dramatically and thus more network throughput can be achieved and the end to end transmission delay is also reduced. Simulation results show that the average of the packet delivery performance is increased by 3％; we compared with the typical source multicast algorithm MRA (multicast routing algorithm), NC-DMRP improves the total data transfer delay performance, and enhances network robust fault tolerance and data distribution rate.
Distributed routing Network coding Queuing theory Polar orbit constellation Distributed iterative
Changsheng Chen Wei Dong Min Zhang Junfeng Wang
College of Computer Science and Engineering,Sichuan University,P.R.China,610064 College of Computer Science and Engineering,Sichuan University, P.R.China, 610064 Information Center University of Electronic Science &Technology of China P.R.China 610054
国际会议
重庆
英文
415-419
2011-01-21（万方平台首次上网日期，不代表论文的发表时间）