TY - JOUR

T1 - End-to-end data paths

T2 - Quickest or most reliable?

AU - Xue, Guoliang

N1 - Funding Information:
Manuscript received February 17, 1998. This work was supported in part by the U.S. Army Research Office under Grant DAAH04-96-1-0233 and by the National Science Foundation under Grant ASC-9409285 and Grant OSR-9350540. The associate editor coordinating the review of this letter and approving it for publication was Prof. C. Douligeris.

PY - 1998

Y1 - 1998

N2 - Let N = (V, E, c, l, p) be a network where V is the set of n vertices, E is the set of m edges, c(u, v) ≥ 0 is the capacity of edge {u, v}, l (u, v) ≥ 0 is the delay of edge {u, u}, p(u, v) ε [0, 1] is the operational probability of edge {u, v}. In this letter, we present O(rm + rn logn) time algorithms for the most reliable quickest path problem and the quickest most reliable path problem, where r is the number of different capacity values in the network.

AB - Let N = (V, E, c, l, p) be a network where V is the set of n vertices, E is the set of m edges, c(u, v) ≥ 0 is the capacity of edge {u, v}, l (u, v) ≥ 0 is the delay of edge {u, u}, p(u, v) ε [0, 1] is the operational probability of edge {u, v}. In this letter, we present O(rm + rn logn) time algorithms for the most reliable quickest path problem and the quickest most reliable path problem, where r is the number of different capacity values in the network.

KW - Communication networks

KW - Most reliable path

KW - Quickest path

KW - Shortest path network

UR - http://www.scopus.com/inward/record.url?scp=0032097366&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032097366&partnerID=8YFLogxK

U2 - 10.1109/4234.681357

DO - 10.1109/4234.681357

M3 - Article

AN - SCOPUS:0032097366

VL - 2

SP - 156

EP - 158

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 6

ER -