Analysing GeoPath diversity and improving routing performance in optical networks

• Published in: Computer networks (Amsterdam, Netherlands : 1999) Vol. 82; pp. 50 - 67
• Main Authors: Cheng, Yufei, Gardner, M. Todd, Li, Junyan, May, Rebecca, Medhi, Deep, Sterbenz, James P.G.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 08.05.2015; Elsevier Sequoia S.A
• Subjects: Area-based network disasters; Computer networks; Correlation analysis; Cross-layer routing protocol; Fiber optic networks; Graph-centrality targeted attacks; Graphs; Heuristic; Multipath geographic routing heuristics; Network flow problem; Network resilience and survivability; Networks; Optical communication; Physical network topology diversity; Resilience; Routing; Routing (telecommunications); Studies; Telecommunications; Traffic flow; Area-based network disasters; Graph-centrality targeted attacks; Cross-layer routing protocol; Physical network topology diversity; Multipath geographic routing heuristics; Network resilience and survivability
• ISSN: 1389-1286; 1872-7069
• DOI: 10.1016/j.comnet.2015.02.021

With the increasing frequency of natural disasters and intentional attacks that challenge telecommunication networks, vulnerability to cascading and regional-correlated challenges is escalating. Given the high complexity and large traffic load of optical networks, these correlated challenges cause substantial damage to reliable network communication. In this paper, we propose a network vulnerability identification mechanism and study different vulnerability scales using real-world optical network data. We further propose geographical diversity and incorporate it into a new graph resilience metric cTGGD (compensated Total Geographical Graph Diversity), which is capable of characterising and differentiating resiliency levels among different optical fibre networks. It is shown to be an effective resilience level indicator under regional network challenges or attacks. We further propose two heuristics for solving the path geodiverse problem (PGD) in which the calculation of a number of geographically separated paths is required. Geodiverse paths can be used to circumvent physical challenges such as large-scale disasters in telecommunication networks. We present the GeoDivRP routing protocol with two new routing heuristics implemented, which provides the end nodes with multiple geographically diverse paths. Our protocol demonstrates better performance compared to OSPF when the network is subject to area-based challenges. We have analysed the mechanism by which the attackers could use to maximise the attack impact with a limited budget and demonstrate the effectiveness of restoration plans.