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

Abstract

In this brief announcement we propose B-Neck, a max-min fair distributed algorithm that is also quiescent. As far as we know, B-Neck is the �rst max-min fair distributed algorithm that does not require a continuous injection of control tra�c to compute the rates. When changes occur, a�ected sessions are asynchronously informed, so they can start the process of computing their new rate (i.e., sessions do not need to poll the network for changes). 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 de- parting.