Static and dynamic server allocation in systems with on/off sources

Joris Slegers (), Isi Mitrani () and Nigel Thomas ()

Annals of Operations Research, 2009, vol. 170, issue 1, 263 pages

Abstract: A system consisting of a number of servers, where demands of different types arrive in bursts (modelled by interrupted Poisson processes), is examined in the steady state. The problem is to decide how many servers to allocate to each job type, so as to minimize a cost function expressed in terms of average queue sizes. First, an exact analysis is provided for an isolated IPP/M/n queue. The results are used to compute the optimal static server allocation policy. The latter is then compared to four heuristic policies which employ dynamic switching of servers from one queue to another (such switches take time and hence incur costs). Copyright Springer Science+Business Media, LLC 2009

Keywords: Resource allocation; Dynamic optimization; Bursty arrival sources (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-008-0440-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:170:y:2009:i:1:p:251-263:10.1007/s10479-008-0440-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-008-0440-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().