This publication is unavailable to your account. If you have more privileged account please try to use it or contact with the institution connected to this digital library.
Craveirinha, Jose ; Violante, Artur ; Gomes, Teresa
2006, nr 4
artykuł
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
application/pdf
oai:bc.itl.waw.pl:347
10.26636/jtit.2006.4.397
1509-4553
1899-8852
Journal of Telecommunications and Information Technology
ang
Biblioteka Naukowa Instytutu Łączności
Jun 24, 2024
Feb 25, 2010
117
https://bc.itl.waw.pl/publication/396
RDF
OAI-PMH
Citation style: Chicago ISO690
This page uses 'cookies'. More information I understand