By Topic

End-to-end data paths: quickest or most reliable?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Guoliang Xue ; Dept. of Comput. Sci., Vermont Univ., Burlington, VT, USA

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)/spl ges/0 is the capacity of edge {u,v}, l(u,v)/spl ges/0 is the delay of edge {u,v}, p(u,v)/spl isin/[0,1] is the operational probability of edge {u,v}. In this letter, we present O(rm+rnlog n) 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.

Published in:

Communications Letters, IEEE  (Volume:2 ,  Issue: 6 )