@inproceedings{55b8bc1751aa43a1a17ca5dc347bc9b2,
title = "Research on Cache Placement in ICN",
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.",
keywords = "Cache placement, Group multicast, ICN, Link cost, Steiner tree",
author = "Yu Zhang and Yangyang Li and Ruide Li and Wenjing Sun",
note = "Publisher Copyright: {\textcopyright} 2018, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.; 2nd International Conference on Machine Learning and Intelligent Communications, MLICOM 2017 ; Conference date: 05-08-2017 Through 06-08-2017",
year = "2018",
doi = "10.1007/978-3-319-73447-7\_65",
language = "English",
isbn = "9783319734460",
series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",
publisher = "Springer Verlag",
pages = "603--611",
editor = "Bo Li and Xuemai Gu and Gongliang Liu",
booktitle = "Machine Learning and Intelligent Communications - Second International Conference, MLICOM 2017, Proceedings",
address = "Germany",
}