SRPT applied to bandwidth-sharing networks
From MaRDI portal
Publication:839852
DOI10.1007/s10479-008-0427-xzbMath1169.90316OpenAlexW1986662958MaRDI QIDQ839852
Publication date: 3 September 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0427-x
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items
SCHEDULING IN A SINGLE-SERVER QUEUE WITH STATE-DEPENDENT SERVICE RATES ⋮ Instability of SRPT, SERPT and SJF multiclass queueing networks ⋮ Instability of LAS multiclass queueing networks ⋮ Continuity and monotonicity of solutions to a greedy maximization problem ⋮ Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion ⋮ Local edge minimality of SRPT networks with shared resources
Cites Work
- Unnamed Item
- Minimizing total flow time and total completion time with immediate dispatching
- Processor-sharing queues: Some progress in analysis
- Insensitive bandwidth sharing in data networks
- Bandwidth sharing and admission control for elastic traffic
- Structural properties of proportional fairness: stability and insensitivity
- Rearrangement, Majorization and Stochastic Scheduling
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Fluid Model for a Data Network with α -Fair Bandwidth Sharing and General Document Size Distributions: Two Examples of Stability
- Single Machine Scheduling Problem When the Machine Capacity Varies Stochastically
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Stability of data networks under an optimization-based bandwidth allocation
- Stability of Data Networks: Stationary and Bursty Models
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
