Neighbor-Referencing Cooperative Cache Policy in Content-Centric Network
In-network caching is one of the key aspects of content-centric networks (CCN), while the cache replacement algorithm of LRU does not consider the relation between the cache contents and its neighbor nodes in the cache replacement process, which reduced the efficiency of the cache. In this paper, a...
Saved in:
Published in | Applied Mechanics and Materials Vol. 433-435; no. Advances in Mechatronics and Control Engineering II; pp. 1702 - 1708 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Zurich
Trans Tech Publications Ltd
15.10.2013
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In-network caching is one of the key aspects of content-centric networks (CCN), while the cache replacement algorithm of LRU does not consider the relation between the cache contents and its neighbor nodes in the cache replacement process, which reduced the efficiency of the cache. In this paper, a Neighbor-Referencing Cooperative Cache Policy (NRCCP) in CCN has been proposed to check whether the neighbors have cached the content. Node will cache the content while none of its neighbors has cached it, therefore reduce redundancy of cached content and increase the variety of contents. Simulation results show that NRCCP has better performance, as the network path had more caching ability and more content popularity densely distributed. |
---|---|
Bibliography: | Selected, peer reviewed papers from the 2013 2nd International Conference on Mechatronics and Control Engineering (ICMCE 2013), August 28-29, 2013, Guangzhou, China ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISBN: | 303785894X 9783037858943 |
ISSN: | 1660-9336 1662-7482 1662-7482 |
DOI: | 10.4028/www.scientific.net/AMM.433-435.1702 |