Fair resource allocation for different scenarios of demands

This paper considers a resource allocation problem, which objective is to treat fairly all the system users. Usually the requests cannot be entirely predicted, but the manager can forecast the request evolution, this leading to a set of possible scenarios. Such a problem arises for instance in network bandwidth allocation as well as in storage space management. It also appears in the management of computer systems, such as computational grids or in cloud computing, when teams share a common pool of machines. Problems of fair resource sharing arise among users with equal access right but with different needs.

[1]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[2]  G. Hardy,et al.  Asymptotic formulae in combinatory analysis , 1918 .

[3]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[4]  Keith W. Hipel,et al.  Lexicographic minimax approach to fair water allocation problems , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[5]  Jérôme Lang,et al.  Allocation of indivisible goods: a general model and some complexity results , 2005, AAMAS '05.

[6]  Alessandro Agnetis,et al.  Combinatorial Models for Multi-Agent Scheduling Problems , 2007 .

[7]  Sally Floyd,et al.  Congestion Control Principles , 2000, RFC.

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

[9]  Eitan Altman,et al.  On fairness in Bandwidth Allocation , 2001 .

[10]  Jean-Charles Billaut,et al.  Flexibility and Robustness in Scheduling , 2008 .

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

[12]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[13]  H. Moulin.  Axioms of Cooperative Decision Making , 1988 .

[14]  Wlodzimierz Ogryczak,et al.  On the lexicographic minimax approach to location problems , 1997, Eur. J. Oper. Res..

[15]  R. E. Butler.  The role of the ITU in the use of the geostationary orbit , 1988 .

[16]  G. Hardy,et al.  Asymptotic Formulaæ in Combinatory Analysis , 1918 .

[17]  François Maniquet,et al.  Social orderings for the assignment of indivisible objects , 2008, J. Econ. Theory.

[18]  Ronaldo M. Salles,et al.  Lexicographic maximin optimisation for fair bandwidth allocation in computer networks , 2008, Eur. J. Oper. Res..

[19]  Adam Wierzbicki,et al.  Fair Game-Theoretic Resource Management in Dedicated Grids , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[20]  Erik Taflin.  Equity allocation and portfolio selection in insurance , 1999 .

[21]  Rizos Sakellariou,et al.  Scheduling multiple DAGs onto heterogeneous systems , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[22]  Evripidis Bampis,et al.  On truthfulness and approximation for scheduling selfish tasks , 2009, J. Sched..

[23]  Adam Wierzbicki,et al.  Equitable aggregations and multiple criteria analysis , 2004, Eur. J. Oper. Res..

[24]  Ashish Goel,et al.  Approximate majorization and fair online load balancing , 2001, TALG.

[25]  Alagan Anpalagan,et al.  Fairness in Radio Resource Management for Wireless Networks , 2009, EURASIP J. Wirel. Commun. Netw..

[26]  Yossi Azar,et al.  On-Line Load Balancing , 1994, Theor. Comput. Sci..

[27]  Yann Chevaleyre,et al.  A Short Introduction to Computational Social Choice , 2007, SOFSEM.

[28]  Yves De Smet,et al.  About the applicability of MCDA to some robustness problems , 2006, Eur. J. Oper. Res..

[29]  Dimitri Papadimitriou,et al.  Open Research Issues in Internet Congestion Control , 2011, RFC.

[30]  Denis Trystram,et al.  Multi-users scheduling in parallel systems , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[31]  F. Fabozzi.  Robust Portfolio Optimization and Management , 2007 .

[32]  Benjamin Avi-Itzhak,et al.  SQF: A slowdown queueing fairness measure , 2007, Perform. Evaluation.

[33]  Anat Rafaeli,et al.  The Effects of Queue Structure on Attitudes , 2002 .

[34]  Ashish Goel,et al.  Combining Fairness with Throughput: Online Routing with Multiple Objectives , 2001, J. Comput. Syst. Sci..

[35]  Krzysztof Rzadca,et al.  Cooperation in multi-organization scheduling , 2009 .

[36]  Adam Wierzbicki,et al.  A multi-criteria approach to fair and efficient bandwidth allocation , 2008 .