关于需求和通道不确定的主动缓存

L. S. Muppirisetty, John Tadrous, A. Eryilmaz, H. Wymeersch
{"title":"关于需求和通道不确定的主动缓存","authors":"L. S. Muppirisetty, John Tadrous, A. Eryilmaz, H. Wymeersch","doi":"10.1109/ALLERTON.2015.7447141","DOIUrl":null,"url":null,"abstract":"Mobile data traffic has surpassed that of voice to become the main component of the system load of today's wireless networks. Recent studies indicate that the data demand patterns of mobile users are predictable. Moreover, the channel quality of mobile users along their navigation paths is predictable by exploiting their location information. This work aims at fusing the statistically predictable demand and channel patterns in devising proactive caching strategies that alleviate network congestion. Specifically, we establish a fundamental bound on the minimum possible cost achievable by any proactive scheduler under time-invariant demand and channel statistics as a function of their prediction uncertainties, and develop an asymptotically optimal proactive service policy that attains this bound as the prediction window grows. In addition, the established bound yields insights on how the demand and channel statistics affect proactive caching decisions. We reveal some of these insights through numerical investigations.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"On proactive caching with demand and channel uncertainties\",\"authors\":\"L. S. Muppirisetty, John Tadrous, A. Eryilmaz, H. Wymeersch\",\"doi\":\"10.1109/ALLERTON.2015.7447141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile data traffic has surpassed that of voice to become the main component of the system load of today's wireless networks. Recent studies indicate that the data demand patterns of mobile users are predictable. Moreover, the channel quality of mobile users along their navigation paths is predictable by exploiting their location information. This work aims at fusing the statistically predictable demand and channel patterns in devising proactive caching strategies that alleviate network congestion. Specifically, we establish a fundamental bound on the minimum possible cost achievable by any proactive scheduler under time-invariant demand and channel statistics as a function of their prediction uncertainties, and develop an asymptotically optimal proactive service policy that attains this bound as the prediction window grows. In addition, the established bound yields insights on how the demand and channel statistics affect proactive caching decisions. We reveal some of these insights through numerical investigations.\",\"PeriodicalId\":112948,\"journal\":{\"name\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2015.7447141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7447141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

移动数据流量已经超过语音流量,成为当今无线网络系统负载的主要组成部分。最近的研究表明,移动用户的数据需求模式是可预测的。此外,利用移动用户的位置信息,可以预测其导航路径上的信道质量。这项工作旨在融合统计上可预测的需求和通道模式,以设计缓解网络拥塞的主动缓存策略。具体地说,我们建立了在定常需求和信道统计的情况下,任何主动调度器可实现的最小可能成本的基本界,作为其预测不确定性的函数,并开发了一个随着预测窗口的增长而达到该界的渐近最优主动服务策略。此外,已建立的绑定可以深入了解需求和通道统计信息如何影响主动缓存决策。我们通过数值研究揭示了其中的一些见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On proactive caching with demand and channel uncertainties
Mobile data traffic has surpassed that of voice to become the main component of the system load of today's wireless networks. Recent studies indicate that the data demand patterns of mobile users are predictable. Moreover, the channel quality of mobile users along their navigation paths is predictable by exploiting their location information. This work aims at fusing the statistically predictable demand and channel patterns in devising proactive caching strategies that alleviate network congestion. Specifically, we establish a fundamental bound on the minimum possible cost achievable by any proactive scheduler under time-invariant demand and channel statistics as a function of their prediction uncertainties, and develop an asymptotically optimal proactive service policy that attains this bound as the prediction window grows. In addition, the established bound yields insights on how the demand and channel statistics affect proactive caching decisions. We reveal some of these insights through numerical investigations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Robust temporal logic model predictive control Efficient replication of queued tasks for latency reduction in cloud systems Cut-set bound is loose for Gaussian relay networks Improving MIMO detection performance in presence of phase noise using norm difference criterion Utility fair RAT selection in multi-homed LTE/802.11 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