內(nèi)容中心網(wǎng)絡(luò)中基于內(nèi)容遷移的協(xié)作緩存機(jī)制
doi: 10.11999/JEIT150399 cstr: 32379.14.JEIT150399
-
2.
(中南大學(xué)信息科學(xué)與工程學(xué)院 長沙 410083) ②(中南大學(xué)湘雅醫(yī)學(xué)院 長沙 410013) ③(湖南警察學(xué)院信息技術(shù)系 長沙 410138) ④(湖南商學(xué)院計(jì)算機(jī)與信息工程學(xué)院 長沙 410205)
基金項(xiàng)目:
國家自然科學(xué)基金(61402541, 61103204)
Cooperative Caching Mechanism with Content Migration in Content-centric Networking
-
2.
(School of Information Science and Engineering, Central South University, Changsha 410083, China)
Funds:
The National Natural Science Foundation of China (61402541, 61103204)
-
摘要: 內(nèi)容中心網(wǎng)絡(luò)(CCN)是為了適應(yīng)未來網(wǎng)絡(luò)通信模式的轉(zhuǎn)變，提供對(duì)可擴(kuò)展和高效內(nèi)容獲取的原生支持而提出一種新型的網(wǎng)絡(luò)體系架構(gòu)，內(nèi)容緩存機(jī)制是其研究的關(guān)鍵問題之一?，F(xiàn)有機(jī)制在緩存節(jié)點(diǎn)的選擇時(shí)往往過于集中，緩存負(fù)載分布嚴(yán)重不均，大大降低了網(wǎng)絡(luò)資源利用率以及系統(tǒng)的緩存性能。該文提出一種基于緩存遷移的協(xié)作緩存機(jī)制，首先在緩存節(jié)點(diǎn)選擇時(shí)考慮節(jié)點(diǎn)的中心性保證內(nèi)容盡可能緩存在位置更重要的節(jié)點(diǎn)。同時(shí)，在緩存壓力過大時(shí)，通過可用緩存空間大小、緩存替換率以及網(wǎng)絡(luò)連接的穩(wěn)定性等信息選擇合適的鄰居節(jié)點(diǎn)進(jìn)行緩存內(nèi)容的轉(zhuǎn)移，充分利用鄰居資源實(shí)現(xiàn)負(fù)載分擔(dān)。仿真結(jié)果表明該機(jī)制能有效地改善緩存負(fù)載在節(jié)點(diǎn)上分布的均衡性，提高緩存命中率和緩存資源利用率并降低平均接入代價(jià)。
-
關(guān)鍵詞:
- 內(nèi)容中心網(wǎng)絡(luò) /
- 協(xié)作緩存 /
- 負(fù)載均衡 /
- 內(nèi)容遷移
Abstract: Content-Centric Networking (CCN) is a new Internet architecture with native support for scalable and efficient content acquisition, which is proposed to accommodate the changes in future communication mode. Content caching is one of the key issues in CCN. In some existing work, the choice of caching nodes is over-focused on few special nodes, which results in an uneven distribution of cached contents. It greatly decreases the utilization of network resources and impairs the overall caching performance. In this paper, a Cooperative Caching Mechanism with Content Migration (CCMCM) is proposed. In this scheme, the centrality of node is considered in the selection of caching nodes to ensure that contents can be cached in the more important nodes as much as possible. When the cached contents are extensive, the caching node can transfer some contents to the appropriate neighbor according to the cache space available, the cache replacement rate and the connection stability between nodes. The aim is to fully utilize the resource of neighbor nodes and achieve effective load distribution. Simulation results show that the proposed scheme improves the load balance among caching nodes, increases the resource utilization and achieves high cache hit rate with low average access cost.-
Key words:
- Content-Centric Networking (CCN) /
- Cooperative caching /
- Load balance /
- Content migration
-
Koponen T, Chawla M, Chun B G, et al.. A data-oriented (and beyond) network architecture[J]. ACM SIGCOMM Computer Communication Review, 2007, 37(4): 181-192. Ahlgren B, Dannewitz C, Imbrenda C, et al.. A survey of information-centric networking[J]. IEEE Communications Magazine, 2012, 50(7): 26-36. Jacobson V, Smetters D K, Thornton J D, et al.. Networking named content[J]. Communications of the ACM, 2012, 55(1): 117-124. Laoutaris N, Syntila S, and Stavrakakis I. Meta algorithms for hierarchical web caches[C]. Proceedings of the IEEE International Performance Computing and Communications Conference (IEEE IPCCC), Phoenix, 2004: 445-452. Cho K, Lee M, Park K, et al.. WAVE: popularity-based and collaborative in-network caching for contentoriented networks[C]. Proceedings of the IEEE INFOCOM Workshop on NOMEN, Orlando, FL, 2012: 316-321. Ming Z, Xu M, and Wang D. Age-based cooperative caching in information-centric network[C]. Proceedings of the 23rd International Conference on Computer Communication and Networks (ICCCN), Shanghai, 2014: 1-8. 葛國棟, 郭云飛, 劉彩霞, 等. 命名數(shù)據(jù)網(wǎng)絡(luò)中基于內(nèi)容請(qǐng)求相關(guān)性的協(xié)作緩存算法[J]. 電子與信息學(xué)報(bào), 2014, 36(12): 2795-2801. Ge Guo-dong, Guo Yun-fei, Liu Cai-xia, et al.. Collaborative caching algorithm based on request correlation in named data networking[J]. Journal of Electronics Information Technology, 2014, 36(12): 2795-2801. Wang L, Bayhan S, and Kangasharju J. Optimal chunking and partial caching in information-centric networks[J]. Computer Communications, 2015, 61: 48-57. Qian H, Muqing W, Dongyang W, et al.. Lifetime-based greedy caching approach for content-centric networking[C]. Proceedings of the 21st International Conference on Telecommunications (ICT), Lisbon, Portugal, 2014: 426-430. Chai W K, He D, Psaras I, et al.. Cache less for more in information-centric networks (extended version)[J]. Computer Communications, 2013, 36(7): 758-770. Psaras I, Chai W K, and Pavlou G. Probabilistic in-network caching for information-centric networks[C]. Proceedings of the Second Edition of the ICN Workshop on Information- centric Networking, Helsinki, Finland, 2012: 55-60. 崔現(xiàn)東, 劉江, 黃韜, 等. 基于節(jié)點(diǎn)介數(shù)和替換率的內(nèi)容中心網(wǎng)絡(luò)網(wǎng)內(nèi)緩存策略[J]. 電子與信息學(xué)報(bào), 2014, 36(1): 1-7. Cui Xian-dong, Liu Jiang, Huang Tao, et al.. A novel in-network caching scheme based on betweenness and replacement rate in content centric networking[J]. Journal of Electronics Information Technology, 2014, 36(1): 1-7. -
計(jì)量
- 文章訪問數(shù): 1311
- HTML全文瀏覽量: 155
- PDF下載量: 680
- 被引次數(shù): 0
下載:
