Justice: flexible and enforceable per-source bandwidth allocation

Authors:
Jakob Eriksson;Michalis Faloutsos;Srikanth Krishnamurthy
Affiliations:
University of California, Riverside;University of California, Riverside;University of California, Riverside
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 12
Cited 0

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
Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
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
Carry-over round robin: a simple cell scheduling mechanism for ATM networks

IEEE/ACM Transactions on Networking (TON)
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Weighted fair bandwidth sharing using SCALE technique

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main goal of this work is to provide bandwidth allocation that is robust against the behavior of greedy or malicious users. The traditional solution, Fair Queueing, allocates capacity per sourcedestination pair in accordance with the max-min fairness criterion. While Fair Queueing, defined as above, has been successful and popular to a large extent, it does not prevent greedy or malicious users from getting unfair shares of capacity. In particular, it is vulnerable to end-points simply establishing multiple parallel connections to increase their allocated capacity. In order to overcome this limitation, we propose Justice, which allows for robust, yet flexible bandwidth allocation in the Internet. Justice employs weighted per source bandwidth allocation to accommodate traffic sources with varying bandwidth requirements. We describe an efficient and scalable mechanism for determining, for each source s, the weight φ$_{k}^{\rm ({s})}$ at any given link k. We demonstrate through analysis and simulation that Justice is flexible, efficient, scalable, and robust to all identified attacks related to bandwidth allocation.