The Community for Technology Leaders
2014 IEEE 39th Conference on Local Computer Networks (LCN) (2014)
Edmonton, AB, Canada
Sept. 8, 2014 to Sept. 11, 2014
ISBN: 978-1-4799-3778-3
pp: 99-106
Saran Tarnoi , Dept. of Inf., Grad. Univ. for Adv. Studies, Tokyo, Japan
Kalika Suksomboon , KDDI R&D Labs. Inc., Saitama, Japan
Wuttipong Kumwilaisak , King Mongkut's Univ. of Technol. Thonburi, Bangkok, Thailand
Yusheng Ji , Dept. of Inf., Grad. Univ. for Adv. Studies, Tokyo, Japan
ABSTRACT
The Content-Centric Networking (CCN) architecture exploits a universal caching strategy whose inefficiency has been confirmed by research communities. Various caching schemes have been proposed to overcome some drawbacks of the universal caching strategy but they come with additional complexity and overheads. Besides those sophisticated caching schemes, there is a probabilistic caching scheme that is more efficient than the universal caching strategy and adds a modest complexity to a network. The probabilistic caching scheme was treated as a benchmark and the insights into its behavior have never been studied despite its promising performance and feasibility in practical use. In this paper we study the probabilistic caching scheme by means of computer simulation to explore the behavior of the probabilistic caching scheme when it works with various cache replacement policies. The simulation results show the different behavioral characteristics of the probabilistic caching scheme as a function of the cache replacement policy.
INDEX TERMS
Probabilistic logic, Servers, Network topology, Sociology, Statistics, Simulation, Routing
CITATION

S. Tarnoi, K. Suksomboon, W. Kumwilaisak and Yusheng Ji, "Performance of probabilistic caching and cache replacement policies for Content-Centric Networks," 2014 IEEE 39th Conference on Local Computer Networks (LCN), Edmonton, AB, Canada, 2014, pp. 99-106.
doi:10.1109/LCN.2014.6925761
91 ms
(Ver 3.3 (11022016))