{"title":"Cache content placement in the presence of fictitious requests in mmWave 5G IAB networks","authors":"Fatemeh Sadat Hashemi Nazarifard , Zahra Rashidi , Vesal Hakami","doi":"10.1016/j.adhoc.2024.103563","DOIUrl":null,"url":null,"abstract":"<div><p>Caching popular content at the edge of wireless networks leads to backhaul congestion mitigation. To come up with an effective caching policy, content popularity distribution should be taken into account, which is not accurately known in most practical scenarios. Moreover, the mobile users’ (MU) request pattern may not always follow a well-defined distribution since some malicious MUs may deliberately issue their requests incompatible with the content popularity statistics. In this paper, we consider the problem of cache content placement in a 5G mmWave small cell network that relies on integrated access and backhaul (IAB) technology for pushing contents to MUs. We assume that the IAB node is equipped with a cache and has no prior knowledge about the content popularity profiles; instead, it only relies on the observation of the instantaneous demands to shape its caching policy. Also, malicious MUs may exist whose goals are to increase cache miss by issuing fictitious requests. The IAB node decides on which contents to cache and for how long, given that frequently replacing contents incurs administrative costs. We model the content placement problem as an ”adversarial combinatorial multi-armed bandit process with switching costs (ACMAB-SC)” and present an online learning algorithm for shaping the caching policy. We conduct extensive simulation experiments to evaluate the convergence property and assess the performance of our algorithm in terms of backhaul congestion, delay, and cache hit ratio. We also compare against two baseline online learning schemes, including a CMAB-based approach and a generic caching policy based on the ”Follow the Perturbed Leader (FPL)” algorithm.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524001744","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Caching popular content at the edge of wireless networks leads to backhaul congestion mitigation. To come up with an effective caching policy, content popularity distribution should be taken into account, which is not accurately known in most practical scenarios. Moreover, the mobile users’ (MU) request pattern may not always follow a well-defined distribution since some malicious MUs may deliberately issue their requests incompatible with the content popularity statistics. In this paper, we consider the problem of cache content placement in a 5G mmWave small cell network that relies on integrated access and backhaul (IAB) technology for pushing contents to MUs. We assume that the IAB node is equipped with a cache and has no prior knowledge about the content popularity profiles; instead, it only relies on the observation of the instantaneous demands to shape its caching policy. Also, malicious MUs may exist whose goals are to increase cache miss by issuing fictitious requests. The IAB node decides on which contents to cache and for how long, given that frequently replacing contents incurs administrative costs. We model the content placement problem as an ”adversarial combinatorial multi-armed bandit process with switching costs (ACMAB-SC)” and present an online learning algorithm for shaping the caching policy. We conduct extensive simulation experiments to evaluate the convergence property and assess the performance of our algorithm in terms of backhaul congestion, delay, and cache hit ratio. We also compare against two baseline online learning schemes, including a CMAB-based approach and a generic caching policy based on the ”Follow the Perturbed Leader (FPL)” algorithm.
期刊介绍:
The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to:
Mobile and Wireless Ad Hoc Networks
Sensor Networks
Wireless Local and Personal Area Networks
Home Networks
Ad Hoc Networks of Autonomous Intelligent Systems
Novel Architectures for Ad Hoc and Sensor Networks
Self-organizing Network Architectures and Protocols
Transport Layer Protocols
Routing protocols (unicast, multicast, geocast, etc.)
Media Access Control Techniques
Error Control Schemes
Power-Aware, Low-Power and Energy-Efficient Designs
Synchronization and Scheduling Issues
Mobility Management
Mobility-Tolerant Communication Protocols
Location Tracking and Location-based Services
Resource and Information Management
Security and Fault-Tolerance Issues
Hardware and Software Platforms, Systems, and Testbeds
Experimental and Prototype Results
Quality-of-Service Issues
Cross-Layer Interactions
Scalability Issues
Performance Analysis and Simulation of Protocols.