Capacity provisioning and failure recovery for Low Earth Orbit satellite constellation

This paper considers the link capacity requirement for an LEO satellite constellation. We model the constellation as an N×N mesh-torus topology under a uniform all-to-all traffic model. Both primary capacity and spare capacity for recovering from a link or node failure are examined. In both cases, we use a method of ‘cuts on a graph’ to obtain lower bounds on capacity requirements and subsequently find algorithms for routing and failure recovery that meet these bounds. Finally, we quantify the benefits of path-based restoration over that of link-based restoration; specifically, we find that the spare capacity requirement for a link-based restoration scheme is nearly N times that for a path-based scheme. Copyright © 2003 John Wiley & Sons, Ltd.

[1]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1999, TNET.

[2]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

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

[4]  Ö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.

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

[6]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

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

[9]  Muriel Médard,et al.  Towards a deeper understanding of link restoration algorithms for mesh networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[11]  Young-Joo Suh,et al.  All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks , 2001, IEEE Trans. Parallel Distributed Syst..

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

[13]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

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

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

[16]  S. Ramamurthy,et al.  Survivable WDM Mesh Networks, Part II-Restoration , 1999 .