On deciding stability of constrained random walks and queueing systems
ACM SIGMETRICS Performance Evaluation Review
Stability of a three-station fluid network
Queueing Systems: Theory and Applications
Stability of Fluid Networks with Proportional Routing
Queueing Systems: Theory and Applications
Weak instability in stochastic and fluid queueing networks
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
A Continuum Model for a Re-entrant Factory
Operations Research
Lyapunov method for the stability of fluid networks
Operations Research Letters
Stability analysis of N-model systems under a static priority rule
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
This paper studies the fluid models of two-station multiclass queueing networks with deterministic routing. A fluid model is globally stable if the fluid network eventually empties under each nonidling dispatch policy. We explicitly characterize the global stability region in terms of the arrival and service rates. We show that the global stability region is defined by the nominal workload conditions and the "virtual workload conditions," and we introduce two intuitively appealing phenomena--virtual stations and push starts--that explain the virtual workload conditions. When any of the workload conditions is violated, we construct a fluid solution that cycles to infinity, showing that the fluid network is unstable. When all the workload conditions are satisfied, we solve a network flow problem to find the coefficients of a piecewise linear Lyapunov function. The Lyapunov function decreases to zero, proving that the fluid level eventually reaches zero under any nonidling dispatch policy. Under certain assumptions on the inter arrival and service time distributions, a queueing network is stable or positive Harris recurrent if the corresponding fluid network is stable. Thus, the workload conditions are sufficient to ensure the global stability of two-station multiclass queueing networks with deterministic routing.