Skip to main content

A Control-Theoretical Approach for Fair Share Computation in Core-Stateless Networks

  • Conference paper
  • First Online:
  • 240 Accesses

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

Abstract

In this paper, we propose the use of a control theoretical approach for a fast and robust fair share computation for a class of fair queueing algorithms based on the Scalable Core (SCORE)/Dynamic Packet State (DPS) architecture. Our proposed approach is generic and can be applied to other SCORE/DPS fair queueing algorithms with little modifications. For purpose of illustration, we applied the Linear Quadratic (LQ) control method from the optimal control theory to our modification of Core-Stateless Fair Queueing (CSFQ). Simulation results show that this approach gives improved flow isolation between TCP and UDP flows when compared with CSFQ.

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. Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. Proc. ACM SIGCOMM (1989) 1–12

    Google Scholar 

  2. Shreedhar, M., Varghese, G.: Efficient Fair Queueing Using Deficit Round Robin. Proc. ACM SIGCOMM (1995) 231–243

    Google Scholar 

  3. Stoica, I.: Stateless Core: A Scalable Approach for Quality of Service in the Internet. PhD. Dissertion, CMU-CS-00-176 (2000)

    Google Scholar 

  4. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services. IETF RFC 2475 (1998)

    Google Scholar 

  5. Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Trans. on Networking, Vol. 1 (1993) 397–413

    Article  Google Scholar 

  6. Cao, Z.R., Wang, Z., Zegura, E.: Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State. Proc. IEEE INFOCOM (2000) 922–931

    Google Scholar 

  7. Clerget, A., Dabbous, W.,: TUF: Tag-based Unified Fairness. Proc. IEEE INFOCOM (2001) 498–507

    Google Scholar 

  8. Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall (1987)

    Google Scholar 

  9. Anderson, B.D.O., Moore, J.B.: Optimal Control: Linear Quadratic Methods. Prentice-Hall (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ngin, HT., Tham, CK. (2002). A Control-Theoretical Approach for Fair Share Computation in Core-Stateless Networks. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds) From QoS Provisioning to QoS Charging. QofIS ICQT 2002 2002. Lecture Notes in Computer Science, vol 2511. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45859-X_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45859-X_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45859-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics