Feedback control for router congestion resolution

Authors:
Xiaojie Gao;Leonard J. Schulman
Affiliations:
Caltech, Pasadena, CA;Caltech, Pasadena, CA
Venue:
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Year:
2005

Citing 12
Cited 1

Data networks

Data networks
Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
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
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)
A game-theoretic approach towards congestion control in communication networks

ACM SIGCOMM Computer Communication Review
Controlling High-Bandwidth Flows at the Congested Router

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Fair and efficient router congestion control

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Understanding CHOKe: throughput and spatial characteristics

IEEE/ACM Transactions on Networking (TON)
REM: active queue management

IEEE Network: The Magazine of Global Internetworking

An Architecture for Network Congestion Control and Charging of Non-cooperative Traffic

Journal of Network and Systems Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Queueing is a crucial component in effective router congestion control. If packets are dropped indiscriminately by the queueing system, in some cases, the effect can be to encourage senders to actually increase their transmission rates, worsening the congestion and destabilizing the system.We approach this congestion problem from the point of view of the elementary concepts of game theory and control theory. We provide a queueing mechanism with feedback-control. Our analysis shows that the protocol achieves high throughput as well as fairness in allocating capacity among sources, while maintaining bounded queue lengths and responding dynamically to changes in network flow conditions. Perhaps most importantly, the new protocol is shown in network simulations to have superior ability (compared with previous solutions) to protect responsive flows (specifically TCP) against router flooding by multiple high-volume unresponsive (e.g., UDP) flows.