A distributed scheduling framework based on selfish autonomous agents for federated cloud environments

Today, large-scale distributed Cloud computing infrastructures are often characterized by the fact that each participating organization, like a company in the free economy scenario, when making its resources available, will strive for reducing its own cost and for optimizing its own benefit, regardless of the consequences on the global Cloud's welfare, in terms of effectiveness and performance losses. The selfish behavior of all these entities (end-users, Cloud providers, underlying enterprises/data centers), competing strategically for resources (distributed storage, processing power, bandwidth), motivates the use of game theory and autonomous agents for effective Multi-User Task Scheduling. Accordingly, we present a novel uncoordinated fully distributed scheduling scheme for federated cloud organizations, based on independent, competing, and self-interested job/task execution agents, driven by optimum social welfare criteria towards a Nash equilibrium solution. The agents' behavior is also conditioned by marginal costs, to force some kind of implicit coordination between the (often conflicting) objectives of the various entities involved in the cloud. Due to its inherent parallel nature, such schema can provide a significantly better scalability in presence of a large number of tasks and resources involved into the scheduling system.

[1]  Ian Foster,et al.  A quality of service architecture that combines resource reservation and application adaptation , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[2]  Shanshan Song,et al.  Selfish grid computing: game-theoretic modeling and NAS performance results , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[3]  Mark J. Clement,et al.  The Performance Impact of Advance Reservation Meta-scheduling , 2000, JSSPP.

[4]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[5]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[6]  David R. Karger,et al.  Looking up data in P2P systems , 2003, CACM.

[7]  Jack J. Dongarra,et al.  Experiments with Scheduling Using Simulated Annealing in a Grid Environment , 2002, GRID.

[8]  Yishay Mansour,et al.  Strong price of anarchy , 2007, SODA '07.

[9]  George Karakostas,et al.  The Efficiency of Optimal Taxes , 2004, CAAN.

[10]  Elias Koutsoupias,et al.  Coordination mechanisms , 2009, Theor. Comput. Sci..

[11]  Daniel Grosu,et al.  Distributed algorithmic mechanism design for scheduling on unrelated machines , 2011, J. Parallel Distributed Comput..

[12]  Francesco Palmieri,et al.  Selfish routing and wavelength assignment strategies with advance reservation in inter-domain optical networks , 2012, Comput. Commun..

[13]  Hoong Chuin Lau,et al.  The Price of Stability in Selfish Scheduling Games , 2007, 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07).

[14]  Fatos Xhafa,et al.  Use of genetic algorithms for scheduling jobs in large scale grid applications , 2006 .

[15]  Paul G. Spirakis,et al.  Selfish Unsplittable Flows , 2004, ICALP.

[16]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[17]  Tami Tamir,et al.  Approximate Strong Equilibrium in Job Scheduling Games , 2009, SAGT.

[18]  Elias Koutsoupias,et al.  A Lower Bound for Scheduling Mechanisms , 2007, SODA '07.

[19]  Chunyan Miao,et al.  Market Based Resource Allocation with Incomplete Information , 2007, IJCAI.

[20]  Rajkumar Buyya,et al.  Nature's heuristics for scheduling jobs on Computational Grids , 2000 .

[21]  Ali Afzal,et al.  Making the Grid Predictable through Reservations and Performance Modelling , 2005, Comput. J..

[22]  Klara Nahrstedt,et al.  A distributed resource management architecture that supports advance reservations and co-allocation , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[23]  Yishay Mansour,et al.  Convergence Time to Nash Equilibria , 2003, ICALP.

[24]  Andreas S. Schulz,et al.  On the Performance of User Equilibrium in Traffic Networks , 2015 .

[25]  Paolo Penna,et al.  Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines , 2004, STACS.

[26]  Azer Bestavros,et al.  Colocation Games and Their Application to Distributed Resource Management , 2009, HotCloud.

[27]  Éva Tardos,et al.  Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[28]  Yossi Azar,et al.  Truthful Approximation Mechanisms for Scheduling Selfish Related Machines , 2005, Theory of Computing Systems.

[29]  R. Rosenthal A class of games possessing pure-strategy Nash equilibria , 1973 .

[30]  Salvatore Venticinque,et al.  Competitive P 2 P Scheduling of Users ’ Jobs in Cloud , 2011 .

[31]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[32]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[33]  Chuntian Cheng,et al.  Utility-driven solution for optimal resource allocation in computational grid , 2009, Comput. Lang. Syst. Struct..

[34]  Wolfgang Kellerer,et al.  ProtoPeer: a P2P toolkit bridging the gap between simulation and live deployement , 2009, SimuTools.

[35]  Paolo Penna,et al.  Deterministic Truthful Mechanism for Scheduling on Selfish Machines , 2004 .

[36]  Tamer Basar,et al.  Computational Markets to Regulate Mobile-Agent Systems , 2003, Autonomous Agents and Multi-Agent Systems.

[37]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[38]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[39]  Berthold Vöcking,et al.  Tight bounds for worst-case equilibria , 2002, SODA '02.

[40]  Andreas S. Schulz,et al.  On the performance of user equilibria in traffic networks , 2003, SODA '03.

[41]  Ishfaq Ahmad,et al.  Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[42]  Axel Keller,et al.  The virtual resource manager: an architecture for SLA-aware resource management , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[43]  Rajkumar Buyya,et al.  Article in Press Future Generation Computer Systems ( ) – Future Generation Computer Systems Cloud Computing and Emerging It Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility , 2022 .

[44]  Borja Sotomayor,et al.  Resource Leasing and the Art of Suspending Virtual Machines , 2009, 2009 11th IEEE International Conference on High Performance Computing and Communications.

[45]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[46]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[47]  Borja Sotomayor,et al.  Virtual Infrastructure Management in Private and Hybrid Clouds , 2009, IEEE Internet Computing.