.png){kind=icon}
Return
A statistical framework for EDF scheduling
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2003.817320.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
deadline violation probability
dominant time scale
earliest deadline first (EDF)
quality-of-service (QoS)
statistical scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveA measurement-analytic approach for QoS estimation in a network based on the dominant time scale
PREAI
ShareSaveConnecting Digitalization and Sustainability: Proptech in the Real Estate Operations and Management
OAAI
OAAIShareSave no more
no more