Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
From MaRDI portal
Publication:1771277
DOI10.1023/B:QUES.0000046581.34849.CFzbMath1125.60315MaRDI QIDQ1771277
Publication date: 7 April 2005
Published in: Queueing Systems (Search for Journal in Brave)
Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Combinatorial probability (60C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (7)
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 ⋮ Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints ⋮ Analysis of Stochastic Online Bin Packing Processes ⋮ Stability of a Markov-modulated Markov Chain, with application to a wireless network governed by two protocols ⋮ Bin Packing with Queues
This page was built for publication: Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
