Fast convergence caching replacement algorithm based on dynamic
classification for content-centric networks

doi:10.1016/S1005-8885(13)60088-6

中国邮电高校学报(英文) ›› 2013, Vol. 20 ›› Issue (5): 45-50.doi: 10.1016/S1005-8885(13)60088-6

Fast convergence caching replacement algorithm based on dynamic classification for content-centric networks

方超,黄韬,刘江,刘韵洁

Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China

收稿日期:2013-03-19 修回日期:2013-06-05 出版日期:2013-10-30 发布日期:2013-10-29
通讯作者: 方超 E-mail:fangchao@bupt.edu.cn
基金资助:
This work was supported by the National Basic Research Program of China (2012CB315801, 2011CB302901), the Fundamental Research Funds for the Central Universities (2013RC0113).

Fast convergence caching replacement algorithm based on dynamic classification for content-centric networks

Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2013-03-19 Revised:2013-06-05 Online:2013-10-30 Published:2013-10-29
Contact: fang chao E-mail:fangchao@bupt.edu.cn
Supported by:
This work was supported by the National Basic Research Program of China (2012CB315801, 2011CB302901), the Fundamental Research Funds for the Central Universities (2013RC0113).

摘要/Abstract

摘要： One of the key research fields of content-centric networking (CCN) is to develop more efficient cache replacement policies to improve the hit ratio of CCN in-network caching. However, most of existing cache strategies designed mainly based on the time or frequency of content access, can not properly deal with the problem of the dynamicity of content popularity in the network. In this paper, we propose a fast convergence caching replacement algorithm based on dynamic classification method for CCN, named as FCDC. It develops a dynamic classification method to reduce the time complexity of cache inquiry, which achieves a higher caching hit rate in comparison to random classification method under dynamic change of content popularity. Meanwhile, in order to relieve the influence brought about by dynamic content popularity, it designs a weighting function to speed up cache hit rate convergence in the CCN router. Experimental results show that the proposed scheme outperforms the replacement policies related to least recently used (LRU) and recent usage frequency (RUF) in cache hit rate and resiliency when content popularity in the network varies.

关键词: CCN, cache replacement policy, dynamic classification, fast convergence, category popularity

Abstract: One of the key research fields of content-centric networking (CCN) is to develop more efficient cache replacement policies to improve the hit ratio of CCN in-network caching. However, most of existing cache strategies designed mainly based on the time or frequency of content access, can not properly deal with the problem of the dynamicity of content popularity in the network. In this paper, we propose a fast convergence caching replacement algorithm based on dynamic classification method for CCN, named as FCDC. It develops a dynamic classification method to reduce the time complexity of cache inquiry, which achieves a higher caching hit rate in comparison to random classification method under dynamic change of content popularity. Meanwhile, in order to relieve the influence brought about by dynamic content popularity, it designs a weighting function to speed up cache hit rate convergence in the CCN router. Experimental results show that the proposed scheme outperforms the replacement policies related to least recently used (LRU) and recent usage frequency (RUF) in cache hit rate and resiliency when content popularity in the network varies.

Key words: CCN, cache replacement policy, dynamic classification, fast convergence, category popularity

FANG Chao HUANG Tao LIU Jiang CHEN Jian-ya LIU Yun-jie. Fast convergence caching replacement algorithm based on dynamic classification for content-centric networks [J]. Acta Metallurgica Sinica(English letters), 2013, 20(5): 45-50.

参考文献

1. Anand A, Muthukrishnan C, Akella A, et al. Redundancy in network traffic: findings and implications. Proceedings of the 8th International Joint Conference on Measurement and Modeling of Computer Systems (SIGMETRICS’09), Jun 15-19, 2009, Seattle, WA, USA. New York, NY, USA: ACM, 2009: 37-48

2. Ahlgren B, Dannewitz C, Imbrenda C, et al. A survey of information-centric networking. IEEE Communications Magazine, 2012, 50(7): 26-36

3. Paul S, Pan J, Jain R. Architectures for the future networks and the next generation Internet: a survey. Elsevier Computer Communications, 2011, 34(1): 2-42

