不能拿走我的分配:通过考虑云中的需求和支付来强制公平

Gyuyeong Kim, Wonjun Lee
{"title":"不能拿走我的分配:通过考虑云中的需求和支付来强制公平","authors":"Gyuyeong Kim, Wonjun Lee","doi":"10.1109/NOF.2013.6724514","DOIUrl":null,"url":null,"abstract":"Cloud data centers provide cost-effective and elastic resource management environments through multi-tenancy. However, we observe that existing policies cause unfair bandwidth allocation. A max-min based policy allocates lower bandwidth to a tenant whose the size of flows is mostly large, and DCTCP falls short of high utilization and minimum performance guarantee. Moreover, commodity clouds are vulnerable to denial of service (DoS) attacks, which can be attempted by a malicious tenant. The aforementioned deficiencies decrease the motivation to use clouds and revenue of cloud providers. To address the problem, we propose Spiderweb, a fair network sharing mechanism for cloud data centers, which allocates bandwidth to tenants in proportion to the amount of demand and payment during oversubscription. Our proposal delivers both a cloud-specialized fair network sharing environment and robustness against DoS attacks. We show that our proposal meets the desirable sharing properties including proportional fairness, performance isolation, and high utilization through analytical allocation scenarios.","PeriodicalId":143986,"journal":{"name":"2013 Fourth International Conference on the Network of the Future (NoF)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cannot take my allocation: Enforcing fairness by considering demand and payment in clouds\",\"authors\":\"Gyuyeong Kim, Wonjun Lee\",\"doi\":\"10.1109/NOF.2013.6724514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud data centers provide cost-effective and elastic resource management environments through multi-tenancy. However, we observe that existing policies cause unfair bandwidth allocation. A max-min based policy allocates lower bandwidth to a tenant whose the size of flows is mostly large, and DCTCP falls short of high utilization and minimum performance guarantee. Moreover, commodity clouds are vulnerable to denial of service (DoS) attacks, which can be attempted by a malicious tenant. The aforementioned deficiencies decrease the motivation to use clouds and revenue of cloud providers. To address the problem, we propose Spiderweb, a fair network sharing mechanism for cloud data centers, which allocates bandwidth to tenants in proportion to the amount of demand and payment during oversubscription. Our proposal delivers both a cloud-specialized fair network sharing environment and robustness against DoS attacks. We show that our proposal meets the desirable sharing properties including proportional fairness, performance isolation, and high utilization through analytical allocation scenarios.\",\"PeriodicalId\":143986,\"journal\":{\"name\":\"2013 Fourth International Conference on the Network of the Future (NoF)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Fourth International Conference on the Network of the Future (NoF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NOF.2013.6724514\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Fourth International Conference on the Network of the Future (NoF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOF.2013.6724514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

云数据中心通过多租户提供经济高效、弹性的资源管理环境。然而,我们观察到现有的政策导致了不公平的带宽分配。最大最小策略分配给流量较大的租户的带宽较低,无法实现高利用率和最低性能保证。此外,商品云容易受到拒绝服务(DoS)攻击,恶意租户可能会尝试这种攻击。上述缺陷降低了使用云的动机和云提供商的收入。为了解决这个问题,我们提出了Spiderweb,这是一种公平的云数据中心网络共享机制,它在超额订阅期间根据需求和支付的数量按比例分配带宽给租户。我们的建议提供了一个云专用的公平网络共享环境和抗DoS攻击的鲁棒性。通过分析分配场景,我们证明了我们的提议满足了期望的共享特性,包括比例公平、性能隔离和高利用率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cannot take my allocation: Enforcing fairness by considering demand and payment in clouds
Cloud data centers provide cost-effective and elastic resource management environments through multi-tenancy. However, we observe that existing policies cause unfair bandwidth allocation. A max-min based policy allocates lower bandwidth to a tenant whose the size of flows is mostly large, and DCTCP falls short of high utilization and minimum performance guarantee. Moreover, commodity clouds are vulnerable to denial of service (DoS) attacks, which can be attempted by a malicious tenant. The aforementioned deficiencies decrease the motivation to use clouds and revenue of cloud providers. To address the problem, we propose Spiderweb, a fair network sharing mechanism for cloud data centers, which allocates bandwidth to tenants in proportion to the amount of demand and payment during oversubscription. Our proposal delivers both a cloud-specialized fair network sharing environment and robustness against DoS attacks. We show that our proposal meets the desirable sharing properties including proportional fairness, performance isolation, and high utilization through analytical allocation scenarios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信