On the flow fairness of aggregate queues

Addisu Eshete, Yuming Jiang
{"title":"On the flow fairness of aggregate queues","authors":"Addisu Eshete, Yuming Jiang","doi":"10.1109/BCFIC-RIGA.2011.5733222","DOIUrl":null,"url":null,"abstract":"This paper presents S-SFQ which is a single queue design and implementation of the well-known Start-time Fair Queueing (SFQ). This aggregate queue orders packets based on their timestamps rather than order of arrivals. Through simulation, we show the performance gains of S-SFQ over other default single-queue schemes such as RED and FIFO in terms of link utilization and flow fairness. When sources implement end-to-end (e2e) congestion control, S-SFQ can fairly approximate the fairness, both simple and weighted, of per flow queues. In addition, we discuss in detail the adverse effect of packet loss synchronization problem common in such aggregate queues. The qualities of aggregate queue based router scheme may easily and single-handedly be taken away by this problem. Loss synchronization may surface during overloaded (rather than early) drops when the buffer becomes full (e.g., FIFO) or certain (upper) buffer thresholds are exceeded (e.g., RED).","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Baltic Congress on Future Internet and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733222","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

This paper presents S-SFQ which is a single queue design and implementation of the well-known Start-time Fair Queueing (SFQ). This aggregate queue orders packets based on their timestamps rather than order of arrivals. Through simulation, we show the performance gains of S-SFQ over other default single-queue schemes such as RED and FIFO in terms of link utilization and flow fairness. When sources implement end-to-end (e2e) congestion control, S-SFQ can fairly approximate the fairness, both simple and weighted, of per flow queues. In addition, we discuss in detail the adverse effect of packet loss synchronization problem common in such aggregate queues. The qualities of aggregate queue based router scheme may easily and single-handedly be taken away by this problem. Loss synchronization may surface during overloaded (rather than early) drops when the buffer becomes full (e.g., FIFO) or certain (upper) buffer thresholds are exceeded (e.g., RED).
关于聚合队列的流公平性
本文提出了S-SFQ,它是一种单队列设计,实现了著名的起始时间公平队列(SFQ)。此聚合队列根据数据包的时间戳而不是到达的顺序对数据包进行排序。通过仿真,我们展示了S-SFQ在链路利用率和流公平性方面优于其他默认单队列方案(如RED和FIFO)的性能增益。当源实现端到端(e2e)拥塞控制时,S-SFQ可以相当接近每个流队列的简单和加权公平性。此外,我们还详细讨论了这种聚合队列中常见的丢包同步问题的不利影响。这个问题很容易使基于聚合队列的路由器方案的性能受到影响。丢失同步可能在过载(而不是早期)下降期间出现,当缓冲区变满时(例如,FIFO)或超过某些(上)缓冲区阈值(例如,RED)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信