a resource-sharing game with relative priorities：具有相对优先级的资源共享游戏.pdfVIP

Performance Evaluation 79 (2014) 287–305 Contents lists available at ScienceDirect Performance Evaluation journal homepage: /locate/peva A resource-sharing game with relative priorities J. Doncel a,d,∗, U. Ayesta a,b,c,d , O. Brun a,d , B. Prabhu a,d a CNRS, LAAS, 7 avenue du colonel Roche, F-31400 Toulouse, France b IKERBASQUE, Basque Foundation for Science, 48011 Bilbao, Spain c UPV/EHU, Univ. of the Basque Country, 20018 Donostia, Spain d Univ. de Toulouse, INSA, LAAS, F-31400 Toulouse, France a r t i c l e i n f o a b s t r a c t Article history: Motivated by cloud-based computing resources operating with relative priorities, we in- Available online 10 July 2014 vestigate 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 sub- Keywords: mits jobs of variable sizes according to a stochastic process. These jobs have to be completed Pricing before some user-specific deadline. They are executed on the processor and receive a share Queueing games Heavy-traffic approximation of the capacity that is proportional to the priority level. The users’ goal is to choose prior- Discriminatory processor-sharing ity levels so as to minimize their own payment, while guaranteeing that their jobs meet their deadlines. We fully characterize the solution of the game for two classes of users and