Reliability problem on all pairs quickest paths

Authors:
Young-Cheol Bang;Hyunseung Choo;Youngsong Mun
Affiliations:
Department of Computer Engineering, Korea Polytechnic University, Kyunggi-Do, Korea;Department of Computer Engineering, Korea Polytechnic University, Kyunggi-Do, Korea;Department of Computer Engineering, Korea Polytechnic University, Kyunggi-Do, Korea
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science
Year:
2003

Citing 5
Cited 1

The quickest path problem

Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths

Computers and Operations Research
The all-pairs quickest path problem

Information Processing Letters
Introduction to Algorithms

Introduction to Algorithms
On update algorithms for quickest paths

Computer Communications

Reliable and restricted quickest path problems

INOC'11 Proceedings of the 5th international conference on Network optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The reliability problem of the quickest path deals with the transmission of a message of sizes γ from a source to a destination with both the minimum end-to-end delay and the reliability of the path over a network with bandwidth, delay, and probability of fault free on the links. For any value of message sizes γ, we propose O(n2m) time algorithm for all-pairs quickest most reliable path problem, where n and m are the number of nodes and the number of arcs or links in the network, respectively.