Skip to main content
SpringerLink
Log in

Traceable Congestion Control

  • Conference paper
  • First Online:
From QoS Provisioning to QoS Charging (QofIS 2002, ICQT 2002)

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

Abstract

A new, easily traceable congestion control scheme which only requires bandwidth information from rare packets that query routers is presented. In contrast with TCP, the (very simple) rate calculation can be performed by any node that sees the occasional feedback message from the receiver; this facilitates load based charging as well as enforcing appropriate behaviour. The control law, which is based on logistic growth, quickly converges to a fixed and stable rate. In simulations, the mechanism showed greater throughput than TCP while maintaining a very small loss ratio and a smaller average queue length.

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

Access this chapter

Log in via an institution
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. D. Katz: IP Router Alert Option, RFC 2113, February 1997.

    Google Scholar 

  2. Michael Welzl: A Stateless QoS Signaling Protocol for the Internet, Proceedings of IEEE ICPADS’00, July 2000.

    Google Scholar 

  3. The PTP website: http://fullspeed.to/ptp

  4. A. W. Barnhart: Explicit Rate Performance Evaluations, ATM Forum Technical Committee, Contribution ATM Forum/94-0983 (October 1994).

    Google Scholar 

  5. D. Chiu and R. Jain: Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks, Journal of Computer Networks and ISDN, Vol. 17, No. 1, June 1989, pp. 1–14.

    Article  MATH  Google Scholar 

  6. Michael Welzl: Vector Representations for the Analysis and Design of Distributed Controls, MIC 2002, Innsbruck, Austria, 18–22 February 2002.

    Google Scholar 

  7. David G. Luenberger: Introduction to Dynamic Systems-Theory, Models, and Applications, John Wiley & Sons, New York 1979.

    MATH  Google Scholar 

  8. Perrin S. Meyer, Jason W. Yung and Jesse H. Ausubel: A Primer on Logistic Growth and Substitution: The Mathematics of the Loglet Lab Software, Technological Forecasting and Social Change 61(3), pp. 247–271, Elsevier Science 1999.

    Google Scholar 

  9. Mark Kot: Elements of Mathematical Ecology, Cambridge University Press, Cambridge, UK, 2001.

    Google Scholar 

  10. Raj Jain and K. K. Ramakrishnan: Congestion Avoidance in Computer Networks with a Connectionless Network Layer: Concepts, Goals and Methodology, Computer Networking Symposium, Washington, D. C., April 11-13 1988, pp. 134–143.

    Google Scholar 

  11. Reza Rejaie, Mark Handley, and Deborah Estrin: RAP: An End-to-end Rate-based Congestion Control Mechanism for Realtime Streams in the Internet, Proceedings of IEEE Infocom 1999, New York City, New York, 21.-25. 3. 1999.

    Google Scholar 

  12. Y. Richard Yang and Simon S. Lam: General AIMD Congestion Control, Technical Report TR-2000-09, Dept. of Computer Sciences, Univ. of Texas, May 2000.

    Google Scholar 

  13. Sally Floyd, Mark Handley, Jitendra Padhye, and Jörg Widmer: Equation-Based Congestion Control for Unicast Applications, Proceedings of ACM SIGCOMM 2000.

    Google Scholar 

  14. Injong Rhee, Volkan Ozdemir, and Yung Yi: TEAR: TCP emulation at receivers-flow control for multimedia streaming, Technical Report, Department of Computer Science, North Carolina State University.

    Google Scholar 

  15. Philippe Oechslin and Jon Crowcroft: Differentiated End-to-End Internet Services using a Weighted Proportional Fair Sharing TCP, ACM CCR, 1998.

    Google Scholar 

  16. Na Li, Sangkyu Park, and Sanqi Li: A Selective Attenuation Feedback Mechanism for Rate Oscillation Avoidance, Computer Communications, Vol. 24., No. 1, pp. 19–34, Jan. 2001.

    Article  Google Scholar 

  17. Dina Katabi, Mark Handley, and Charlie Rohrs: Internet Congestion Control for Future High Bandwidth-Delay Product Environments, ACM SIGCOMM 2002, Pittsburgh, PA, 19-23 August 2002. 18. Ion Stoica, Scott Shenker, and Hui Zhang: Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks, ACM SIGCOMM 1998, Vancouver, British Columbia, September 1998.

    Google Scholar 

  18. Arjan Durresi, Mukundan Sridharan, Chunlei Liu, Mukul Goyal and Raj Jain: Traffic Management using Multilevel Explicit Congestion Notification, Proceedings of SCI 2001, Orlando Florida 2001.

    Google Scholar 

  19. Dorgham Sisalem and Henning Schulzrinne: The adaptive load service: An ABR-like service for the Internet, IEEE ISCC’2000, France, July 2000.

    Google Scholar 

  20. Frank Kelly: Charging and rate control for elastic traffic, European Transactions on Telecommunications, 8. pp. 33–37. An updated version is available at http://www.statslab.cam.ac.uk/frank/elastic.html

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Leopold Franzens Universität Innsbruck, Technikerstr. 25/7, A-6020, Innsbruck, Austria

    Michael Welzl

Authors
  1. Michael Welzl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Systems Laboratory, IIS, University of Federal Armed Forces Munich, UniBwM, Werner-Heisenberg-Weg 39, 85577, Neubiberg, Germany

    Burkhard Stiller

  2. Computer Engineering and Networks Laboratory, TIK, Swiss Federal Institute of Technology Zurich, ETH Zurich, Gloriastr. 35, 8092, Zurich, Switzerland

    Burkhard Stiller

  3. Fraunhofer Institute FOKUS, Kaiserin-Augusta-Allee 31, 19589, Berlin, Germany

    Michael Smirnow

  4. Multimedia Communications Lab, KOM, Darmstadt University of Technology, Merckstr. 25, 64283, Darmstadt, Germany

    Martin Karsten

  5. Forschungszentrum Wien, FTW, Donau-City-Str. 1, 1220, Wien, Austria

    Peter Reichl

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Welzl, M. (2002). Traceable Congestion Control. 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_26

Download citation

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

  • 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

Search

Navigation