隨著社群媒體網路、物聯網、視頻流的興起。各種面相內容的應用程式如雨後春筍般大量地冒出。以信息為中心的網絡架構(Information-centric networking, ICN)逐漸凸顯出它的優勢。它擁有緩存資料的功能來減少探訪主機的次數，還能夠透過轉發機制減少網路上冗餘的封包。它以內容名稱來命名封包，並以名稱作為轉發依據。ICN架構被認為是未來有能力替代傳統網路的網路架構，來解決目前傳統網路種種的問題。命名資料網路(Named Data Networking, NDN)是基於ICN的網路架構之一，它被認為是最能夠代表實現ICN架構的方案。

網路內緩存被認為是網路應用中重要的要素之一。將資料緩存在網路上，來滿足大量用戶的需求，也減少探訪提供者主機的次數。在本文中，我們提出了一種基於內容受歡迎度與距離的NDN緩存策略。內容的受歡迎度越高代表內容在網路上需求程度越高。優先滿足能夠促進整體網路的命中率。越靠近消費者的內容，越能夠快速的反應需求，來提高用戶的服務品質。我們將這兩種因素一起考慮，透過加權計算，並讓路由器依據計算出來的結果，來判斷值不值得將資料緩存起來。我們使用ndnSIM來進行詳細的評估，得到優於現行NDN緩存策略的結果。證明了我們的方法是有效且可行的。

With the rise of social media networks, the Internet of Things, and video streaming. The increasing popularity of various content-oriented applications. The Information-centric networking (ICN) architecture gradually highlights its advantages. It has the function of caching data to reduce the number of visits to the host, and can also reduce redundant packets on the network through a forwarding mechanism. ICN names the packet with the content name and uses the name as the basis for forwarding. The ICN architecture is considered to be a network architecture capable of replacing traditional networks in the future to solve the current problems of traditional networks. NDN is one of the ICN-based network architectures, and it is considered to be the most representative solution for implementing the ICN architecture.

Caching data on the internet is considered to be one of the important factors in internet applications. Cache data on the Internet to meet the needs of a large number of users and reduce the number of visits to the provider’s host. In this paper, we propose an NDN caching strategy based on content popularity and distance. The higher the popularity of the content, the higher the demand for the content on the Internet. Prioritizing satisfaction can improve the overall network hit rate. The content which is closer to consumers can faster respond to consumers and improve the quality of service for users. We will consider these two factors together. After weighted calculation, the switch is allowed to judge whether the value is worth caching the data based on the calculated result. We use ndnSIM for detailed evaluation and get results that are better than the current NDN caching strategy. Proved that our method is effective and feasible.

