A distributed routing algorithm for datagram traffic in LEO satellite networks

Satellite networks provide global coverage and support a wide range of serv ices, 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 algorithm s. In this work, a datagram routing algorithm for LEO satellite networks is introduced. The algorithm generates minimum propagation delay paths. The p erformance of the algorithm is evaluated through simulations. The robustnes s issues of the algorithm are also discussed.