.png){kind=icon}
返回
k-Connected Network Partitioning Under Shared Risk Link Groups
.png){kind=icon}
PRE
AI
DOI：10.1364/JOCN.7.000695.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Fault tolerance
k-connected graph
Network management
Partitioning
SRLG
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
2.2K
被引数:
3.8K
机构
引用论文
Novel bonding modes in metallo–dithiadiazolyl complexes: preparation and crystal structures of [Pt(SNCPhNS-S,S)(PPh3)2]·MeCN and [Pt3(µ-SNCPhNS-S,S)2(PPh3)4]·2PhMe金属二噻二唑基配合物中的新型键合方式: [Pt (sncphns-s，S)(PPh3)2]·MeCN和 [Pt3(µ-sncphns-s，S)2(PPh3)4]·2PhMe
.png){kind=icon}
PREAI
分享收藏分享收藏
分享收藏
查看更多内容