Skip to main content

How Expensive Is Link Utilization?

  • Conference paper
Network Control and Optimization (NET-COOP 2007)

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

Included in the following conference series:

Abstract

Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in understanding this relationship stem from the fact that it depends on the complex nature of arriving traffic and the problems associated with modelling such traffic. Existing AQM schemes achieve a “low delay” and “high utilization” by responding early to congestion without considering the exact relationship between delay and utilization. However, in the context of exploiting the delay/utilization tradeoff, the optimal choice of a queueing scheme’s control parameter depends on the cost associated with the relative importance of queueing delay and utilization. The optimal choice of control parameter is the one that maximizes a benefit that can be defined as the difference between utilization and cost associated with queuing delay. We present a generic algorithm Optimal Delay-Utilization control of t (ODU-t) that is designed with a performance goal of maximizing this benefit. Its novelty lies in fact that it maximizes the benefit in an online manner, without requiring knowledge of the traffic conditions, specific delay-utilization models, nor does it require complex parameter estimation. Moreover, other performance metrics like loss rate or jitter can be directly incorporated into the optimization framework as well. Packet level ns2 simulations are given to demonstrate the behavior of the proposed algorithm.

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. Appenzeller, G., Keslassy, I., McKeown, N.: Sizing router buffers. In: ACM SIGCOMM, USA (2004)

    Google Scholar 

  2. Avrachenkov, K., Ayesta, U., Piunovskiy, A.: Optimal choice of the buffer size in the Internet routers. In: Proc. of the IEEE CDC, Spain (2005)

    Google Scholar 

  3. Dhamdhere, A., Dovrolis, C.: Open Issues in Router Buffer Sizing ACM CCR (January 2006)

    Google Scholar 

  4. Dhamdhere, A., Jiang, H., Dovrolis, C.: Buffer sizing for congested internet links. In: Proc. of the IEEE INFOCOM, Miami, FL, USA (2005)

    Google Scholar 

  5. Enachescu, M., Ganjali, Y., Goel, A., McKeown, N., Roughgarden, T.: Part III: routers with very small buffers. ACM Computer Communication Review 35(3), 83–90 (2005)

    Article  Google Scholar 

  6. Estan, C., Varghese, G., Fisk, M.: Bitmap algorithms for counting active flows on high speed links. In: Proc. of 3rd ACM SIGCOMM conference on Internet measurement (2003)

    Google Scholar 

  7. Feng, W., Kandlur, D.D., Saha, D., Shin, K.G.: A Self-Configuring RED Gateway. In: Proc. of INFOCOM, New York, NY, USA (1999)

    Google Scholar 

  8. Feng, W., Shin, K.G., Kandlur, D.D., Saha, D.: The BLUE active queue management algorithms. IEEE ACM Transactions on Networking 10(4), 513–528 (2002)

    Article  Google Scholar 

  9. Gibbens, R.J., Kelly, F.P.: Distributed Connection Acceptance Control for a Connectionless Network. In: 16th International Teletraffic Conference, Edimburgh, June 1999, pp. 397–413 (1999)

    Google Scholar 

  10. Hollot, C., Misra, V., Towsley, D., Gong, W.B.: Analysis and design of controllers for AQM routers supporting TCP flows. IEEE Transactions on Automatic Control, 945–959 (June 2002)

    Google Scholar 

  11. Jacobson, V.: Congestion avoidance and control. In: Proc. of the ACM SIGCOMM, (1988)

    Google Scholar 

  12. Jain, R.: The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. John Wiley and Sons, Chichester (1991)

    MATH  Google Scholar 

  13. Jaiswal, S., Iannaccone, G., Diot, C., Towsley, D.F.: Inferring TCP connection characteristics through passive measurements. In: IEEE INFOCOM (March 2004)

    Google Scholar 

  14. Jiang, H., Dovrolis, C.: Passive estimation of TCP round-trip times. In: ACM SIGCOMM Computer Communication Review 32(3) (July 2002)

    Google Scholar 

  15. Kelly, F.P., Maulloo, A.K., Tan, D.K.H.: Rate control for communication networks: shadow. prices, proportional fairness and stability. J. Oper. Res. Soc. 49 (3) (March 1998)

    Google Scholar 

  16. Kodialam, M., Lakshman, T.V., Mohanty, S.: Runs bAsed Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation. In: Proc. of the IEEE INFOCOM (2004)

    Google Scholar 

  17. Kumaran, K., Mandjes, M.: The buffer-bandwidth trade-off curve is convex. Queueing Systems 38(4), 471–483

    Google Scholar 

  18. Kumaran, K., Mandjes, M., Stolyar, A.: Convexity properties of loss and overflow functions. Operations Research Letters 31(2) (2003)

    Google Scholar 

  19. Kunniyur, S., Srikant, R.: Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management. IEEE ACM Transactions on Networking 12(2) (2004)

    Google Scholar 

  20. Online: http://pma.nlanr.net/Special/

  21. Pearlmutter, B.: Bounds on query convergence. Preprint (2005), Online: http://arxiv.org/abs/cs.LG/0511088

  22. Stanojevic, R., Shorten, R.: How expensive is link utilization. Technical report, available online: www.hamilton.ie/person/rade/QP.pdf

  23. Srikant, R.: The Mathematics of Internet Congestion Control. Birkh‘̀auser (2004)

    Google Scholar 

  24. Veal, B., Li, K., Lowenthal, D.: New Methods for Passive Estimation of TCP Round-Trip Times. In: Proc. of PAM, Boston, MA, USA (2005)

    Google Scholar 

  25. Villamizar, C., Song, C.: High Performance TCP in ANSNET. ACM Computer Communication Review 24(5) (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tijani Chahed Bruno Tuffin

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stanojević, R., Shorten, R. (2007). How Expensive Is Link Utilization?. In: Chahed, T., Tuffin, B. (eds) Network Control and Optimization. NET-COOP 2007. Lecture Notes in Computer Science, vol 4465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72709-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72709-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-72709-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics