Performance Analysis of Cache Replacement Algorithm using Virtual Named Data Network Nodes

Authors

  • Leanna Vidya Yovita School of Electrical Engineering, Telkom University, Indonesia
  • Tody Ariefianto Wibowo School of Electrical Engineering, Telkom University, Indonesia
  • Ade Aditya Ramadha School of Electrical Engineering, Telkom University, Indonesia
  • Gregorius Pradana Satriawan School of Electrical Engineering, Telkom University, Indonesia
  • Sevierda Raniprima School of Electrical Engineering, Telkom University, Indonesia

DOI:

https://doi.org/10.15575/join.v7i2.875

Keywords:

Cache, NDN, Performance, Replacement, Virtual node

Abstract

As a future internet candidate, named Data Network (NDN) provides more efficient communication than TCP/IP network. Unlike TCP/IP, consumer requests in NDN are sent based on content, not the address. The previous study evaluated the NDN performance using a simulator. In this research, we modeled the system using virtual NDN nodes, making the model more relevant to the real NDN. As an essential component in every NDN router, the content store (CS) has a function to keep the data. We use First In First Out (FIFO) and Least Recetly Used (LRU) in our nodes as cache replacement algorithms. The in-depth exploration is done using various scenarios. The result shows that the cache hit ratio (CHR) increases if the size of the CS, the number of interests, and the number of consumers increases. CHR decreases as the number of producers and the number of prefixes increase. As CHR increases, round trip time (RTT) decreases. LRU provides better performance for all cases: higher CHR of 5-15% and lower RTT of 1-10% than FIFO.

Author Biography

Leanna Vidya Yovita, School of Electrical Engineering, Telkom University

Fakultas Teknik Elektro

Universitas Telkom

References

A. Afanasyev, J. Burke, L. Wang, and B. Zhang, “A Brief Introduction to Named Data Networking,†2018.

I. Networking, M. Zhang, H. Luo, and H. Zhang, “A Survey of Caching Mechanisms in Information centric Networking,†IEEE Commun. Surv. TUTORIALS, vol. 17, no. 3, pp. 1473–1499, 2015.

H. Jin, D. Xu, C. Zhao, and D. Liang, “Information-centric mobile caching network frameworks and caching optimization: a survey,†Eurasip J. Wirel. Commun. Netw., vol. 2017, no. 1, pp. 1–32, 2017, doi: 10.1186/s13638-017-0806-6.

L. V. Yovita and N. R. Syambas, “Caching on named data network: A survey and future research,†Int. J. Electr. Comput. Eng., vol. 8, no. 6, pp. 4456–4466, 2018, doi: 10.11591/ijece.v8i6.pp.4456-4466.

L. V. Yovita, N. R. Syambas, I. Joseph, M. Edward, and N. Kamiyama, “Performance Analysis of Cache Based on Popularity and Class in Named Data Network,†in Future Internet, 2020, vol. 12, no. 227, doi: https://doi.org/10.3390/fi12120227.

J. H. Mun and H. Lim, “Cache sharing using bloom filters in named data networking,†J. Netw. Comput. Appl., vol. 90, pp. 74–82, 2017, doi: 10.1016/j.jnca.2017.04.011.

L. V. Yovita, N. R. Syambas, I. Joseph, and M. Edward, “Weighted-CAPIC Caching Algorithm for Priority Traffic in Named Data Network,†Futur. Internet, vol. 14, no. 3, pp. 1–15, 2022, doi: 10.3390/fi14030084.

V. Sourlas, “Partition-based Caching in Information-Centric Networks,†in Seventh IEEE International Workshop on Network Science for Communication Networks (NetSciCom 2015), 2015, pp. 396–401.

S. Podlipnig and L. Böszörmenyi, “A survey of Web cache replacement strategies,†ACM Comput. Surv., vol. 35, no. 4, pp. 374–398, 2003, doi: 10.1145/954339.954341.

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

H. Situmorang, N. R. Syambas, and T. Juhana, “The effect of scaling the size of Topology and Content Stored on the Named Data Networking,†in Proceeding of 2016 10th International Conference on Telecommunication Systems Services and Applications, TSSA 2016: Special Issue in Radar Technology, 2017, pp. 16–21, doi: 10.1109/TSSA.2016.7871110.

F. C. Alamsyah, L. V. Yovita, and R. M. Negara, “The Effect of Content Population and Frequency Interest for Named Data Networking with Modified-Optimal Replacement Algorithm,†2021.

G. Carofiglio, V. Gehlen, and D. Perino, “Experimental evaluation of memory management in content-centric networking,†in IEEE International Conference on Communications, 2011, pp. 1–6, doi: 10.1109/icc.2011.5962739.

X. Hu, J. Gong, G. Cheng, and C. Fan, “Enhancing in-network caching by coupling cache placement, replacement and location,†in IEEE International Conference on Communications, 2015, vol. 2015-Septe, pp. 5672–5678, doi: 10.1109/ICC.2015.7249226.

E. Hattab and S. Qawasmeh, “A Survey of Replacement Policies for Mobile Web Caching,†in Proceedings - 2015 International Conference on Developments in eSystems Engineering, DeSE 2015, 2016, pp. 41–46, doi: 10.1109/DeSE.2015.13.

D. Meint and S. Liebald, “From FIFO to Predictive Cache Replacement,†2019, doi: 10.2313/NET-2019-06-1.

M. Dehghan, L. Massoulie, D. Towsley, D. S. Menasche, and Y. C. Tay, “A Utility Optimization Approach to Network Cache Design,†in IEEE/ACM Transactions on Networking, 2016, vol. 27, no. 3, pp. 1013–1027, doi: 10.1109/TNET.2019.2913677.

C. M. I. N. Park and R. A. Rehman, “Packet Flooding Mitigation in CCN-based Wireless Multimedia Sensor Networks for Smart Cities Packet Flooding Mitigation in CCN-Based Wireless Multimedia Sensor Networks for Smart Cities,†IEEE Access, vol. 5, no. June, pp. 11054–11062, 2017, doi: 10.1109/ACCESS.2017.2715407.

L. V. Yovita and N. R. Syambas, “Content Storage Effect on the Named Data Network Traffic Load,†2017.

Mini-NDN_Team, “Mini-NDN,†2022. https://minindn.memphis.edu/ (accessed Mar. 15, 2022)

Downloads

Published

2022-12-29

Issue

Vol. 7 No. 2 (2022)

Section

Article

Citation Check

License

You are free to:

 

Under the following terms:

  • Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.

  • NoDerivatives — If you remix, transform, or build upon the material, you may not distribute the modified material.

  • No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

 

Notices:

  • You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation.
  • No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License

Similar Articles

1 2 3 4 5 6 7 > >> 

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