Earliest deadline first (EDF) has become one of the most promising scheduling schemes for providing quality-of-service differentiation over high speed networks. In this letter, we study the deadline violation (loss) probability at an EDF scheduling switch. An analytical framework has been developed for estimating the loss probabilities for the aggregated traffic and the individual flows. This enables us to determine whether a given flow can meet its deadline with the required loss probability. As illustrated from the simulation results using real network traffic, the asymptotic approximations presented are accurate enough to predict the real metrics.
Bibliographical noteFunding Information:
Manuscript received March 7, 2003. The associate editor coordinating the review of this letter and approving it for publication was Dr. N. A. Nilolaou. This work was supported by the Advanced Networking Research Program of the Oklahoma State University, Stillwater, OK.
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering