PACCP: A Price-Aware Congestion Control Protocol for Datacenters

Xiaocui Sun, Zhijun Wang, Yunxiang Wu, Hao Che, Hong Jiang
{"title":"PACCP: A Price-Aware Congestion Control Protocol for Datacenters","authors":"Xiaocui Sun, Zhijun Wang, Yunxiang Wu, Hao Che, Hong Jiang","doi":"10.1109/UCC48980.2020.00022","DOIUrl":null,"url":null,"abstract":"To date, customers using infrastructure-as-a service (IaaS) cloud services are charged for the usage of computing/storage resources, but not the network resource. The difficulty lies in the fact that it is nontrivial to allocate network resource to individual customers effectively, especially for short-lived flows, in terms of both performance and cost. To tackle this challenge, in this paper, we propose PACCP, an end-to-end Price-Aware Congestion Control Protocol for cloud services. PACCP is a network utility maximization (NUM) based optimal congestion control protocol. It supports three different classes of services (CoSes), i.e., best effort service (BE), differentiated service (DS), and minimum rate guaranteed (MRG) service. In PACCP, the desired CoS or rate allocation for a given flow is enabled by properly setting a pair of control parameters, i.e., a minimum guaranteed rate and a utility weight, which in turn, determines the price paid by the user of the flow. Two pricing models, i.e., a coarse-grained Virtual machine (VM)-Based Pricing model (VBP) and a fine-grained Flow-Based Pricing model (FBP), are proposed. PACCP is evaluated by both large scale simulation and small testbed implementation. The results demonstrate that PACCP provides minimum rate guarantee, high bandwidth utilization and fair rate allocation, commensurate with the pricing models.","PeriodicalId":125849,"journal":{"name":"2020 IEEE/ACM 13th International Conference on Utility and Cloud Computing (UCC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE/ACM 13th International Conference on Utility and Cloud Computing (UCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UCC48980.2020.00022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

To date, customers using infrastructure-as-a service (IaaS) cloud services are charged for the usage of computing/storage resources, but not the network resource. The difficulty lies in the fact that it is nontrivial to allocate network resource to individual customers effectively, especially for short-lived flows, in terms of both performance and cost. To tackle this challenge, in this paper, we propose PACCP, an end-to-end Price-Aware Congestion Control Protocol for cloud services. PACCP is a network utility maximization (NUM) based optimal congestion control protocol. It supports three different classes of services (CoSes), i.e., best effort service (BE), differentiated service (DS), and minimum rate guaranteed (MRG) service. In PACCP, the desired CoS or rate allocation for a given flow is enabled by properly setting a pair of control parameters, i.e., a minimum guaranteed rate and a utility weight, which in turn, determines the price paid by the user of the flow. Two pricing models, i.e., a coarse-grained Virtual machine (VM)-Based Pricing model (VBP) and a fine-grained Flow-Based Pricing model (FBP), are proposed. PACCP is evaluated by both large scale simulation and small testbed implementation. The results demonstrate that PACCP provides minimum rate guarantee, high bandwidth utilization and fair rate allocation, commensurate with the pricing models.
PACCP:数据中心的价格感知拥塞控制协议
迄今为止,使用基础设施即服务(IaaS)云服务的客户需要为计算/存储资源的使用付费,而不需要为网络资源付费。困难在于,从性能和成本两方面考虑,将网络资源有效地分配给单个客户,特别是对于短期流,这是一件非常重要的事情。为了应对这一挑战,在本文中,我们提出了PACCP,一种用于云服务的端到端价格感知拥塞控制协议。PACCP是一种基于网络效用最大化(NUM)的最优拥塞控制协议。它支持三种不同的服务类别,即最佳努力服务(BE)、差异化服务(DS)和最低保证率服务(MRG)。在PACCP中,通过适当设置一对控制参数(即最小保证率和效用权重)来启用给定流的期望CoS或费率分配,这反过来又决定了流量用户支付的价格。提出了基于粗粒度虚拟机(VM)的定价模型(VBP)和基于细粒度流量的定价模型(FBP)两种定价模型。通过大规模仿真和小型实验平台实现对PACCP进行了评估。结果表明,PACCP提供了最低的速率保证、较高的带宽利用率和公平的速率分配,与定价模型相适应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信