Stability of queueing networks

@article{Bramson2008StabilityOQ,
  title={Stability of queueing networks},
  author={Maury Bramson},
  journal={Probability Surveys},
  year={2008},
  volume={5},
  pages={169-345}
}
  • M. Bramson
  • Published 2008
  • Mathematics
  • Probability Surveys
Queueing networks constitute a large family of stochastic models, involving jobs that enter a network, compete for service, and eventually leave the network upon completion of service. Since the early 1990s, substantial attention has been devoted to the question of when such networks are stable. This monograph presents a summary of such work. Emphasis is placed on the use of fluid models in showing stability, and on examples of queueing networks that are unstable even when the arrival rate… Expand
Diffusion Parameters of Flows in Stable Queueing Networks
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitraryExpand
Stability of multi-class queueing networks with infinite virtual queues
TLDR
It is shown that re-entrant lines, systems of two re-ENTrant lines through two service stations, and rings of service stations can be stabilized with priority policies under certain parameter restrictions. Expand
Stability Analysis of Some Networks with Interacting Servers
TLDR
The fluid limit approach is applied to find stability conditions of two models of queueing networks with interacting servers in which customers that are awaiting service at any queue can move to the other station, whenever it is free, to be served there immediately. Expand
Stochastic Processing Networks
TLDR
Some of the highlights in the development of the theory of queueing prior to 1990 are summarized, which includes some exact analysis and development of approximate models for certain queueing networks. Expand
Stability and performance for multi-class queueing networks with infinite virtual queues
TLDR
It is shown that re-entrant lines, systems of two re-ENTrant lines through two service stations, and rings of service stations can be stabilized with priority policies under certain parameter restrictions. Expand
Pathwise stability of multiclass queueing networks
TLDR
It is proved that queueing systems operating under the Work-in-Progress-Dependent service policies are always stable if every physical station has sufficient capacity and a queueing network is pathwise stable if and only if the effective traffic intensity of every general server does not exceed one. Expand
Stability of join the shortest queue networks
Join the shortest queue (JSQ) refers to networks whose incoming jobs are assigned to the shortest queue from among a randomly chosen subset of the queues in the system. After completion of service atExpand
Stability of Parallel Server Systems
A parallel server system is a queueing system in which jobs are routed upon their arrivals to one of several buffers, each handled by a different server. The main operational and theoretical problemExpand
On the stability of queueing networks and fluid models
The stability of the Lu-Kumar queueing network is re-analyzed. It is shown that the associated fluid network is a hybrid dynamical system that has a succession of invariant subspaces leading toExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 110 REFERENCES
Stability of two families of queueing networks and a discussion of fluid limits
  • M. Bramson
  • Mathematics, Computer Science
  • Queueing Syst. Theory Appl.
  • 1998
TLDR
The stability of two families of queueing networks are investigated, one of which is related to the insertion of “leaky buckets” into the system, and the other generalizes networks considered by Humes. Expand
Convergence to equilibria for fluid models of FIFO queueing networks
  • M. Bramson
  • Computer Science
  • Queueing Syst. Theory Appl.
  • 1996
TLDR
A family of FIFO fluid models of Kelly type, where the discipline is first-in, first-out, and the service rate depends only on the station, are interested, and an entropy function associated with the state of the system is introduced. Expand
A Fluid-limit Model Criterion for Instability of Multiclass Queueing Networks
This paper studies the instability of multiclass queueing networks. We prove that if a uid limit model of the queueing network is weakly unstable, then the queueing network is unstable in the senseExpand
Stability and convergence of moments for multiclass queueing networks via fluid limit models
TLDR
This work provides a solid foundation for performance analysis either by analytical methods or by simulation of open multiclass queueing networks, which are common models of communication networks, and complex manufacturing systems such as wafer fabrication facilities. Expand
Fundamentals of Queueing Networks
In this chapter, we consider service models, where the service to be provided may be represented as a sequence of services provided by several servers. Such a service scenario may be convenientlyExpand
Instability in stochastic and fluid queueing networks
The fluid model has proven to be one of the most effective tools for the analysis of stochastic queueing networks, specifically for the analysis of stability. It is known that stability of a fluidExpand
Jobshop-Like Queueing Systems
TLDR
The equilibrium joint probability distribution of queue lengths is obtained for a broad class of jobshop-like "networks of waiting lines," where the mean arrival rate of customers depends almost arbitrarily upon the number already present, and the mean service rate at each service center depends almost arbitrary upon the queue length there. Expand
Fluid Approximations and Stability of Multiclass Queueing Networks: Work-Conserving Disciplines
This paper studies the uid approximation (also known as the functional strong law-of-large-numbers) and the stability (positive Harris recurrent) for a multiclass queueing network. Both of these areExpand
Stability and instability of a two-station queueing network
This article proves that the stability region of a two-station, five-class reentrant queueing network, operating under a nonpreemptive static buffer priority service policy, depends on theExpand
The stability of open queueing networks
Abstract The stability of open Jackson networks is established where service times are i.i.d. general distribution, exogeneous interarrival times are i.i.d. general distribution, and the routing isExpand
...
1
2
3
4
5
...