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

25 Aug
2011

Alberto Mozo, Universidad Politécnica de Madrid; José Luis López-Presa, Universidad Politécnica de Madrid; Antonio Fernández Anta, Institute IMDEA Networks

External Presentation (IN Speaker)

​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 first max-min fair distributed algorithm that does not require a continuous injection of control traffic to compute the rates. When changes occur, affected 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.

Document PDF Download publication (307 Kb)

 

  • Location: The 10th IEEE International Symposium on Network Computing and Applications (IEEE NCA11), Cambridge, Massachusetts (USA)

  • Time: 09:00 am