Stability of linear EDF networks with resource sharing
From MaRDI portal
Publication:1698771
DOI10.1007/s11134-017-9553-yzbMath1390.60328MaRDI QIDQ1698771
Publication date: 16 February 2018
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-017-9553-y
90B18: Communication networks in operations research
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
90B36: Stochastic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)
Related Items
Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks, Instability of SRPT, SERPT and SJF multiclass queueing networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimality of EDF networks with resource sharing
- Heavy traffic analysis for EDF queues with reneging
- Accuracy of state space collapse for earliest-deadline-first queues
- Convex comparison of service disciplines in real time queues
- Fluid limits for networks with bandwidth sharing and general document size distributions
- State-dependent criteria for convergence of Markov chains
- A Skorokhod map on measure-valued paths with applications to priority queues
- Bandwidth sharing and admission control for elastic traffic
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Earliest-deadline-first service in heavy-traffic acyclic networks.
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- An explicit formula for the Skorokhod map on \([0,a\)]
- Structural properties of proportional fairness: stability and insensitivity
- Stochastic-Process Limits
- An Open Queueing Network with Asymptotically Stable Fluid Model and Unconventional Heavy Traffic Behavior
- Stability and structural properties of stochastic storage networks
- Fluid Limits for Shortest Remaining Processing Time Queues
- Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
- Fluid Model for a Data Network with α -Fair Bandwidth Sharing and General Document Size Distributions: Two Examples of Stability
- Resource sharing networks: Overview and an open problem
- Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Stability of earliest-due-date, first-served queueing networks
