Browse by author
Lookup NU author(s): Dr Joris Slegers, Emeritus Professor Isi Mitrani, Dr Nigel Thomas
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 IP/M/n queue. The results are used to compute the optimal static server allocation policy. The latter is then compared to two heuristic policies which employ dynamic switching of servers from one queue to another (such switches take time and hence incur costs).
Author(s): Slegers J, Mitrani I, Thomas N
Publication type: Report
Publication status: Published
Series Title: School of Computing Science Technical Report Series
Year: 2006
Pages: 13
Print publication date: 01/09/2006
Source Publication Date: September 2006
Report Number: 982
Institution: School of Computing Science, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/982.pdf
