Capacity provisioning and failure recovery in mesh-torus networks with application to satellite constellations

This paper considers the link capacity requirement for a N/spl times/N mesh-torus network under a uniform all-to-all traffic model. Both primary capacity and spare capacity for recovering from link failures are examined. In both cases, we use a novel 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.

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

[2]  P. W. Lemme,et al.  IRIDIUM(R) aeronautical satellite communications , 1998 .

[3]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1997, Proceedings of INFOCOM '97.

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

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

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

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

[8]  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).

[9]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

[10]  John N. Tsitsiklis,et al.  Efficient routing schemes for multiple broadcasts in hypercubes , 1990, 29th IEEE Conference on Decision and Control.

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

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

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

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

[15]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. II. Restoration , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

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

[17]  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).