Scheduling and congestion control for wireless and processing networks
From MaRDI portal
Publication:2841508
Recommendations
- Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
- Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
- Randomized scheduling algorithm for queueing networks
- Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
Cited in
(12)- New directions in learning and control of stochastic networks
- Model-based network scheduling and control for systems over the IEEE 802.15.4 network
- Communication contention in APN list scheduling algorithm
- Stability and delay of distributed scheduling algorithms for networks of conflicting queues
- Universal stability in multi-hop radio networks
- The SIS and SIR stochastic epidemic models: a maximum entropy approach
- Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
- Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
- Stability and Instability of the MaxWeight Policy
- Markets for public decision-making
- Synchronous resource allocation: modeling, capacity, and optimization
- Scheduling for real/non-real time traffic in wireless packet networks
This page was built for publication: Scheduling and congestion control for wireless and processing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841508)