移动边缘网络中合作更新缓存和转发的在线方法

IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Wireless Networks Pub Date : 2024-05-06 DOI:10.1007/s11276-024-03749-7
Manoj Kumar Somesula, Banalaxmi Brahma, Mekala Ratna Raju, Sai Krishna Mothku
{"title":"移动边缘网络中合作更新缓存和转发的在线方法","authors":"Manoj Kumar Somesula, Banalaxmi Brahma, Mekala Ratna Raju, Sai Krishna Mothku","doi":"10.1007/s11276-024-03749-7","DOIUrl":null,"url":null,"abstract":"<p>The proliferation of technological advancement in the Internet of Things (IoT) and mobile devices accelerates the need for latency-sensitive multimedia applications. The network operator may charge application vendors to cache their content. Vendors risk losing their user base if users don’t receive the expected Quality of Service (QoS), which includes meeting specific delay thresholds for services like video on demand. While multiple content copies can enhance QoS by delivering content quickly, maintaining redundant copies is costly. Therefore, deploying edge servers at edge nodes and caching content is a prominent solution for application vendors. This approach guarantees lower latency, fewer content replicas, and reduced strain on backhaul links. However, the limited cache capabilities of individual edge nodes present challenges, such as efficiently allocating scarce resources to meet user demands. This work addresses the earlier challenges by formulating a cooperative content caching and forwarding problem by placing the various latency-sensitive content to minimize the total cost with resource and deadline constraints. The problem is formulated as an integer linear programming problem for cooperative caching in mobile edge networks to mitigate the total cost to the application vendors. In the absence of content popularity information, an online cooperative caching mechanism is presented to solve the dynamic content request and forwarding problem. Extensive simulations have been performed to illustrate that the proposed online algorithm significantly enhances the performance in terms of the total cost, load on the cloud, hit ratio, time utility, and cache utilization.</p>","PeriodicalId":23750,"journal":{"name":"Wireless Networks","volume":"20 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An online approach for cooperative cache updating and forwarding in mobile edge network\",\"authors\":\"Manoj Kumar Somesula, Banalaxmi Brahma, Mekala Ratna Raju, Sai Krishna Mothku\",\"doi\":\"10.1007/s11276-024-03749-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The proliferation of technological advancement in the Internet of Things (IoT) and mobile devices accelerates the need for latency-sensitive multimedia applications. The network operator may charge application vendors to cache their content. Vendors risk losing their user base if users don’t receive the expected Quality of Service (QoS), which includes meeting specific delay thresholds for services like video on demand. While multiple content copies can enhance QoS by delivering content quickly, maintaining redundant copies is costly. Therefore, deploying edge servers at edge nodes and caching content is a prominent solution for application vendors. This approach guarantees lower latency, fewer content replicas, and reduced strain on backhaul links. However, the limited cache capabilities of individual edge nodes present challenges, such as efficiently allocating scarce resources to meet user demands. This work addresses the earlier challenges by formulating a cooperative content caching and forwarding problem by placing the various latency-sensitive content to minimize the total cost with resource and deadline constraints. The problem is formulated as an integer linear programming problem for cooperative caching in mobile edge networks to mitigate the total cost to the application vendors. In the absence of content popularity information, an online cooperative caching mechanism is presented to solve the dynamic content request and forwarding problem. Extensive simulations have been performed to illustrate that the proposed online algorithm significantly enhances the performance in terms of the total cost, load on the cloud, hit ratio, time utility, and cache utilization.</p>\",\"PeriodicalId\":23750,\"journal\":{\"name\":\"Wireless Networks\",\"volume\":\"20 1\",\"pages\":\"\"},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Wireless Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s11276-024-03749-7\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wireless Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11276-024-03749-7","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

物联网(IoT)和移动设备的技术进步加速了对延迟敏感的多媒体应用的需求。网络运营商可能会向应用供应商收取缓存内容的费用。如果用户不能获得预期的服务质量(QoS),包括满足视频点播等服务的特定延迟阈值,供应商就有可能失去用户群。虽然多个内容副本可以通过快速交付内容来提高 QoS,但维护冗余副本的成本很高。因此,在边缘节点部署边缘服务器并缓存内容是应用供应商的一个重要解决方案。这种方法能保证更低的延迟、更少的内容副本,并减少对回程链路的压力。然而,单个边缘节点有限的缓存能力带来了挑战,例如如何有效分配稀缺资源以满足用户需求。为应对上述挑战,本研究提出了一个合作内容缓存和转发问题,即在资源和截止日期限制下,将各种对延迟敏感的内容放置在一起,以最小化总成本。该问题被表述为移动边缘网络中合作缓存的整数线性编程问题,以降低应用供应商的总成本。在没有内容流行度信息的情况下,提出了一种在线合作缓存机制来解决动态内容请求和转发问题。通过大量仿真说明,所提出的在线算法在总成本、云负载、命中率、时间效用和高速缓存利用率等方面显著提高了性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An online approach for cooperative cache updating and forwarding in mobile edge network

The proliferation of technological advancement in the Internet of Things (IoT) and mobile devices accelerates the need for latency-sensitive multimedia applications. The network operator may charge application vendors to cache their content. Vendors risk losing their user base if users don’t receive the expected Quality of Service (QoS), which includes meeting specific delay thresholds for services like video on demand. While multiple content copies can enhance QoS by delivering content quickly, maintaining redundant copies is costly. Therefore, deploying edge servers at edge nodes and caching content is a prominent solution for application vendors. This approach guarantees lower latency, fewer content replicas, and reduced strain on backhaul links. However, the limited cache capabilities of individual edge nodes present challenges, such as efficiently allocating scarce resources to meet user demands. This work addresses the earlier challenges by formulating a cooperative content caching and forwarding problem by placing the various latency-sensitive content to minimize the total cost with resource and deadline constraints. The problem is formulated as an integer linear programming problem for cooperative caching in mobile edge networks to mitigate the total cost to the application vendors. In the absence of content popularity information, an online cooperative caching mechanism is presented to solve the dynamic content request and forwarding problem. Extensive simulations have been performed to illustrate that the proposed online algorithm significantly enhances the performance in terms of the total cost, load on the cloud, hit ratio, time utility, and cache utilization.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Wireless Networks
Wireless Networks 工程技术-电信学
CiteScore
7.70
自引率
3.30%
发文量
314
审稿时长
5.5 months
期刊介绍: The wireless communication revolution is bringing fundamental changes to data networking, telecommunication, and is making integrated networks a reality. By freeing the user from the cord, personal communications networks, wireless LAN''s, mobile radio networks and cellular systems, harbor the promise of fully distributed mobile computing and communications, any time, anywhere. Focusing on the networking and user aspects of the field, Wireless Networks provides a global forum for archival value contributions documenting these fast growing areas of interest. The journal publishes refereed articles dealing with research, experience and management issues of wireless networks. Its aim is to allow the reader to benefit from experience, problems and solutions described.
期刊最新文献
An EEG signal-based music treatment system for autistic children using edge computing devices A DV-Hop localization algorithm corrected based on multi-strategy sparrow algorithm in sea-surface wireless sensor networks Multi-Layer Collaborative Federated Learning architecture for 6G Open RAN Cloud-edge collaboration-based task offloading strategy in railway IoT for intelligent detection Exploiting data transmission for route discoveries in mobile ad hoc 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