A Cache Replication Strategy Based on Betweenness and Edge Popularity in Named Data Networking

被引:12
|
作者
Zheng, Quan [1 ]
Kan, Yuanzhi [1 ]
Chen, Jiebo [1 ]
Wang, Song [2 ]
Tian, Hongliang [3 ]
机构
[1] Univ Sci & Technol China, Lab Future Networks, Hefei, Anhui, Peoples R China
[2] Univ Sci & Technol China, Dept Automat, Hefei, Anhui, Peoples R China
[3] ZTE Shanghai, R&D Ctr, Shanghai, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Named Data Networking; Caching; Node centrality; Popularity; Cache decision; Network edge; Cache replication strategy;
D O I
10.1109/icc.2019.8761900
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Caching content in routers is the most significant feature of Named Data Networking (NDN) and therefore the cache performance is increasingly being concerned for NDN deployment. The default cache policy of NDN is Leave Copy Everywhere (LCE) that leaves the copies in each node the data packet passed, and most of the copies will not be requested again, which leads to the waste of cache resources. The Betweenness Strategy caches data in the node with the maximal betweenness value, which causes a high replacement rate. Considering the betweenness of nodes and the popularity of content, as well as the filter effect of cache, we propose Betweenness and Edge Popularity strategy (BEP) which caches the most popular content in the most important nodes. We also conduct comprehensive simulations based on ndnSIM. By evaluating BEP and other cache replication strategies on a virtual topology, it is indicated that BEP can achieve higher performance in terms of the cache hit ratio, server load and average delay.
引用
收藏
页数:7
相关论文
共 50 条
  • [1] A Cache Placement Strategy Based on Compound Popularity in Named Data Networking
    Gui, Yiqi
    Chen, Yongkang
    IEEE ACCESS, 2020, 8 : 196002 - 196012
  • [2] Detection and Defense of Cache Pollution Based on Popularity Prediction in Named Data Networking
    Yao, Lin
    Zeng, Yujie
    Wang, Xin
    Chen, Ailun
    Wu, Guowei
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (06) : 2848 - 2860
  • [3] Popularity based Probabilistic Caching Strategy Design for Named Data Networking
    Zhang, Ran
    Liu, Jiang
    Huang, Tao
    Xie, Renchao
    2017 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2017, : 476 - 481
  • [4] A Cache Invalidation Strategy Based on Publish/Subscribe for Named Data Networking
    Kan, Yuanzhi
    Zheng, Quan
    Yang, Jian
    Tan, Xiaobin
    IEEE ACCESS, 2020, 8 : 80074 - 80085
  • [5] Dynamic Popularity-Based Caching Permission Strategy for Named Data Networking
    Yu, Meiju
    Li, Ru
    PROCEEDINGS OF THE 2018 IEEE 22ND INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN ((CSCWD)), 2018, : 576 - 581
  • [6] Towards a novel cache replacement strategy for Named Data Networking based on Software Defined Networking
    Kalghoum, Anwar
    Gammar, Sonia Mettali
    Saidane, Leila Azouz
    COMPUTERS & ELECTRICAL ENGINEERING, 2018, 66 : 98 - 113
  • [7] Cache based on Popularity and Class in Mobile Named Data Network
    Yoyita, Leanna Vidya
    Syambas, Nana Rachmana
    Edward, Ian Yosef Matheus
    2019 IEEE ASIA PACIFIC CONFERENCE ON WIRELESS AND MOBILE (APWIMOB), 2019, : 105 - 111
  • [8] CAPIC : Cache based on Popularity and Class in Named Data Network
    Yovita, Leanna Vidya
    Syambas, Nana Rachmana
    Edward, Ian Yosef Matheus
    2018 INTERNATIONAL CONFERENCE ON CONTROL, ELECTRONICS, RENEWABLE ENERGY AND COMMUNICATIONS (ICCEREC), 2018, : 24 - 29
  • [9] A Cache Placement Strategy Based on Entropy Weighting Method and TOPSIS in Named Data Networking
    Gui, Yiqi
    Chen, Yongkang
    IEEE ACCESS, 2021, 9 : 56240 - 56252
  • [10] Popularity-based Congestion Control in Named Data Networking
    Park, Heungsoon
    Jang, Hoseok
    Kwon, Taewook
    2014 SIXTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS (ICUFN 2014), 2014, : 166 - 171