[1] ITU, “Itu statistics.”https://www.itu.int/en/ITU-D/Statistics/Pages/stat/default.aspx, 2020.
[2] ITU, “Measuring digital development facts and figures 2020.”https://www.itu.int/en/ITU-D/Statistics/Documents/facts/FactsFigures2020.pdf, 2020.
[3] Cisco,“Ciscoannualinternetreport(2018–2023)whitepaper.”https://www.cisco.com/c/en/us/solutions/collateral/executive-perspectives/annual-internet-report/white-paper-c11-741490.html, 2020.
[4] D. Trossen, M. Sarela, and K. Sollins, “Arguments for an information-centric in-ternetworking architecture,”ACM SIGCOMM Computer Communication Review,vol. 40, no. 2, pp. 26–33, 2010.
[5] V. Jacobson, M. Mosko, D. Smetters, and J. Garcia-Luna-Aceves, “Content-centricnetworking,”Whitepaper, Palo Alto Research Center, pp. 2–4, 2007.
[6] J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, and B. Weihl, “Globallydistributed content delivery,”IEEE Internet Computing, vol. 6, no. 5, pp. 50–58,2002.
[7] T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H. Kim, S. Shenker, andI. Stoica, “A data-oriented (and beyond) network architecture,” inProceedings ofthe 2007 conference on Applications, technologies, architectures, and protocols forcomputer communications, pp. 181–192, 2007.
[8] L. Zhang, D. Estrin, J. Burke, V. Jacobson, J. D. Thornton, D. K. Smetters, B. Zhang,G. Tsudik, D. Massey, C. Papadopoulos,et al., “Named data networking (ndn)project,”Relat ́orio T ́ecnico NDN-0001, Xerox Palo Alto Research Center-PARC,vol. 157, p. 158, 2010.37
[9] R. D. Yates and W. Lehr, “Mobilityfirst, lte and the evolution of mobile networks,”in2012 IEEE International Symposium on Dynamic Spectrum Access Networks,pp. 180–188, IEEE, 2012.
[10] H. Harai, “Akari architecture design for new generation network,” in2009IEEE/LEOS Summer Topical Meeting, pp. 155–156, IEEE, 2009.
[11] H. Yuan and P. Crowley, “Scalable pending interest table design: From principlesto practice,” inIEEE INFOCOM 2014-IEEE Conference on Computer Communica-tions, pp. 2049–2057, IEEE, 2014.
[12] V. P. Singh and R. Ujjwal, “A walkthrough of name data networking: Architecture,functionalities, operations and open issues,”Sustainable Computing: Informaticsand Systems, vol. 28, p. 100419, 2020.
[13] N. Laoutaris, S. Syntila, and I. Stavrakakis, “Meta algorithms for hierarchical webcaches,” inIEEE International Conference on Performance, Computing, and Com-munications, 2004, pp. 445–452, IEEE, 2004.
[14] M. A. Naeem, S. A. Nor, S. Hassan, and B.-S. Kim, “Compound popular contentcaching strategy in named data networking,”Electronics, vol. 8, no. 7, p. 771, 2019.
[15] K. Cho, M. Lee, K. Park, T. T. Kwon, Y. Choi, and S. Pack, “Wave: Popularity-based and collaborative in-network caching for content-oriented networks,” in2012Proceedings IEEE INFOCOM Workshops, pp. 316–321, IEEE, 2012.
[16] H. Khattak, N. Ul Amin, I. U. Din, Insafullah, and J. Iqbal, “Leafpopdown: leaf pop-ular down caching strategy for information-centric networking,”INTERNATIONALJOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, vol. 9,no. 2, pp. 148–151, 2018.
[17] Y. Wang, M. Xu, and Z. Feng, “Hop-based probabilistic caching for information-centric networks,” in2013 IEEE Global Communications Conference (GLOBE-COM), pp. 2102–2107, IEEE, 2013.38
[18] I. Psaras, W. K. Chai, and G. Pavlou, “Probabilistic in-network caching forinformation-centric networks,” inProceedings of the second edition of the ICNworkshop on Information-centric networking, pp. 55–60, 2012.
[19] J. Ren, W. Qi, C. Westphal, J. Wang, K. Lu, S. Liu, and S. Wang, “Magic: A dis-tributed max-gain in-network caching strategy in information-centric networks,” in2014 IEEE conference on computer communications workshops (INFOCOM WK-SHPS), pp. 470–475, IEEE, 2014.
[20] J. Li, H. Wu, B. Liu, J. Lu, Y. Wang, X. Wang, Y. Zhang, and L. Dong, “Popularity-driven coordinated caching in named data networking,” in2012 ACM/IEEE Sym-posium on Architectures for Networking and Communications Systems (ANCS),pp. 15–26, IEEE, 2012.
[21] N. Abani, G. Farhadi, A. Ito, and M. Gerla, “Popularity-based partial caching for in-formation centric networks,” in2016 Mediterranean Ad Hoc Networking Workshop(Med-Hoc-Net), pp. 1–8, IEEE, 2016.
[22] M. A. Naeem, M. A. U. Rehman, R. Ullah, and B.-S. Kim, “A comparative perfor-mance analysis of popularity-based caching strategies in named data networking,”IEEE Access, vol. 8, pp. 50057–50077, 2020.
[23] N. Laoutaris, H. Che, and I. Stavrakakis, “The lcd interconnection of lru caches andits analysis,”Performance Evaluation, vol. 63, no. 7, pp. 609–634, 2006.
[24] M. Abdelaal, M. Karadeniz, F. D ̈urr, and K. Rothermel, “litendn: Qos-aware packetforwarding and caching for named data networks,” in2020 IEEE 17th Annual Con-sumer Communications & Networking Conference (CCNC), pp. 1–9, IEEE, 2020.
[25] A. Suwannasa, M. Broadbent, and A. Mauthe, “Vicinity-based replica finding innamed data networking,” in2020 International Conference on Information Network-ing (ICOIN), pp. 146–151, IEEE, 2020.
[26] A. Anand, C. Muthukrishnan, A. Akella, and R. Ramjee, “Redundancy in networktraffic: findings and implications,” inProceedings of the eleventh international jointconference on Measurement and modeling of computer systems, pp. 37–48, 2009.39
[27] ndnSIM Project, “ndnsim: Ns-3 based ndn simulator.”https://github.com/named-data-ndnSIM/ndnSIM, 2020.
[28] S. Knight, H. Nguyen, N. Falkner, R. Bowden, and M. Roughan, “The internet topol-ogy zoo,”Selected Areas in Communications, IEEE Journal on, vol. 29, pp. 1765–1775, october 2011.