##
**Stabilizing priority fluid queueing network model.**
*(English)*
Zbl 1314.60150

Summary: The aim of this paper is to establish the stability of fluid queueing network models under priority service discipline. To this end, we introduce a priority fluid multiclass queueing network model, composed of \(N\) stations, \(N \geq 3\) and \(2N\) classes (2 classes at each station), where in the system, each station may serve more than one job class with differentiated service priority, and each job may require service sequentially by more than one service station. In this paper the fluid model approach is employed in the study of the stability.

### MSC:

60K25 | Queueing theory (aspects of probability theory) |

90B22 | Queues and service in operations research |

68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |

PDFBibTeX
XMLCite

\textit{A. A. Bouchentouf} and \textit{H. Sakhi}, Acta Univ. Sapientiae, Math. 6, No. 2, 146--161 (2014; Zbl 1314.60150)

Full Text:
DOI

### References:

[1] | M. Bramson, Stability of two families of queueing networks and a discus- sion of uid limits, Queueing Syst., 23 (1998), 7{31.;} · Zbl 0911.90163 |

[2] | H. Chen, Fluid approximations and stability of multiclass queueing net- works: Workconserving discipline, Ann. Appl. Probab., 5 (1995), 637{655.;} · Zbl 0847.60073 |

[3] | H. Chen, D. D. Yao, Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization, Springer-Verlag New York, Inc. (2001).; · Zbl 0992.60003 |

[4] | H. Chen, H. Q. Ye, Piecewise linear Lyapunov function for the stability of priority multiclass queueing networks, IEEE Trans. Automat. Control, 47 (4) (2002), 564{575.;} · Zbl 1364.93556 |

[5] | H. Chen, H. Zhang, Stability of multiclass queueing networks under pri- ority service disciplines, Oper. Res., 48 (2000), 26{37.;} · Zbl 1106.60312 |

[6] | J. G. Dai, On positive Harris recurrence of multiclass queueing networks: a uni_ed approach via uid models, Ann. Appl. Probab., 5 (1995), 49{77.;} · Zbl 0822.60083 |

[7] | J. G. Dai, A uid-limit model criterion for instability of multiclass queue- ing networks, Ann. Appl. Probab., 6 (1996), 751{757.;} · Zbl 0860.60075 |

[8] | J. G. Dai, S. P. Meyn, Stability and convergence of moments for multiclass queueing networks via uid models, IEEE Trans. Automat. Control, 40 (1995), 1899{1904.;} · Zbl 0836.90074 |

[9] | J. G. Dai, J. H. Vande Vate, Global Stability of Two-Station Queueing Networks. Proceedings of Workshop on Stochastic Networks: Stability and Rare Events, Editors: Paul Glasserman, Karl Sigman and David Yao, Springer-Verlag, Columbia University, New York., (1996), 1{26.;} · Zbl 0856.60093 |

[10] | H. Q. Ye, A paradox for admission control of multiclass queueing network with di_erentiated service, J. Appl. Probab., 44 (2) (2007), 321{331.;} · Zbl 1132.60323 |

[11] | P. R. Kumar, T. I. Seidman, Dynamic instabilities and stabilization meth- ods in distributed real-time scheduling of manufacturing systems, IEEE Trans. Automat. Control, 35 (1990), 289{298.;} · Zbl 0715.90062 |

[12] | S. Meyn, Transience of multiclass queueing networks via uid limit mod- els, Ann. Appl. Probab., 5 (1995), 946{957.;} · Zbl 0865.60079 |

[13] | A. Puhalskii, A. N. Rybko, Non-ergodicity of queueing networks under nonstability of their uid models, Probl. Inf. Transm., 36 (1) (2000), 26{48.;} · Zbl 0966.60095 |

[14] | A. N. Rybko, A. L. Stolyar, Ergodicity of stochastic processed describing the operations of open queueing networks, Problemy Peredachi Informat- sii, 28 (1992), 2{26.;} · Zbl 0768.60089 |

[15] | A. L. Stolyar, On the stability of multiclass queueing network: a relaxed su_cient condition via limiting uid processes, Markov Process. Related Fields, 1 (4) (1995), 491{512.;} · Zbl 0902.60079 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.