Nxt-Freedom:考虑基于vdc的公平性在云数据中心实施带宽保证

Shuo Wang, Jing Li, Hongjie Zhang, Qiqi Wang
{"title":"Nxt-Freedom:考虑基于vdc的公平性在云数据中心实施带宽保证","authors":"Shuo Wang, Jing Li, Hongjie Zhang, Qiqi Wang","doi":"10.1109/NAS.2018.8515723","DOIUrl":null,"url":null,"abstract":"In cloud datacenter, it should be rational to enforce fair allocation on network resources among VDCs (virtual datacenters) in terms of multi-tenant model. Traditionally, cloud networks are shared in a best-effort manner, making it hard to reason about how network resources are allocated. Prior works concentrate on either providing minimum bandwidth guarantee or achieving work-conserving based on the VM-to-VM flow policy or per-source policy, or both. However, fair allocation on redundant bandwidth among VDCs is ignored. In this paper, we design NXT-Freedom, a bandwidth guarantees enforcement framework that divides network capacity based on per-VDC fairness while achieving work-conservation. To ensure per-VDC fair allocation, a hierarchical max-min fairness algorithm is proposed. To be applicable to non-congestion-free network core and to be scalable, NXT-Freedom decouples computing per-VDC allocation from enforcing the allocation. Through evaluation of a prototype, we show that NXT-Freedom achieves per-VDC performance isolation, and can be rapidly adapted to flow variation in cloud datacenter.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Nxt-Freedom: Considering VDC-based Fairness in Enforcing Bandwidth Guarantees in Cloud Datacenter\",\"authors\":\"Shuo Wang, Jing Li, Hongjie Zhang, Qiqi Wang\",\"doi\":\"10.1109/NAS.2018.8515723\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In cloud datacenter, it should be rational to enforce fair allocation on network resources among VDCs (virtual datacenters) in terms of multi-tenant model. Traditionally, cloud networks are shared in a best-effort manner, making it hard to reason about how network resources are allocated. Prior works concentrate on either providing minimum bandwidth guarantee or achieving work-conserving based on the VM-to-VM flow policy or per-source policy, or both. However, fair allocation on redundant bandwidth among VDCs is ignored. In this paper, we design NXT-Freedom, a bandwidth guarantees enforcement framework that divides network capacity based on per-VDC fairness while achieving work-conservation. To ensure per-VDC fair allocation, a hierarchical max-min fairness algorithm is proposed. To be applicable to non-congestion-free network core and to be scalable, NXT-Freedom decouples computing per-VDC allocation from enforcing the allocation. Through evaluation of a prototype, we show that NXT-Freedom achieves per-VDC performance isolation, and can be rapidly adapted to flow variation in cloud datacenter.\",\"PeriodicalId\":115970,\"journal\":{\"name\":\"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)\",\"volume\":\"95 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAS.2018.8515723\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2018.8515723","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在云数据中心中,在多租户模式下,在vdc(虚拟数据中心)之间公平分配网络资源应该是合理的。传统上,云网络是以尽力而为的方式共享的,因此很难推断网络资源是如何分配的。以前的工作主要集中在提供最小带宽保证或基于VM-to-VM流策略或单源策略实现工作量节省,或者两者兼而有之。但忽略了vdc间冗余带宽的公平分配。在本文中,我们设计了NXT-Freedom,这是一个带宽保证执行框架,它基于每个vdc的公平性划分网络容量,同时实现了工作节约。为了保证每个vdc的公平分配,提出了一种分层最大最小公平性算法。为了适用于非拥塞的网络核心并具有可扩展性,NXT-Freedom将每个vdc分配的计算与强制分配分离开来。通过对原型的评估,我们表明NXT-Freedom实现了每个vdc的性能隔离,并且可以快速适应云数据中心的流量变化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nxt-Freedom: Considering VDC-based Fairness in Enforcing Bandwidth Guarantees in Cloud Datacenter
In cloud datacenter, it should be rational to enforce fair allocation on network resources among VDCs (virtual datacenters) in terms of multi-tenant model. Traditionally, cloud networks are shared in a best-effort manner, making it hard to reason about how network resources are allocated. Prior works concentrate on either providing minimum bandwidth guarantee or achieving work-conserving based on the VM-to-VM flow policy or per-source policy, or both. However, fair allocation on redundant bandwidth among VDCs is ignored. In this paper, we design NXT-Freedom, a bandwidth guarantees enforcement framework that divides network capacity based on per-VDC fairness while achieving work-conservation. To ensure per-VDC fair allocation, a hierarchical max-min fairness algorithm is proposed. To be applicable to non-congestion-free network core and to be scalable, NXT-Freedom decouples computing per-VDC allocation from enforcing the allocation. Through evaluation of a prototype, we show that NXT-Freedom achieves per-VDC performance isolation, and can be rapidly adapted to flow variation in cloud datacenter.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信