IDEAS home Printed from https://ideas.repec.org/a/hin/jnlaor/216790.html
   My bibliography  Save this article

Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case

Author

Listed:
  • Charles Knessl
  • John A. Morrison

Abstract

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 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.

Suggested Citation

  • Charles Knessl & John A. Morrison, 2011. "Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case," Advances in Operations Research, Hindawi, vol. 2011, pages 1-26, March.
  • Handle: RePEc:hin:jnlaor:216790
    DOI: 10.1155/2011/216790
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AOR/2011/216790.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/AOR/2011/216790.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2011/216790?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlaor:216790. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.