Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-16T20:16:48.478Z Has data issue: false hasContentIssue false
  • English
  • Français

Exact-Order Asymptotic Analysis for Closed Queueing Networks

Part of: Operations research and management science Computer system organization Special processes

Published online by Cambridge University Press:  04 February 2016

David K. George ,
Cathy H. Xia  and
Mark S. Squillante
David K. George*
Affiliation:
The Ohio State University
Cathy H. Xia*
Affiliation:
The Ohio State University
Mark S. Squillante*
Affiliation:
IBM Thomas J. Watson Research Center
*
∗ Postal address: Department of Integrated Systems Engineering, The Ohio State University, Columbus, OH 43201, USA.
∗ Postal address: Department of Integrated Systems Engineering, The Ohio State University, Columbus, OH 43201, USA.
∗∗∗∗ Postal address: Mathematical Sciences Department, IBM Thomas J. Watson Research Center, PO Box 218, Yorktown Heights, NY 10598, USA. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we study the asymptotic behavior of a general class of product-form closed queueing networks as the population size grows large. We first characterize the asymptotic behavior of the normalization constant for the stationary distribution of the network in exact order. This result then enables us to establish the asymptotic behavior of the system performance metrics, which extends a number of well-known asymptotic results to exact order. We further derive new, computationally simple approximations for performance metrics that significantly improve upon existing approximations for large-scale networks. In addition to their direct use for the analysis of large networks, these new approximations are particularly useful for reformulating large-scale queueing network optimization problems into more easily solvable forms, which we demonstrate with an optimal capacity planning example.

Keywords

Closed queueing networklarge populationasymptotic analysisexact-order asymptoticsapproximation methods

MSC classification

Primary: 60K25: Queueing theory
Secondary: 68M20: Performance evaluation; queueing; scheduling 90B22: Queues and service
Type
Research Article
Information
Journal of Applied Probability , Volume 49 , Issue 2 , June 2012 , pp. 503 - 520
Copyright
© Applied Probability Trust 

References

Anselmi, J. and Cremonesi, P. (2008). Bounding the performance of BCMP networks with load-dependent stations. In 16th Internat. Symp. Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (Baltimore, MA, 2008), eds Miller, E. L. and Williamson, C. L., IEEE Computer Society, pp. 171–178.Google Scholar
Baskett, F., Chandy, K. M., Muntz, R. R. and Palacios, F. G. (1975). Open, closed, and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22, 248–260.CrossRefGoogle Scholar
Bruell, S. C. and Balbo, G. (1980). Computational Algorithms for Closed Queueing Networks. North-Holland, New York.Google Scholar
Buzen, J. P. (1973). Computational algorithms for closed queueing networks with exponential servers. Commun. Accoc. Comput. Mach. 16, 527–531.Google Scholar
Casale, G., Muntz, R. R. and Serazzi, G. (2008). Geometric bounds: a noniterative analysis technique for closed queueing networks. IEEE Trans. Comput. 57, 780–794.Google Scholar
Chandy, K. M. and Sauer, C. H. (1980). Computational algorithms for product form queueing networks. Commun. Assoc. Comput. Mach. 23, 573–583.Google Scholar
Denning, P. J. and Buzen, J. P. (1978). The operational analysis of queueing network models. ACM Comput. Surveys 10, 225–261.Google Scholar
George, D. K. and Xia, C. H. (2011). Fleet-sizing and service availability for a vehicle rental system via closed queueing networks. Europ. J. Operat. Res. 211, 198–207.Google Scholar
Gerasimov, A. I. (1995). On normalizing constants in multiclass queueing networks. Operat. Res. 43, 704–711.Google Scholar
Hsieh, C. T. and Lam, S. S. (1987). Two classes of performance bounds for closed queueing networks. Performance Evaluation 7, 3–30.Google Scholar
Knessl, C. and Tier, C. (1990). Asymptotic expansions for large closed queuing networks. J. Assoc. Comput. Mach. 37, 144–174.CrossRefGoogle Scholar
Kogan, Y. (1992). Another approach to asymptotic expansions for large queueing networks. Operat. Res. Lett. 11, 317–321.Google Scholar
Kriz, J. (1984). Throughput bounds for closed queueing networks. Performance Evaluation 4, 1–10.Google Scholar
Kulkarni, V. G. (1995). Modeling and Analysis of Stochastic Systems. Chapman and Hall, London.Google Scholar
Lavenberg, S. S. (1983). Computer Performance Modeling Handbook. Academic Press, Orlando, FL.Google Scholar
Lazowska, E. D., Zahorjan, J., Graham, G. S. and Sevcik, K. C. (1984). Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice-Hall.Google Scholar
McKenna, J. and Mitra, D. (1982). Integral representations and asymptotic expansions for closed Markovian queueing networks: normal usage. Bell System Tech. J. 61, 661–683.CrossRefGoogle Scholar
Muntz, R. R. and Wong, J. W. (1974). Asymptotic properties of closed queueing network models. In Proc. 8th Annual Princeton Conf. Information Sciences and Systems (Princeton University, Princeton), pp. 348–352.Google Scholar
Mureşan, M. (2008). A Concrete Approach to Classical Analysis. Springer.Google Scholar
Ogata, K. (1987). Discrete-Time Control Systems. Prentice-Hall.Google Scholar
Reiser, M. and Lavenberg, S. S. (1980). Mean-value anlaysis of closed multichain queueing networks. J. Assoc. Comput. Mach. 27, 313–322. (Correction: 28 (1981), 629.)Google Scholar
Serfozo, R. (1999). Introduction to Stochastic Networks. Springer, New York.Google Scholar
Zahorjan, J., Sevcik, K. C., Eager, D. L. and Galler, B. (1982). Balanced Job bound analysis of queueing networks. Commun. Assoc. Comput. Mach. 25, 134–141.Google Scholar