Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
From MaRDI portal
Combinatorial probability (60C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Communication networks in operations research (90B18)
Recommendations
- ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM
- Stability of data networks under an optimization-based bandwidth allocation
- Stability and probability. I: Convergence for queueing networks via Lyapunov optimization
- Uniform packing dimension results for multiparameter stable processes
- Band-Limited Stochastic Processes in Discrete and Continuous Time
- From local to global stability in stochastic processing networks through quadratic Lyapunov functions
- scientific article; zbMATH DE number 1278394
- scientific article; zbMATH DE number 1936532
Cited in
(7)- Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
- A service system with packing constraints: greedy randomized algorithm achieving sublinear in scale optimality gap
- Interior-point-based online stochastic bin packing
- Stability of a Markov-modulated Markov chain, with application to a wireless network governed by two protocols
- Analysis of Stochastic Online Bin Packing Processes
- Bin Packing with Queues
This page was built for publication: Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1771277)
