Perfect is the Enemy of Good: Lloyd-Max Quantization for Rate Allocation in Congestion Control Plane

Shiva Ketabi, Y. Ganjali
{"title":"Perfect is the Enemy of Good: Lloyd-Max Quantization for Rate Allocation in Congestion Control Plane","authors":"Shiva Ketabi, Y. Ganjali","doi":"10.1109/ANCS.2019.8901887","DOIUrl":null,"url":null,"abstract":"Decoupling congestion control plane from datapath expedites the development of new congestion control solutions and creates opportunities for explicit rate allocation schemes. However, dealing with large numbers of flows remains a major challenge. Max-min fairness - the gold standard for rate allocation - has a running complexity proportional to the number of flows, which might be prohibitive in large-scale networks. To accelerate explicit rate allocation, we suggest using rate quantization, i.e. mapping the continuous range of flow rates to a small number of bins. We use Lloyd-max, a quantization method that generates bins according to the distribution of flow rates, to dynamically adjust the quantization bins over time. Our experimental evaluation shows that the distortion caused by this quantization scheme is small, while reducing the max-min rate allocation running time by 60 − 90%.","PeriodicalId":405320,"journal":{"name":"2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANCS.2019.8901887","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Decoupling congestion control plane from datapath expedites the development of new congestion control solutions and creates opportunities for explicit rate allocation schemes. However, dealing with large numbers of flows remains a major challenge. Max-min fairness - the gold standard for rate allocation - has a running complexity proportional to the number of flows, which might be prohibitive in large-scale networks. To accelerate explicit rate allocation, we suggest using rate quantization, i.e. mapping the continuous range of flow rates to a small number of bins. We use Lloyd-max, a quantization method that generates bins according to the distribution of flow rates, to dynamically adjust the quantization bins over time. Our experimental evaluation shows that the distortion caused by this quantization scheme is small, while reducing the max-min rate allocation running time by 60 − 90%.
完美是好的敌人:拥塞控制平面中速率分配的Lloyd-Max量化
将拥塞控制平面与数据路径解耦加速了新的拥塞控制解决方案的开发,并为显式速率分配方案创造了机会。然而,处理大量流动仍然是一项重大挑战。最大最小公平性——费率分配的黄金标准——的运行复杂性与流量数量成正比,这在大规模网络中可能是令人望而却步的。为了加速显式的速率分配,我们建议使用速率量化,即将连续的流量范围映射到少量的箱中。我们使用Lloyd-max,一种根据流量分布生成箱子的量化方法,随着时间的推移动态调整量化箱子。我们的实验评估表明,该量化方案造成的失真很小,同时减少了60 - 90%的最大最小速率分配运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信