Bridging the Ring-Mesh Dichotomy With P-Cycles

p-cycles represent a new strategy for network restoration. Their main feature is that they retain ring-like switching characteristics but, under appropriate design optimization, yield networks that are virtually as efficient as span-restorable mesh networks. This remarkably desirable combination of attributes makes p-cycles and exciting topic for investigation. This paper attempts to summarize our work to date on p-cycle network concepts, design theory, and implementation methods for both connection-oriented (Sonet, WDM) and IP layer network restoration.

[1]  Donald B. Johnson,et al.  Finding All the Elementary Circuits of a Directed Graph , 1975, SIAM J. Comput..

[2]  M. Herzberg,et al.  An optimal spare-capacity assignment model for survivable networks with hop limits , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[3]  W. D. Grover,et al.  VP-BASED ATM NETWORK DESIGN WITH CONTROLLED OVER-SUBSCRIPTION OF RESTORATION CAPACITY , 1998 .

[4]  Wayne D. Grover,et al.  Mesh/arc networking: an architecture for efficient survivable self-healing networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[5]  Wayne D. Grover,et al.  Potential for spare capacity preconnection to reduce crossconnection workloads in mesh-restorable networks , 1994 .

[6]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[7]  Wayne D. Grover,et al.  Case studies of survivable ring, mesh and mesh-arc hybrid networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[8]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[9]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[10]  Wayne D. Grover,et al.  SELF-ORGANIZING CLOSED PATH CONFIGURATION OF RESTORATION CAPACITY IN BROADBAND MESH TRANSPORT NETWORKS , 1998 .

[11]  W. D. Grover,et al.  Self-organizing broad-band transport networks , 1997, Proc. IEEE.

[12]  Ken-ichi Sato,et al.  Self-healing ATM networks based on virtual path concept , 1994, IEEE J. Sel. Areas Commun..

[13]  T. Flanagan,et al.  Fiber network survivability , 1990, IEEE Communications Magazine.

[14]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[15]  Demetrios Stamatelakis,et al.  Theory and Algorithms for Preconfiguration of Spare Capacity in Mesh Restorable Networks , 1997 .

[16]  Wayne D. Grover,et al.  Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles") , 2000, IEEE Trans. Commun..

[17]  Salah Aidarous,et al.  Distributed Restoration of the Transport Network , 1994 .