基于內容流行度和節(jié)點中心度匹配的信息中心網絡緩存策略
doi: 10.11999/JEIT150626
基金項目:
國家自然科學基金(61302078, 61372108)，國家863計劃(2011AA01A102)，國家科技重大專項(2011ZX03005-004-02)，北京高等學校青年英才計劃項目(YETP0476)
Popularity and Centrality Based Selective Caching Scheme for Information-centric Networks
Funds:
The National Natural Science Foundation of China (61302078, 61372108), The National 863 Program of China (2011AA01A102), The National ST Major Project (2011ZX 03005-004-02), Beijing Higher Education Young Elite Teacher Project (YETP0476)
-
摘要: 在信息中心網絡(Information-Centric Network, ICN)中，利用網絡內置緩存提高內容獲取及傳輸效率是該網絡構架最重要的特性。然而，網絡內置的緩存存在應對大量的需要轉發(fā)的內容時能力相對弱小，對內容放置缺乏均衡分布的問題。該文提出基于內容流行度和節(jié)點中心度匹配的緩存策略(Popularity and Centrality Based Caching Scheme, PCBCS)，通過對經過的內容進行選擇性緩存來提高內容分發(fā)沿路節(jié)點的緩存空間使用效率，減少緩存冗余。仿真結果表明，該文提出的算法和全局沿路緩存決策方案，LCD(Leave Copy Down)以及參數為0.7及0.3的Prob(copy with Probability)相比較，在服務器命中率上平均減少30%，在命中緩存內容所需的跳數上平均減少20%，最重要的是，和全局沿路緩存決策方案相比總體緩存替換數量平均減少了40%。Abstract: Information-Centric Network (ICN) architectures seek to provide the necessary foundations for a more cost-efficient content acquirement and content distribution using universal in-network caching, also universal in-network caching is a key design principle of many such architectures. Given that caching capacity of ICN is relatively small in comparison to the amount of forwarded content, a key aspect is balanced distribution of content among the available caches. The in-network caching resolution scheme is proposed in this paper, based on content popularity and nodes centrality, called PCBCS. It reduces caching redundancy and in turn, make more efficient utilization of available cache resources along a delivery path through selective caching of content passing. The proposed algorithm is compared with universal on-path caching and Leave Copy Down (LCD), also Prob (copy with probability) scheme with parameter of 0.7 and 0.3. The results show reduction of up to 30% in server hits, and up to 20% in the number of hops required to hit cached contents, but, most importantly, reduction of cache replacements up to 40% in comparison to universal caching.
-
張國強, 李楊, 林濤, 等. 信息中心網絡中的內置緩存技術研究[J]. 軟件學報, 2014, 25(1): 154-175. doi: 10.13328/j.cnki. jos.004494. ZHANG Guo-qiang, LI Yang, LIN Tao, et al. Survey of in-network caching techniques in information-centric networks[J]. Journal of Software, 2014, 25(1): 154-175. doi: 10.13328/j.cnki.jos.004494. KUROSE J. Information-centric networking: The evolution from circuits to packets to content[J]. Computer Networks, 2014, 66: 112-120. TANG X and CHANSON S T. Coordinated en-route Web caching[J]. IEEE Transactions on Computers, 2002, 51(6): 595-607. WANG S, BI J, and WU J. Collaborative caching based on hash-routing for information-centric networking[C]. Proceedings of the 2013 ACM SIGCOMM, Hong Kong, 2013: 535-536. PAVIOU G, PSARAS I, and WEI K C. Probabilistic in-network caching for information-centric networks[C]. Proceedings of ACM SIGCOMM ICN Workshop, Helsinki, 2012: 55-60. 崔現東, 劉江, 黃韜, 等. 基于節(jié)點介數和替換率的內容中心網絡網內緩存策略[J]. 電子與信息學報, 2014, 36(1): 1-7. doi: 10.3724/SP.J.1146.2013.00503. CUI Xiandong, 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. doi: 10.3724/SP.J.1146.2013.00503. HU Q, WU M, WANG D, et al. Lifetime-based greedy caching approach for content-centric networking[C]. 21st International Conference on Telecommunications, Lisbon, 2014: 426-430. 葛國棟, 郭云飛, 劉彩霞. 內容中心網絡中面向隱私保護的協(xié)作緩存策略[J]. 電子與信息學報, 2015, 37(5): 1220-1226. doi. 10.11999/JEIT140874. GE Guodong, GUO Yunfei, LIU Caixia, et al. A collaborative caching strategy for privacy protection in content centric networking[J]. Journal of Electronics Information Technology, 2015, 37(5): 1220-1226. doi: 10.11999/ JEIT140874. 朱軼, 糜正琨, 王文鼐等. 一種基于內容流行度的內容中心網絡緩存概率置換策略[J]. 電子與信息學報, 2013, 35(6): 1305-1310. doi: 10.3724/SP.J.1146.2012.01143. ZHU Yi, MI Zhengkun, WANGg Wennai, et al. A cache probability replacement policy based on content popularity in content centric networks[J]. Journal of Electronics Information Technology, 2013, 35(6): 1305-1310. doi. 10.3724/SP.J1146.2012.01143. MING Z X, XU M W, and WANG D. Age-based cooperative caching in information-centric networks[C]. IEEE INFOCOM Workshop on Emerging Design Choices in Name-oriented Networking, Orlando, USA, 2012: 268-273. LEET D. On the existence of a spectrum of policies that subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) policies[C]. Proceedings of the 1999 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Atlanta, 1999: 134-143. CHE H, TUNG Y, and WANG Z. Hierarchical Web caching systems: Modeling, design and experimental results[J]. IEEE Selected Areas in Communications, 2012, 20(7): 1305-1314. TRAVERSO S, AHMED M, GATETTO M, et al. Temporal locality in today's content caching: Why it matters and how to model it[J]. ACM SIGCOMM Computer Communications Review, 2013, 43(5): 5-12. KARYPIS G, HAN E H, and KUMAR V. CHAMELEON: Hierarchical clustering algorithm using dynamic modeling[J]. IEEE Computer, 1999, 32(8): 68-75. AFANASYEV A, MOISEENKO I, and ZHANG L. ndnSIM: NDN Simulator for NS-3[R]. University of California Technical Report, 2012. -
計量
- 文章訪問數: 1586
- HTML全文瀏覽量: 175
- PDF下載量: 1005
- 被引次數: 0
下載:
