Handling high-bandwidth traffic aggregates by receiver-driven feedback control

Authors:
Chee-Wei Tan;Dah-Ming Chiu;John C. S. Lui;David K. Y. Yau
Affiliations:
Dept of Electrical Engineering, Princeton University, Princeton, NJ;Dept of Information Engineering, The Chinese University of Hong Kong;Dept of Computer Science, The Chinese University of Hong Kong;Dept of Computer Science, Purdue University, West Lafayette, IN
Venue:
COMPSAC-W'05 Proceedings of the 29th annual international conference on Computer software and applications conference
Year:
2005

Citing 4
Cited 0

NETBLT: a high throughput transport protocol

SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

Computer Networks and ISDN Systems
Introduction to Algorithms

Introduction to Algorithms
Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

High-bandwidth traffic aggregates may occur during times of flooding-based distributed denial-of-service attacks or flash crowds. Congestion control of these traffic aggregates is important to avoid congestion collapse of network services. This paper presents a class of feedback-control algorithms that proactively protect a network server from overload by installing rate throttles in a set of upstream routers. A control-theoretical framework is proposed to optimize the control setting such that throttling can be achieved in a distributed and fair manner. We develop control-theoretic algorithms that (1) are highly adaptive by avoiding the configuration of unnecessary control parameters, (2) provide max-min fairness for any number of throttling routers, (3) respond very quickly to network changes, (4) are extremely robust against extrinsic factors beyond the system control, and (5) are stable under given delay bounds.