IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v30y1984i5p623-632.html
   My bibliography  Save this article

Approximations for Superposition Arrival Processes in Queues

Author

Listed:
  • G. F. Newell

    (Department of Civil Engineering, University of California, Berkeley, California 94720)

Abstract

S. L. Albin has described extensive simulations of queue behavior for a system with a single server and an arrival process that is a superposition of n renewal processes. The simulations show, among other things, that as n increases for a fixed traffic intensity \rho, the queue behavior approaches that of the M/M/1 system. The rate of convergence, however, becomes much slower as the traffic intensity \rho comes closer to 1. Several qualitative effects shown in the simulations are explained here. In particular it is shown that the approach to the M/M/1 system requires that n(1 - \rho) 2 \gg 1.

Suggested Citation

  • G. F. Newell, 1984. "Approximations for Superposition Arrival Processes in Queues," Management Science, INFORMS, vol. 30(5), pages 623-632, May.
    • Handle: RePEc:inm:ormnsc:v:30:y:1984:i:5:p:623-632
    DOI: 10.1287/mnsc.30.5.623
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.30.5.623
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.30.5.623?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Irina Peshkova & Evsey Morozov & Michele Pagano, 2024. "Regenerative Analysis and Approximation of Queueing Systems with Superposed Input Processes," Mathematics, MDPI, vol. 12(14), pages 1-22, July.

    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:inm:ormnsc:v:30:y:1984:i:5:p:623-632. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.