Staleness verification of caching data in ICN

ICN can be considered as a largely distributed caching architecture which requires a mechanism to verify staleness of data objects at caching points. However, this staleness issue has rarely been addressed in ICN literature previously. This paper discusses this issue and proposes staleness verification algorithms for ICN, named ICN PER and ICN_CB which provide a strong consistency and coherence of caching data object. Intensive simulations were carried out to demonstrate the behaviors of the algorithms. The results demonstrate that ICN_CB improves cache hit probability around 20% higher than ICN_PER, which reduces user side delay and network resource usage. In addition, ICN CB is a superior choice when a network involves with high data communication cost such as wireless networks.