Approximating optimal spare capacity allocation by successive survivable routing

The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to route backup paths and allocate spare capacity in the network to guarantee seamless communications services survivable to a set of failure scenarios. This is a complex multi-constraint optimization problem, called the spare capacity allocation (SCA) problem. This paper unravels the SCA problem structure using a matrix-based model, and develops a fast and efficient approximation algorithm, termed successive survivable routing (SSR). First, per-flow spare capacity sharing is captured by a spare provision matrix (SPM) method. The SPM matrix has a dimension the number of failure scenarios by the number of links. It is used by each demand to route the backup path and share spare capacity with other backup paths. Next, based on a special link metric calculated from SPM, SSR iteratively routes/updates backup paths in order to minimize the cost of total spare capacity. A backup path can be further updated as long as it is not carrying any traffic. Furthermore, the SPM method and SSR algorithm are generalized from protecting all single link failures to any arbitrary link failures such as those generated by Shared Risk Link Groups or all single node failures. Numerical results comparing several SCA algorithms show that SSR has the best trade-off between solution optimality and computation speed.

[1]  Deep Medhi,et al.  Some approaches to solving a multihour broadband network capacity design problem with single-path routing , 2000, Telecommun. Syst..

[2]  Jeffery R. Westbrook,et al.  Algorithms for Restoration Planning in a Telecommunications Network , 1999, ALENEX.

[3]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[4]  Kim-Fung Man,et al.  Using Genetic Algorithms to Design Mesh Networks , 1997, Computer.

[5]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[6]  Murali S. Kodialam,et al.  Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information , 2003, TNET.

[7]  Eiji Oki,et al.  A disjoint path selection scheme with shared risk link groups in GMPLS networks , 2002, IEEE Communications Letters.

[8]  David Tipper,et al.  Prioritized traffic restoration in connection oriented QoS based networks , 2003, Comput. Commun..

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

[10]  Masayuki Murata,et al.  Design Method for Highly Reliable Virtual Path Based ATM Networks , 1996 .

[11]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[12]  John C. McDonald,et al.  Public network integrity-avoiding a crisis in trust , 1994, IEEE J. Sel. Areas Commun..

[13]  Panos M. Pardalos,et al.  Design of survivable networks , 2006 .

[14]  José Duato,et al.  A theory of fault-tolerant routing in wormhole networks , 1994, Proceedings of 1994 International Conference on Parallel and Distributed Systems.

[15]  Ori Gerstel,et al.  Protection interoperability for WDM optical networks , 2000, TNET.

[16]  W. D. Grover,et al.  Comparative Methods and Issues In Design of Mesh-Restorable STM and ATM Networks , 1999 .

[17]  Chunming Qiao,et al.  Trap avoidance and protection schemes in networks with shared risk link groups , 2003 .

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

[19]  Chunming Qiao,et al.  Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .

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

[21]  Wayne D. Grover,et al.  The Forcer Concept and Express Route Planning in Mesh-Survivable Networks , 2004, Journal of Network and Systems Management.

[22]  Yu Liu,et al.  Spare capacity allocation: model, analysis and algorithm , 2001 .

[23]  Robert D. Doverspike.  Trends in Layered Network Management of ATM, SONET, and WDM Technologies For Network Survivability and Fault Management , 2004, Journal of Network and Systems Management.

[24]  Lorne Mason,et al.  Comparison of two path restoration schemes in self-healing networks , 2002, Comput. Networks.

[25]  S. Chaudhuri,et al.  A national mesh network using optical cross-connect switches , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[26]  Parameswaran Ramanathan,et al.  Resource aggregation for fault tolerance in integrated services networks , 1998, CCRV.

[27]  Hideki Sakauchi,et al.  A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[28]  Bernard Kolman,et al.  Discrete Mathematical Structures , 1984 .

[29]  Filip De Turck,et al.  Dimensioning of survivable WDM networks , 1998, IEEE J. Sel. Areas Commun..

[30]  Tsong-Ho Wu,et al.  Emerging technologies for fiber network survivability , 1995, IEEE Commun. Mag..

[31]  Graham McMahon,et al.  An integrated GA–LP approach to communication network design , 1999, Telecommun. Syst..

[32]  Wayne D. Grover,et al.  Optimal Spare Capacity Preconfiguration for Faster Restoration of Mesh Networks , 2004, Journal of Network and Systems Management.

[33]  Kris Struyve,et al.  End-to-end survivable broadband networks , 1995 .

[34]  M. Herzberg,et al.  The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.

[35]  Muriel Médard,et al.  Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.

[36]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[37]  Luca Valcarenghi,et al.  On the Convergence of the Link-State Advertisement Protocol in SurvivableWDM Mesh Networks , 2003 .

[38]  Ue-Pyng Wen,et al.  Applying tabu search to spare capacity planning for network restoration , 1999, Comput. Oper. Res..

[39]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[40]  Piet Demeester,et al.  Resilience in multilayer networks , 1999, IEEE Commun. Mag..

[41]  David Tipper,et al.  On fault recovery priority in ATM networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[42]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

[43]  David Tipper,et al.  Fault Recovery Routing in Wide Area Packet , 1997 .

[44]  R. Braden,et al.  Resource reSer Vation Protocol (RSVP) , 1997 .

[45]  Robert D. Doverspike,et al.  Comparison of capacity efficiency of DCS network restoration routing techniques , 1994, Journal of Network and Systems Management.

[46]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[47]  Eytan Modiano,et al.  Survivable routing of logical topologies in WDM networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[48]  Chunming Qiao,et al.  An ultra-fast shared path protection scheme - distributed partial information management, part II , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[49]  Yu Liu,et al.  Spare Capacity Allocation for Non-Linear Link Cost and Failure-Dependent Path Restoration , 2001 .

[50]  Wayne D. Grover,et al.  Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..

[51]  Xun Su,et al.  An online distributed protection algorithm in WDM networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[52]  Robert Doverspike,et al.  Challenges for MPLS in optical network restoration , 2001, IEEE Commun. Mag..

[53]  Yu Liu,et al.  Spare Capacity Planning for Survivable Mesh Networks , 2000, NETWORKING.

[54]  Shen Lin,et al.  Heuristic Techniques for Solving Large Combinatorial Problems on a Computer , 1970 .

[55]  Eric Bouillet,et al.  Lightpath Re-optimization in mesh optical networks , 2005, IEEE/ACM Transactions on Networking.

[56]  Jeffery L. Kennington,et al.  Fault restoration and spare capacity allocation with QoS constraints for MPLS networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[57]  M. Herzberg,et al.  Optimal resource allocation for path restoration in mesh-type self-healing networks , 1997 .

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

[59]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[60]  Wayne D. Grover,et al.  Fast heuristic principle for spare capacity placement in mesh-restorable SONET/SDH transport networks , 1997 .

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

[62]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).