Enumerating Maximal Shared Risk Link Groups of Circular Disk Failures Hitting k Nodes

• Published in: IEEE/ACM transactions on networking Vol. 29; no. 4; pp. 1648 - 1661
• Main Authors: Vass, Balazs, Tapolcai, Janos, Berczi-Kovacs, Erika R.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.08.2021; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Computational modeling; Computer networks; disaster resilience; Failure; Geometry; IEEE transactions; Informatics; limited geometric information model; Natural disasters; Network topologies; Network topology; Nodes; Routing; Shared Risk Link Groups (SRLGs); SRLG enumeration; survivable networks; Topology; Voronoi diagrams
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2021.3070100

Many recent studies shed light on the vulnerability of networks against large-scale natural disasters. The corresponding network failures, called regional failures, are manifested at failing multiple network elements that are physically close to each other. The recovery mechanisms of current backbone networks protect failures listed as Shared Risk Link Groups (SRLGs). We aim to design an algorithm for the routing engines, which can generate a reasonable list of SRLGs based on the limited geometric information available. As a first step towards this direction, in this paper, we propose a limited geographic information failure model for the network topology that enables efficient algorithms to compute the set of links that are expected to be close to each other. More precisely, we work with (1) relative node positions without knowing the real distances, (2) an area in the map defines the route of each physical cable, and (3) a regional failure is a circular disk with <inline-formula> <tex-math notation="LaTeX">k=0,1, {\dots } </tex-math></inline-formula> nodes in its interior. We describe an efficient algorithm for listing SRLGs based on our limited geographic information failure model and show that under realistic assumptions, the obtained list of SRLGs is short, having approximately <inline-formula> <tex-math notation="LaTeX">1.2 n </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">2.2n </tex-math></inline-formula> elements for <inline-formula> <tex-math notation="LaTeX">k=0 </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">k=1 </tex-math></inline-formula>, respectively, where <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> is the number of nodes of the network.