Algorithms for all-pairs reliable quickest paths

Authors:
Young-Cheol Bang;Nageswara S. V. Rao;S. Radhakrishnan
Affiliations:
Department of Computer Engineering, Korea Polytechnic University, Kyunggi-Do, Korea;Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, Tennessee;School of Computer Science, University of Oklahoma, Norman, Oklahoma
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Year:
2003

Citing 6
Cited 0

The quickest path problem

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

Computers and Operations Research
On the quickest path problem

Information Processing Letters
The all-pairs quickest path problem

Information Processing Letters
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
On update algorithms for quickest paths

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the reliable transmission of messages via quickest paths in a network with bandwidth, delay and reliability parameters specified for each link. For a message of sizes, we present algorithms to compute all-pairs quick est most-reliable and most-reliable quickest paths each with time complexity O(n2m), where n and m are the number of nodes and links of the network, respectively.