Abstract | ||
---|---|---|
The deployment of caches in the Internet has grown significantly in the last decade, thus enabling the vision of Content-Centric Networks (CCNs). The caching policy employed at these routers has significant impact on the potential gains in network performance. Policies that adapt to changes in content popularities are of special interest. In this paper, we propose a novel caching policy called Data Stream Caching Algorithm (DSCA) with the goal of maximizing cache hit rate of CCN routers by incorporating content popularity in caching decisions. In contrast to existing popularity-based caching policies, DSCA copes with dynamics in content popularity while operating under the memory and high processing rate constraints of CCN network routers. DSCA achieves the above objectives using a data streaming algorithm that identifies the most popular contents adapted to work in a windowed manner. We analyze the performance and robustness of the proposed caching policy through simulations. Evaluations on synthetic data and real-world traces show that DSCA outperforms LRU and other caching policies evaluated in this work. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1145/2836183.2836191 | CCDWN@CoNEXT |
Field | DocType | Citations |
Data mining,Computer science,Data stream | Conference | 2 |
PageRank | References | Authors |
0.41 | 9 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Antonio Augusto de Aragão Rocha | 1 | 2 | 0.75 |
Mostafa Dehghan | 2 | 2 | 0.75 |
Theodoros Salonidis | 3 | 1247 | 93.31 |
Ting He | 4 | 716 | 44.82 |
Don Towsley | 5 | 18693 | 1951.05 |