| 一类基于调度表的公平轮循调度算法 |
| |
| 引用本文： | 涂晓东,李乐民. 一类基于调度表的公平轮循调度算法[J]. 电子学报, 2001, 29(9): 1290-1293 |
| |
| 作者姓名： | 涂晓东 李乐民 |
| |
| 作者单位： | 电子科技大学光纤通信国家重点实验室,四川成都 610054 |
| |
| 基金项目： | 信息产业部电子科学研究项目，深圳华为基金，国家自然科学基金（No.69882003），博士点专项科研基金（No.98061409） |
| |
| 摘 要： | 本文研究了一类利用时标在调度表中安排信元发送时隙的公平轮循(Fair Round Robin,FRR)调度算法.对其中三种算法的性能进行了分析比较.FRR能够保证连接的带宽和时延,同时实现复杂性低于一些分组公平排队算法,例如WF2Q+.
|
| 关 键 词： | 分组公平排队 基于调度表的轮循 公平轮循 整形的公平轮循 |
| 文章编号： | 0372-2112(2001)09-1290-04 |
| 收稿时间： | 2000-05-10 |
A Kind of Schedule Table Based Fair Round Robin Scheduling Algorithms |
| |
| TU Xiao-dong,Le-imn. A Kind of Schedule Table Based Fair Round Robin Scheduling Algorithms[J]. Acta Electronica Sinica, 2001, 29(9): 1290-1293 |
| |
| Authors: | TU Xiao-dong Le-imn |
| |
| Affiliation: | National Key Lab.of Fiber Communications,University of Electronic Science and Technology of China,Chengdu,Sichuan 610054,China |
| |
| Abstract: | A kind of fair round robin(FRR) scheduling algorithms ,which schedule the cell transmission slot m the schedule table by timestampe, are studied in this paper. The performance of three algorithms belonging to ERR are analyzed and compared. ERR can guarantee the bandwidth and delay of a connection , and the implementation complexity of ERR is lower than some of packet fair queuing(PFQ) algorithms,such as WF~2Q+. |
| |
| Keywords: | packet fair queuing schedule table based round robin fair round robin( ERR) shaped fair round mbin(ShFRR) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载全文 |
