Skip to main content
Log in

Pathwise stability of multiclass queueing networks

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

It has been shown that, under some service policies, a queueing network can be unstable even if the load of every station is less than one. Although the stability of queueing systems in some special cases (e.g. under First-Buffer-First-Served policy) has been well addressed, there are still difficulties in coping with more general networks. In this paper, we study the stability problem through depicting the mutual blocking effect among different classes and generalize the concept of servers in the context of queueing networks based on the sample path analysis. We show that the general servers have similar impacts on the system stability as physical stations and a queueing network is pathwise stable if and only if the effective traffic intensity of every general server does not exceed one. Through case studies, we show that the stability of queueing networks and the structure of general servers are sensitive and depend on various factors, including the service policies. Furthermore, we prove that queueing systems operating under the Work-in-Progress-Dependent service policies are always stable if every physical station has sufficient capacity.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig.12

Similar content being viewed by others

References

  • Altman, E., Foss, S., Riehl, E. and Stidham, S. (1993) Performance bounds and pathwise stability for generalized vacation and polling systems, technical report UNC/OR TR93–8, Department of Operations Research, University of North Carolina at Chapel Hill

  • Avrachenkov K, Morozov E, Steyaert B (2016) Sufficient stability conditions for multi-class constant retrial rate systems. Queueing systems 82:149–171

    Article  MathSciNet  Google Scholar 

  • Banks J, Dai J (1997) Simulation studies of multiclass queueing networks. IIE Trans 29:213–219

    Google Scholar 

  • Bramson, M. (1994) Instability of FIFO queueing networks with quick service times. Ann Appl Prob 693–718

  • Bramson M (2008) Stability of queueing networks, Springer

  • Bramson M (1999) A stable queueing network with unstable fluid model. Ann Appl Probab 818–853

  • Chen H (1995) Fluid approximations and stability of multiclass queueing networks: work-conserving disciplines. Ann Appl Probab 637–665

  • Dai, J. (2009) Fluid models and stability of multiclass queueing networks

  • Dai J, Hasenbein JJ, Vande Vate J (1999) Stability of a three-station fluid network. Queueing Systems 33:293–325

    Article  MathSciNet  Google Scholar 

  • Dai J, Hasenbein JJ, Vande Vate JH (2004) Stability and instability of a two-station queueing network. Ann Appl Probab 326–377

  • Dai J, Lin W (2005) Maximum pressure policies in stochastic processing networks. Oper Res 53:197–218

    Article  MathSciNet  Google Scholar 

  • Dai J, Vande Vate J (2000) The stability of two-station multitype fluid networks. Oper Res 48:721–744

    Article  MathSciNet  Google Scholar 

  • Dai J, Vande Vate JH (1996) Global stability of two-station queueing networks, in stochastic networks, Springer pp 1–26

  • Dai JG (1995) On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann Appl Probab 49–77

  • Dai JG, Weiss G (1996) Stability and instability of fluid models for reentrant lines. Math Oper Res 21:115–134

    Article  MathSciNet  Google Scholar 

  • Down D, Meyn S (1994) A survey of Markovian methods for stability of networks, in 11th international conference on analysis and optimization of systems discrete event systems, springer pp 490–504

  • Dumas V (1997) A multiclass network with non-linear, non-convex, non-monotonic stability conditions. Queueing systems 25:1–43

    Article  MathSciNet  Google Scholar 

  • El-Taha M, Stidham S (1992) Deterministic analysis of queueing systems with heterogeneous servers. Theor Comput Sci 106:243–264

    Article  MathSciNet  Google Scholar 

  • El-Taha M, Stidham S (2012) Sample-path analysis of queueing systems, Springer Science & Business Media

  • El-Taha M, Stidham S (1993) Sample-path analysis of stochastic discrete-event systems. Discrete Event Dynamic Systems 3:325–346

    Article  Google Scholar 

  • Erlang AK (1909) The theory of probabilities and telephone conversations. Nyt Tidsskrift for Matematik B 20:16

    Google Scholar 

  • Hasenbein, J.J. (1997) Necessary conditions for global stability of multiclass queueing networks. Oper Res Lett,21, 87–94

  • Hirsch MW, Smale S, Devaney RL (2012) Differential equations, dynamical systems, and an introduction to chaos. Academic Press

  • Kelly FP (1975) Networks of queues with customers of different types. J Appl Probab 12:542–554

    Article  MathSciNet  Google Scholar 

  • Khalid R, Nawawi MKM, Kawsar LA, Ghani NA, Kamil AA, Mustafa A (2016) The evaluation of pedestrians’ behavior using M/G/C/C analytical, weighted distance and real distance simulation models. Discrete Event Dynamic Systems 26:439–476

    Article  MathSciNet  Google Scholar 

  • Kim J, Kim B (2016) A survey of retrial queueing systems. Ann Oper Res 247:3–36

    Article  MathSciNet  Google Scholar 

  • Kumar P (1993) Re-entrant lines. Queueing systems 13:87–110

    Article  MathSciNet  Google Scholar 

  • Kumar P, Meyn SP (1995) Stability of queueing networks and scheduling policies. IEEE Trans Autom Control 40:251–260

    Article  MathSciNet  Google Scholar 

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

  • Leahu H, Mandjes M, Oprescu A-M (2017) A numerical approach to stability of multiclass queueing networks. IEEE Trans Autom Control 62:5478–5484

    Article  MathSciNet  Google Scholar 

  • Lu SH, Kumar P (1991) Distributed scheduling based on due dates and buffer priorities. Automatic Control, IEEE Transactions 36:1406–1416

    Article  Google Scholar 

  • Maglaras C (1999) Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies. Queueing systems 31:171–206

    Article  MathSciNet  Google Scholar 

  • Meyn SP (1995) Transience of multiclass queueing networks via fluid limit models. Ann Appl Probab 946–957

  • Pedarsani, R. and Walrand, J. (2016) Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling. J Appl Probab,53, 421–433

  • Royden HL, Fitzpatrick P (1988) Real analysis, Macmillan New York

  • Rybko AN, Stolyar AL (1992) Ergodicity of stochastic processes describing the operation of open queueing networks. Problemy Peredachi Informatsii 28:3–26

    MATH  Google Scholar 

  • Seidman TI (1994) 'First come, first served'can be unstable! IEEE Trans Autom Control 39:2166–2171

    Article  MathSciNet  Google Scholar 

  • Shen Y, Wu K (2018) Stability of a GI/G/1 queue: a survey. Asia-Pacific J Oper Res 1850015

  • Wu K (2014) Classification of queueing models for a workstation with interruptions: a review. Int J Prod Res 52:902–917

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yichi Shen.

Electronic supplementary material

ESM 1

(PDF 150 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, K., Shen, Y. Pathwise stability of multiclass queueing networks. Discrete Event Dyn Syst 31, 5–23 (2021). https://doi.org/10.1007/s10626-020-00321-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-020-00321-1

Keywords

Navigation