单云和联合云中数据中心间广域网混合流的保证

Shruti Gandhi, Y. Viniotis
{"title":"单云和联合云中数据中心间广域网混合流的保证","authors":"Shruti Gandhi, Y. Viniotis","doi":"10.1109/LCN48667.2020.9314789","DOIUrl":null,"url":null,"abstract":"Inter-datacenter WANs connect geo-distributed datacenters and carry a considerable amount of traffic, generally a mix of flows. There has been little work done to provide custom guarantees depending on the nature of traffic requirements in such environments. In this paper we address this problem by proposing Vritti, an adaptable spatial-temporal system for traffic engineering in inter-datacenter WAN environments applicable to single and federated clouds. With Vritti, cloud providers can offer tailor-made guarantees to users with widely differing requirements (in terms of hard, soft or no deadlines) and traffic characteristics (in terms of known or unknown traffic volumes). We use linear programming to mathematically formulate the problem with the objective of maximizing utility. We propose two online algorithms to generate admission control, scheduling and routing decisions. Our simulations show that Vritti can effectively meet deadline transfers and provide fairness to non-deadline transfers in both single and federated cloud environments.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Guarantees for Mix-flows in Inter-Datacenter WANs in Single and Federated Clouds\",\"authors\":\"Shruti Gandhi, Y. Viniotis\",\"doi\":\"10.1109/LCN48667.2020.9314789\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Inter-datacenter WANs connect geo-distributed datacenters and carry a considerable amount of traffic, generally a mix of flows. There has been little work done to provide custom guarantees depending on the nature of traffic requirements in such environments. In this paper we address this problem by proposing Vritti, an adaptable spatial-temporal system for traffic engineering in inter-datacenter WAN environments applicable to single and federated clouds. With Vritti, cloud providers can offer tailor-made guarantees to users with widely differing requirements (in terms of hard, soft or no deadlines) and traffic characteristics (in terms of known or unknown traffic volumes). We use linear programming to mathematically formulate the problem with the objective of maximizing utility. We propose two online algorithms to generate admission control, scheduling and routing decisions. Our simulations show that Vritti can effectively meet deadline transfers and provide fairness to non-deadline transfers in both single and federated cloud environments.\",\"PeriodicalId\":245782,\"journal\":{\"name\":\"2020 IEEE 45th Conference on Local Computer Networks (LCN)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 45th Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN48667.2020.9314789\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN48667.2020.9314789","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

数据中心间广域网连接地理分布的数据中心,并承载相当数量的流量,通常是流的混合。在这种环境中,根据交通需求的性质提供定制保障的工作很少。在本文中,我们通过提出Vritti来解决这个问题,Vritti是一种适用于单云和联合云的跨数据中心WAN环境中流量工程的自适应时空系统。有了Vritti,云提供商可以为有着不同需求(硬截止日期、软截止日期或无截止日期)和流量特征(已知或未知流量)的用户提供量身定制的保证。我们用线性规划的方法来数学地表述以效用最大化为目标的问题。我们提出了两种在线算法来生成准入控制、调度和路由决策。仿真结果表明,无论在单一云环境还是联合云环境中,Vritti都能有效地满足截止日期传输,并为非截止日期传输提供公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Guarantees for Mix-flows in Inter-Datacenter WANs in Single and Federated Clouds
Inter-datacenter WANs connect geo-distributed datacenters and carry a considerable amount of traffic, generally a mix of flows. There has been little work done to provide custom guarantees depending on the nature of traffic requirements in such environments. In this paper we address this problem by proposing Vritti, an adaptable spatial-temporal system for traffic engineering in inter-datacenter WAN environments applicable to single and federated clouds. With Vritti, cloud providers can offer tailor-made guarantees to users with widely differing requirements (in terms of hard, soft or no deadlines) and traffic characteristics (in terms of known or unknown traffic volumes). We use linear programming to mathematically formulate the problem with the objective of maximizing utility. We propose two online algorithms to generate admission control, scheduling and routing decisions. Our simulations show that Vritti can effectively meet deadline transfers and provide fairness to non-deadline transfers in both single and federated cloud environments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Leveraging MEC in a 5G System for Enhanced Back Situation Awareness L3SFA: Load Shifting Strategy for Spreading Factor Allocation in LoRaWAN Systems PLEDGE: An IoT-oriented Proof-of-Honesty based Blockchain Consensus Protocol Don’t Stop at the Top: Using Certificate Transparency Logs to Extend Domain Lists for Web Security Studies SETA: Scalable Encrypted Traffic Analytics in Multi-Gbps Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1