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

DOI10.1016/J.EJOR.2006.03.005MaRDI QIDQ877588zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
• An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
• Mathematical programming algorithms for two-path routing problems with reliability considerations

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• A quick method for finding shortest pairs of disjoint paths
• Deviation algorithms for ranking shortest paths
• Disjoint paths in a network
• Finding disjoint paths with different path-costs: Complexity and algorithms
• Finding the k Shortest Paths
• The complexity of finding maximum disjoint paths with length constraints

Cited in

(8)

• An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
• Analysis of shortest paths and subscriber line lengths in telecommunication access networks
• Mathematical programming algorithms for two-path routing problems with reliability considerations
• Enumerating \(K\) best paths in length order in DAGs
• Information security: Designing a stochastic-network for throughput and reliability
• An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877588)