Datagram routing algorithm for LEO satellite networks

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.

[1]  Markus Werner,et al.  ATM-Based Routing in LEO/MEO Satellite Networks with Intersatellite Links , 1997, IEEE J. Sel. Areas Commun..

[2]  Ian F. Akyildiz,et al.  A connection handover protocol for LEO satellite ATM networks , 1997, MobiCom '97.

[3]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .

[4]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[5]  M. Werner,et al.  Performance of optimized routing in LEO intersatellite link networks , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[6]  Ian F. Akyildiz,et al.  Satellite ATM networks: a survey , 1997 .

[7]  Yanghee Choi,et al.  Topological design and routing for low-Earth orbit satellite networks , 1995, Proceedings of GLOBECOM '95.

[8]  A. F. Adams,et al.  The Survey , 2021, Dyslexia in Higher Education.

[9]  Ian F. Akyildiz,et al.  A routing algorithm for connection‐oriented Low Earth Orbit (LEO) satellite networks with dynamic connectivity , 2000, Wirel. Networks.

[10]  Wlodzimierz Dobosiewicz,et al.  A bounded-hop-count deflection scheme for Manhattan-street networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.