Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-11T07:35:10.392Z Has data issue: false hasContentIssue false
  • English
  • Français

Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu-Kumar network

Part of: Special processes Operations research and management science

Published online by Cambridge University Press:  14 July 2016

José Niño-Mora  and
Kevin D. Glazebrook
José Niño-Mora*
Affiliation:
Universitat Pompeu Fabra
Kevin D. Glazebrook*
Affiliation:
Newcastle University
*
∗Postal address: Department of Economics and Business, Universitat Pompeu Fabra, E-08005 Barcelona, Spain. Email address: jose.nino-mora@econ.upf.es
∗∗Postal address: Department of Statistics, Newcastle University, Newcastle upon Tyne NE1 7RU, UK. Email address: kevin.glazebrook@ncl.ac.uk
Get access Rights & Permissions [Opens in a new window]

Abstract

We argue the importance both of developing simple sufficient conditions for the stability of general multiclass queueing networks and also of assessing such conditions under a range of assumptions on the weight of the traffic flowing between service stations. To achieve the former, we review a peak-rate stability condition and extend its range of application and for the latter, we introduce a generalisation of the Lu–Kumar network on which the stability condition may be tested for a range of traffic configurations. The peak-rate condition is close to exact when the between-station traffic is light, but degrades as this traffic increases.

Keywords

Multiclass queueing networksstabilityfluid modelLu-Kumar network

MSC classification

Primary: 90B22: Queues and service
Secondary: 60K30: Applications (congestion, allocation, storage, traffic, etc.)
Type
Research Papers
Information
Journal of Applied Probability , Volume 37 , Issue 3 , September 2000 , pp. 890 - 899
Copyright
Copyright © Applied Probability Trust 2000 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bramson, M. (1994). Instability of FIFO queueing networks. Ann. Appl. Prob. 4, 414–431.Google Scholar
Dai, J. G. (1995). On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Prob. 5, 49–77.Google Scholar
Dai, J. G., and Weiss, G. (1996). Stability and instability of fluid models for reentrant lines. Math. Operat. Res. 21, 115–134.Google Scholar
Glazebrook, K. D. and Niüo-Mora, J. (1999). A linear programming approach to stability, optimization and performance analysis for Markovian multiclass queueing networks. Ann. Operat. Res. 92, 1–18. Spec. vol. Models and Algorithms for Planning and Scheduling Problems, eds C. A. Glass, C. N. Potts, V. A. Strusevich and R. R. Weber.Google Scholar
Kumar, P. R., and Meyn, S. P. (1995). Stability of queueing networks and scheduling policies. IEEE Trans. Automat. Control 40, 251–260.CrossRefGoogle Scholar
Kumar, P. R., and Meyn, S. P. (1996). Duality and linear programs for stability and performance analysis of queueing networks and scheduling policies. IEEE Trans. Automat. Control 41, 4–16.CrossRefGoogle Scholar
Lu, S. H., and Kumar, P. R. (1991). Distributed scheduling based on due dates and buffer priorities. IEEE Trans. Automat. Control 36, 1406–1416.CrossRefGoogle Scholar