State space collapse for queueing networks
Let \(Z(t)\) be the \(K\)-vector of numbers of customers at time \(t\) in a queueing network with \(J\) stations and \(K\) customer classes and \(W(t)\) the \(J\)-vector of workloads at the \(J\) stations. Typically, \(K\) is much smaller than \(J\), and state space collapse means that \(Z(\cdot)\) can be approximated by \(\Delta W(\cdot)\) where \(\Delta\) is a linear map from \(R^J\) to \(R^K\). This paper is a survey of how state space collapse can be obtained from fluid limits of the network, with particular emphasis on multiplicative state space collapse (meaning that \(Z(\cdot)-\Delta W(\cdot)\) can be bounded by \(\|W(\cdot)\|\)) and heavy traffic limit theory (convergence to multidimensional reflected Brownian motion in an orthant).
- Reflecting diffusions and queueing networks
- State space collapse with application to heavy traffic limits for multiclass queueing networks
- State space collapse for multi-class queueing networks under SBP service policies
- State space collapse in many-server diffusion limits of parallel server systems
- scientific article; zbMATH DE number 3868389 (Why is no real title available?)
- State-space collapse in stationarity and its application to a multiclass single-server queue in heavy traffic
- State space collapse and stability of queueing networks
- Diffusion approximations for multiclass queueing networks under preemptive priority service discipline
- State space collapse for asymptotically critical multi-class fluid networks
- Approximate solution for two stage open networks with Markov-modulated queues minimizing the state space explosion problem
This page was built for publication: State space collapse for queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126814)
