Summary: Core-Stateless Fair Queueing: Achieving Approximately Fair
Bandwidth Allocations in High Speed Networks
Ion Stoica
CMU
istoica@cs.cmu.edu
Scott Shenker
Xerox PARC
shenker@parc.xerox.com
Hui Zhang
CMU
hzhang@cs.cmu.edu
Abstract
Router mechanisms designed to achieve fair bandwidth al-
locations, like Fair Queueing, have many desirable proper-
ties for congestion control in the Internet. However, such
mechanisms usually need to maintain state, manage bu ers,
and or perform packet scheduling on a per ow basis, and
this complexity may prevent them frombeing cost-e ectively
implemented and widely deployed. In this paper, we pro-
pose an architecture that signi cantly reduces this imple-

Source: Akella, Aditya - Department of Computer Sciences, University of Wisconsin at Madison

Collections: Computer Technologies and Information Sciences