Analysing GeoPath diversity and improving routing performance in optical networks

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.

[1]  Deep Medhi,et al.  Using network measure to reduce state space enumeration in resilient networks , 2013, 2013 9th International Conference on the Design of Reliable Communication Networks (DRCN).

[2]  D. Medhi,et al.  Avoiding high impacts of geospatial events in mission critical and emergency networks using linear and swarm optimization , 2012, 2012 IEEE International Multi-Disciplinary Conference on Cognitive Methods in Situation Awareness and Decision Support.

[3]  Cory Beard,et al.  Evaluating geographic vulnerabilities in networks , 2011, 2011 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR).

[4]  David Tipper,et al.  Measuring the survivability of networks to geographic correlated failures , 2014, Opt. Switch. Netw..

[5]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[6]  James P. G. Sterbenz,et al.  Modelling communication network challenges for Future Internet resilience, survivability, and disruption tolerance: a simulation-based approach , 2013, Telecommun. Syst..

[7]  Renata Teixeira,et al.  In search of path diversity in ISP networks , 2003, IMC '03.

[8]  Julia Kastner,et al.  Survivable Networks Algorithms For Diverse Routing , 2016 .

[9]  E. Modiano,et al.  Assessing the impact of geographically correlated network failures , 2008, MILCOM 2008 - 2008 IEEE Military Communications Conference.

[10]  Charles J. Colbourn,et al.  Bounding all-terminal reliability in computer networks , 1988, Networks.

[11]  James P. G. Sterbenz,et al.  On the fitness of geographic graph generators for modelling physical level topologies , 2013, 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[12]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[13]  Damien Magoni,et al.  Tearing down the Internet , 2003, IEEE J. Sel. Areas Commun..

[14]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Gil Zussman,et al.  Network vulnerability to single, multiple, and probabilistic physical attacks , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

[16]  Archana Ganapathi,et al.  Why Do Internet Services Fail, and What Can Be Done About It? , 2002, USENIX Symposium on Internet Technologies and Systems.

[17]  Eytan Modiano,et al.  Diverse Routing in Networks with Probabilistic Failures , 2009, IEEE INFOCOM 2009.

[18]  Deep Medhi,et al.  Using Multi-Topology Routing to improve routing during geographically correlated failures , 2014, 2014 10th International Conference on the Design of Reliable Communication Networks (DRCN).

[19]  Prasant Mohapatra,et al.  Characterization of BGP Recovery Time under Large-Scale Failures , 2006, 2006 IEEE International Conference on Communications.

[20]  James P. G. Sterbenz,et al.  Path geo-diversification: Design and analysis , 2013, 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[21]  J. W. Suurballe Disjoint paths in a network , 1974, Networks.

[22]  L. Freeman Centrality in social networks conceptual clarification , 1978 .

[23]  Xiaohong Jiang,et al.  Reliability Assessment for Wireless Mesh Networks Under Probabilistic Region Failure Model , 2011, IEEE Transactions on Vehicular Technology.

[24]  Moshe Zukerman,et al.  Topology Design of Undersea Cables Considering Survivability Under Major Disasters , 2009, 2009 International Conference on Advanced Information Networking and Applications Workshops.

[25]  John Moy,et al.  OSPF specification , 1989, Request for Comments.

[26]  Deep Medhi,et al.  Optimised heuristics for a geodiverse routing protocol , 2014, 2014 10th International Conference on the Design of Reliable Communication Networks (DRCN).

[27]  Eytan Modiano,et al.  Assessing the Vulnerability of the Fiber Infrastructure to Disasters , 2009, IEEE INFOCOM 2009.

[28]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[29]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[30]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[31]  Stefan Burr,et al.  The Mathematics of networks , 1982 .

[32]  Abdul Jabbar,et al.  Path diversification: A multipath resilience mechanism , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[33]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[34]  Abdul Jabbar,et al.  Path diversification for future internet end-to-end resilience and survivability , 2014, Telecommun. Syst..

[35]  Shuguang Cui,et al.  Network Robustness under Large-Scale Attacks , 2013, SpringerBriefs in Computer Science.

[36]  Santosh S. Vempala,et al.  Path splicing , 2008, SIGCOMM '08.

[37]  Erhan Erkut,et al.  On finding dissimilar paths , 2000, Eur. J. Oper. Res..

[38]  Alia Atlas,et al.  Basic Specification for IP Fast Reroute: Loop-Free Alternates , 2008, RFC.

[39]  Gil Zussman,et al.  The resilience of WDM networks to probabilistic geographical failures , 2011, INFOCOM 2011.

[40]  D. Richard Kuhn,et al.  Sources of Failure in the Public Switched Telephone Network , 1997, Computer.

[41]  Ibrahim Matta,et al.  On the geographic location of Internet resources , 2003, IEEE J. Sel. Areas Commun..

[42]  Eytan Modiano,et al.  Network Reliability With Geographically Correlated Failures , 2010, 2010 Proceedings IEEE INFOCOM.

[43]  George F. Riley,et al.  The ns-3 Network Simulator , 2010, Modeling and Tools for Network Simulation.

[44]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .