k-connected network partitioning under shared risk link groups

Partitioning a large network into a connected hierarchy is a proven technique for scalability and manageability. Although a significant body of work is devoted to this area of interest, a reference to survivable hierarchical networks where each partition remains k-connected is missing (k ≥ 2). A k-connected partition ensures functional network organization even after any k - 1 failures occur. In optical networks, a failure of a physical component (e.g., a cable or line-card) disrupts multiple logical links that share the component. Such a shared risk link group (SRLG) failure is more common than a single link or node failure in the logical topology. Hence, we study the significance of a k-SRLG-connected (kSC) partitioning problem for optical networks. For a given network, we show that finding 2-SRLG-connected (2SC) partitioning, the simplest case, is NP-complete. We provide mathematical formulations and propose a distributed-scalable heuristic solution. We also solve 2SC partitioning with flexible mapping onto the physical topology, where lightpaths can be added to guarantee a solution. Simulation results verify that the kSC partitioning scheme performs better than traditional 1-connected partitioning schemes with regard to system survivability, stability, and repartitioning overhead.

[1]  G. Sasaki Simple Layout Algorithms To Maintain Network Connectivity Under Faults , 2000 .

[2]  Chang Liu,et al.  A new survivable mapping problem in IP-over-WDM networks , 2007, IEEE Journal on Selected Areas in Communications.

[3]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

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

[5]  Patrick Thiran,et al.  Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction , 2007, IEEE Journal on Selected Areas in Communications.

[6]  A. Dutta-Roy An overview of cable modem technology and market perspectives , 2001 .

[7]  Jim Boyle,et al.  Requirements for Inter-Area MPLS Traffic Engineering , 2005, RFC.

[8]  Patrick Thiran,et al.  On survivable routing of mesh topologies in IP-over-WDM networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  J.P. Jue,et al.  Online Partitioning for Scalable and Survivable Optical Networks , 2009, IEEE/OSA Journal of Optical Communications and Networking.

[10]  Luying Zhou,et al.  Best Effort Shared Risk Link Group (SRLG) Failure Protection in WDM Networks , 2008, 2008 IEEE International Conference on Communications.

[11]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[12]  Antonio Nucci,et al.  Increasing the robustness of IP backbones in the absence of optical level protection , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Eytan Modiano,et al.  Survivable lightpath routing: a new approach to the design of WDM-based networks , 2002, IEEE J. Sel. Areas Commun..

[14]  Mounir Hamdi,et al.  On the application of the blocking island paradigm in all-optical networks , 2003, IEEE Trans. Commun..

[15]  Yan Liang,et al.  Reliability-Constrained Resource Allocation for optically interconnected distributed clouds , 2014, OFC 2014.

[16]  Jason P. Jue,et al.  2-SRLG-connected partitioning in optical networks , 2010, 2010 International Conference on High Performance Switching and Routing.

[17]  Guoliang Xue,et al.  Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Networks , 2009, IEEE INFOCOM 2009.

[18]  Masayuki Murata,et al.  A Distributed Clustering Method for Hierarchical Routing in Large-Scaled Wavelength Routed Networks , 2005, IEICE Trans. Commun..

[19]  P. Baran,et al.  On Distributed Communications Networks , 1964 .

[20]  Nick Feamster,et al.  Improving network management with software defined networking , 2013, IEEE Commun. Mag..

[21]  A. Sima Etaner-Uyar,et al.  An Evolutionary Algorithm for Survivable Virtual Topology Mapping in Optical WDM Networks , 2009, EvoWorkshops.

[22]  Yonggang Wen,et al.  Efficient fault diagnosis for all-optical networks: an information theoretic approach , 2006, 2006 IEEE International Symposium on Information Theory.

[23]  J.P. Jue,et al.  SRLG-aware partitioning for scalability and survivability , 2009, 2009 Conference on Optical Fiber Communication - incudes post deadline papers.

[24]  Byrav Ramamurthy,et al.  A scalable approach for survivable virtual topology routing in optical WDM networks , 2007, IEEE Journal on Selected Areas in Communications.

