Optimizing Content Hit Rate On Named Data Network Using Multilevel Content Store

Authors

  • Muhammad Putra Pamungkas Politeknik Negeri Padang
  • Rostam Ahmad Efendi Politeknik Negeri Padang

DOI:

https://doi.org/10.62671/jataed.v1i2.44

Keywords:

NDN, Named Data Network, Content Store, Content Centric Network, Multilevel Caching, ndnSim

Abstract

The internet is a technology that allows users to exchange information more flexibly. As internet service users increase, communication not only between humans but also between machines (IoT), so does the need for internet access. With the architecture in use today, IP based network, Requires users to access the server / producer (of the content) to obtain the desired content. This architecture will meet with limitations where the density of network traffic will continue to increase. Named Data Network (NDN) is currently being developed as an internet supporting architecture which changes the interconnection paradigm that was previously address-based to the desired content/information. NDN which can support the needs of users to access content through the content caching feature. The content caching capability allows the router to store copies of content in memory for a specified period of time. So users who need content can simply access the closest source (content store). The scheme that is widely used in the content caching method is to place content in one large memory. This research develops a scheme where cache memory is divided into two levels (multilevel CS). The purpose of using multilevel CS is to improve the performance of the content store. Testing is done by comparing the single content store scheme and multilevel content store. The parameters tested are the hit rate, miss rate, and average content lifetime in the content store. As a test parameter is a large change in content store size, interest rate, topology grid size, and consumer deployment. From the simulation results, the 2-level content store scheme has better performance compared to conventional schemes.

References

Ahmed, S. H., Bouk, S. H., & Kim, D. (2016). Content-Centric Networks. Springer Singapore. https://doi.org/10.1007/978-981-10-0066-9

Almeida, F., & Lourenço, J. (2012). Information Centric Networks - Design Issues, Principles and Approaches. International Journal of Latest Trends in Computing, 3(3), 58–66.

APJII. (2018). Penetrasi & Profil Perilaku Pengguna Internet Indonesia. In Asosiasi Penyelenggara Jasa Internet Indonesia.

Bartolomeo, G., & Kovacikova, T. (2016). Identification and Management of Distributed Data. In Identification and Management of Distributed Data. CRC Press. https://doi.org/10.1201/b14966

Feldman, M., & Chuang, J. (2002). Service Differentiation in Web Caching and Content Distribution. IASTED International Conference on Communications and Computer Networks.

Hull, S. (2002). Web Servers, Cookies, and Web Caches. In Content Delivery Networks : Web Switching for Security, Availability, and Speed (1st ed., pp. 209–233). McGraw-Hill Companies, Inc. https://doi.org/10.1036/0072225467

Leiner, B. M., Cerf, V. G., Clark, D. D., Kahn, R. E., Kleinrack, L., Lynch, D. C., Postel, J., Roberts, L. G., & Wolff, S. (1997). A brief history of internet. In Internet Society. Internet Society.

Miao, F., Chen, D., & Jin, L. (2018). Multi-level plru cache algorithm for content delivery networks. Proceedings - 2017 10th International Symposium on Computational Intelligence and Design, ISCID 2017, 2018-Janua, 320–323. https://doi.org/10.1109/ISCID.2017.45

Moon, A. R., & Islam, S. M. R. (2016). Analysis of LCD(Leave Copy Down) &LCE(Leave Copy Everywhere) caching scheme for tree topology.

Putra, M. A. P. (2019). Analisis Performansi Replacement Policy dengan Algoritma Least Recently Frequently Used Pada Named Data Network. Institut Teknologi Bandung.

Reishi Kumaar, T., Sharma, A., & Bhaskar, M. (2017). Reference table based cache design using LRU replacement algorithm for Last Level Cache. IEEE Region 10 Annual International Conference, Proceedings/TENCON, 2219–2223. https://doi.org/10.1109/TENCON.2016.7848422

Shailendra, S., Sengottuvelan, S., Rath, H. K., Panigrahi, B., & Simha, A. (2017). Performance evaluation of caching policies in NDN-an ICN architecture. IEEE Region 10 Annual International Conference, Proceedings/TENCON, 1117–1121. https://doi.org/10.1109/TENCON.2016.7848182

Thomas Barnet, Jr., Jain, S., Andra, U., & Khurana, T. (2018). Cisco Visual Networking Index ( VNI ) Complete Forecast Update , 2017 – 2022.

Yovita, L. V., & Syambas, N. R. (2018a). Caching on named data network: A survey and future research. International Journal of Electrical and Computer Engineering, 8(6), 4456–4466. https://doi.org/10.11591/ijece.v8i6.pp.4456-4466

Yovita, L. V., & Syambas, N. R. (2018b). Content storage effect on the named data network traffic load. Proceeding of 2017 11th International Conference on Telecommunication Systems Services and Applications, TSSA 2017, 2018-Janua, 1–5. https://doi.org/10.1109/TSSA.2017.8272941

Zhang, L., Afanasyev, A., Burke, J., Jacobson, V., Claffy, K. C., Crowley, P., Papadopoulos, C., Wang, L., & Zhang, B. (2014). Named data networking. Computer Communication Review, 44(3), 66–73. https://doi.org/10.1145/2656877.2656887

Downloads

Published

2024-07-01

How to Cite

Optimizing Content Hit Rate On Named Data Network Using Multilevel Content Store. (2024). JATAED: Journal of Appropriate Technology for Agriculture, Environment, and Development, 1(2), 59-66. https://doi.org/10.62671/jataed.v1i2.44

Similar Articles

You may also start an advanced similarity search for this article.