Research Article
Research on Cache Placement in ICN
@INPROCEEDINGS{10.1007/978-3-319-73447-7_65, author={Yu Zhang and Yangyang Li and Ruide Li and Wenjing Sun}, title={Research on Cache Placement in ICN}, proceedings={Machine Learning and Intelligent Communications. Second International Conference, MLICOM 2017, Weihai, China, August 5-6, 2017, Proceedings, Part II}, proceedings_a={MLICOM}, year={2018}, month={2}, keywords={ICN Steiner tree Link cost Cache placement Group multicast}, doi={10.1007/978-3-319-73447-7_65} }- Yu Zhang
Yangyang Li
Ruide Li
Wenjing Sun
Year: 2018
Research on Cache Placement in ICN
MLICOM
Springer
DOI: 10.1007/978-3-319-73447-7_65
Abstract
Ubiquitous in-network caching is one of key features of Information Centric Network, together with receiver-drive content retrieval paradigm, Information Centric Network is better support for content distribution, multicast, mobility, etc. Cache placement strategy is crucial to improving utilization of cache space and reducing the occupation of link bandwidth. Most of the literature about caching policies considers the overall cost and bandwidth, but ignores the limits of node cache capacity. This paper proposes a G-FMPH algorithm which takes into account both constrains on the link bandwidth and the cache capacity of nodes. Our algorithm aims at minimizing the overall cost of contents caching afterwards. The simulation results have proved that our proposed algorithm has a better performance.