Skip to main content
SpringerLink
Log in

On stationary tandem queueing networks with job feedback

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The class of tandem queueing networks with job feedback is studied under stationarity conditions on the arrival and service times sequences. Each job, after completing service in the last queue, is fed back (rerouted) to the first one, a random number of times, before leaving the system. The average execution time per job is exactly computed, as the number of jobs becomes large, and is minimized under mild conditions. The degree of parallelism achieved in the processing is also computed. The issue of rate-stability of the system is then considered. The network is defined to be rate-stable iff the job departure rate is equal to the job arrival rate; that depends heavily on the dynamic feedback policy we employ to place rerouted jobs in specific places of the front queue buffer of the network. The condition under which the network is rate-stable is specified, and a dynamic feedback policy is constructed, which rate-stabilizes the system under the maximum possible job arrival rate; thus, it maximizes the dynamic throughput of the network. Other related results concerning the performance of tandem networks with feedback are obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Baccelli and P. Bremaud, Palm probabilities and stationary queues,Lecture Notes in Statistics, Vol. 41 (Springer, Berlin, 1987).

    Google Scholar 

  2. N. Bambos, On closed ring queueing networks, J. Appl. Prob. 29 (1992) 979–995.

    Google Scholar 

  3. N. Bambos and J. Walrand, On the asymptotic execution time of multi-tasked processes on tandem processors, Syst. Control Lett. 13 (1989) 391–396.

    Google Scholar 

  4. N. Bambos and J. Walrand, Scheduling and stability aspects of a general class of parallel processing systems, to appear in Adv. Appl. Prob. (March 93).

  5. R. Bellman, A.O. Esogbue and I. Nabeshima, Mathematical aspects of scheduling theory and applications,Int. Series in Modern Applied Mathematics and Computer Science, Vol. 4 (Pergamon, New York, 1982).

    Google Scholar 

  6. A. Borovkov, Limit theorems for queueing networks I, Theory Prob Appl. 31 (1987) 413–427.

    Google Scholar 

  7. A. Borovkov, Limit theorems for queueing networks II, Theory Prob. Appl. 32 (1988) 257–272.

    Google Scholar 

  8. J. Brandon and U. Yechiali, A tandem Jackson network with feedback to the first node, Queueing Systems 9 (1991) 337–352.

    Google Scholar 

  9. A. Brandt, P. Franken and B. Lisek,Stationary Stochastic Models (Wiley, New York, 1990).

    Google Scholar 

  10. J.F.C. Kingman, The ergodic theory of subadditive stochastic processes, J. R. Stat. Soc. Ser. B30 (1968) 499–510.

    Google Scholar 

  11. J.F.C. Kingman, Subadditive ergodic theory, The Ann. Prob. 1 (1973) 883–909.

    Google Scholar 

  12. D. Koenig and V. Schmidt, Limit theorems for single-server feedback queues controlled by a general class of marked point processes, Theory Prob. Appl. 30 (1986) 712–719.

    Google Scholar 

  13. P.R. Kumar and T.I. Seidman, Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems, IEEE Trans. Automatic Control. 35 (1990) 289–298.

    Google Scholar 

  14. R.M. Loynes, The stability of a queue with non-independent inter-arrival and service times, Proc. Cambridge Philos. Soc. 58 (1962) 497–520.

    Google Scholar 

  15. S.H. Lu and P.R. Kumar, Distributed scheduling based on due dates and buffer priorities, to appear in IEEE Trans. Automatic Control.

  16. J.R. Perkins and P.R. Kumar, Stable distributed real-time scheduling of flexible manufacturing/assembly/disassembly systems, IEEE Trans. Automatic Control. 34 (1989) 139–148.

    Google Scholar 

  17. A.N. Shiryayev, Probability (Springer, New York, 1984).

    Google Scholar 

  18. K. Sigman, Notes on the stability of closed queueing networks, J. Appl. Prob. 26 (1989) 678–682.

    Google Scholar 

  19. K. Sigman, The stability of open queueing networks, Stoch. Proc. Appl. 35 (1990) 11–25.

    Google Scholar 

  20. J. Walrand,An Introduction to Queueing Networks (Prentice-Hall, Englewood Cliffs, NJ, 1988).

    Google Scholar 

  21. P. Walters,An Introduction to Ergodic Theory (Springer, New York, 1982).

    Google Scholar 

  22. M.A. Wortman, R.L. Disney and P.C. Kiessler, TheM/GI/1 Bernoulli feedback queue with vacations, Queueing Systems 9 (1991) 353–364.

    Google Scholar 

  23. W. Whitt, Large fluctuations in a deterministic multiclass network of queues, to appear in Management Sci.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of California at Los Angeles, 90024, Los Angeles, CA, USA

    Nicholas Bambos & Kimberly Wasserman

Authors
  1. Nicholas Bambos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kimberly Wasserman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by grants NSF-DDM-RIA-9010778, NSF-NCR-9116268, NSF-NCR-NYI-9258 507, by an AT&T Foundation grant and a GTE Fellowship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bambos, N., Wasserman, K. On stationary tandem queueing networks with job feedback. Queueing Syst 15, 137–164 (1994). https://doi.org/10.1007/BF01189235

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01189235

Keywords

Search

Navigation