An infinite server system with general packing constraints: Asymptotic optimality of a greedy randomized algorithm

Motivated primarily by the problem of efficient assignment of virtual machines to physical host machines in a network cloud, we consider an infinite-server system with several types of arriving customers. Multiple customers can be placed into one server for service, subject to general "packing&...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton) s. 575 - 582
Hlavní autoři: Stolyar, Alexander L., Yuan Zhong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2013
Témata:
Convergence
Greedy algorithms
Random variables
Servers
Steady-state
Vectors
Virtual machining
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Motivated primarily by the problem of efficient assignment of virtual machines to physical host machines in a network cloud, we consider an infinite-server system with several types of arriving customers. Multiple customers can be placed into one server for service, subject to general "packing" constraints. Service times of different customers are independent, even if served simultaneously by the same server. Customers are placed for service immediately upon arrival, and leave the system after service completion. A key system objective is to minimize the total number of occupied servers. We propose Greedy-Random (GRAND), an extremely simple customer placement algorithm, which is also easy to implement. We show that a version of GRAND is essentially asymptotically optimal, as the customer arrival rates grow to infinity. We also study several versions of the GRAND algorithms by simulations.
DOI:10.1109/Allerton.2013.6736576