Title: A new algorithm for calculating the most reliable pair of disjoint paths in a network, Journal of Telecommunications and Information Technology, 2006, nr 4


In various types telecommunication networks, namely mobile ad hoc networks, WDM networks and MPLS networks, there is the necessity of calculating disjoint paths for given node to node connections in order to increase the reliability of the services supported by these networks. This leads to the problem of calculating a pair of disjoint paths (or a set of disjoint paths) which optimises some measure of performance in those networks. In this paper we present an algorithm, designated as OptDP, for obtaining the most reliable pair of disjoint paths based on the loopless version of MPS, a very efficient k-shortest path algorithm, and on Dijkstra algorithm. Since to the best of our knowledge there is no other proposal of an algorithm capable of solving exactly the same problem we perform a comparison with the application to this problem of the DPSP algorithm which calculates a set of disjoint paths with high reliability. Also a comparison with a simplified version (designated as NopDP) of the proposed algorithm, which stops after a maximal number F of candidate pairs of paths have been found, is presented. The comparison also includes the percentage of cases in which both algorithms were not capable of finding the optimal pair.


Instytut Łączności - Państwowy Instytut Badawczy, Warszawa



Resource Identifier:

ISSN 1509-4553, on-line: ISSN 1899-8852 ; oai:bc.itl.waw.pl:347


Journal of Telecommunications and Information Technology



Rights Management:

Biblioteka Naukowa Instytutu Łączności

Object collections:

Last modified:

Feb 25, 2010

In our library since:

Feb 25, 2010

Number of object content hits:


All available object's versions:


Show description in RDF format:


Show description in OAI-PMH format:




Citation style:

This page uses 'cookies'. More information