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

Full description

Bibliographic Details

Published in:	2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton) pp. 575 - 582
Main Authors:	Stolyar, Alexander L., Yuan Zhong
Format:	Conference Proceeding
Language:	English
Published:	IEEE 2013
Subjects:	Convergence Greedy algorithms Random variables Servers Steady-state Vectors Virtual machining
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!