{"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%.