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

Technical Note–Stability of a Queue Fed by Scheduled Traffic at Critical Loading

Author

Listed:
  • Victor F. Araman

    (Olayan School of Business, American University of Beirut (AUB), Beirut 1107 2020, Lebanon)

  • Peter W. Glynn

    (Management Science and Engineering Department, Stanford University, Stanford, California 74305)

Abstract

Consider the workload process for a single server queue with deterministic service times in which customers arrive according to a scheduled traffic process. A scheduled arrival sequence is one in which customers are scheduled to arrive at constant interarrival times, but each customer’s actual arrival time is perturbed from her scheduled arrival time by a random perturbation. In this paper, we consider a critically loaded queue in which the service rate equals the arrival rate. Unlike a queue fed by renewal traffic, this queue can be stable even in the presence of critical loading. We show that for finite mean perturbations, a necessary and sufficient condition for stability is when the positive part of the perturbation has bounded support, with no requirement on the negative part of the perturbation. Perhaps surprisingly, this criterion is not reversible, in the sense that such a queue can be stable for a scheduled traffic process in forward time, but unstable for the time-reversal of the same traffic process.

Suggested Citation

  • Victor F. Araman & Peter W. Glynn, 2025. "Technical Note–Stability of a Queue Fed by Scheduled Traffic at Critical Loading," Operations Research, INFORMS, vol. 73(5), pages 2567-2571, September.
    • Handle: RePEc:inm:oropre:v:73:y:2025:i:5:p:2567-2571
    DOI: 10.1287/opre.2023.0039
    as

    Download full text from publisher

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

    Keywords

    ;

    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:inm:oropre:v:73:y:2025:i:5:p:2567-2571. 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.