Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1995: Algorithms and Data Structures pp 303–314Cite as

Routing with delays when storage is costly

  • Invited Presentation
  • Conference paper
  • First Online:

  • 162 Accesses

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

Abstract

A model for computer networks is considered in which there is a cost associated with both the transmission of data across network links, and the storage of data at network nodes. Requests for data specify the time at which the data is to be used — early arrival therefore has no advantage, and has the disadvantage that the data must be stored at the node, accruing the related costs. A wide variety of data routing and broadcast problems are considered for this model. Efficient algorithms for solving some of these problems are presented; others are proven intractable.

Supported in part by NSF grants OSR-9350540 and CCR-9410752, and UVM grant PSCI94-3.

Supported in part by NSF grant OSR-9350540.

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. R. Ahmadi. Scheduling in just-in-time manufacture. Ph.D thesis. The University of Texas, Austin, TX. 1988.

    Google Scholar 

  2. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, Carnegie-Mellon University, 1976.

    Google Scholar 

  3. E. W. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 1:269–271, 1959.

    Article  Google Scholar 

  4. R. W. Floyd. Algorithm 97: Shortest path. Comm. ACM, 5:345, 1962.

    Article  Google Scholar 

  5. F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.

    Google Scholar 

  6. H. Psaraftis and J. Tsitsiklis. Dynamic shortest paths in acyclic networks with Markovian arc costs. Operations Research:14(1). 1993.

    Google Scholar 

  7. V. Vazirani. Personal communication. July 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Electrical Engineering Dept. of Mathematics and Statistics, The University of Vermont, 351 Votey Building, 05401, Burlington, VT

    Sanjoy Baruah & Gara Pruesse

Authors
  1. Sanjoy Baruah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gara Pruesse
    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

Baruah, S., Pruesse, G. (1995). Routing with delays when storage is costly. 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_72

Download citation

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

  • 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