Abstract
AnN-node tandem queueing network with Bernoulli feedback to the end of the queue of thefirst node is considered. We first revisit the single-nodeM/G/1 queue with Bernoulli feedback, and derive a formula forEL(n), the expected queue length seen by a customer at his nth feedback. We show that, asn becomes large,EL(n) tends to ρ/(l ρ), ρ being the effective traffic intensity. We then treat the entire queueing network and calculate the mean value ofS, the total sojourn time of a customer in theN-node system. Based on these results we study the problem ofoptimally ordering the nodes so as to minimize ES. We show that this is a special case of a general sequencing problem and derive sufficient conditions for an optimal ordering. A few extensions of the serial queueing model are also analyzed. We conclude with an appendix in which we derive an explicit formula for the correlation coefficient between the number of customers seen by an arbitrary arrival to anM/G/1 queue, and the number of customers he leaves behind him upon departure. For theM/M/1 queue this coefficient simply equals the traffic intensity ρ.
Similar content being viewed by others
References
J.L. van den Berg and O.J. Boxma, Sojourn times in feedback queues, in:Operations Research Proceedings 1988, eds. D. Pressmar et al. (Springer, Berlin, 1989) pp. 247–257.
J.L. van den Berg and O.J. Boxma, Sojourn times in feedback and processor sharing queues, in:Proc. 12th Int. Teletraffic Congress 1988, ed. M. Bonatti (North-Holland, Amsterdam, 1989) pp. 1467–1475.
J.L. van den Berg and O.J. Boxma, TheM/G/1 queue with processor sharing and its relation to a feedback queue, this issue.
J.L. van den Berg, O.J. Boxma and W.P. Groenendijk, Sojourn times in theM/G/1 queue with deterministic feedback, Commun. Statist. Stochastic Models 5 (1989) 115–129.
O.J. Boxma and J.W. Cohen, TheM/G/1 queue with permanent customers, IEEE J. Sel. Areas Commun. (1991).
R.L. Disney, D. König 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 anM/G/1 queue with Bernoulli feedback, in:Queueing Theory and its Applications (Liber Amicorum for J.W. Cohen), eds. O.J. Boxma and R. Syski (North-Holland, Amsterdam, 1988) pp. 207–233.
E. Gelenbe and I. Mitrani,Analysis and Synthesis of Computer Systems (Academic Press, New York, 1980).
O. Kella and U. Yechiali, Priorities inM/G/1 queue with server vacations, Nav. Res. Log. 35 (1988) 23–34.
L. Kleinrock,Queueing Systems, vol. 1 (Wiley, New York, 1975).
A. Mandelbaum and U. Yechiali, The conditional residual service time in the M/G/1 queue, Technical Report, Dept. of Statistics, Tel-Aviv University (1979) unpublished.
L. Takács, A single-server queue with feedback, Bell Sys. Tech. J. 42 (1963) 505–519.
U. Yechiali, Sequencing anN-stage process with feedback, Prob. Eng. Infor. Sci. 2 (1988) 263–265.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brandon, J., Yechiali, U. A tandem Jackson network with feedback to the first node. Queueing Syst 9, 337–351 (1991). https://doi.org/10.1007/BF01159221
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01159221