The queue with impatience: construction of the stationary workload under FIFO
Pascal Moyal
Source: J. Appl. Probab. Volume 47, Number 2
(2010), 498-512.
Abstract
In this paper we study the stability of queueing systems with impatient customers and a single server operating under a FIFO (first-in-first-out) discipline. We first give a sufficient condition for the existence of a stationary workload in the case of impatience until the beginning of service. We then provide a weaker condition of existence on an enriched probability space using the theory of Anantharam et al. (1997), (1999). The case of impatience until the end of service is also investigated.
First Page:
Show
Hide
Keywords: Stochastic recursion; stationary solution; queues with impatience; renovative event; enrichment of probability space
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jap/1276784905
Digital Object Identifier: doi:10.1239/jap/1276784905
Zentralblatt MATH identifier: 05758483
Mathematical Reviews number (MathSciNet): MR2668502
References
Anantharam, V. and Konstantopoulos, T. (1997). Stationary solutions of stochastic recursions describing discrete event systems. Stoch. Process. Appl. 68, 181--194.
Mathematical Reviews (MathSciNet): MR1454831
Digital Object Identifier: doi:10.1016/S0304-4149(97)00019-7
Baccelli, F. and Brémaud, P. (2002). Elements of Queueing Theory, 2nd edn. Springer, Berlin.
Mathematical Reviews (MathSciNet): MR1957884
Baccelli, F. and Hébuterne, G. (1981). On queues with impatient customers. In Performance '81 (Amsterdam, 1981), North-Holland, Amsterdam, pp. 159--179.
Mathematical Reviews (MathSciNet): MR727303
Zentralblatt MATH: 0539.90030
Baccelli, F., Boyer, P. and Hébuterne, G. (1984). Single-server queues with impatient customers. Adv. Appl. Prob. 16, 887--905.
Mathematical Reviews (MathSciNet): MR766784
Digital Object Identifier: doi:10.2307/1427345
JSTOR: links.jstor.org
Barrer, D. Y. (1957). Queuing with impatient customers and ordered service. Operat. Res. 5, 650--656.
Mathematical Reviews (MathSciNet): MR90183
Digital Object Identifier: doi:10.1287/opre.5.5.650
Borovkov, A. A. (1976). Stochastic Processes in Queueing Theory. Springer, New York.
Mathematical Reviews (MathSciNet): MR391297
Borovkov, A. A. and Foss, S. G. (1992). Stochastically recursive sequences and their generalizations. Siberian Adv. Math. 2, 16--81.
Mathematical Reviews (MathSciNet): MR1157423
Zentralblatt MATH: 0848.60025
Flipo, D. (1983). Files d'attente à rejet à un serveur. Application au cas indépendant. C. R. Acad. Sci. Paris 297, 365--367.
Mathematical Reviews (MathSciNet): MR732508
Loynes, R. M. (1962). The stability of a queue with non-independent interarrival and service times. Proc. Camb. Phil. Soc. 58, 497--520.
Mathematical Reviews (MathSciNet): MR141170
Digital Object Identifier: doi:10.1017/S0305004100036781
Moyal, P. (2008). Stability of a processor-sharing queue with varying throughput. J. Appl. Prob. 45, 953--962.
Mathematical Reviews (MathSciNet): MR2484154
Zentralblatt MATH: 1154.60352
Digital Object Identifier: doi:10.1239/jap/1231340226
Project Euclid: euclid.jap/1231340226
Moyal, P. (2009). Weak solutions of stochastic recursions: an explicit construction. Preprint. Available at http://arxiv.org/abs/0904.3240v1.
Neveu, J. (1984). Construction de files d'attente stationnaires. In Modeling and Performance Evaluation Methodology (Lecture Notes Control Inf. Sci. 60), Springer, Berlin, pp. 29--41.
Mathematical Reviews (MathSciNet): MR893653
Zentralblatt MATH: 0548.60092
Digital Object Identifier: doi:10.1007/BFb0005168
Journal of Applied Probability
