Distributed algorithms for the quickest path problem

Abstract

Let N = ( V, A, C, L) be a network with node set V, arc set A, positive arc capacity function C, and nonnegative arc lead time function L. The quickest path problems is to find paths in N to transmit a given amount of data such that the transmission time is minimized. In this paper, distributed algorithms are developed for the quickest path problem in an asynchronous communication network. For the one-source quickest path problem, we present three algorithms that require O( rn 2) messages and O( 2 ) time, O(n) messages and O( rn) time, and O 1+ ε log w) messages and O( rn 1+ ε log w) time for any ε, 0< ε<1, respectively, where m = | A|, n = | V|, r is the number of distinct capacity values of N, and w is the maxima arc weight of N. For the all-pairs quickest path problem, we present an algorithm that requires O( mn) messages and O( m) time.