Abstract
With the widespread growth of mass content, information-centric networks (ICN) have become one of the research hotspots of future network architecture. One of the important features of ICN is ubiquitous in-network caching. In recent years, the explosive growth of mobile devices has brought content dynamics, which poses a new challenge to the original ICN caching mechanism. This paper focuses on the WiFi mobile scenario of ICN. We design a new path-associated active caching scheme to shorten the time delay of users obtaining content to enhance the user experience. In this article, based on the WiFi scenario, we first propose a solution for neighbor access point selection from a theoretical perspective, considering the caching cost and transition probability. The cache content is then forwarded based on the selected neighbor set. For cached content, we propose content freshness according to mobile characteristics and consider content popularity at the same time. For cache nodes, we focus on the size of the remaining cache space and the number of hops from the cache to the user. We have implemented this strategy based on the value of caching on the forwarding path. The simulation results show that our caching strategy has a significant improvement in performance compared with active caching and other caching strategies.
Highlights
BGP can be used for inter-domain routing, networks disconnected due to mobility and variable link conditions are supported by local storage optimization, the storage-aware routing mechanism can be adopted at the intra-domain level
Many researchers have designed a new type of information-centric networks (ICN) network architecture to naturally support mobility, when mobile consumers move to a new location before receiving the requested content, the delay in receiving the requested data will increase
We apply its idea to our scenario and design a caching mechanism based on content value and node importance
Summary
With the rapid growth of Internet information, the demand of users has changed from communication between hosts to the access of host and network information. We dynamically pull the content in advance to the forwarding path from the source AP to the destination AP through a collaborative caching algorithm based on the freshness and popularity of the content to reduce network delay and improve user experience. The main contributions of this article are as follows: We propose a caching mechanism for neighbor message propagation based on user behavior This mechanism selects the target AP set according to the transition probability table and the transition threshold of the source AP and triggers active caching when the user moves. AP, our idea is to make full use of the forwarding path from the source AP to the destination AP and cache content with high freshness and popularity in high-value nodes This idea ensures the cache hit rate while using the limited network equipment space and reduces the network delay.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
