Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Network QoS Management in Cyber-Physical Systems
ICESSSYMPOSIA '08 Proceedings of the 2008 International Conference on Embedded Software and Systems Symposia
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Compressive data gathering for large-scale wireless sensor networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Adaptive fair resource management with an arbiter for multi-tier computing systems
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
A game-theoretic method of fair resource allocation for cloud computing services
The Journal of Supercomputing
Lectures in Game Theory for Computer Scientists
Lectures in Game Theory for Computer Scientists
Multi-dimensional SLA-Based Resource Allocation for Multi-tier Cloud Computing Systems
CLOUD '11 Proceedings of the 2011 IEEE 4th International Conference on Cloud Computing
Mechanism Design for Stochastic Virtual Resource Allocation in Non-cooperative Cloud Systems
CLOUD '11 Proceedings of the 2011 IEEE 4th International Conference on Cloud Computing
A dynamic game-theoretic approach to resilient control system design for cascading failures
Proceedings of the 1st international conference on High Confidence Networked Systems
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Abstract We consider a resource allocation problem that ensures a fair QoS (Quality of Service) level among selfish clients in a cloud computing system. The clients share multiple resources and process applications concurrently on the cloud computing system. When the available resources are less than the total amount of required resources by all clients, the overload condition occurs. To avoid this, a fair resource allocation is needed. However, when there are selfish clients who want to maximize QoS levels of their applications, they may not report their true QoS functions honestly in order to get more resources than their fairly allocated ones. Then, the performance of the system degrades. Thus, it is important to prevent selfish behaviors of the clients. We propose a resource allocation mechanism that ensures a fair QoS level based on the framework of the mechanism design. In the proposed mechanism, the resource manager cannot know applications which will be processed by the clients but can observe their QoS levels after completing the applications.