Online time-constrained scheduling in linear and ring networks
From MaRDI portal
Publication:616984
Recommendations
- Online scheduling of packets with agreeable deadlines
- Time-constrained scheduling of weighted packets on trees and meshes
- Scheduling time-constrained communication in linear networks
- scientific article; zbMATH DE number 1754634
- Approximation algorithms for time-constrained scheduling on line networks
Cites work
- scientific article; zbMATH DE number 1003261 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
- Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
- Efficient On-Line Call Control Algorithms
- On the competitiveness of on-line real-time task scheduling
- On-line competitive algorithms for call admission in optical networks
- Scheduling time-constrained communication in linear networks
- Time-constrained scheduling of weighted packets on trees and meshes
Cited in
(8)- Scheduling weighted packets with deadlines over a fading channel
- scientific article; zbMATH DE number 2080979 (Why is no real title available?)
- Scheduling problems in transportation networks of line topology
- Scheduling time-constrained communication in linear networks
- scientific article; zbMATH DE number 1754634 (Why is no real title available?)
- Balanced scheduling toward loss-free packet queuing and delay fairness
- Approximation algorithms for time-constrained scheduling on line networks
- Time-constrained scheduling of weighted packets on trees and meshes
This page was built for publication: Online time-constrained scheduling in linear and ring networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616984)
