低时延、有QoS保证的输入队列调度算法

Jinhui Li, N. Ansari
{"title":"低时延、有QoS保证的输入队列调度算法","authors":"Jinhui Li, N. Ansari","doi":"10.1109/HPSR.2001.923671","DOIUrl":null,"url":null,"abstract":"The enhanced Birkhoff-von Neumann decomposition (EBVND) algorithm, a new class-of scheduling algorithms for input queued (IQ) switches, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkhoff-von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Wave front Birkhoff-von Neumann decomposition (WFBVND) algorithm and its simplified version WFBVND with logN iterations (WFBVND-logN), the special cases of EBVND, are also introduced and evaluated. Simulations show that WFBVND and WFBVND-logN have much lower average cell delay as compared to the Birkhoff-von Neumann decomposition algorithm.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"36 12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"QoS guaranteed input queued scheduling algorithms with low delay\",\"authors\":\"Jinhui Li, N. Ansari\",\"doi\":\"10.1109/HPSR.2001.923671\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The enhanced Birkhoff-von Neumann decomposition (EBVND) algorithm, a new class-of scheduling algorithms for input queued (IQ) switches, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkhoff-von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Wave front Birkhoff-von Neumann decomposition (WFBVND) algorithm and its simplified version WFBVND with logN iterations (WFBVND-logN), the special cases of EBVND, are also introduced and evaluated. Simulations show that WFBVND and WFBVND-logN have much lower average cell delay as compared to the Birkhoff-von Neumann decomposition algorithm.\",\"PeriodicalId\":308964,\"journal\":{\"name\":\"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)\",\"volume\":\"36 12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2001.923671\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2001.923671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

介绍了一种新的输入队列交换机调度算法——增强Birkhoff-von Neumann分解(EBVND)算法。理论分析表明,EBVND在吞吐量和单元延迟方面优于Birkhoff-von Neumann分解算法,并能提供速率和单元延迟保证。介绍了波前Birkhoff-von Neumann分解(WFBVND)算法及其logN次迭代的简化版WFBVND算法(WFBVND-logN),并对其进行了评价。仿真结果表明,与Birkhoff-von Neumann分解算法相比,WFBVND和WFBVND- logn算法具有更低的平均单元延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
QoS guaranteed input queued scheduling algorithms with low delay
The enhanced Birkhoff-von Neumann decomposition (EBVND) algorithm, a new class-of scheduling algorithms for input queued (IQ) switches, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkhoff-von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Wave front Birkhoff-von Neumann decomposition (WFBVND) algorithm and its simplified version WFBVND with logN iterations (WFBVND-logN), the special cases of EBVND, are also introduced and evaluated. Simulations show that WFBVND and WFBVND-logN have much lower average cell delay as compared to the Birkhoff-von Neumann decomposition algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信