Skip to main content

Differentiated Services with Lottery Queueing

  • Conference paper
  • First Online:
Quality of Service — IWQoS 2001 (IWQoS 2001)

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

Included in the following conference series:

Abstract

This work investigates the benefits and drawbacks of using a lottery to schedule and drop packets within a router. We find that a lottery can provide many distinct levels of service without requiring that per-flow state be maintained in the routers. We also investigate the re-ordering within a flow that can occur if a lottery is used to pick packets to forward without regard to their flow order.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Shenker, R. Braden, and D. Clark, “;Integrated services in the internet architecture: an overview,” RFC 1633, Internet Engineering Task Force, June 1994.

    Google Scholar 

  2. Y. Bernet, J. Binder, S. Blake, M. Carlson, B. Carpenter, S. Keshav, E. Davies, B. Ohlman, D. Verma, Z. Wang, and W. Weiss, “A Framework for Differentiated Services,” Internet Draft, draft-ietf-diffserv-framework-02.txt, Feb. 1999.

    Google Scholar 

  3. S. Blake, D. Black, M. Carlson, and E. Davies, “;An architecture for differentiated services,” RFC 2475, Internet Engineering Task Force, December 1998.

    Google Scholar 

  4. J. Heinanen, F. Baker, W. Weiss, and J. Wroclawski, “;Assured forwarding phb group,” RFC2597, Internet Engineering Task Force, June 1999.

    Google Scholar 

  5. V. Jacobson, K. Nichols, and K. Poduri, “;An expedited forwarding phb,” RFC 2598, Internet Engineering Task Force, June 1999.

    Google Scholar 

  6. C.A. Waldspurger and W.E. Weihl, “;Lottery scheduling: Flexible proportional-share resource management,” Proc. of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)’94, pp. 1–12, 1994.

    Google Scholar 

  7. A. Demers, S. Keshav, and S.J. Shenker, “;Analysis and simulation of a fair queueing algorithm,” Proc. of ACM SIGCOMM’89, pp. 1–12, Sept. 1989.

    Google Scholar 

  8. I. Stoica, S. Shenker, and H. Zhang, “;Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks,” Proc. of ACM SIGCOMM’98, pp. 118–130, Sept. 1998.

    Google Scholar 

  9. I. Stoica and H. Zhang, “;Providing guaranteed services without per flow management,” Proc. of ACM SIGCOMM’99, pp. 81–94, Aug. 1999.

    Google Scholar 

  10. S. Jamin, P.B. Danzig, S.J. Shenker, and L. Zhang, “;A measurement-based admission control algorithm for integrated services packet networks (extended version),” ACM/IEEE Transactions on Networking, vol. 5, no. 1, pp. 56–70, Feb. 1997, Available from http://netweb.usc.edu/jamin/admctl/ton96.ps.Z.

    Article  Google Scholar 

  11. S. Floyd and V. Jacobson, “;Random early detection gateways for congestion avoidance,” ACM/IEEE Transactions on Networking, vol. 1, no. 4, pp. 397–413, Aug. 1993.

    Article  Google Scholar 

  12. D. Clark. and W. Fang, “;Explicit allocation of best effort packet delivery service,” ACM/IEEE Transactions on Networking, vol. 6, no. 4, pp. 362–373, Aug. 1998.

    Article  Google Scholar 

  13. G. Wright and W. Stevens, TCP/IP Illustrated, Volume 2: The Implementation, Addison-Wesley, 1995.

    Google Scholar 

  14. K. Nichols, S. Blake, F. Baker, and D. Black, “;Definition of the differentiated services field (ds field) in the ipv4 and ipv6 headers,” RFC 2474, Internet Engineering Task Force, December 1998.

    Google Scholar 

  15. W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson, “;On the self-similar nature of ethernet traffic (extended version),” ACM/IEEE Transactions on Networking, vol. 2, no. 1, pp. 1–15, Feb. 1994.

    Article  Google Scholar 

  16. W. Willinger, M.S. Taqqu, R. Sherman, and D.V. Wilson, “;Self-similarity through highvariability: Statistical analysis of ethernet lan traffic at the source level,” Proc. of ACM SIGCOMM’95, pp. 100–113, Aug. 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eggleston, J., Jamin, S. (2001). Differentiated Services with Lottery Queueing. In: Wolf, L., Hutchison, D., Steinmetz, R. (eds) Quality of Service — IWQoS 2001. IWQoS 2001. Lecture Notes in Computer Science, vol 2092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45512-4_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-45512-4_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42217-4

  • Online ISBN: 978-3-540-45512-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics