Low-state fairness: lower bounds and practical enforcement


Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the space complexity of fairness algorithms, and the communication complexity of distributed global fairness algorithms. We show that in order to enforce max-min fairness with bounded… (More)
DOI: 10.1109/INFCOM.2005.1498529

10 Figures and Tables


  • Presentations referencing similar topics