2021-03-01T13:28:40Z
http://oa.upm.es/cgi/oai2
oai:oa.upm.es:11653
2016-04-20T19:40:32Z
7374617475733D707562
7375626A656374733D74656C65636F6D756E69636163696F6E6573
7375626A656374733D696E666F726D6174696361
747970653D636F6E666572656E63655F6974656D
B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm
Mozo Velasco, Alberto
López Presa, Jose Luis
Fernández Anta, Antonio
Telecommunications
Computer Science
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 session s 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 max min 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.
E.U. de Informática (UPM)
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
2011
info:eu-repo/semantics/conferenceObject
Presentation at Congress or Conference
Proceedings of the 10th IEEE International Symposium on Network Computing and Applications 2011 | The 10th IEEE International Symposium on Network Computing and Applications 2011 | 25/08/2011 - 27/08/2011 | Cambridge, Massachusetts USA
PeerReviewed
application/pdf
eng
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6038580&contentType=Conference+Publications&sortType%3Dasc_p_Sequence%26filter%3DAND(p_IS_Number%3A6038577)%26rowsPerPage%3D50
info:eu-repo/semantics/openAccess
http://oa.upm.es/11653/