Skip to main content

Advertisement

SpringerLink
  1. Home
  2. Queueing Systems
  3. Article
On queues with service and interarrival times depending on waiting times
Download PDF
Your article has downloaded

Similar articles being viewed by others

Slider with three articles shown per slide. Use the Previous and Next buttons to navigate the slides or the slide controller buttons at the end to navigate through each slide.

Analysis of a queue with general service demands and correlated service capacities

03 October 2019

Michiel De Muynck, Herwig Bruneel & Sabine Wittevrongel

Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview

14 October 2020

Kristen Gardner & Rhonda Righter

On the distributions of infinite server queues with batch arrivals

15 February 2019

Andrew Daw & Jamol Pender

The Queue Geo/G/1/N + 1 Revisited

04 June 2018

M. L. Chaudhry & Veena Goswami

Maximum Remaining Service Time in Infinite-Server Queues

01 April 2018

A. V. Lebedev

An M/PH/1 queue with workload-dependent processing speed and vacations

25 March 2021

Yutaka Sakuma, Onno Boxma & Tuan Phung-Duc

Extension of the Class of Queueing Systems with Delay

13 December 2018

V. N. Tarasov

Algorithms for the Analysis of Queueing System M/G/1/ $$\infty $$ with Cut-Off of the Line

01 April 2022

A. M. Andronov & I. M. Dalinger

A New and Pragmatic Approach to the GIX/Geo/c/N Queues Using Roots

18 November 2020

J. J. Kim, M. L. Chaudhry, … A. D. Banik

Download PDF
  • Open Access
  • Published: 20 March 2007

On queues with service and interarrival times depending on waiting times

  • O. J. Boxma1 &
  • M. Vlasiou2 

Queueing Systems volume 56, pages 121–132 (2007)Cite this article

  • 617 Accesses

  • 24 Citations

  • 1 Altmetric

  • Metrics details

Abstract

We consider an extension of the standard G/G/1 queue, described by the equation \(W\stackrel{ \mathcal {D}}{=}\max\mathrm{max}\,\{0,B-A+YW\}\) , where ℙ[Y=1]=p and ℙ[Y=−1]=1−p. For p=1 this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for p=0 it describes the waiting time of the server in an alternating service model. For all other values of p, this model describes a FCFS queue in which the service times and interarrival times depend linearly and randomly on the waiting times. We derive the distribution of W when A is generally distributed and B follows a phase-type distribution, and when A is exponentially distributed and B deterministic.

Download to read the full article text

Working on a manuscript?

Avoid the most common mistakes and prepare your manuscript for journal editors.

Learn more

