IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v110y2026i1d10.1007_s11134-025-09960-3.html
   My bibliography  Save this article

The Markovian queue with exclusive positions for customers and forward movement delays

Author

Listed:
  • Tetsuya Takine

    (The University of Osaka, Department of Information and Communications Technology, Graduate School of Engineering)

Abstract

This paper considers Markovian queues with exclusive positions for customers and forward movement delays, where the arrival rate of customers depends on the system length. This model seems to be suitable to investigate traffic jam because it has two performance measures for the queue length: the system length L and the number N of customers in the system. We first show that the matrix product ansatz holds in this model and obtain the stability condition. We then formulate the model as a level-dependent quasi birth-and-death (QBD) process whose state space is explosive and discuss the implications of the matrix product ansatz from the perspective of Markov chain theory. In particular, we find that the matrix product ansatz is a sufficient condition for the local balance of a certain type. We then derive recursions for the stationary probability of L and for the stationary joint probability of L and N, which form the basis of our analysis. Specifically, using these recursions, we develop a computational procedure for the stationary joint probability of L and N and derive various performance measures, such as the stationary joint probability of L and N and the Laplace–Stieltjes transform of the delay distribution. Some numerical examples are also provided.

Suggested Citation

  • Tetsuya Takine, 2026. "The Markovian queue with exclusive positions for customers and forward movement delays," Queueing Systems: Theory and Applications, Springer, vol. 110(1), pages 1-74, March.
  • Handle: RePEc:spr:queues:v:110:y:2026:i:1:d:10.1007_s11134-025-09960-3
    DOI: 10.1007/s11134-025-09960-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-025-09960-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11134-025-09960-3?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    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:spr:queues:v:110:y:2026:i:1:d:10.1007_s11134-025-09960-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.