A Unified Framework for Max-Min and Min-Max Fairness With Applications

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite of this wide applicability, there are still examples, arising in the context of wireless or peer-to-peer networks, where the existing theories do not seem to apply directly. In this paper, we give a unifying treatment of max-min fairness, which encompasses all existing results in a simplifying framework, and extend its applicability to new examples. First, we observe that the existence of max-min fairness is actually a geometric property of the set of feasible allocations. There exist sets on which max-min fairness does not exist, and we describe a large class of sets on which a max-min fair allocation does exist. This class contains, but is not limited to the compact, convex sets of RN. Second, we give a general purpose centralized algorithm, called max-min programming, for computing the max-min fair allocation in all cases where it exists (whether the set of feasible allocations is in our class or not). Its complexity is of the order of N linear programming steps in RN, in the case where the feasible set is defined by linear constraints. We show that, if the set of feasible allocations has the free disposal property, then max-min programming reduces to a simpler algorithm, called water filling, whose complexity is much lower. Free disposal corresponds to the cases where a bottleneck argument can be made, and water filling is the general form of all previously known centralized algorithms for such cases. All our results apply mutatis mutandis to min-max fairness. Our results apply to weighted, unweighted and util-max-min and min-max fairness. Distributed algorithms for the computation of max-min fair allocations are outside the scope of this paper.

[1]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[2]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

[3]  A. Charny,et al.  An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback , 1994 .

[4]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[5]  Kai-Yeung Siu,et al.  On Max-Min Fair Congestion Control for Multicast ABR Service in ATM , 1997, IEEE J. Sel. Areas Commun..

[6]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[7]  Yiwei Thomas Hou,et al.  A generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[9]  Sergio Verdú,et al.  Maximin Performance of Binary-Input Channels with Uncertain Noise Distributions , 1998, IEEE Trans. Inf. Theory.

[10]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[11]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[12]  Ellen W. Zegura,et al.  Utility max-min: an application-oriented bandwidth allocation scheme , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  Leandros Tassiulas,et al.  Fair allocation of discrete bandwidth layers in multicast networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[15]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[16]  Mark A. Chen.  Individual monotonicity and the leximin solution , 2000 .

[17]  Moe Z. Win,et al.  Ultra-wide bandwidth time-hopping spread-spectrum impulse radio for wireless multiple-access communications , 2000, IEEE Trans. Commun..

[18]  Wei Kang Tsai,et al.  A theory of convergence order of maxmin rate allocation and an optimal protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  Brahim Bensaou,et al.  On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation , 2001, MobiHoc.

[20]  D. Towsley,et al.  The impact of multicast layering on network fairness , 1999, TNET.

[21]  P. Georgatsos,et al.  Lexicographically optimal balanced networks , 2002, IEEE/ACM Trans. Netw..

[22]  Peter Marbach,et al.  Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[23]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[24]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[25]  W. Bossert,et al.  Utility in Social Choice , 2004 .

[26]  Jean-Yves Le Boudec,et al.  When Power Adaptation is Useless or Harmful , 2004 .

[27]  J. Boudec,et al.  Optimal power control, scheduling, and routing in UWB networks , 2004, IEEE Journal on Selected Areas in Communications.

[28]  J. Rawls,et al.  A Theory of Justice , 1971, Princeton Readings in Political Thought.

[29]  Jean-Yves Le Boudec,et al.  Power control is not required for wireless networks in the linear regime , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[30]  Jean-Yves Le Boudec,et al.  A unified framework for max-min and min-max fairness with applications , 2007, TNET.