Result: Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
Title:
Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
Authors:
Source:
European journal of operational research. 181(3):1055-1064
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Théorie de la fiabilité. Renouvellement des équipements, Reliability theory. Replacement problems, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Evaluation performance, Performance evaluation, Evaluación prestación, Fiabilité, Reliability, Fiabilidad, Routage réseau, Network routing, Réseau télécommunication, Telecommunication network, Red telecomunicación, Télécommunication, Telecommunication, Telecomunicación, OR in telecommunications, Routing
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Electrical and Computer Engineering, Faculty of Sciences and Technology of the University of Coimbra, Pinhal de Marrocos, 3030-290 Coimbra, Portugal
INESC-Coimbra, Rua Antero de Quental, 199, 3000-033 Coimbra, Portugal
INESC-Coimbra, Rua Antero de Quental, 199, 3000-033 Coimbra, Portugal
ISSN:
0377-2217
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Operational research. Management
Operational research. Management
Accession Number:
edscal.18674423
Database:
PASCAL Archive
Further Information
In transmission networks an important routing problem is to find a pair of link disjoint paths which optimises some performance measure. In this paper the problem of obtaining the most reliable pair of link disjoint paths, assuming the reliability of the links are known, is considered. This is a non-linear optimisation problem. It is further introduced the constraint that the length of the paths should not exceed a certain number of links, which makes the efficient resolution of the problem more complex. In this paper two variants of a novel exact algorithm for finding the most reliable pair of link disjoint paths with lengths constraints, are presented. Also a computational study on the performance of the variants, is described.