Skip to main content

Best-Effort Versus Reservations Revisited

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3552))

Abstract

In this paper, we walk in the footsteps of the stimulating paper by Lee Breslau and Scott Shenker entitled “Best-effort vs. Reservations: A Simple Comparative Analysis”[1]. In fact, we finally follow their invitation to use their models as a starting point and extend them to reason about the very basic but still very much debated architectural issue whether quality of service (QoS) mechanisms like admission control and service differentiation are necessary or if overprovisioning with a single service class does the job just as well at lower system complexity. We analytically compare two QoS systems: a QoS system using admission control and a reservation mechanism that can guarantee bandwidth for flows respectively offers service differentiation based on priority queueing for two service classes and a system with no admission control and a single best-effort service class.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Breslau, L., Shenker, S.: Best-Effort versus Reservations: A Simple Comparative Analysis. In: Proceedings of the ACM Special Interest Group on Data Communication Conference (SIGCOMM 1998), October 1998, pp. 3–16 (1998)

    Google Scholar 

  2. Kleinrock, L.: Queueing Systems – Theory, vol. 1. Wiley Interscience, New York (1975), ISBN: 0471491101

    Google Scholar 

  3. Lakshman, T.V., Madhow, U.: The Performance of TCP/IP for Networks with High Bandwidth-Delay Products and Random Loss. IEEE/ACM Transactions on Networking 5(3), 336–350 (1997)

    Article  Google Scholar 

  4. Little, J.D.: A proof of the queueing formula l = λw. Operations Research 9(3), 383–387 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  5. Mathis, M., Semke, J., Mahdavi, J., Ott, T.: The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm. Computer Communication Review 27(3) (July 1997)

    Google Scholar 

  6. Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling TCP Throughput: A Simple Model and its Empirical Validation. In: Proceedings of the ACM Special Interest Group on Data Communication Conference (SIGCOMM 1998), September 1998, pp. 303–314 (1998)

    Google Scholar 

  7. Shenker, S.: Fundamental design issues for the future internet. IEEE Journal on Selected Areas in Communications 13(7), 1176–1188 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heckmann, O., Schmitt, J.B. (2005). Best-Effort Versus Reservations Revisited. In: de Meer, H., Bhatti, N. (eds) Quality of Service – IWQoS 2005. IWQoS 2005. Lecture Notes in Computer Science, vol 3552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499169_13

Download citation

  • DOI: https://doi.org/10.1007/11499169_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26294-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics