Skip to main content
SpringerLink
Log in

On-line resource management with applications to routing and scheduling

  • Algorithms III
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1995)

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

Included in the following conference series:

Abstract

We propose a general framework to model on-line resource management problems as linear programming problems. We consider both min cost problems and max benefit problems and propose logarithmic competitive algorithms that are optimal up to a constant factor.

The proposed framework provides a general methodology that applies to a wide class of on-line problems. Some of these on-line problems are studied for the first time in this work such as shop scheduling problems, packet routing and real and {0,1} knapsack problems. It also allows to model some already studied on-line problems such as on-line multiprocessor scheduling and virtual circuit routing; in some cases the known results are improved.

This work was partly supported by ESPRIT BRA Alcom II under contract No.7141, by Italian Ministry of Scientific Research Project 40% “Algoritmi, Modelli di Calcolo e Strutture Informative” and by CNR project “Trasporti II”.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts, “On-line load balancing with applications to machine scheduling and virtual circuit routing”, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1993.

    Google Scholar 

  2. B. Awerbuch, Y. Azar, and S. Plotkin, “Throughput competitive on-line routing”, In Proc. of the 34th Ann. Symp. on Foundations of Computer Science, 1993.

    Google Scholar 

  3. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén, “ Competitive non-preemptive call control”, In Proc. of the 5th ACM-SIAM Symp. on Discrete Algorithms, 1994.

    Google Scholar 

  4. Y. Azar, A.Z. Broder, A.R. Karlin, “On-line load-balancing”, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pp. 218–225, 1992.

    Google Scholar 

  5. B. Awerbuch, R. Gawlick, F.T. Leighton, and Y. Rabani, “On-line admission control and circuit routing for high performance computing and communication”, Proceedings of the 35th Ann. Symp. on Foundations of Computer Science, 1994.

    Google Scholar 

  6. Y. Azar, J. Naor, R. Rom, “The competitiveness of on-line assignments”, Proc. of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pp. 203–210, 1992.

    Google Scholar 

  7. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos and A. Widgerson, “On the power of randomization in on-line algorithms”, Proc. of the 22nd Annual ACM Symposium on Theory of Computing, pp. 379–386, 1990.

    Google Scholar 

  8. R.B. Boppana, M.M. Halldorson, “Approximating maximum independent set by excluding subgraphs”, BIT 32(2), pp.180–196, 1992.

    Google Scholar 

  9. R. El-Yaniv, A. Fiat, R.M. Karp and G. Turpin, “Competitive analysis of financial games”, Proc. of the 33rd Ann. Symp. on Foundations of Computer Science, 1992.

    Google Scholar 

  10. A. Fiat, personal communication, 1994.

    Google Scholar 

  11. J. Garay, I. Gopal, S. Kutten, Y. Mansour, M. Yung, “Efficient on-line call-control algorithms”, Proc. of the 2nd Annual Israel Conference on Theory of Computing and Systems, 1993.

    Google Scholar 

  12. M.S. Manasse, L.A. McGeoch and D. Sleator, Competitive algorithms for on-line problems, Proc. 20th ACM Symp. on Theory of Computing, pp. 322–333, 1988.

    Google Scholar 

  13. P. Raghavan, “Probabilistic construction of deterministic algorithms: approximating packing integer programs”, Journal of Computer and System Science 37, pp. 130–143, 1988.

    Google Scholar 

  14. D.B. Shmoys, C. Stein, J. Wein, “Improved approximation algorithms for shop scheduling problems”, Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pp. 148–157, 1991.

    Google Scholar 

  15. D.B. Shmoys, J. Wein, D.P. Williamson, “Scheduling parallel machines on-line”, Proc. of the 32nd Annual Symposium on Foundations of Computer Science, 1991.

    Google Scholar 

  16. D. Sleator and R.E. Tarjan, Amortized efficiency of list update and paging algorithms, Communications of ACM 28, pp. 202–208 (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, 00198, Roma, Italia

    Stefano Leonardi & Alberto Marchetti-Spaccamela

Authors
  1. Stefano Leonardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leonardi, S., Marchetti-Spaccamela, A. (1995). On-line resource management with applications to routing and scheduling. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_83

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_83

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation