By Topic

Asymptotic expansions for large closed queueing networks with multiple job classes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Knessl, C. ; Illinois Univ., Chicago, IL, USA ; Tier, C.

A closed BCMP queuing network consisting of R job classes (chains), K+1 single-server, fixed-rate nodes, and M j class j jobs (j=1, 2, . . ., R) is considered. Asymptotic expansions are constructed for the partition function under assumptions (1) K≫1, (2) Mj ≫1 for each j, and (3) K/Mj =O(1). Analytic expressions for performance measures such as the mean queue length are also given. The approach employs the ray method and the method of matched asymptotic expansions. Numerical comparisons illustrate the accuracy of the approximations

Published in:

Computers, IEEE Transactions on  (Volume:41 ,  Issue: 4 )