Loss ratio of the EDF scheduling policy with early discarding technique

Authors:
Sudipta Das;Lawrence Jenkins;Debasis Sengupta
Affiliations:
Electrical Engineering Department, Indian Institute of Science, Bengaluru, India;Electrical Engineering Department, Indian Institute of Science, Bengaluru, India;Applied Statistical Unit, Indian Statistical Institute, Kolkata, India
Venue:
Information Processing Letters
Year:
2013

Citing 4
Cited 0

Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue

Queueing Systems: Theory and Applications
Scheduling on-demand broadcast with timing constraints

Journal of Parallel and Distributed Computing
The M/G/1+G queue revisited

Queueing Systems: Theory and Applications
Improving delay characteristics of real-time flows by adaptive early packet discarding

ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper considers a firm real-time M/M/1 system, where jobs have stochastic deadlines till the end of service. A method for approximately specifying the loss ratio of the earliest-deadline-first scheduling policy along with exit control through the early discarding technique is presented. This approximation uses the arrival rate and the mean relative deadline, normalized with respect to the mean service time, for exponential and uniform distributions of relative deadlines. Simulations show that the maximum approximation error is less than 4% and 2% for the two distributions, respectively, for a wide range of arrival rates and mean relative deadlines.