下一代路由器的非优先级QoS保证

O. Salami, H. A. Chan, M. Dlodlo
{"title":"下一代路由器的非优先级QoS保证","authors":"O. Salami, H. A. Chan, M. Dlodlo","doi":"10.1109/AFRCON.2007.4401564","DOIUrl":null,"url":null,"abstract":"Virtual Output Queuing (VOQ) is a proffered queuing strategy that solves the head of line blocking (HoL) issue in routers implementing input queuing (IQ). Also, VOQ can achieve 100% throughput with an effective scheduler. However, most schedulers for VOQ are deterministic algorithms, which either provide QoS guarantee or do not. Even though these algorithms have high performance, they schedule packets arbitrarily or with priority thereby starving some traffic. These algorithms may become inadequate in future networks where data rate continues to increase and traffic with different QoS requirements co-exist. This paper recommends a probabilistic QoS guarantee for routers using VOQ. Probabilistic QoS guarantees for network traffic ensure fairness and prevent traffic starvation. A probabilistic scheduling algorithm termed Iterative Probabilistic Scheduling (IPS) is proposed. IPS guarantees probabilistic QoS with a basic mathematical operation as its scheduling policy. From simulation, it achieves a high throughput performance and does not starve traffic. IPS was used at the first stage of the Multi-stage Queuing and Scheduling (MQAS) architecture. MQAS is a two-stage queuing architecture with VOQ at the input and Output Queuing (OQ) at the output of the router.","PeriodicalId":112129,"journal":{"name":"AFRICON 2007","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Non-priority QoS guarantee for next generation routers\",\"authors\":\"O. Salami, H. A. Chan, M. Dlodlo\",\"doi\":\"10.1109/AFRCON.2007.4401564\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Virtual Output Queuing (VOQ) is a proffered queuing strategy that solves the head of line blocking (HoL) issue in routers implementing input queuing (IQ). Also, VOQ can achieve 100% throughput with an effective scheduler. However, most schedulers for VOQ are deterministic algorithms, which either provide QoS guarantee or do not. Even though these algorithms have high performance, they schedule packets arbitrarily or with priority thereby starving some traffic. These algorithms may become inadequate in future networks where data rate continues to increase and traffic with different QoS requirements co-exist. This paper recommends a probabilistic QoS guarantee for routers using VOQ. Probabilistic QoS guarantees for network traffic ensure fairness and prevent traffic starvation. A probabilistic scheduling algorithm termed Iterative Probabilistic Scheduling (IPS) is proposed. IPS guarantees probabilistic QoS with a basic mathematical operation as its scheduling policy. From simulation, it achieves a high throughput performance and does not starve traffic. IPS was used at the first stage of the Multi-stage Queuing and Scheduling (MQAS) architecture. MQAS is a two-stage queuing architecture with VOQ at the input and Output Queuing (OQ) at the output of the router.\",\"PeriodicalId\":112129,\"journal\":{\"name\":\"AFRICON 2007\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AFRICON 2007\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AFRCON.2007.4401564\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFRICON 2007","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AFRCON.2007.4401564","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

虚拟输出排队(VOQ)是一种解决路由输入排队(IQ)中排队阻塞(HoL)问题的排队策略。此外,VOQ可以通过有效的调度程序实现100%的吞吐量。然而,大多数VOQ调度程序都是确定性算法,它们要么提供QoS保证,要么不提供QoS保证。尽管这些算法具有很高的性能,但它们任意地或优先地调度数据包,从而使一些流量枯竭。在未来的网络中,随着数据速率的不断提高和不同QoS需求的流量共存,这些算法可能会变得不够用。本文提出了一种基于VOQ的路由器的概率QoS保证方法。网络流量的概率QoS保证保证了公平性,防止了流量饥饿。提出了一种概率调度算法——迭代概率调度算法。IPS以一种基本的数学运算作为调度策略来保证概率QoS。从仿真结果来看,它实现了高吞吐量性能,并且不会饿死流量。IPS用于多阶段队列和调度(MQAS)体系结构的第一阶段。MQAS是一种两阶段排队体系结构,其中VOQ位于路由器的输入端,OQ位于路由器的输出端。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Non-priority QoS guarantee for next generation routers
Virtual Output Queuing (VOQ) is a proffered queuing strategy that solves the head of line blocking (HoL) issue in routers implementing input queuing (IQ). Also, VOQ can achieve 100% throughput with an effective scheduler. However, most schedulers for VOQ are deterministic algorithms, which either provide QoS guarantee or do not. Even though these algorithms have high performance, they schedule packets arbitrarily or with priority thereby starving some traffic. These algorithms may become inadequate in future networks where data rate continues to increase and traffic with different QoS requirements co-exist. This paper recommends a probabilistic QoS guarantee for routers using VOQ. Probabilistic QoS guarantees for network traffic ensure fairness and prevent traffic starvation. A probabilistic scheduling algorithm termed Iterative Probabilistic Scheduling (IPS) is proposed. IPS guarantees probabilistic QoS with a basic mathematical operation as its scheduling policy. From simulation, it achieves a high throughput performance and does not starve traffic. IPS was used at the first stage of the Multi-stage Queuing and Scheduling (MQAS) architecture. MQAS is a two-stage queuing architecture with VOQ at the input and Output Queuing (OQ) at the output of the router.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信