SRLG-Aware Partitioning for Scalability and Survivability

Hasan, Mehedi; Jue, Jason P.

doi:10.1364/nfoec.2009.jtha65

Cited by 2 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To decompose large networks, as indicated in [17,33], even a quadratic algorithm is not scalable, and a linear localized algorithm is more suitable. Therefore, the authors in [34][35][36] propose a localized framework of partitioning optical networks based on dynamic or static parameters. They observe that minimizing common SRLGs among partitions achieves better survivability.…”

Section: Literature Surveymentioning

confidence: 99%

“…If a join message is received from other partitions, a wait message is replied. In both cases, if the combined partition size exceeds S, a rejection is replied and the list of rejected partitions is updated (lines [27][28][29][30][31][32][33][34][35][36][37][38]. For each accept message, two maximum consecutive attempts to join using 2SC links 9.…”

Section: E Distributed Heuristic Solutionmentioning

confidence: 99%

See 1 more Smart Citation

k-Connected Network Partitioning Under Shared Risk Link Groups

Hasan

Farahmand

Jue

2015

J. Opt. Commun. Netw.

Self Cite

View full text Add to dashboard Cite

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.

show abstract