Journal of the ACM (JACM)
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Performance evaluation of market-based resource allocation for Grid computing: Research Articles
Concurrency and Computation: Practice & Experience - Middleware for Grid Computing
CoMon: a mostly-scalable monitoring system for PlanetLab
ACM SIGOPS Operating Systems Review
Algorithmic Game Theory
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A game-theoretical approach to the benefits of cloud computing
GECON'11 Proceedings of the 8th international conference on Economics of Grids, Clouds, Systems, and Services
Resource management in the cloud using evolutionary computation
Proceedings of the 2012 SpringSim Poster & Work-In-Progress Track
A game theoretical method for auto-scaling of multi-tiers web applications in cloud
Proceedings of the Fourth Asia-Pacific Symposium on Internetware
Future Generation Computer Systems
Slice embedding solutions for distributed service architectures
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We introduce Colocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed/cloud computing environments, where resources are offered in an open marketplace to independent, rational parties interested in setting up their own applications. Virtualization technologies enable the partitioning of such resources so as to allow each player to dynamically acquire appropriate fractions of the resources. When all the components are under the control of a single administrative domain, this leads to an standard optimization problem, but when infrastructure providers make available their resources in a marketplace, and from there customers acquire the resources, the global optimization framework is no longer appropriate. Rather, in this paper we use a game-theoretic framework in which the assignment of players to resources is the outcome of a strategic "Colocation Game". Although we show that determining the existence of an equilibrium for colocation games in general is NP-hard, we present a number of simplified, practically-motivated variants of the colocation game for which we establish convergence to a Nash Equilibrium, and price of anarchy bounds. In addition to these analytical results, we present an experimental evaluation of implementations of some of these variants. Experimental evaluation corroborates our analytical results and also illustrates how colocation games offer a feasible distributed resourcemanagement alternative for self-organizing systems, in which the adoption of a global optimization approach would be neither practical nor justifiable.