Toward fast calculation of communication paths for resilient routing. Issue 4 (25th October 2017)

• Record Type: Journal Article
• Authors: Myslitski, Kanstantsin; Rak, Jacek; Kuszner, Łukasz
• Is Part Of: Networks. Volume 70:Issue 4(2017)
• Page Start: 308
• Page End: 326
• Publication Date: 2017-10-25
• Subjects: network resilience -- end‐to‐end communications resilience -- survivable routing -- fast computation of communication paths -- failures of network nodes/links -- optimization; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21789
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract : Utilization of alternate communication paths is a common technique to provide protection of transmission against failures of network nodes/links. However, a noticeable delay is encountered when calculating the relevant sets of disjoint paths using the available algorithms (e.g., using Bhandari's approach). This, in turn, may have a serious impact on the ability of a network to serve dynamic demands (i.e., characterized by a relatively short duration time). To provide a solution to this problem, in this article we introduce an approach to pre‐compute the sets of disjoint paths in advance to be able to start serving the demands shortly after their arrival. Our approach is based on the observation that the issue of establishing a set of node‐disjoint paths is equivalent to the problem of determining the cheapest cycle in the network topology traversing the end nodes of a demand. In particular, we propose a generalization of this scheme assuming that any pair of node‐disjoint paths can be obtained by means of merging a number of basic cycles defined for a network topology. A new method to calculate the cheapest end‐to‐end cycles based on the so called basic cycles is introduced, which, as verified for real network topologies, reduces up to 70% the time needed to establish node‐disjoint paths (compared with the results obtained for the reference Bhandari's scheme). © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(4), 308–326 2017