Efficient heuristics for determining node‐disjoint path pairs visiting specified nodes

A new recursive heuristic is proposed to calculate a shortest simple path, from a source node to a destination node, that visits a specified set of nodes in a network. To provide survivability to failures along the path, the proposed heuristic is modified to ensure that the calculated path can be protected by a node-disjoint backup path. Additionally, the case when both paths in the disjoint path pair are required to visit specific sets of nodes is studied and effective heuristics are proposed. An evaluation of the solutions of the heuristics is conducted by comparing with results from an integer linear programming (ILP) formulation for each of the considered problems, and also with previous heuristics. The ILP solver may require a significant amount of time to obtain a solution, especially in large networks, which justifies the need for effective, computationally efficient heuristics for solving these problems. © 2017 Wiley Periodicals, Inc. NETWORKS, 2017

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Chunming Qiao,et al.  Trap avoidance and protection schemes in networks with shared risk link groups , 2003 .

[3]  David Tipper,et al.  An efficient heuristic for calculating a protected path with specified nodes , 2016, 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM).

[4]  T. Ibaraki.  Algorithms for Obtaining Shortest Paths Visiting Specified Nodes , 1973 .

[5]  Jacek Rak.  Resilient Routing in Communication Networks , 2015, Computer Communications and Networks.

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

[7]  Ivanise Hilbig de Andrade.  CINEMA E TELEJORNALISMO NO DOCUMENTÁRIO TELEVISIVO BRASILEIRO , 2013 .

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

[9]  C. P. Bajaj,et al.  Some constrained shortest-route problems , 1971, Unternehmensforschung.

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

[11]  David Tipper,et al.  Protected shortest path visiting specified nodes , 2015, 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM).

[12]  Andrea Fumagalli,et al.  Finding a simple path with multiple must-include nodes , 2009, 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems.

[13]  David Hutchison,et al.  Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines , 2010, Comput. Networks.

[14]  Tibor Cinkler,et al.  Quality of resilience as a network reliability characterization tool , 2009, IEEE Network.

[15]  David Tipper,et al.  Algorithms for determining a node-disjoint path pair visiting specified nodes , 2017, Opt. Switch. Netw..

[16]  R. Kalaba.  ON SOME COMMUNICATION NETWORK PROBLEMS , 1959 .

[17]  Wei Chen,et al.  Improving the performance of arrival on time in stochastic shortest path problem , 2016, 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC).

[18]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[19]  Deep Medhi,et al.  Geodiverse routing with path delay and skew requirement under area‐based challenges , 2015, Networks.

[20]  Marjan Gusev,et al.  An overview of security challenges in communication networks , 2016, 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM).

[21]  Andrzej Jajszczyk,et al.  QoX: What is it really? , 2011, IEEE Communications Magazine.

[22]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[23]  Rafael Castro de Andrade,et al.  New formulations for the elementary shortest-path problem visiting a given set of nodes , 2016, Eur. J. Oper. Res..

[24]  Santosh Kumar,et al.  The Routing Problem with "K" Specified Nodes , 1966, Oper. Res..

[25]  Bjarne E. Helvik,et al.  A survey of resilience differentiation frameworks in communication networks , 2007, IEEE Communications Surveys & Tutorials.

[26]  R. Andrade,et al.  Elementary shortest-paths visiting a given set of nodes , 2013 .

[27]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[28]  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).

[29]  Massimo Tornatore,et al.  Availability design of optical transport networks , 2005, IEEE Journal on Selected Areas in Communications.

[30]  Jacek Rak,et al.  Disaster-resilient communication networks: Principles and best practices , 2016, 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM).