Datagram routing algorithm for LEO satellite networks

Author

Ekici, Eylem ; Akyildiz, Ian F. ; Bender, Michael D.

Author_Institution

Broadband & Wireless Networking Lab., Georgia Inst. of Technol., Atlanta, GA, USA

Volume

2

fYear

2000

fDate

6/22/1905 12:00:00 AM

Firstpage

500

Abstract

Satellite networks provide global coverage and support a wide range of services. Low-Earth-orbit (LEO) satellites provide short round-trip delays and are becoming increasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. In this work, a datagram routing algorithm for LEO satellite networks is introduced. The algorithm generates minimum propagation delay paths. The performance of the algorithm is evaluated through simulations and finally robustness issues are discussed

Keywords

data communication; delays; minimisation; satellite communication; telecommunication network routing; LEO satellite networks; datagram routing algorithm; low-Earth-orbit satellites; minimisation; performance evaluation; propagation delay paths; robustness; round-trip delays; simulations; Bandwidth; Computer networks; Delay; Internet; Laboratories; Low earth orbit satellites; Network topology; Routing; Switches; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

ISSN

0743-166X

Print_ISBN

0-7803-5880-5

Type

conf

DOI

10.1109/INFCOM.2000.832223

Filename

832223