A Multicast Routing Algorithm for LEO Satellite Networks

Author

Mao, Tengyue

Author_Institution

LIESMARS, Wuhan Univ., Wuhan, China

fYear

2009

fDate

6-7 June 2009

Firstpage

94

Lastpage

96

Abstract

In LEO satellite networks, the traditional multicast routing algorithm exist the problem of high computational complexity. In this paper, a fast iterative distributed multicast routing algorithm was developed based on the inherent characteristics of satellite networks which using distributed computing model and significantly reducing the algorithm computational complexity. Simulations show that fast algorithm has low computational complexity, a better average delay performance and overhead compared with the MRA.

Keywords

computational complexity; distributed algorithms; iterative methods; multicast communication; satellite communication; telecommunication network routing; LEO satellite network; average delay performance; computational complexity; iterative distributed computing model; multicast routing algorithm; Artificial satellites; Computational complexity; Distributed computing; IP networks; Iterative algorithms; Low earth orbit satellites; Multicast algorithms; Multicast protocols; Routing; Satellite broadcasting;

fLanguage

English

Publisher

ieee

Conference_Titel

Future Computer and Communication, 2009. FCC '09. International Conference on

Conference_Location

Wuhan

Print_ISBN

978-0-7695-3676-7

Type

conf

DOI

10.1109/FCC.2009.42

Filename

5235699