Minimizing state access delay for cloud-native network functions

Márk Szalay, P. Mátray, László Toka
{"title":"Minimizing state access delay for cloud-native network functions","authors":"Márk Szalay, P. Mátray, László Toka","doi":"10.1109/CloudNet47604.2019.9064048","DOIUrl":null,"url":null,"abstract":"In the era of cloud services, there is a strong desire to improve the elasticity and reliability of applications in the cloud. The standard way of achieving these goals is to decouple the life-cycle of important application states from the life-cycle of individual application instances: states, and data in general, are written to and read from cloud databases, deployed close to the application code. The high performance requirements on the application impose strict latency limits on these storage solutions for state access. Cloud database instances are therefore distributed on multiple hosts in order to strive to ensure data locality for all functions. However, the shared nature of certain states, and the inevitable dynamics of the application workload necessarily lead to inter-host data access within the data center (or even across data centers, if the application requires a multi-data center setup). In order to minimize the inter-host communication due to state externalization, we propose an advanced cloud scheduling algorithm that places functions' states across the hosts of a data center. We create a model for the state placement with the aim of minimizing state access latency, and we prove that it is a complex problem. We therefore propose heuristics for fast and efficient placement methods and we evaluate those across realistic scenarios. We show that our approximations are close to the optimal placement, and in large-scale settings the algorithms take only a few minutes to yield good placement results.","PeriodicalId":340890,"journal":{"name":"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudNet47604.2019.9064048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In the era of cloud services, there is a strong desire to improve the elasticity and reliability of applications in the cloud. The standard way of achieving these goals is to decouple the life-cycle of important application states from the life-cycle of individual application instances: states, and data in general, are written to and read from cloud databases, deployed close to the application code. The high performance requirements on the application impose strict latency limits on these storage solutions for state access. Cloud database instances are therefore distributed on multiple hosts in order to strive to ensure data locality for all functions. However, the shared nature of certain states, and the inevitable dynamics of the application workload necessarily lead to inter-host data access within the data center (or even across data centers, if the application requires a multi-data center setup). In order to minimize the inter-host communication due to state externalization, we propose an advanced cloud scheduling algorithm that places functions' states across the hosts of a data center. We create a model for the state placement with the aim of minimizing state access latency, and we prove that it is a complex problem. We therefore propose heuristics for fast and efficient placement methods and we evaluate those across realistic scenarios. We show that our approximations are close to the optimal placement, and in large-scale settings the algorithms take only a few minutes to yield good placement results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最小化云原生网络功能的状态访问延迟
在云服务时代,人们强烈希望提高云应用程序的弹性和可靠性。实现这些目标的标准方法是将重要应用程序状态的生命周期与单个应用程序实例的生命周期解耦:通常将状态和数据写入和读取到云数据库,部署在靠近应用程序代码的地方。应用程序的高性能要求对这些状态访问的存储解决方案施加了严格的延迟限制。因此,云数据库实例分布在多个主机上,以努力确保所有功能的数据局部性。但是,某些状态的共享特性和应用程序工作负载的不可避免的动态特性必然导致数据中心内的主机间数据访问(如果应用程序需要多数据中心设置,甚至可以跨数据中心访问)。为了最大限度地减少由于状态外部化而导致的主机间通信,我们提出了一种先进的云调度算法,该算法将功能的状态放置在数据中心的主机上。我们以最小化状态访问延迟为目标创建了状态放置模型,并证明了这是一个复杂的问题。因此,我们提出了快速有效的放置方法的启发式方法,并在现实场景中评估这些方法。我们表明,我们的近似值接近于最佳放置,并且在大规模设置中,算法只需几分钟即可产生良好的放置结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Preventive Start-time Optimization to Determine Link Weights against Multiple Link Failures Collaborative Traffic Measurement in Virtualized Data Center Networks A stable matching method for cloud scheduling Dynamic Sketch: Efficient and Adjustable Heavy Hitter Detection for Software Packet Processing Minimizing state access delay for cloud-native network functions
×
引用
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