一种基于分块的两步车云分流算法

Luigi Vigneri, T. Spyropoulos, C. Barakat
{"title":"一种基于分块的两步车云分流算法","authors":"Luigi Vigneri, T. Spyropoulos, C. Barakat","doi":"10.1109/SPAWC.2018.8445782","DOIUrl":null,"url":null,"abstract":"Using vehicles equipped with small caches as small base stations has recently been proposed as an interesting middle ground between caching at fixed base stations (which has higher CAPEX/OPEX), and caching at user devices (which has resource limitations). A typical problem in this setup is which content to store in which vehicles. The correct answer depends on the application. Indeed, if the stored content will be streamed (not downloaded), then this offers a natural delay tolerance: latter parts of the content do not need to be downloaded immediately from expensive links (e.g., macro-cells), but could be fetched from encountered vehicles cheaply. In an earlier work, we formulated a related optimal cache allocation problem, in which the proposed solution stores a content in its entirety. In light of recent statistics suggesting that different parts of a content (e.g., YouTube clips) are not watched equally frequently, this method is suboptimal. In this paper, we thus consider per-chunk allocation, and propose a simple two-step heuristic that first allocates the vehicular cloud capacity among content items, then efficiently distributes the capacity for a specific content among its chunks. Trace-driven simulation results suggest that chunk-based allocation can lead to considerable gains.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Two-Step Chunk-Based Algorithm for Offloading Streaming Traffic Through a Vehicular Cloud\",\"authors\":\"Luigi Vigneri, T. Spyropoulos, C. Barakat\",\"doi\":\"10.1109/SPAWC.2018.8445782\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Using vehicles equipped with small caches as small base stations has recently been proposed as an interesting middle ground between caching at fixed base stations (which has higher CAPEX/OPEX), and caching at user devices (which has resource limitations). A typical problem in this setup is which content to store in which vehicles. The correct answer depends on the application. Indeed, if the stored content will be streamed (not downloaded), then this offers a natural delay tolerance: latter parts of the content do not need to be downloaded immediately from expensive links (e.g., macro-cells), but could be fetched from encountered vehicles cheaply. In an earlier work, we formulated a related optimal cache allocation problem, in which the proposed solution stores a content in its entirety. In light of recent statistics suggesting that different parts of a content (e.g., YouTube clips) are not watched equally frequently, this method is suboptimal. In this paper, we thus consider per-chunk allocation, and propose a simple two-step heuristic that first allocates the vehicular cloud capacity among content items, then efficiently distributes the capacity for a specific content among its chunks. Trace-driven simulation results suggest that chunk-based allocation can lead to considerable gains.\",\"PeriodicalId\":240036,\"journal\":{\"name\":\"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2018.8445782\",\"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 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2018.8445782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在固定基站(具有较高的CAPEX/OPEX)和用户设备(具有资源限制)缓存之间,最近提出了一种有趣的中间路线,即使用配备小型缓存的车辆作为小型基站。此设置中的一个典型问题是将哪些内容存储在哪些车辆中。正确答案取决于应用程序。事实上,如果存储的内容将被流式传输(而不是下载),那么这提供了一个自然的延迟容忍:内容的后一部分不需要立即从昂贵的链接(例如,宏单元)下载,但可以从遇到的车辆中廉价地获取。在早期的工作中,我们制定了一个相关的最优缓存分配问题,其中提出的解决方案存储完整的内容。根据最近的统计数据表明,内容的不同部分(例如,YouTube剪辑)的观看频率并不相同,这种方法是次优的。因此,在本文中,我们考虑了每个块的分配,并提出了一个简单的两步启发式算法,首先在内容项之间分配车辆云容量,然后在其块之间有效地分配特定内容的容量。跟踪驱动的模拟结果表明,基于块的分配可以带来可观的收益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Two-Step Chunk-Based Algorithm for Offloading Streaming Traffic Through a Vehicular Cloud
Using vehicles equipped with small caches as small base stations has recently been proposed as an interesting middle ground between caching at fixed base stations (which has higher CAPEX/OPEX), and caching at user devices (which has resource limitations). A typical problem in this setup is which content to store in which vehicles. The correct answer depends on the application. Indeed, if the stored content will be streamed (not downloaded), then this offers a natural delay tolerance: latter parts of the content do not need to be downloaded immediately from expensive links (e.g., macro-cells), but could be fetched from encountered vehicles cheaply. In an earlier work, we formulated a related optimal cache allocation problem, in which the proposed solution stores a content in its entirety. In light of recent statistics suggesting that different parts of a content (e.g., YouTube clips) are not watched equally frequently, this method is suboptimal. In this paper, we thus consider per-chunk allocation, and propose a simple two-step heuristic that first allocates the vehicular cloud capacity among content items, then efficiently distributes the capacity for a specific content among its chunks. Trace-driven simulation results suggest that chunk-based allocation can lead to considerable gains.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信