Show simple item record

dc.contributor.authorKnessl, Charles
dc.contributor.authorMorrison, John A.
dc.date.accessioned2012-03-15T18:40:37Z
dc.date.available2012-03-15T18:40:37Z
dc.date.issued2011
dc.identifier.bibliographicCitationKnessl, C. & Morrison, J. A. 2011. Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case. Advances in Operations Research, 2011. DOI: 10.1155/2011/216790en
dc.identifier.issn1687-9147
dc.identifier.otherDOI: 10.1155/2011/216790
dc.identifier.urihttp://hdl.handle.net/10027/8197
dc.descriptionCopyright © 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. The original version is available through Hindawi Publishing Corporation at DOI: 10.1155/2011/216790.en
dc.description.abstractWe 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 smaller, of order O(ε−1/2). We obtain a two-dimensional diffusion approximation for this model and explicitly solve for the joint steady state probability distribution of the numbers of customers in the two queues. This work complements that in (Morrison, 2010), which the second queue was assumed to be heavily or lightly loaded, leading to mean queue lengths that were O(ε−1) or O(1), respectively.en
dc.description.sponsorshipThe work of C. Knessl was partly supported by NSF Grant no. DMS 05-03745 and by NSA Grant no. H 98230-08-1-0102.en
dc.language.isoen_USen
dc.publisherHindawi Publishing Corporationen
dc.subjectcouples queuesen
dc.subjectarrival rateen
dc.subjectprocessor sharingen
dc.titleTwo Coupled Queues with Vastly Different Arrival Rates: Critical Loading Caseen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record