Routing strategies for maximizing throughput in LEO satellite networks

This paper develops routing and scheduling algorithms for packet transmission in a low Earth orbit satellite network with a limited number of transmitters and buffer space. We consider a packet switching satellite network, where time is slotted and the transmission time of each packet is fixed and equal to one time slot. Packets arrive at each satellite independently with a some probability during each time slot; their destination satellite is uniformly distributed. With a limited number of transmitters and buffer space on-board each satellite, contention for transmission inevitably occurs as multiple packets arrive at a satellite. First, we establish the stability region of the system in terms of the maximum admissible packet arrival rate that can possibly be supported. We then consider three transmission scheduling schemes for resolving these contentions: random packet win, where the winning packet is chosen at random; oldest packet win, where the packet that has traveled the longest distance wins the contention; and shortest hops win (SHW), where the packet closest to its destination wins the contention. We evaluate the performance of each of the schemes in terms of throughput. For a system without a buffer, the SHW scheme attains the highest throughput. However, when even limited buffer space is available, all three schemes achieve about the same throughput performance. Moreover, even with a buffer size of just a few packets the achieved throughput is close to that of the infinite buffer case.

[1]  Eytan Modiano,et al.  Efficient algorithms for performing packet broadcasts in a mesh network , 1996, TNET.

[2]  D. P. Patterson.  Teledesic: a global broadband network , 1998, 1998 IEEE Aerospace Conference Proceedings (Cat. No.98TH8339).

[3]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[4]  Krzysztof Pawlikowski,et al.  Steady-state simulation of queueing processes: survey of problems and solutions , 1990, CSUR.

[5]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[6]  P.W. Lemme,et al.  IRIDIUM(R) aeronautical satellite communications , 1998, 17th DASC. AIAA/IEEE/SAE. Digital Avionics Systems Conference. Proceedings (Cat. No.98CH36267).

[7]  Eytan Modiano,et al.  Capacity provisioning and failure recovery in mesh-torus networks with application to satellite constellations , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[8]  Ömer Egecioglu,et al.  Lower bounds on communication loads and optimal placements in torus networks , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[9]  Eylem Ekici,et al.  A distributed routing algorithm for datagram traffic in LEO satelitte networks , 2001, TNET.

[10]  F AkyildizIan,et al.  A distributed routing algorithm for datagram traffic in LEO satelitte networks , 2001 .

[11]  John N. Tsitsiklis,et al.  Efficient Routing Schemes for Multiple Broadcasts in Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..

[12]  Emmanouel Varvarigos,et al.  Efficient routing algorithms for folded-cube networks , 1995, Proceedings International Phoenix Conference on Computers and Communications.

[13]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[14]  John N. Tsitsiklis,et al.  The efficiency of greedy routing in hypercubes and butterflies , 1991, SPAA '91.

[15]  Emmanouel A. Varvarigos,et al.  Performance of hypercube routing schemes with or without buffering , 1994, TNET.

[16]  Albert G. Greenberg,et al.  Deflection routing in hypercube networks , 1992, IEEE Trans. Commun..

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