A resource-sharing game with relative priorities
| Autor: | Balakrishna J. Prabhu, Josu Doncel, Olivier Brun, Urtzi Ayesta |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Structure (mathematical logic)
Service (business) Operations research Computer Networks and Communications Computer science business.industry Stochastic process media_common.quotation_subject Cloud computing Payment A share Shared resource Variable (computer science) Hardware and Architecture Modeling and Simulation business Software media_common Computer network |
| Zdroj: | Performance Evaluation. 79:287-305 |
| ISSN: | 0166-5316 |
| DOI: | 10.1016/j.peva.2014.07.018 |
| Popis: | Motivated by cloud-based computing resources operating with relative priorities, we investigate the strategic interaction between a fixed number of users sharing the capacity of a processor. Each user chooses a payment, which corresponds to his priority level, and submits jobs of variable sizes according to a stochastic process. These jobs have to be completed before some user-specific deadline. They are executed on the processor and receive a share of the capacity that is proportional to the priority level. The users' goal is to choose priority levels so as to minimize their own payment, while guaranteeing that their jobs meet their deadlines. We show that the equilibria in this game always coincides with the social welfare of the system. We fully characterize the solution of the game for two classes of users and exponential service times. For an arbitrary number of classes and general service times, we develop an approximation based on heavy-traffic. We characterize the solution of the game under the heavy-traffic assumption and we numerically investigate the accuracy of the approximation. Our results show that the approximate solution captures accurately the structure of the equilibrium in the original game. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect