Content Media Retrieval using Virtual Network Functions in Multi-access Edge Computing architecture

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ian Vilar Bastos, Igor Monteiro Moraes, Thi-Mai-Trang Nguyen, Guy Pujolle
{"title":"Content Media Retrieval using Virtual Network Functions in Multi-access Edge Computing architecture","authors":"Ian Vilar Bastos,&nbsp;Igor Monteiro Moraes,&nbsp;Thi-Mai-Trang Nguyen,&nbsp;Guy Pujolle","doi":"10.1002/nem.2208","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>The mobile traffic grows every year. Resource requirements of mobile applications, as processing power and storage capacity, transformed the architecture of cellular networks into a centralized infrastructure, the C-RANs. On the other hand, providing resources close to base stations, as the multi-access edge computing suggests, allows an immediate processing for delay sensitive applications. In this work, we formulate as a mixed integer linear programming the retrieval of media contents through caches acting as virtual network functions. The optimization model minimizes both the media contents' retrieval cost and the number of instantiated virtual network functions. Results show that the characteristic that has most impact on caching is the high throughput between the node that stores the virtual network function images and the virtualized environment that hosts the image, where up to 70% of the requests are satisfied. When caches have low storage capacity and incurs high transferring delay cost for deployment, the most important characteristic is the throughput distribution between the virtualized environment and the base stations.</p>\n </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"32 5","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2022-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Network Management","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/nem.2208","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1

Abstract

The mobile traffic grows every year. Resource requirements of mobile applications, as processing power and storage capacity, transformed the architecture of cellular networks into a centralized infrastructure, the C-RANs. On the other hand, providing resources close to base stations, as the multi-access edge computing suggests, allows an immediate processing for delay sensitive applications. In this work, we formulate as a mixed integer linear programming the retrieval of media contents through caches acting as virtual network functions. The optimization model minimizes both the media contents' retrieval cost and the number of instantiated virtual network functions. Results show that the characteristic that has most impact on caching is the high throughput between the node that stores the virtual network function images and the virtualized environment that hosts the image, where up to 70% of the requests are satisfied. When caches have low storage capacity and incurs high transferring delay cost for deployment, the most important characteristic is the throughput distribution between the virtualized environment and the base stations.

Abstract Image

基于多访问边缘计算架构的虚拟网络功能的内容媒体检索
移动通信流量每年都在增长。移动应用程序的资源需求,如处理能力和存储容量,将蜂窝网络的架构转变为集中的基础设施,即c - ran。另一方面,如多接入边缘计算所建议的那样,在基站附近提供资源,可以立即处理对延迟敏感的应用程序。在这项工作中,我们制定了一个混合整数线性规划,通过缓存作为虚拟网络功能来检索媒体内容。该优化模型使媒体内容的检索成本和实例化虚拟网络函数的数量最小化。结果表明,对缓存影响最大的特性是存储虚拟网络功能映像的节点和承载该映像的虚拟化环境之间的高吞吐量,其中高达70%的请求得到满足。当缓存的存储容量较小时,部署的传输延迟成本较高时,最重要的特征是虚拟化环境和基站之间的吞吐量分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Network Management
International Journal of Network Management COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
5.10
自引率
6.70%
发文量
25
审稿时长
>12 weeks
期刊介绍: Modern computer networks and communication systems are increasing in size, scope, and heterogeneity. The promise of a single end-to-end technology has not been realized and likely never will occur. The decreasing cost of bandwidth is increasing the possible applications of computer networks and communication systems to entirely new domains. Problems in integrating heterogeneous wired and wireless technologies, ensuring security and quality of service, and reliably operating large-scale systems including the inclusion of cloud computing have all emerged as important topics. The one constant is the need for network management. Challenges in network management have never been greater than they are today. The International Journal of Network Management is the forum for researchers, developers, and practitioners in network management to present their work to an international audience. The journal is dedicated to the dissemination of information, which will enable improved management, operation, and maintenance of computer networks and communication systems. The journal is peer reviewed and publishes original papers (both theoretical and experimental) by leading researchers, practitioners, and consultants from universities, research laboratories, and companies around the world. Issues with thematic or guest-edited special topics typically occur several times per year. Topic areas for the journal are largely defined by the taxonomy for network and service management developed by IFIP WG6.6, together with IEEE-CNOM, the IRTF-NMRG and the Emanics Network of Excellence.
×
引用
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学术官方微信