Abstract
Information-Centric Networking (ICN) is gaining increasingly momentum, as an important direction of the future Internet architecture research. To study the impact of various cache policies on the overall performance of ICN network, we formulate the in-network caching problem of ICN into Mixed-Integer Linear Programming problem. Via analyzing the properties of the optimal cache assignment, we explore the impacts of the frequency and distance factors on cache policy performance. Furthermore, we design a novel cache policy named Least Benefit (LB), which takes into account the distance factor besides frequency. Through extensive simulations, we compare the performance of a variety of cache policies under various scenarios and configurations. It is found that LB outperforms a series of cache policies in terms of average hop number to get content.
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.
