Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1995: Algorithms and Data Structures pp 291–302Cite as

On the computation of fast data transmissions in networks with capacities and delays

  • Invited Presentation
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 955))

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.

This work was partially supported by the EU ESPRIT BRA No. 7141 (ALCOM II) and the NSF grant MIP-940990.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. L. Chen and Y. H. Chin, “The quickest path problem”, Computers and Operations Research, 17, pp. 153–161, 1990.

    Article  Google Scholar 

  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 

  3. G. N. Frederickson, “Planar Graph Decomposition and All Pairs Shortest Paths,” J. ACM, Vol.38, No. 1, pp.162–204, 1991.

    Article  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 

  6. M. L. Fredman and R. E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,” J. ACM, Vol. 34, pp. 596–615, 1987.

    Article  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 

  9. A. Itai, and M. Rodeh, “Scheduling Transmissions in a Network”, Journal of Algorithms, 6, pp. 409–429, 1985.

    Article  Google Scholar 

  10. J.B. Rosen, S.Z. Sun and G.L. Xue, “Algorithms for the quickest path problem and the enumeration of quickest paths,” Comp. and O.R., 18, pp.579–584, 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical Eng. Dept, Southern Illinois University, 62901, Carbondale, IL, USA

    Dimitrios Kagaris

  2. Computer Science Dept, University of Central Florida, 32816, Orlando, FL, USA

    Grammati E. Pantziou

  3. Computer Science Dept, Southern Illinois University, 62901, Carbondale, IL, USA

    Spyros Tragoudas

  4. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Christos D. Zaroliagis

Authors
  1. Dimitrios Kagaris
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grammati E. Pantziou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Spyros Tragoudas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christos D. Zaroliagis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Selim G. Akl Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kagaris, D., Pantziou, G.E., Tragoudas, S., Zaroliagis, C.D. (1995). On the computation of fast data transmissions in networks with capacities and delays. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-60220-8_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60220-0

  • Online ISBN: 978-3-540-44747-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation