Statistical admission control for real-time services under earliest deadline first scheduling

DOI10.1016/J.COMNET.2004.10.017zbMATH Open1101.68351OpenAlexW2079893190MaRDI QIDQ2484967FDOQ2484967

Authors: Zhi Quan, Jong-Moon Chung 

Publication date: 3 August 2005

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2004.10.017

Recommendations

• Optimal admission control of discrete event systems with real-time constraints
• Rate Admission Control for Hard Real-Time Task Scheduling
• Real-time queueing theory: A tutorial presentation with an admission control application
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• Scheduling for flow-time with admission control
• Dynamic Admission Quota Control With Controllable and Uncontrollable Demands and Random Service Time

zbMATH Keywords

Call admission controlEarliest deadline firstDeadline violation probabilityDominant time scaleQuality-of-service

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Cited In (8)

• Statistical analysis of delay bound violations at an earliest deadline first (EDF) scheduler
• Title not available (Why is that?)
• Adaptive control of cluster-based Web systems using neuro-fuzzy models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Concave piecewise linear service curves and deadline calculations
• Real-time queueing theory: A tutorial presentation with an admission control application

This page was built for publication: Statistical admission control for real-time services under earliest deadline first scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484967)