Title
On The Computation Of Fast Data Transmissions In Networks With Capacities And Delays
Abstract
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.
Publication Date
1-1-1995
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume
955
Number of Pages
291-302
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1007/3-540-60220-8_71
Copyright Status
Unknown
Socpus ID
84958044693 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/84958044693
STARS Citation
Kagaris, Dimitrios; Pantziou, Grammati E.; and Tragoudas, Spyros, "On The Computation Of Fast Data Transmissions In Networks With Capacities And Delays" (1995). Scopus Export 1990s. 1734.
https://stars.library.ucf.edu/scopus1990/1734