A distributed routing algorithm for datagram traffic in 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. The robustness issues of the algorithm are also discussed.
satellite networks low earth orbit (leo) connectionless/datagram routing