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&...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton) S. 575 - 582
Hauptverfasser:	Stolyar, Alexander L., Yuan Zhong
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 2013
Schlagworte:	Convergence Greedy algorithms Random variables Servers Steady-state Vectors Virtual machining
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!