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).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Buyukkoc, C., Varaiya, P., & Walrand, J. (1985). The c μ-rule revisited. Advances in Applied Probability, 17, 237–238.
de Souza e Silva, E., Gail, H. (2001). The uniformization method in performability analysis. In B. R. Haverkort & G. R. R. Marie (Eds.), Performability modelling. New York: Wiley.
Duenyas, I., & Oyen, M. V. (1992). Heuristic scheduling of parallel heterogeneous queues with set-ups (Technical Report 92-60). Department of Industrial and Operations Engineering, University of Michigan.
Duenyas, I., & Oyen, M. V. (1995). Stochastic scheduling of parallel queues with set-up costs. Queueing Systems Theory and Applications, 19, 421–444.
Koole, G. (1997). Assigning a single server to inhomogeneous queues with switching costs. Theoretical Computer Science, 182, 203–216.
Koole, G. (1998). Structural results for the control of queueing systems using event-based dynamic programming. Queueing Systems Theory and Applications, 30, 323–339.
Kuczura, A. (1973). The interrupted Poisson process as an overflow process. Bell Systems Technical Journal, 52, 437–448.
Liu, Z., Nain, P., & Towsley, D. (1992). On optimal polling policies. Queueing Systems Theory and Applications, 11, 59–83.
Mitrani, I., & Mitra, D. (1991). A spectral expansion method for random walks on semi-infinite strips. In: IMACS symposium on iterative methods in linear algebra, Brussels.
Neuts, M. (1981). Matrix geometric solutions in stochastic models. Baltimore: John Hopkins Press.
Palmer, J., & Mitrani, I. (2005). Optimal server allocation in reconfigurable clusters with multiple job types. Journal of Parallel and Distributed Computing, 65(10), 1204–1211.
Tijms, H. (1994). Stochastic models. New York: Wiley.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was carried out in the framework of the collaborative project DOPCHE (Dynamic Operative Policies for Commercial Hosting Environments), funded by the UK Engineering and Physical Sciences Research Council under its E-Science programme. The support of the Network of Excellence EuroNGI, funded by the EU, is also acknowledged.
Rights and permissions
About this article
Cite this article
Slegers, J., Mitrani, I. & Thomas, N. Static and dynamic server allocation in systems with on/off sources. Ann Oper Res 170, 251–263 (2009). https://doi.org/10.1007/s10479-008-0440-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0440-0