Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Static and dynamic server allocation in systems withon/off sources

Static and dynamic server allocation in systems withon/off sources 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). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Operations Research Springer Journals

Static and dynamic server allocation in systems withon/off sources

Loading next page...
 
/lp/springer-journals/static-and-dynamic-server-allocation-in-systems-with-on-off-sources-I694E5NZH4

References (15)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer Science+Business Media, LLC
Subject
Business and Management; Operation Research/Decision Theory; Combinatorics; Theory of Computation
ISSN
0254-5330
eISSN
1572-9338
DOI
10.1007/s10479-008-0440-0
Publisher site
See Article on Publisher Site

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

Journal

Annals of Operations ResearchSpringer Journals

Published: Sep 13, 2008

There are no references for this article.