Compressed Sensing-Based Cached Content Locating for ICN
- 7 August 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (10) , 2020-2023
Abstract
Locating the cached content accurately and timely is critical for utilizing in-network storage in information-centric networks (ICN). However, an enormous number of cached contents and their volatility nature make it a challenge to collect and maintain a consistent view of the network cache information. In this letter, we propose a novel cached content locating mechanism for ICN, which jointly uses the bloom filter and compressed sensing to efficiently represent the cached contents and leverages the ability of centralized control of software-defined networking (SDN) to make the cache information consistent in the SDN controller. Simulation results show a large saving in announcement cost with a tolerable decrease in locating accuracy.Keywords
Funding Information
- Major International (Regional) Joint Research Project of NSFC (71620107003)
- National Science Foundation for Distinguished Young Scholars of China (71325002)
- National Natural Science Foundation of China (61572123)
- Program for Liaoning Innovative Research Term in University (LT2016007)
- MoE and China Mobile Joint Research Fund (MCM20160201)
This publication has 8 references indexed in Scilit:
- RISC: ICN routing mechanism incorporating SDN and community divisionComputer Networks, 2017
- DENA: An Intelligent Content Discovery System Used in Named Data NetworkingIEEE Access, 2016
- CPHR: In-Network Caching for Information-Centric Networking With Partitioning and Hash-RoutingIEEE/ACM Transactions on Networking, 2015
- Content discovery for information-centric networkingComputer Networks, 2015
- Group Testing Algorithms: Bounds and SimulationsIEEE Transactions on Information Theory, 2014
- Boolean compressed sensing: LP relaxation for group testing2012
- Compressed sensingIEEE Transactions on Information Theory, 2006
- Compressed Bloom filtersIEEE/ACM Transactions on Networking, 2002