two coupled queues with vastly different arrival rates critical loading case两个耦合的队列与截然不同的到达率临界加载情况.pdf

Hindawi Publishing Corporation Advances in Operations Research Volume 2011, Article ID 216790, 26 pages doi:10.1155/2011/216790 Research Article Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case Charles Knessl1 and John A. Morrison2 1 Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, 851 South Morgan Street Chicago, IL 60607-7045, USA 2 Consultant Bell Laboratories, Alcatel-Lucent, 600 Mountain Avenue, Murray Hill, NJ 07974, USA Correspondence should be addressed to Charles Knessl, knessl@ Received 8 September 2010; Accepted 18 January 2011 Academic Editor: A. Gomez-Corral ´ Copyright q 2011 C. Knessl and J. A. Morrison. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We consider two coupled queues with a generalized processor sharing service discipline. The second queue has a much smaller Poisson arrival rate than the first queue, while the customer service times are of comparable magnitude. The processor sharing server devotes most of its resources to the first queue, except when it is empty. The fraction of resources devoted to the second queue is small, of the same order as the ratio of the arrival rates. We assume that the primary queue is heavily loaded and that the secondary queue is critically loaded. If we let the small arrival rate to the secondary queue be Oε, where 0 ≤ ε 1, then in this asymptotic limit the number of customers in the first queue will be large, of order Oε−1 , while that in the second queue will be somewhat smal