From last few years, an exponential growth in content sharing among smart devices results in an extra burden on the underlying communication infrastructure. The traditional host-based architecture is not sufficient to serve the storage and access requests of such an enormous amount of content. Consequently, a more flexible, content-centric networking (CCN) approach was introduced which decouples the content from its physical location. In CCN architecture, each network device is capable of serving as data provider. However, network performance is constrained by the limited caching capacity of network devices. For efficient implementation of any solution, fast caching on each smart device is required. Hence, in this work, we propose a new Count-Min-Sketch based adaptive caching mechanism, which caches the content based upon content popularity and its distance from the requesting node with an aim to maximize the hit ratio and minimize the overall operational cost. We also propose the usage of Bloom Filter for storing the cached content and maintaining the routing table node for reduction of storage and access cost. The proposed scheme is evaluated with respect to the performance parameters where its performance is found superior in comparison to the existing competing schemes of its categories.
[1]
Jussi Kangasharju,et al.
Content-Centric Networking in the Internet of Things
,
2016,
2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC).
[2]
Nikolaos Laoutaris,et al.
The LCD interconnection of LRU caches and its analysis
,
2006,
Perform. Evaluation.
[3]
George Pavlou,et al.
In-Network Cache Management and Resource Allocation for Information-Centric Networks
,
2014,
IEEE Transactions on Parallel and Distributed Systems.
[4]
Bengt Ahlgren,et al.
A survey of information-centric networking
,
2012,
IEEE Communications Magazine.
[5]
Christian Esteve Rothenberg,et al.
The deletable Bloom filter: a new member of the Bloom family
,
2010,
IEEE Communications Letters.
[6]
Graham Cormode,et al.
Count-Min Sketch
,
2016,
Encyclopedia of Algorithms.
[7]
Dave Evans,et al.
How the Next Evolution of the Internet Is Changing Everything
,
2011
.
[8]
Burton H. Bloom,et al.
Space/time trade-offs in hash coding with allowable errors
,
1970,
CACM.