A rate-based drop policy for punishing unresponsive flows

Authors:
Ikjun Yeom
Affiliations:
Department of Computer Science, Korea Advanced Institute of Science and Technology, Daejeon, South Korea
Venue:
Computer Communications
Year:
2006

Citing 6
Cited 0

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
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
Explicit allocation of best-effort packet delivery service

IEEE/ACM Transactions on Networking (TON)
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
ERUF: Early Regulation of Unresponsive Best-Effort Traffic

ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols

Quantified Score

Hi-index	0.25

Visualization

Abstract

This paper proposes a drop policy for punishing unresponsive flows. The proposed drop policy uses the difference in traffic arrival patterns of responsive and unresponsive flows, and discards more packets from unresponsive flows. The drop probability of an arriving packet at a router is determined only by the temporal arrival rate of the router at that time, and the router does not need to identify the flow to which the packet belongs. The main advantage of this policy is that it performs well even in the presence of a large number of unresponsive flows since it does not attempt to distinguish high-bandwidth flows. Extensive simulations are presented to show that the proposed policy effectively punishes unresponsive flows by dropping more packets from them in various network situations.