[vc_empty_space][vc_empty_space]
A simulation of cache replacement strategy on named data network
Situmorang H.a, Syambas N.R.a, Juhana T.a, Matheus Edward I.Y.a
a School of Electrical Engineering and Informatics, Bandung Institute of Technology, 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]© 2018 IEEE.NDN (Named Data Networking) as one approach of the Content-Centric Networking (CCN) architecture, proposed by Jacobson, 2006, conceptually, has some advantages compares to the current Internet technology which build based on host-To-host TCP/IP protocol stack. However, technically, we have to examine the NDN approach, beside to prove the concept, also to get as much as able the opportunities of improvement the concept before implementation stage. In this work, it has been compared two kinds of cache replacement policy. The policies that compared are the Least Recency Used (LRU) and Least Recency/Frequency Used (LRFU). In the first stage both of these policies implemented and then the performance comparison has been investigated. Based on the experiment, the LRFU policy outperform LRU policy with a limited cache size. As a consequence the LRFU has a time complexity higher than LRU. Finally, based on the simulation can be concluded that LRFU should be considered as cache replacement strategy on NDN instead of basic NDN cache policy, named as caching everything everywhere (CEE)[/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 replacement,Cache replacement policy,Content-centric networkings,Internet technology,LRFU,Named data networkings,Named data networks,Performance comparison[/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]cache replacement policy,LRFU,LRU,NDN[/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]Named Data Networking (NDN) is one of five projects funded by the U.S. National Science Foundation under its Future Internet Architecture Program. NDN has its roots in an earlier project, Content-Centric Networking (CCN), which Van Jacobson first publicly presented in 2006 [3]. NDN changes the semantics of network service from delivering the packet to a given destination address to fetching data identifed by a given name [3].[/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/TSSA.2018.8708796[/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]