IMDEA Networks Institute Publications Repository

B-Neck: A Distributed and Quiescent Max-min Fair Algorithm

Mozo, Alberto and Lopéz-Presa, José Luis and Fernández Anta, Antonio (2011) B-Neck: A Distributed and Quiescent Max-min Fair Algorithm. In: The 10th IEEE International Symposium on Network Computing and Applications (IEEE NCA11), 25 - 27 Agosto, 2011, Cambridge, Massachusetts, USA.

[img]
Preview
PDF (B-Neck: A Distributed and Quiescent Max-min Fair Algorithm) - Published Version
Download (305Kb) | Preview

Abstract

The problem of fairly distributing the capacity of a network among a set of sessions has been widely studied. In this problem, each session connects via a single path a source and a destination, and its goal is to maximize its assigned transmission rate (i.e., its throughput). Since the links of the network have limited bandwidths, some criterion has to be defined to fairly distribute their capacity among the sessions. A popular criterion is max-min fairness that, in short, guarantees that each session i gets a rate !i such that no sessions can increase !s without causing another session s! to end up with a rate !s! < !s. Many max-min fair algorithms have been proposed, both centralized and distributed. However, to our knowledge, all proposed distributed algorithms require control data being continuously transmitted to recompute the max-min fair rates when needed (because none of them has mechanisms to detect convergence to the max-min fair rates). In this paper we propose B-Neck, a distributed max-min fair algorithm that is also quiescent. This means that, in absence of changes (i.e., session arrivals or departures), once the maxmin rates have been computed, B-Neck stops generating network traffic. Quiescence is a key design concept of B-Neck, because B-Neck routers are capable of detecting and notifying changes in the convergence conditions of max-min fair rates. As far as we know, B-Neck is the first distributed max-min fair algorithm that does not require a continuous injection of control traffic to compute the rates. The correctness of B-Neck is formally proved, and extensive simulations are conducted. In them, it is shown that B-Neck converges relatively fast and behaves nicely in presence of sessions arriving and departing.

Item Type: Conference or Workshop Papers (Paper)
Uncontrolled Keywords: Index Terms—Max-mix fairness, distributed algorithm, quiescence
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User: Rebeca De Miguel
Date Deposited: 15 Feb 2012 12:17
Last Modified: 24 Feb 2012 12:14
URI: http://eprints.networks.imdea.org/id/eprint/93

Actions (login required)

View Item View Item