Skip to main content
Log in

A Simple proof for the stability of global FIFO queueing networks

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

We study the stability of multiclass queueing networks under the global FIFO (first in first out) service discipline, which was established by Bramson in 2001. For these networks, the service priority of a customer is determined by his entrance time. Using fluid models, we describe the entrance time of the most senior customer in the networks at time t, which is the key to simplify the proof for the stability of the global FIFO queueing networks.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bramson, M. Instability of FIFO queueing networks. Annals of Applied Probability, 4: 414–431 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bramson, M. Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Systems, 22: 5–45 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bramson, M. Convergence to equilibria for fluid models of head-of-the-line proportional process sharing queueing networks. Queueing Systems, 23: 1–26 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bramson, M. Stability of earlist-due-date, first-served queueing networks. Queueing Systems, 39: 79–102 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chen, H., Zhang, H. Stability of multiclass queueing networks under FIFO service discipline. Mathematics of Operations Research, 22: 691–725 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chen, H., Zhang, H. Stability of multiclass queueing networks under priority service disciplines. Operations Research, 48: 26–37 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dai, J.G. On the positive Harris recurrence for multiclass queueing networks. Annals of Applied Probability, 5: 49–77 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  8. Dai, J.G., Weiss, G. Stability and instability of fluid models for re-entrant lines. Mathematics of Operations Research, 21: 115–134 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lu, S.H., Kumar, P.R. Distributed sheduling based on due dates and buffer priorities. IEEE Trans. Autom. Control, 36: 1406–1416 (1991)

    Article  Google Scholar 

  10. Rybko, S., Stolyar, A. Ergodicity of stochastic processes that discribe the functioning of open queueing networks. Problem of Information Transmission, 28: 3–26 (1992) (in Russian)

    MathSciNet  Google Scholar 

  11. Seidman, T.I. First come, first served can be unstable! IEEE Trans. Automat. Control, 39: 2166–2171 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Stolyar, A. On the stability of multiclass queueing networks. In: Proc. 2nd Conf. on Telecommunication Systems-Modeling and Analysis, Nashiville, 1994, 1020–1028

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jian-kui Yang.

Additional information

Supported by the Research Grants Council of Hong Kong (RGC No. PolyU 5318/07E)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, Jk. A Simple proof for the stability of global FIFO queueing networks. Acta Math. Appl. Sin. Engl. Ser. 25, 647–654 (2009). https://doi.org/10.1007/s10255-009-8819-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-009-8819-5

Keywords

2000 MR Subject Classification

Navigation