Edge minimality of EDF resource sharing networks
From MaRDI portal
Publication:1683942
DOI10.1007/S00186-017-0598-9zbMath1386.60308OpenAlexW2636545658WikidataQ59610753 ScholiaQ59610753MaRDI QIDQ1683942
Publication date: 1 December 2017
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-017-0598-9
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Sample path properties (60G17) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)
Related Items (4)
Open Problem—Protocols for Resource-Sharing Networks with Locally Edge-Minimal Fluid Models ⋮ Continuity and monotonicity of solutions to a greedy maximization problem ⋮ Local edge minimality of SRPT networks with shared resources ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Minimality of EDF networks with resource sharing
- Heavy traffic analysis for EDF queues with reneging
- State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
- Convex comparison of service disciplines in real time queues
- Fluid limits for networks with bandwidth sharing and general document size distributions
- Bandwidth sharing and admission control for elastic traffic
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Heavy traffic limit for a processor sharing queue with soft deadlines
- Fluid models of integrated traffic and multipath routing
- Fluid Limits for Processor-Sharing Queues with Impatience
- Resource sharing networks: Overview and an open problem
- 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
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Stability of earliest-due-date, first-served queueing networks
This page was built for publication: Edge minimality of EDF resource sharing networks
