[vc_empty_space][vc_empty_space]
Least Recently Frequently Used Replacement Policy Named Data Networking Approach
Putra M.A.P.a, Situmorang H.a, Syambas N.R.a
a School of Electrical Engineering and Informatics, Bandung Institute of Technology, Bandung, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2019 IEEE.Named Data Networking (NDN) is a new paradigm of a network by using Content-Centric Network (CCN) theory. NDN provides better network performance since the caching policy of the NDN router saving the content requested by the user and make it accessible by another user. The current popular replacing policy that adopted from TCP/IP network is Least Recently Used (LRU) and Least Frequency Used (LFU). However, in a low condition of cache size, both algorithms not powerful yet. In this paper, we evaluate replacement policy in NDN using Least Recently/Frequency Used (LRFU) compared with LRU algorithm. Moreover, our approach based on C++ programming language to simulate the LRFU caching policy in Named Data Networking. Overall results shows that LRFU replacement policy in NDN provides higher hit rate and lower miss rate. Based on 20000 generated interest, LRFU replacement policy achieve 3578 average hit which is 18.398% greater than LRU with average hit 3022. Based on miss rate LRFU replacement policy achieve 16391 miss rate which is 3.28% lower than LRU with 16948 miss rate.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Cache size,Caching policy,Content-centric networks,Least recently used,LRU algorithms,Named data networkings,Replacement policy,TCP/IP networks[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Content Store,LRFU,NDN,Replacement Policy[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/ICEEI47359.2019.8988828[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]