Wyszukiwanie zaawansowane ?

Obiekt

Pobierz

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

Autor:

Craveirinha, Jose ; Violante, Artur ; Gomes, Teresa

Data wydania:

2006, nr 4

Typ zasobu:

artykuł

Opis:

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.

Wydawca:

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

Format:

application/pdf

Identyfikator zasobu:

oai:bc.itl.waw.pl:347

DOI:

10.26636/jtit.2006.4.397

ISSN:

1509-4553

eISSN:

1899-8852

Źródło:

Journal of Telecommunications and Information Technology

Język:

ang

Prawa:

Biblioteka Naukowa Instytutu Łączności

Temat i słowa kluczowe:

reliability routing OR in telecommunications

Kolekcje, do których przypisany jest obiekt:

Data ostatniej modyfikacji:

24 cze 2024

Data dodania obiektu:

25 lut 2010

Liczba wyświetleń treści obiektu:

118

Wszystkie dostępne wersje tego obiektu:

https://bc.itl.waw.pl/publication/396

Wyświetl opis w formacie RDF:

RDF

Wyświetl opis w formacie OAI-PMH:

OAI-PMH

Nazwa wydania Data
Gomes, Teresa; Craveirinha, Jose; Violante, Artur, A new algorithm for calculating the most reliable pair of disjoint paths in a network, Journal of Telecommunications and Information Technology, 2006, nr 4 24 cze 2024
×

Cytowanie

Styl cytowania:

Dane kontaktowe

Adres

Instytut Łączności – Państwowy Instytut Badawczy ul. Szachowa 1 04-894 Warszawa

Telefon

(+48) 5128 696

E-Mail

biblioteka@il-pib.pl

Odwiedź nas!

Ta strona wykorzystuje pliki 'cookies'. Więcej informacji