Rainbow fair queueing: theory and applications

Authors:
Zhiruo Cao;Ellen Zegura;Zheng Wang
Affiliations:
Airespace, Inc. San Jose, CA 95134, USA;College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0280, USA;Azanda Network, Sunnyvale, CA 94085, USA
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2005

Citing 10
Cited 1

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)
Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Receiver-driven layered multicast

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Hierarchical packet fair queueing algorithms

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
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
Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks

IEEE/ACM Transactions on Networking (TON)
Fundamental design issues for the future Internet

IEEE Journal on Selected Areas in Communications

A mini-bandwidth guaranteed and differentiated service supporting bandwidth allocation algorithm for Multimedia Group Communication

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of end-to-end congestion control mechanisms. Traditional mechanisms to achieve fair sharing (e.g., Weighted Fair Queueing, Flow Random Early Discard) require per-flow state to determine which packets to drop under congestion, and therefore are complex to implement at the interior of a high-speed network. This scalability limitation of traditional WFQ implementations has been one of the major obstacles for the network to provide more sophisticated services. To address this issue, Core-Stateless Fair Queueing (CSFQ) was proposed to approximate fair bandwidth sharing without per-flow state in the interior routers. In this paper, we also achieve approximate fair sharing without per-flow state, however our mechanism differs from CSFQ. Specifically, we divide each flow into a set of layers, based on rate. The packets in a flow are marked at an edge router with a layer label (or ''color''). A core router maintains a color threshold and drops layers whose color exceeds the threshold. Using simulations, we show that the performance of our Rainbow Fair Queueing (RFQ) scheme is comparable to CSFQ when the application data does not contain any preferential structure. RFQ outperforms CSFQ in goodput when the application takes advantage of the coloring to encode preferences. We also show that RFQ is suitable for a more generalized fair resource allocation scheme-utility max-min, and that makes it to better serve multimedia applications.