Competitive caching of contents in 5G edge cloud networks

F. Pellegrini, Antonio Massaro, L. Goratti, R. E. Azouzi
{"title":"Competitive caching of contents in 5G edge cloud networks","authors":"F. Pellegrini, Antonio Massaro, L. Goratti, R. E. Azouzi","doi":"10.23919/WIOPT.2017.7959875","DOIUrl":null,"url":null,"abstract":"The surge of mobile data traffic forces network operators to cope with capacity shortage. The deployment of small cells in 5G networks shall increase radio access capacity. Mobile edge computing technologies can be used to manage dedicated cache memory at the edge of mobile networks. As a result, data traffic can be confined within the radio access network thus reducing latency, round-trip time and backhaul congestion. Such technique can be used to offer content providers premium connectivity services to enhance the quality of experience of their customers on the move. In this context, cache memory in the mobile edge network becomes a shared resource. We study a competitive caching scheme where contents are stored at a given price set by the mobile network operator. We first formulate a resource allocation problem for a tagged content provider seeking to minimize the expected missed cache rate. The optimal caching policy is derived accounting for popularity of contents, spatial distribution of small cells, and caching strategies of competing content providers. Next, we study a game among content providers in the form of a generalized non-smooth Kelly mechanism with bounded strategy sets and heterogeneous players. Existence and uniqueness of the Nash equilibrium are proved. Finally, numerical results validate and characterize the performance of the system.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"26 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2017.7959875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

The surge of mobile data traffic forces network operators to cope with capacity shortage. The deployment of small cells in 5G networks shall increase radio access capacity. Mobile edge computing technologies can be used to manage dedicated cache memory at the edge of mobile networks. As a result, data traffic can be confined within the radio access network thus reducing latency, round-trip time and backhaul congestion. Such technique can be used to offer content providers premium connectivity services to enhance the quality of experience of their customers on the move. In this context, cache memory in the mobile edge network becomes a shared resource. We study a competitive caching scheme where contents are stored at a given price set by the mobile network operator. We first formulate a resource allocation problem for a tagged content provider seeking to minimize the expected missed cache rate. The optimal caching policy is derived accounting for popularity of contents, spatial distribution of small cells, and caching strategies of competing content providers. Next, we study a game among content providers in the form of a generalized non-smooth Kelly mechanism with bounded strategy sets and heterogeneous players. Existence and uniqueness of the Nash equilibrium are proved. Finally, numerical results validate and characterize the performance of the system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
5G边缘云网络中的竞争性内容缓存
移动数据流量的激增迫使网络运营商应对容量短缺。在5G网络中部署小型基站将增加无线接入容量。移动边缘计算技术可用于管理移动网络边缘的专用缓存内存。因此,数据流量可以限制在无线接入网内,从而减少延迟、往返时间和回程拥塞。这种技术可以用来为内容提供商提供优质的连接服务,以提高其客户在移动中的体验质量。在这种情况下,移动边缘网络中的缓存成为一种共享资源。我们研究了一种竞争性缓存方案,其中内容以移动网络运营商设定的给定价格存储。我们首先为标记内容提供程序制定了一个资源分配问题,以最小化预期的错过缓存率。考虑到内容的流行程度、小单元的空间分布以及相互竞争的内容提供者的缓存策略,得出了最优缓存策略。接下来,我们以广义非光滑Kelly机制的形式研究了具有有界策略集和异构参与人的内容提供者之间的博弈。证明了纳什均衡的存在唯一性。最后,通过数值实验验证了系统的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Keynote speaker Keynote speaker Ad-Hoc, Mobile, and Wireless Networks: 19th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2020, Bari, Italy, October 19–21, 2020, Proceedings Retraction Note to: Mobility Aided Context-Aware Forwarding Approach for Destination-Less OppNets Ad-Hoc, Mobile, and Wireless Networks: 18th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2019, Luxembourg, Luxembourg, October 1–3, 2019, Proceedings
×
引用
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