Justice: Flexible and enforceable per-source bandwidth allocation

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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 source-destination 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(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. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Eriksson, J., Faloutsos, M., & Krishnamurthy, S. (2005). Justice: Flexible and enforceable per-source bandwidth allocation. In Lecture Notes in Computer Science (Vol. 3462, pp. 1206–1218). Springer Verlag. https://doi.org/10.1007/11422778_97

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free