IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v32y1984i4p753-773.html
   My bibliography  Save this article

A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals

Author

Listed:
  • Michael Shalmon

    (McGill University, Montreal, Quebec, Canada)

  • Michael A. Kaplan

    (INRS-Telecommunications, Verdun, Quebec, Canada)

Abstract

We present a complete analysis of delays for a tandem network of queues with deterministic service and multiple , interfering sources. The model is of a packet-based data collection system consisting of some finite, but arbitrary, number of stations connected in tandem by a unidirectional, asynchronous transmission network. Packets, or, more generally, tasks enter the system at every station, are handed from station to station in store-and-forward fashion, and exit at the downstream end; there are no intermediate departures. The stations are provided with infinite storage, and the lines between them operate concurrently and asynchronously. Intermediate sources are Poisson; the source at the head of the network can be somewhat more general than Poisson. Tasks from each source wait at each station downstream of their point of origin. We calculate the joint steady-state moment-generating functions for these waiting times, provided that the line capacities do not increase in the direction of flow; the solution contains as a special case the steady-state moment-generating function for end-to-end delay for each source.

Suggested Citation

  • Michael Shalmon & Michael A. Kaplan, 1984. "A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals," Operations Research, INFORMS, vol. 32(4), pages 753-773, August.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:4:p:753-773
    DOI: 10.1287/opre.32.4.753
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.4.753
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.4.753?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. Rhee, Young & Perros, Harry G., 1996. "Analysis of an open tandem queueing network with population constraint and constant service times 1," European Journal of Operational Research, Elsevier, vol. 92(1), pages 99-111, 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:oropre:v:32:y:1984:i:4:p:753-773. 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.