A Cache Invalidation Strategy Based on Publish/Subscribe for Named Data Networking

被引:4
|
作者
Kan, Yuanzhi [1 ,2 ]
Zheng, Quan [1 ,2 ,3 ]
Yang, Jian [1 ,2 ]
Tan, Xiaobin [1 ,2 ]
机构
[1] Univ Sci & Technol China, Dept Automat, Hefei 230022, Peoples R China
[2] Univ Sci & Technol China, Lab Future Networks, Hefei 230022, Peoples R China
[3] Univ Sci & Technol China, Inst Adv Technol, Hefei 230088, Peoples R China
关键词
Cache; consistency; invalidation; publish; subscribe; Named Data Networking;
D O I
10.1109/ACCESS.2020.2991053
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Named Data Networking (NDN) aims to improve the efficiency of data delivery for the Internet. One of the typical characteristics of NDN is ubiquitous caching, that is to say, each network participant in NDN is capable of caching contents. This caching feature is beneficial for enhancing the data availability but also raises a problem of cache consistency. In this paper, we propose a novel strategy of cache invalidation, called PIOR (Proactive Invalidation with Optional Renewing), to provide strong consistency for NDN. PIOR is based on a lightweight publish/subscribe model, actively publishing the updated contents to the router nodes to guarantee the copy validity. We also conceive customized publish/subscribe rules to relieve the unbearable burden on the server imposed by the excessive publishing traffic. The advantage of PIOR lies in simple deployment and compatibility, since the invalidation process of PIOR is independent of the inherent process of NDN. We conduct extensive simulations over a real topology to evaluate the achievable performance of PIOR. The simulation results show that PIOR is able to achieve a high hit ratio and low server load at the low cost of network management.
引用
收藏
页码:80074 / 80085
页数:12
相关论文
共 50 条
  • [31] Data Transmission Scheme Based on Publish/Subscribe in Workshop
    Yuan Tangxiao
    Fan Huafei
    Wang Huifen
    Adjallah, Kondo Hloindo
    Wang Zhouhang
    PROCEEDINGS OF THE 2019 10TH IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT DATA ACQUISITION AND ADVANCED COMPUTING SYSTEMS - TECHNOLOGY AND APPLICATIONS (IDAACS), VOL. 2, 2019, : 953 - 958
  • [32] New efficient caching strategy based on clustering in named data networking
    Fethellah N.E.H.
    Bouziane H.
    Chouarfia A.
    International Journal of Interactive Mobile Technologies, 2019, (12) : 104 - 119
  • [33] An Entropy-based Probabilistic Forwarding Strategy in Named Data Networking
    Lei, Kai
    Wang, Jiawei
    Yuan, Jie
    2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2015, : 5665 - 5671
  • [34] A cache invalidation strategy for mobile networks
    Safa, Haidar
    Artail, Hassan
    Nahhas, Mirna
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2010, 33 (02) : 168 - 182
  • [35] Probability-Based Adaptive Forwarding Strategy in Named Data Networking
    Qian, Haiyang
    Ravindran, Ravishankar
    Wang, Guo-Qiang
    Medhi, Deep
    2013 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2013), 2013, : 1094 - 1101
  • [36] 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
  • [37] Cache Management for Large Data Transfers in Named Data Networking using SDN
    Alhowaidi, Mohammad
    Nadig, Deepak
    Ramamurthy, Byrav
    13TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED NETWORKS AND TELECOMMUNICATION SYSTEMS (IEEE ANTS), 2019,
  • [38] Broadcast-based group invalidation: An energy-efficient cache invalidation strategy
    Tan, KL
    Cai, J
    INFORMATION SCIENCES, 1997, 100 (1-4) : 229 - 254
  • [39] A SELECTIVE INVALIDATION STRATEGY FOR CACHE COHERENCE
    PRETE, CA
    PRINA, G
    RICCIARDI, L
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (10) : 1316 - 1320
  • [40] Named data network dynamic cache placement strategy based on programmable data plane
    Hou, Saifeng
    Hu, Yuxiang
    Tian, Le
    IET NETWORKS, 2023, 12 (01) : 27 - 35