Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints

We consider a service system model primarily motivated by the problem of efficient assignment of virtual machines to physical host machines in a network cloud, so that the number of occupied hosts is minimized.There are multiple types of arriving customers, where a customer’s mean service time depen...

Full description

Saved in:

Bibliographic Details
Published in:	Queueing systems Vol. 79; no. 2; pp. 117 - 143
Main Authors:	Stolyar, Alexander L., Zhong, Yuan
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2015 Springer Nature B.V
Subjects:	Algorithms Arrivals Asymptotic methods Asymptotic properties Business and Management Cloud computing Clouds Computer Communication Networks Control Customer services Customers Greedy algorithms Networks Operations Research/Decision Theory Optimization Packaging Packing problem Probability Theory and Stochastic Processes Queuing theory Servers Simulation Studies Supply Chain Management Systems Theory United States > US Fluid limit Cloud computing Infinite server system Greedy random algorithm 90B15 Virtual machine Queueing networks 60K25 Stochastic bin packing
ISSN:	0257-0130, 1572-9443
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!