Minimality of EDF networks with resource sharing

DOI10.1007/s00186-016-0543-3zbMath1353.60080WikidataQ59473700 ScholiaQ59473700MaRDI QIDQ343806

Łukasz Kruk

Publication date: 29 November 2016

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: http://link.springer.com/10.1007/s00186-016-0543-3

zbMATH Keywords

queueing; minimality; partial ordering; resource sharing

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

60G17: Sample path properties

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68M12: Network protocols

Related Items

Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks, Edge minimality of EDF resource sharing networks, Stability of linear EDF networks with resource sharing, Local edge minimality of SRPT networks with shared resources, Continuity and monotonicity of solutions to a greedy maximization problem

Cites Work

• Unnamed Item
• Heavy traffic analysis for EDF queues with reneging
• State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
• Fluid limits for networks with bandwidth sharing and general document size distributions
• Bandwidth sharing and admission control for elastic traffic
• Earliest-deadline-first service in heavy-traffic acyclic networks.
• An Open Queueing Network with Asymptotically Stable Fluid Model and Unconventional Heavy Traffic Behavior
• 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