Traceable congestion control

Authors:
Michael Welzl
Affiliations:
Leopold Franzens Universität Innsbruck, Institut für Informatik, Innsbruck, Austria
Venue:
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Year:
2002

Citing 9
Cited 1

Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

Computer Networks and ISDN Systems
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP

ACM SIGCOMM Computer Communication Review
Equation-based congestion control for unicast applications

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Congestion control for high bandwidth-delay product networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The Adaptive Load Service (ALS): An ABR-Like Service for the Internet

ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
A Stateless QoS Signaling Protocol for the Internet

ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems
General AIMD Congestion Control

General AIMD Congestion Control
A selective attenuation feedback mechanism for rate oscillation avoidance

Computer Communications

A survey-based study of grid traffic

Proceedings of the first international conference on Networks for grid applications

Quantified Score

Hi-index	0.00

Visualization

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.