Abstract not found

We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non--zero propagation delays. In the absence of delays, the problem has been shown to be solvable in polynomial time. In this paper, we show that the general problem is NP--complete. In addition, we examine transmissions along a single path, called the quickest path, and present algorithms for general and special classes of networks that improve upon previous approaches. The first dynamic algorithm for the quickest path problem is also given. Keywords: Data transmission, sparse network, transmission time, quickest path, dynamic algorithm. 1 Introduction Consider an n-node, m-edge network N = (V; E; c; l), where G = (V; E) is a directed graph, c : E ! IR + is the capacity function and l : E ! IR is the delay function. The nodes represent transmitters/receivers without data memories and the edges represent communication ...