Abstract
A brief survey of the literature on sojourn time problems in single node feedback queueing systems is presented. The derivation of the distribution and moments of the sojourn time of a typical customer in a Markov renewal queue with state dependent feedback is considered in depth. The techniques used relate to the derivation of a first passage time distribution in a particular Markov renewal process. These results are applied to birth-death queues with state dependent feedback. For such models an alternative approach using the theory of Markov chains in continuous time is also examined.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.L. van den Berg and O.J. Boxma, Sojourn times in feedback queues, Report OS-R 8710, Centre for Mathematics and Computer Science, Amsterdam, 1987.
J.L. van den Berg and O.J. Boxma, Sojourn times in feedback and processor sharing queues (1987), To be submitted to ITC-12.
J.L. van den Berg, O.J. Boxma and W.P. Groenendijk, Sojourn times in the M/G/1 queue with deterministic feedback, Report OS-R 8708, Centre for Mathematics and Computer Science, Amsterdam, 1987.
E. Cinlar, Markov renewal theory, Adv. Appl. Prob. 1 (1969) 123–187.
R.L. Disney, A note on sojourn times in M/G/I queues with instantaneous Bernoulli feedback, Naval Research Logistics Quarterly 28 (1981) 679–684.
R.L. Disney, D. Konig and V. Schmidt, Stationary queue-length and waiting time distributions in single server feedback queues, Adv. Appl. Prob. 16 (1984) 437–446.
B.T. Doshi and J.S. Kaufman, Sojourn time in an M/G/1 queue with Bernoulli feedback, Report A.T. & T. Bell Laboratories, Holmdel, N.J, 1987.
B. Fontana and C. Diaz Berzosa, M/G/1 queue withN-priorities and feedback: joint queue length distributions and response time distribution for any particular sequence,Teletraffic Issues in an Advanced Information Society, ITC-11, ed. M. Akiyama (North-Holland, Amsterdam, 1985) 452–458.
J.J. Hunter, Filtering of Markov renewal queues, I: Feedback queues, Adv. Appl. Prob. 15 (1983) 349–375.
J.J. Hunter, Filtering of Markov renewal queues, II: Birth-death queues, Adv. Appl. Prob. 15 (1983) 376–391.
J.J. Hunter, Filtering of Markov renewal queues, III: Semi-Markov processes embedded in feedback queues, Adv. Appl. Prob. 16 (1984) 422–436.
J.J. Hunter, Filtering of Markov renewal queues, IV: Flow process in feedback queues, Adv. Appl. Prob. 17 (1985) 386–407.
A.J. Lemoine, On sojourn time in Jackson networks of queues, J. Appl. Prob. 24 (1987) 495–510.
A. Montazer-Haghighi, Many server queueing systems with feedback, in:Proc. Eighth National Mathematics Conference, Arya-Mehr University of Technology, Tehran, Iran, 1977, 228–249.
M.F. Neuts,Matrix-geometric solutions in Stochastic Models (The Johns Hopkins University Press, Baltimore, 1981).
L. Takacs, A single server queue with feedback, Bell System Technical Journal 42 (1963) 505–519.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hunter, J.J. Sojourn time problems in feedback queues. Queueing Syst 5, 55–75 (1989). https://doi.org/10.1007/BF01149186
Issue Date:
DOI: https://doi.org/10.1007/BF01149186