HLS: A Packet Scheduler for Hierarchical Fairness

Natchanon Luangsomboon, J. Liebeherr
{"title":"HLS: A Packet Scheduler for Hierarchical Fairness","authors":"Natchanon Luangsomboon, J. Liebeherr","doi":"10.1109/ICNP52444.2021.9651972","DOIUrl":null,"url":null,"abstract":"Hierarchical link sharing addresses the demand for fine-grain traffic control at multiple levels of aggregation. At present, packet schedulers that can support hierarchical link sharing are not suitable for an implementation at line rates, whereas deployed schedulers perform poorly at distributing excess capacity to classes that need additional bandwidth. We present HLS, a packet scheduler that ensures a hierarchical max-min fair allocation of the link bandwidth. HLS supports minimum rate guarantees and isolation between classes. Since it is realized as a non-hierarchical round-robin scheduler, it is suitable to operate at high rates. We implement HLS in the Linux kernel and evaluate it with respect to achieved rate allocations and overhead. We compare the results with those obtained for CBQ and HTB, the existing scheduling algorithms in Linux for hierarchical link sharing. We show that the overhead of HLS is comparable to that of other classful packet schedulers.","PeriodicalId":343813,"journal":{"name":"2021 IEEE 29th International Conference on Network Protocols (ICNP)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 29th International Conference on Network Protocols (ICNP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP52444.2021.9651972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Hierarchical link sharing addresses the demand for fine-grain traffic control at multiple levels of aggregation. At present, packet schedulers that can support hierarchical link sharing are not suitable for an implementation at line rates, whereas deployed schedulers perform poorly at distributing excess capacity to classes that need additional bandwidth. We present HLS, a packet scheduler that ensures a hierarchical max-min fair allocation of the link bandwidth. HLS supports minimum rate guarantees and isolation between classes. Since it is realized as a non-hierarchical round-robin scheduler, it is suitable to operate at high rates. We implement HLS in the Linux kernel and evaluate it with respect to achieved rate allocations and overhead. We compare the results with those obtained for CBQ and HTB, the existing scheduling algorithms in Linux for hierarchical link sharing. We show that the overhead of HLS is comparable to that of other classful packet schedulers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
HLS:一个分层公平性的数据包调度程序
分层链路共享解决了多级聚合的细粒度流量控制需求。目前,可以支持分层链路共享的包调度器不适合以线路速率实现,而部署的调度器在将多余容量分配给需要额外带宽的类时表现不佳。我们提出了HLS,一个数据包调度程序,确保分层最大最小公平分配链路带宽。HLS支持最小速率保证和类之间的隔离。由于它是作为非分层轮询调度程序实现的,因此适合以高速率运行。我们在Linux内核中实现HLS,并根据实现的速率分配和开销对其进行评估。我们将结果与Linux下现有的分层链路共享调度算法CBQ和HTB进行了比较。我们展示了HLS的开销与其他类包调度器的开销相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Exploiting WiFi AP for Simultaneous Data Dissemination among WiFi and ZigBee Devices Highway On-Ramp Merging for Mixed Traffic: Recent Advances and Future Trends Generalizable and Interpretable Deep Learning for Network Congestion Prediction DNSonChain: Delegating Privacy-Preserved DNS Resolution to Blockchain ISP Self-Operated BGP Anomaly Detection Based on Weakly Supervised Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1