An infinite server system with customer-to-server packing constraints

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider a model which is motivated primarily by the problem of efficient 'packing' of virtual machines into physical host machines in a network cloud. There is infinite number of servers and multiple flows of arriving customers of different types. Each server can simultaneously serve several customers, subject to some packing constraints. Service times of different customers are independent - even if customers share a server. Customers leave after their service is complete. A key underlying objective is to minimize the number of occupied servers. In this paper we consider the problem with approximate ('convexified') objective, which can be arbitrarily close to the original one. We show that some versions of a greedy strategy are asymptotically optimal as the system scale (the total customer arrival rate) goes to infinity.

Original languageEnglish (US)
Title of host publication2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Pages1713-1720
Number of pages8
DOIs
StatePublished - Dec 1 2012
Externally publishedYes
Event2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 - Monticello, IL, United States
Duration: Oct 1 2012Oct 5 2012

Publication series

Name2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

Other

Other2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
CountryUnited States
CityMonticello, IL
Period10/1/1210/5/12

Fingerprint

Computer systems
Servers

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Stolyar, A. (2012). An infinite server system with customer-to-server packing constraints. In 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 (pp. 1713-1720). [6483428] (2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012). https://doi.org/10.1109/Allerton.2012.6483428

An infinite server system with customer-to-server packing constraints. / Stolyar, Aleksandr.

2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012. 2012. p. 1713-1720 6483428 (2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Stolyar, A 2012, An infinite server system with customer-to-server packing constraints. in 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012., 6483428, 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, pp. 1713-1720, 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, Monticello, IL, United States, 10/1/12. https://doi.org/10.1109/Allerton.2012.6483428
Stolyar A. An infinite server system with customer-to-server packing constraints. In 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012. 2012. p. 1713-1720. 6483428. (2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012). https://doi.org/10.1109/Allerton.2012.6483428
Stolyar, Aleksandr. / An infinite server system with customer-to-server packing constraints. 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012. 2012. pp. 1713-1720 (2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012).
@inproceedings{02663d8af358435c9cd39a853a36415f,
title = "An infinite server system with customer-to-server packing constraints",
abstract = "We consider a model which is motivated primarily by the problem of efficient 'packing' of virtual machines into physical host machines in a network cloud. There is infinite number of servers and multiple flows of arriving customers of different types. Each server can simultaneously serve several customers, subject to some packing constraints. Service times of different customers are independent - even if customers share a server. Customers leave after their service is complete. A key underlying objective is to minimize the number of occupied servers. In this paper we consider the problem with approximate ('convexified') objective, which can be arbitrarily close to the original one. We show that some versions of a greedy strategy are asymptotically optimal as the system scale (the total customer arrival rate) goes to infinity.",
author = "Aleksandr Stolyar",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/Allerton.2012.6483428",
language = "English (US)",
isbn = "9781467345385",
series = "2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012",
pages = "1713--1720",
booktitle = "2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012",

}

TY - GEN

T1 - An infinite server system with customer-to-server packing constraints

AU - Stolyar, Aleksandr

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We consider a model which is motivated primarily by the problem of efficient 'packing' of virtual machines into physical host machines in a network cloud. There is infinite number of servers and multiple flows of arriving customers of different types. Each server can simultaneously serve several customers, subject to some packing constraints. Service times of different customers are independent - even if customers share a server. Customers leave after their service is complete. A key underlying objective is to minimize the number of occupied servers. In this paper we consider the problem with approximate ('convexified') objective, which can be arbitrarily close to the original one. We show that some versions of a greedy strategy are asymptotically optimal as the system scale (the total customer arrival rate) goes to infinity.

AB - We consider a model which is motivated primarily by the problem of efficient 'packing' of virtual machines into physical host machines in a network cloud. There is infinite number of servers and multiple flows of arriving customers of different types. Each server can simultaneously serve several customers, subject to some packing constraints. Service times of different customers are independent - even if customers share a server. Customers leave after their service is complete. A key underlying objective is to minimize the number of occupied servers. In this paper we consider the problem with approximate ('convexified') objective, which can be arbitrarily close to the original one. We show that some versions of a greedy strategy are asymptotically optimal as the system scale (the total customer arrival rate) goes to infinity.

UR - http://www.scopus.com/inward/record.url?scp=84875741414&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875741414&partnerID=8YFLogxK

U2 - 10.1109/Allerton.2012.6483428

DO - 10.1109/Allerton.2012.6483428

M3 - Conference contribution

AN - SCOPUS:84875741414

SN - 9781467345385

T3 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

SP - 1713

EP - 1720

BT - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

ER -