Author(s):
Gomes, Teresa 
; Craveirinha, José
Date: 2007
Persistent ID: http://hdl.handle.net/10316/4054
Origin: Estudo Geral - Universidade de Coimbra
Subject(s): Reliability; OR in telecommunications; Routing
Document details
Efficient calculation of the most reliable pair of link disjoint paths in telec...
Description
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. http://www.sciencedirect.com/science/article/B6VCT-4JS20BJ-2/1/d3a0679a9c65e51ae2074080f957df94
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. http://www.sciencedirect.com/science/article/B6VCT-4JS20BJ-2/1/d3a0679a9c65e51ae2074080f957df94
Document Type
Article
Language English
Language English
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||