References

  1. Asmussen S, Schock Petersen S. Ruin probabilities expressed in terms of storage processes. Adv Appl Probab 1989;20(4):913–6.

    Article  Google Scholar 

  2. Asmussen S, Sigman K. Monotone stochastic recursions and their duals. Probab Eng Inf Sci 1996;10(1):1–20.

    Article  Google Scholar 

  3. Borovkov AA, Foss S. Stochastically recursive sequences. Sib Adv Math 1992;2:16–81.

    Google Scholar 

  4. Brandt A. The stochastic equation Y n+1=A n Y n +B n with stationary coefficients. Adv Appl Probab 1986;18(1):211–20.

    Article  Google Scholar 

  5. Brandt A, Franken P, Lisek B. Stationary stochastic models. vol. 78, Mathematische Lehrbücher und Monographien, II. Abteilung: Mathematische Monographien. Berlin: Akademie Verlag; 1990.

    Google Scholar 

  6. Cohen JW. The single server queue. Amsterdam: North-Holland; 1982.

    Google Scholar 

  7. Erlang AK. The theory of probabilities and telephone conversations. In: Brockmeyer E, Halstrøm HL, Jensen A, editors. The life and works of A.K. Erlang. Applied mathematics and computing machinery series. vol 6. Acta polytechnica Scandinavica. 2nd ed. 1960, p. 131–137. English translation. First published in “Nyt tidsskrift for matematik” B. vol 20. 1909, p. 33.

  8. Franx GJ. A simple solution for the M/D/c waiting time distribution. Oper Res Lett 2001;29(5):221–9.

    Article  Google Scholar 

  9. Jacquet P. Subexponential tail distribution in LaPalice queues. Perform Eval Rev 1992;20(1):60–9.

    Article  Google Scholar 

  10. Kalashnikov V, Norberg R. Power tailed ruin probabilities in the presence of risky investments. Stoch Process Appl 2002;98:211–28.

    Article  Google Scholar 

  11. Lindley DV. The theory of queues with a single server. Proc Camb Philos Soc 1952;48:277–89.

    Article  Google Scholar 

  12. Norberg R. Ruin problems with assets and liabilities of diffusion type. Stoch Process Appl 1999;81:255–69.

    Article  Google Scholar 

  13. Park BC, Park JY, Foley RD. Carousel system performance. J Appl Probab 2003;40(3):602–12.

    Article  Google Scholar 

  14. Ross SM. Stochastic processes. 2nd ed. New York: Wiley; 1996.

    Google Scholar 

  15. Schassberger R. Warteschlangen. Wien: Springer; 1973.

    Google Scholar 

  16. Seal HL. Risk theory and the single server queue. Mitt Ver Schweiz Versicher 1972;72:171–8.

    Google Scholar 

  17. Tang Q, Tsitsiashvili G. Precise estimates for the ruin probability in finite horizon in a discrete-time model with heavy-tailed insurance and financial risks. Stoch Process Appl 2003;108:299–325.

    Google Scholar 

  18. Titchmarsh EC. Theory of functions. 2nd ed. London: Oxford University Press; 1968.

    Google Scholar 

  19. Vervaat W. On a stochastic difference equation and a representation of non-negative infinitely divisible random variables. Adv Appl Probab 1979;11(4):750–83.

    Article  Google Scholar 

  20. Vlasiou M. A non-increasing Lindley-type equation. Technical Report 2005-015, Eurandom, Eindhoven, The Netherlands, 2005. Available at http://www.eurandom.nl.

  21. Vlasiou M, Adan IJBF. An alternating service problem. Probab Eng Inf Sci 2005;19(4):409–26.

    Article  Google Scholar 

  22. Vlasiou M, Adan IJBF. Exact solution to a Lindley-type equation on a bounded support. Oper Res Lett 2007;35(1):105–13.

    Article  Google Scholar 

  23. Vlasiou M, Adan IJBF, Wessels J. A Lindley-type equation arising from a carousel problem. J Appl Probab 2004;41(4):1171–81.

    Article  Google Scholar 

  24. Whitt W. Queues with service times and interarrival times depending linearly and randomly upon waiting times. Queueing Systs 1990;6(4):335–51.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EURANDOM and Department of Mathematics & Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    O. J. Boxma

  2. H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    M. Vlasiou

Authors
  1. O. J. Boxma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Vlasiou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Vlasiou.

Additional information

This research has been carried out when M. Vlasiou was affiliated with EURANDOM, The Netherlands.

Rights and permissions

Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Reprints and Permissions

About this article

Cite this article

Boxma, O.J., Vlasiou, M. On queues with service and interarrival times depending on waiting times. Queueing Syst 56, 121–132 (2007). https://doi.org/10.1007/s11134-007-9011-3

Download citation

  • Received: 26 July 2006

  • Revised: 26 November 2006

  • Published: 20 March 2007

  • Issue Date: August 2007

  • DOI: https://doi.org/10.1007/s11134-007-9011-3

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Lindley recursion
  • G/G/1 queue
  • Alternating service model

Mathematics Subject Classification (2000)

  • 60K25
  • 90B22
Download PDF

Working on a manuscript?

Avoid the most common mistakes and prepare your manuscript for journal editors.

Learn more

Advertisement

Over 10 million scientific documents at your fingertips

Switch Edition
  • Academic Edition
  • Corporate Edition
  • Home
  • Impressum
  • Legal information
  • Privacy statement
  • California Privacy Statement
  • How we use cookies
  • Manage cookies/Do not sell my data
  • Accessibility
  • FAQ
  • Contact us
  • Affiliate program

Not affiliated

Springer Nature

© 2023 Springer Nature Switzerland AG. Part of Springer Nature.