Asymptotic expansions for large closed queueing networks with multiple job classes
- 1 April 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 41 (4) , 480-488
- https://doi.org/10.1109/12.135560
Abstract
A closed BCMP queuing network consisting of R job classes (chains), K+1 single-server, fixed-rate nodes, and M/sub j/ class j jobs (j=1, 2, . . ., R) is considered. Asymptotic expansions are constructed for the partition function under assumptions (1) KKeywords
This publication has 16 references indexed in Scilit:
- Asymptotic expansion for large closed queuing networksJournal of the ACM, 1990
- Calculating joint queue-length distributions in product-form queuing networksJournal of the ACM, 1989
- RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networksJournal of the ACM, 1986
- Asymptotic expansions for closed Markovian networks with state-dependent service ratesJournal of the ACM, 1986
- Open and Closed Models for Networks of QueuesAT&T Bell Laboratories Technical Journal, 1984
- Balanced job bound analysis of queueing networksCommunications of the ACM, 1982
- Rays, waves and asymptoticsBulletin of the American Mathematical Society, 1978
- Queuing Networks with Multiple Closed Chains: Theory and Computational AlgorithmsIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973