Batching for Smart Home: Leveraging delay-insensitive workload in cloud storage

Suiming Guo, Liang Chen, Guoqiang Zhang, D. Chiu
{"title":"Batching for Smart Home: Leveraging delay-insensitive workload in cloud storage","authors":"Suiming Guo, Liang Chen, Guoqiang Zhang, D. Chiu","doi":"10.1109/COMSNETS.2015.7098671","DOIUrl":null,"url":null,"abstract":"We study the problem of managing high intradatacenter traffic in a chunk-based public cloud storage service. The high traffic volume is introduced by aggregating very large files from multiple chunk servers in a single edge server. We measure a commercial cloud storage service system, and observe that peak traffic volume overwhelms the network interface cards (NICs) significantly. In the scenario of delivering content based on Smart Home network, it can be expected the file downloading service could be delay-insensitive. Thus, we propose “Batching Smooth intra-datacenter Traffic” (BST) scheme to reduce the peak load to a specified upper bound by batching and delaying users' requests. We resort to a mathematical model to understand the necessity of batching strategy. To evaluate BST's effects, we implement trace-driven simulations with different scheduling policies. In the commercial cloud storage service system, we show that BST is capable of keeping the upper bound to approximately 75% of the original peak traffic by trading off an average delay of 8 minutes.","PeriodicalId":277593,"journal":{"name":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th International Conference on Communication Systems and Networks (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2015.7098671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We study the problem of managing high intradatacenter traffic in a chunk-based public cloud storage service. The high traffic volume is introduced by aggregating very large files from multiple chunk servers in a single edge server. We measure a commercial cloud storage service system, and observe that peak traffic volume overwhelms the network interface cards (NICs) significantly. In the scenario of delivering content based on Smart Home network, it can be expected the file downloading service could be delay-insensitive. Thus, we propose “Batching Smooth intra-datacenter Traffic” (BST) scheme to reduce the peak load to a specified upper bound by batching and delaying users' requests. We resort to a mathematical model to understand the necessity of batching strategy. To evaluate BST's effects, we implement trace-driven simulations with different scheduling policies. In the commercial cloud storage service system, we show that BST is capable of keeping the upper bound to approximately 75% of the original peak traffic by trading off an average delay of 8 minutes.
智能家居的批处理:利用云存储中对延迟不敏感的工作负载
我们研究了基于块的公共云存储服务中管理数据中心内高流量的问题。高流量是通过在单个边缘服务器中聚合来自多个块服务器的非常大的文件而引入的。我们对一个商业云存储服务系统进行了测量,观察到峰值流量明显超过网卡(nic)。在基于智能家居网络的内容交付场景中,可以预期文件下载服务是不延迟的。因此,我们提出了“批处理平滑数据中心内流量”(BST)方案,通过批处理和延迟用户的请求,将峰值负载降低到指定的上限。我们借助于数学模型来理解批处理策略的必要性。为了评估BST的效果,我们使用不同的调度策略实现了跟踪驱动的仿真。在商业云存储服务系统中,我们证明了BST能够通过权衡平均8分钟的延迟将上限保持在原始峰值流量的75%左右。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信