[25]  Mounir Hamdi,et al.  Routing and Wavelength Assignment in Multi-Segment WDM Optical Networks using Clustering Techniques , 2004, Photonic Network Communications.

[26]  Sung Un Kim,et al.  Fault/Attack Tolerant Recovery Mechanism Under SRLG Constraint in the Next Generation Optical VPN , 2004, ECUMN.

[27]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[28]  G.N. Rouskas,et al.  On the application of K-center algorithms to hierarchical traffic grooming , 2005, 2nd International Conference on Broadband Networks, 2005..

[29]  V. Cutello,et al.  Graph partitioning using genetic algorithms with ODPX , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[30]  Rudra Dutta,et al.  Clustering Methods for Hierarchical Traffic Grooming in Large-Scale Mesh WDM Networks , 2010, IEEE/OSA Journal of Optical Communications and Networking.

[31]  Laura Strauss,et al.  Optical Networks A Practical Perspective , 2016 .

[32]  Luca Maria Gambardella,et al.  Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks , 2006, Research Results of the DICS Program.

[33]  George N. Rouskas,et al.  A framework for hierarchical traffic grooming in WDM networks of general topology , 2005, 2nd International Conference on Broadband Networks, 2005..

[34]  Biswanath Mukherjee,et al.  Optical WDM Networks , 2006 .

[35]  Klaudia Frankfurter Optical Network Control Architecture Protocols And Standards , 2016 .

[36]  George N. Rouskas,et al.  Clustering for Hierarchical Traffic Grooming in Large Scale Mesh WDM Networks , 2007, ONDM.

[37]  Jun Ma,et al.  AnO(k2n2) algorithm to find ak-partition in ak-connected graph , 2008, Journal of Computer Science and Technology.

[38]  Chang Liu,et al.  Logical topology augmentation for survivable mapping in IP-over-WDM networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[39]  Arunabha Sen,et al.  Survivable routing in WDM networks - logical ring in arbitrary physical topology , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[40]  Angela Chiu,et al.  Issues for routing in the optical layer , 2001, IEEE Commun. Mag..

[41]  András Frank,et al.  Egerváry Research Group on Combinatorial Optimization on Decomposing a Hypergraph into K Connected Sub-hypergraphs on Decomposing a Hypergraph into K Connected Sub-hypergraphs , 2022 .

[42]  Yoshiko Wakabayashi,et al.  Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs , 2007, Discret. Math. Theor. Comput. Sci..

[43]  Mounir Hamdi,et al.  Traffic Grooming in Optical WDM Mesh Networks using the Blocking Island Paradigm , 2003 .

[44]  Martin E. Dyer,et al.  On the complexity of partitioning graphs into connected subgraphs , 1985, Discret. Appl. Math..

[45]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[46]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[47]  Guoliang Xue,et al.  Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum Protection Capacity , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[48]  Patrick Thiran,et al.  Survivable mapping algorithm by ring trimming (SMART) for large IP-over-WDM networks , 2004, First International Conference on Broadband Networks.

[49]  Jean-Yves Le Boudec,et al.  Design protection for WDM optical networks , 1998, IEEE J. Sel. Areas Commun..

[50]  R. Shenai,et al.  Hybrid survivability approaches for optical WDM mesh networks , 2005, Journal of Lightwave Technology.

[51]  马军,et al.  An O(k~2n~2) Algorithm to Find a k-Partition in a k-Connected Graph , 1994 .

[52]  Armando N. Pinto,et al.  Optical Networks: A Practical Perspective, 2nd Edition , 2002 .

[53]  S. Raghavan,et al.  Strong formulations for network design problems with connectivity requirements , 2005, Networks.

[54]  Jennifer Yates,et al.  Effectiveness of shared risk link group auto-discovery in optical networks , 2002, Optical Fiber Communication Conference and Exhibit.

[55]  Arunabha Sen,et al.  Survivable routing in WDM networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[56]  Jason P Jue,et al.  Online Clustering for Hierarchical WDM Networks , 2008, OFC/NFOEC 2008 - 2008 Conference on Optical Fiber Communication/National Fiber Optic Engineers Conference.

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

[58]  Ulrich Elsner,et al.  Graph partitioning - a survey , 2005 .