Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
From MaRDI portal
Publication:3775304
DOI10.1109/9.403zbMath0635.90035OpenAlexW2005171089MaRDI QIDQ3775304
Publication date: 1988
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.403
aggregationdecompositionSensitivitybuffertelecommunication systemsshared resourceHeterogeneous traffic typesinteractive and noninteractive trafficoptimal scheduling policy
Related Items (5)
Constrained discounted stochastic games ⋮ Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule ⋮ Sensitivity of constrained Markov decision processes ⋮ Saddle-point calculation for constrained finite Markov chains ⋮ Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space
This page was built for publication: Optimal scheduling of interactive and noninteractive traffic in telecommunication systems