On the Output Rate of Overloaded Link Schedulers
Communications Letters, IEEE (2015)
摘要
We derive and compare properties of the output rates at overloaded links for three types of link scheduling algorithms: First-in-First-Out (FIFO), Static-Priority (SP), and Earliest-Deadline-First (EDF). Under most general assumptions, i.e., each traffic flow has a long-term average rate, we show that the output rates of flows at overloaded FIFO and EDF links are proportional to their input rates. As a consequence, the service rate guarantee offered by EDF and FIFO cannot exceed the guarantee given to a low-priority flow under SP scheduling.
更多查看译文
关键词
Scheduling algorithms,Delays,Scheduling,Aggregates,Bandwidth,Estimation,Internet
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要