Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks

DOI10.1016/j.ejor.2006.03.005zbMath1123.90012OpenAlexW2000761905MaRDI QIDQ877588

Teresa Gomes, José F. Craveirinha

Publication date: 3 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/4054

zbMATH Keywords

reliabilityroutingOR in telecommunications

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (2)

Information security: Designing a stochastic-network for throughput and reliability ⋮ Enumerating \(K\) best paths in length order in DAGs

Cites Work

• Unnamed Item
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• A quick method for finding shortest pairs of disjoint paths
• Finding disjoint paths with different path-costs: Complexity and algorithms
• Disjoint paths in a network
• Finding the k Shortest Paths
• The complexity of finding maximum disjoint paths with length constraints
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS

This page was built for publication: Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks