Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks

Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks (1998)

by Ion Stoica , Scott Shenker , Hui Zhang

Citations:

User correction supplied by mph

Datum	Value	Source
TITLE	Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks	user correction
AUTHOR NAME	Ion Stoica	user correction
AUTHOR AFFIL	CMU	user correction
AUTHOR NAME	Scott Shenker	user correction
AUTHOR AFFIL	Xerox PARC	user correction
AUTHOR NAME	Hui Zhang	user correction
AUTHOR AFFIL	CMU	user correction
ABSTRACT	Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. In this paper, we propose an architecture that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. We apply this approach to an island of routers -- that is, a contiguous region of the network -- and we distinguish between edge routers and core routers. Edge routers maintain per flow state; they estimate the incoming rate of each flow and insert a label into each packet header based on this estimate. Core routers maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels an...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	118--130	INFERENCE
CITATIONS	24 found	ParsCit 1.0