On preemptive-repeat LIFO queues

Søren Asmussen () and Peter W. Glynn ()
Additional contact information
Søren Asmussen: Ny Munkegade
Peter W. Glynn: Stanford University

Queueing Systems: Theory and Applications, 2017, vol. 87, issue 1, No 1, 22 pages

Abstract: Abstract In this paper, we study the basic properties of last-in first-out (LIFO) preemptive-repeat single-server queues in which the server needs to start service from scratch whenever a preempted customer reaches the server. In particular, we study the question of when such queues are stable (in the sense that the equilibrium time-in-system is finite-valued with probability one) and show how moments of the equilibrium customer sojourn time can be computed when the system is stable. A complete analysis of stability is provided in the setting of Poisson arrivals and in that of the Markovian arrival process. The stability region depends upon the detailed structure of the interarrival and service time distributions and cannot be expressed purely in terms of expected values. This is connected to the fact that such preemptive-repeat queues are not work conserving.

Keywords: Branching process; Iterative scheme; Markovian arrival process; Random walk; Sojourn time; Stability; Stochastic fixpoint equation; 60K25 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-017-9532-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:87:y:2017:i:1:d:10.1007_s11134-017-9532-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-017-9532-3

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().