{"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}
引用次数: 0
Abstract
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.
期刊介绍:
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.