On the computation of fast data transmissions in networks with capacities and delays
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-hard. In addition, we examine transmissions along a single path, called the quickest path, and present algorithms for general and sparse networks that outperform previous approaches. The first dynamic algorithm for the quickest path problem is also given.
Unable to display preview. Download preview PDF.
- 2.H. N. Djidjev, G. E. Pantziou and C. D. Zaroliagis, “On-line and Dynamic Algorithms for Shortest Path Problems,” Proc. 12th Symp. on Theor. Aspects of Computer Science (STACS'95), LNCS 900, pp.193–204, Springer-Verlag, 1995.Google Scholar
- 4.G. N. Frederickson, “Using Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems”, Proc. 30th Annual IEEE Symp. on FOCS, 1989, pp.448–453.Google Scholar
- 5.G.N. Frederickson, “Searching among Intervals and Compact Routing Tables”, Proc. 20th ICALP, 1993, LNCS 700, pp.28–39, Springer-Verlag.Google Scholar
- 7.M.R. Garey, and D.S. Johnson, “Computers and Intractability. A Guide to the Theory of NP-Completeness”, W.H. Freeman and Company, New York, NY, 1979.Google Scholar
- 8.Y.-C. Hung and G.-H. Chen, “On the quickest path problem,” Proc. ICCI'91, LNCS 497, Springer-Verlag, pp. 44–46, 1991.Google Scholar