Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
From MaRDI portal
Recommendations
- Optimal dynamic scheduling in Jackson networks
- Optimal multiplexing on a single link: delay and buffer requirements
- Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models
- Scheduling policies using marked/phantom slot algorithms
- Optimal anticipative scheduling with asynchronous transmission opportunities
Cited in
(14)- Sensitivity of constrained Markov decision processes
- Routing and buffer allocation models for a telecommunication system with heterogeneous devices
- Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space
- Constrained discounted stochastic games
- Protocol scheduling
- The resource scheduling in \(M_1+ M_2/M/N/k\) system by the ordinal optimization algorithm
- Optimal scheduling for constant-rate multi-mode systems
- A class of scheduling policies for mixed data with renewal arrival processes
- scientific article; zbMATH DE number 2135144 (Why is no real title available?)
- Solving convex optimization with side constraints in a multi-class queue by adaptive c rule
- Optimal anticipative scheduling with asynchronous transmission opportunities
- Allocation of interdependent resources for maximal throughput
- Analysis of a queueing system with a general service scheduling function, with applications to telecommunication network traffic control
- Saddle-point calculation for constrained finite Markov chains
This page was built for publication: Optimal scheduling of interactive and noninteractive traffic in telecommunication systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775304)
