论文信息 - Routing Space Internet Based on Dijkstra's Algorithm

Routing Space Internet Based on Dijkstra's Algorithm

Earth observation data will be moved through satellite constellations to ground stations by space internet. Routing observation traffic in this environment is constrained by factors such as satellite orbits, satellite capabilities, observation schedules, ground station schedules, and rapidly evolving natural events. Among many global routing algorithms, Dijkstra Algorithm is mostly preferred as it is faster as compared to any other algorithm and its implementation is easier. For this reason, this paper implements a routing algorithm of Dijkstra for space networks under constraints mentioned above.

Xiang-ying Li | Guo-shun Li | Sheng-tian Zhang

[1] Dimitri P. Bertsekas,et al. Data Networks , 1986 .

[2] Mark Allen Weiss,et al. Data structures and algorithm analysis in Ada , 1993 .

[3] Ron Parise,et al. Link and routing issues for Internet protocols in space , 2001, 2001 IEEE Aerospace Conference Proceedings (Cat. No.01TH8542).

[4] James L. Rash,et al. Internet Data Delivery for Future Space Missions , 2002 .

[5] Kul B. Bhasin,et al. Space Internet architectures and technologies for NASA enterprises , 2002, 2001 IEEE Aerospace Conference Proceedings (Cat. No.01TH8542).

[6] Kul B. Bhasin,et al. Developing Architectures and Technologies for an Evolvable NASA Space Communication Infrastructure , 2004 .

[7] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.