4. Van J, Diana K S, Nicholas H B, et al. Networking named content. Proceedings of the ACM Conference on Emerging Networking Experiments and Technologies (CoNEXT’09), Dec 1-4, 2009, Rome, Italy. New York, NY, USA: ACM, 2009: 12p

5. Psaras I, Landa R, Pavlou G, et al. Modelling and evaluation of CCN-caching trees. Proceedings of the 10th International IFIP TC 6 Conference on Networking (IFIP Networking’11), May 9-13, 2011, Valencia, Spain. Berlin, Germany: Springer-Verlag, 2011: 78-91

6. Carofiglio G, Gehlen V, Perino D. Experimental evaluation of storage management in content-centric networking. Proceedings of the IEEE International Conference on Communications (ICC’11), Jun 5-9, 2011, Kyoto, Japan. Piscataway, NJ, USA: IEEE, 2011: 6p

7. Carofiglio G, Gallo M, Muscariello L, et al. Modeling data transfer in content-centric networking. Proceedings of the 23rd International Teletraffic Congress (ITC’11), Sep 6-9, 2.011, San Francisco, CA, USA. Piscataway, NJ, USA: IEEE, 2011: 111-118

8. Wong W, Giraldi M, Kangasharju J, et al. Content routers: fetching data on network path. Proceedings of the IEEE International Conference on Communications (ICC’11), Jun 5-9, 2011, Kyoto, Japan. Piscataway, NJ, USA: IEEE, 2011: 6p

9. Li Z, Simon G. Time-shited TV in content centric networks: the case for cooperative in-network caching. Proceedings of the IEEE International Conference on Communications (ICC’11), Jun 5-9, 2011, Kyoto, Japan. Piscataway, NJ, USA: IEEE, 2011: 6p

10. Podlipnig S, Boszormenyi L. A Survey of Web cache replacement strategies. ACM Computing Surveys , 2003, 35(4): 374-398

11. Lee D, Choi J, Noh S H, et al. LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Transactions on Computers, 2001, 50(12): 135-136

12. Kang S J, Lee S W, Ko Y B. A recent popularity based dynamic cache management for content centric networking. Proceedings of the 4th International Conference on Ubiquitous and Future Networks (ICUFN’12), Jul 4-6, 2012, Phuket, Thailand. Piscataway, NJ, USA: IEEE, 2012: 219-224

13. Yia C, Afanasyevb A, Moiseenkob I, et al. A case for stateful forwarding plane. Computer Communications, 2013, 36(7): 779-791

14. Breslau L, Cao P, Phillips G, et al. Web caching and zipf-like distributions: evidence and implications. Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’99), Mar 21-25, 1999, New York, USA. Piscataway, NJ, USA: IEEE, 1999: 126-134

15. Rosensweig E J, Kurose J, Towsley D. Approximate models for general cache networks. Proceedings of the 29th Annual Joint Conference of the IEEE Computer and Communications (INFOCOM’10), Mar 14-19, 2010, San Diego, CA, USA. Piscataway, NJ, USA: IEEE, 2010: 9p

16. Li Z, Simon G, Gravey A. Caching policies for in-network caching. Proceedings of the 21st International Conference on Computer Communications and Networks (ICCCN’12), Jul 30-Aug 2, 2012, Munich, Germany. Piscataway, NJ, USA: IEEE, 2012: 7p

17. Xie H, Shi G, Wang P. TECC: towards collaborative in-network caching guided by traffic engineering. Proceedings of the 31st Annual Joint Conference of the IEEE Computer and Communications (INFOCOM’12), Mar 25-30, 2012, Orlando, FL, USA. Piscataway, NJ, USA: IEEE, 2012: 2546-2550

18. Li J, Wu H, Liu B, et al. Popularity-driven coordinated caching in named data networking. Proceedings of the 8th ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS’12), Oct 29-30, 2012, Austin, TX, USA. New York, NY, USA: ACM, 2012: 15-26

Fast convergence caching replacement algorithm based on dynamic classification for content-centric networks

Fast convergence caching replacement algorithm based on dynamic classification for content-centric networks

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics

本文评价