یک روش جایگزینی محتوا مبتنی بر آنتروپی شانون و روش تصمیم‌گیری وزنی ساده در شبکه‌های مبتنی بر نام

محمد سلطانی ¹ ( دانشکده مهندسی کامپیوتر- واحد نجف‌آباد، دانشگاه آزاد اسلامی، نجف‌آباد، ایران )
بهرنگ برکتین ² ( دانشکده مهندسی کامپیوتر- واحد نجف‌آباد، دانشگاه آزاد اسلامی، نجف‌آباد، ایران )
فرامرز هندسی ³ ( دانشکده مهندسی برق و کامپیوتر- دانشگاه صنعتی اصفهان، اصفهان، ایران )
زهرا بهشتی ⁴ ( مرکز تحقیقات کلان داده- واحد نجف آباد، دانشگاه آزاد اسلامی، نجف آباد، ایران )

تاریخ ارسال : 1402/07/10 تاریخ تایید : 1402/10/17

کلید واژه: آنتروپی شانون, جایگزینی محتوا حافظه موقت, روش امتیازدهی وزنی ساده, شبکه داده نامگذاری‌شده, شبکه محتوا محور,

چکیده مقاله :

شبکه داده نام گذاری شده به عنوان یکی از معماری های پیشرو و نسل بعدی شبکه محتوا محور در آینده اینترنت معرفی شده است. اخیراً، چالش جایگزینی محتوا به دلیل اهمیت ویژه آن مورد توجه محققین قرار گرفته است. اگرچه روش های معرفی شده تا کنون تلاش در بهبود این چالش داشته اند، اما وزن دهی غیرپویا و استفاده از تنها یک معیار برای انتخاب محتوای خروجی، نیاز به ایجاد بهبود بیشتر در تاخیر دسترسی را به امری اجتناب ناپذیر تبدیل نموده است. در این راستا، در این مقاله یک روش جدید مبتنی بر فرآیند تصمیم‌گیری ساده همراه با وزن دهی پویای آنتروپی شانون برای انتخاب مناسب ترین محتوا جهت جایگزینی محتوا ارائه شده است. در روش پیشنهادی معیار های مهم محبوبیت محتوا و زمان آخرین بازدید به صورت پویا وزن دهی و با توجه به شرایط، امکان تغییر وزن معیارها به صورت پویا وجود دارد. سپس محتوا ها امتیازدهی و محتوای مناسب جهت جایگزینی محتوا تعیین می گردد. از نو آوری های روش پیشنهادی در نظر گرفتن معیارهای تاثیر گذار در شبکه های مبتنی بر نام مانند محبوبیت محتوا و زمان آخرین بازدید برای خروج محتوا و همچنین پویا بودن وزن معیارها می توان نام برد که باعث بهبود همزمان زمان تاخیر و نرخ ضربه می شود. نتایج حاصل از شبیه سازی در ndnSIM حاکی از کاهش تاخیر و افزایش نرخ ضربه در مقایسه با روش های مشابه است.

چکیده انگلیسی :

The named data network has been introduced as one of the next generation content-oriented network architectures in the future of the Internet. Recently, the challenge of content replacement has attracted the attention of researchers due to its special importance. Although the methods introduced so far have tried to improve this challenge, non-dynamic weighting and the use of only one criterion to select the output content have made the need for further improvement in the access delay inevitable. Regarding this matter, a novel strategy is presented based on the simple additive weighting (SAW) with the dynamic weighting of Shannon’s entropy for content replacement. In the proposed method, the important parameters such as the popularity of the content and the time of the last visit are included. According to the conditions of the content, it is possible to change the weights of the criteria dynamically using Shannon's entropy method. Content scoring is done using the SAW method and appropriate content is determined to replace the content. Among the innovations of the proposed method can be mentioned the consideration of influential criteria in named data networks, such as content popularity and the time of the last visit to replace the content, as well as the dynamic weight of the criteria, which reduces the delay and increases the hit rate. The results of the simulation in ndnSIM indicate the improvement access delay and hit rate compared to similar methods. 

منابع و مأخذ:

[1] D. Dhakal, A. Gautam, S. Dey, K. Sharma, ''A review on forwarding strategies in NDN based vehicular networks'', EMITTER International Journal of Engineering Technology, vol. 9, no. 2, pp. 339–356, Dec. 2021 (doi: 10.24003/emitter.v9i2.632).

[2] A. Tariq, R.A. Rehman, B.S. Kim, ''Forwarding strategies in NDN based wireless networks: a survey'', EEE Communications Surveys and Tutorials, vol. 22, no. 1, pp. 68-95, Dec. 2021 (doi: 10.1109/COM­ST.2­019.2­93­5795).

[3] K.N. Lal, A. Kumar, ''A popularity based content eviction scheme via betweenness-centrality caching approach for content-centric networking (CCN)'', Wireless Networks, vol. 25, no. 2, pp. 585–596, Feb. 2019 (doi: 10.1007/s11276-017-1577-z).

[4] A. Kalghoum, L.A. Saidane, ''FCR-NS: A novel caching and forwarding strategy for named data networking based on software defined networking'', Cluster Computing, vol. 22, no. 3, pp. 981–994, Sept. 2019 (doi: 10­.10­07/s10586-018-02887-w).

[5] D. He, C. Westphal, J. Jiang, G. Yang, ''RankRoute: Efficient interest forwarding using nodes ranking'', Pro­c­ee­ding of the IEEE/ICNC, pp. 741–746, Honolulu, HI, USA, Feb. 2019 (doi: 10.1109/ICCNC.2019.8­68­5­6­0­8).

[6] M.S.M. Shah, Y.B. Leau, Z. Yan, M. Anbar, ''Hierarchical naming scheme in named data networking for internet of things: a review and future security challenges'', IEEE Access, vol. 10, pp. 19958–19970, Feb. 2022 (doi: 10.1109/ACCESS.2022.3151864).

[7] I.V.S. Brito, L. Sampaio, L. Zhang, ''On supporting forwarding strategies and sync protocols through NDN distance vector routing'', Proceeding of the ACMCICN, pp. 183–185, Osaka Japan, Sept. 2022 (doi: 10.1145/3517­212.3­559490).

[8] A. Hidouri, N. Hajlaoui, H. Touati, M. Hadded, P. Muhlethaler, ''A survey on security attacks and intrusion detection mechanisms in named data networking'', Computers, vol. 11, no. 12, Article Number: 186, Dec. 2022 (doi: 10.3390/computers11120186).

[9] A. Abrar, A.S. Che Mohamed Arif, K. M. Zaini, ''A mobility mechanism to manage producer mobility in named data networking'', Proceeding of the IEEE/TENSYMP, pp. 1–6, Mumbai, India, July 2022 (doi: 10.1109/TENSYMP54529.2022.9864454).

[10] M. Amadeo, C. Campolo, G. Ruggeri, A. Molinaro, ''Popularity-aware closeness based caching in NDN edge networks'', Sensors, vol. 22, no. 9, Article Number: 3460, May 2022 (doi: 10.3390/s22093460).

[11] S. Lee, I. Yeom, D. Kim, ''T-caching: Enhancing feasibility of In-network caching in ICN'', IEEE Trans. on Parallel and Distributed Systems, vol. 31, no. 7, pp. 1486–1498, July 2020 (doi: 10.1109/TPDS.202­0.297­07­02).

[12] M. Amadeo, C. Campolo, G. Ruggeri, A. Molinaro, ''Beyond edge caching: freshness and popularity aware IoT data caching via NDN at internet-scale'', IEEE Trans. on Green Communications and Networking, vol. 6, no. 1, pp. 352–364, Mar. 2022 (doi: 10.1109/TGCN.2021.3124452).

[13] R.K. Dudeja, R.S. Bali, G.S. Aujla, ''Secure and pervasive communication framework using named data networking for connected healthcare'', Computers and Electrical Engineering, vol. 100, no. 1, Article Number: 107806, May 2022 (doi: 10.1016/j.compeleceng.2022.107806).

[14] X. Wang, Y. Lu, ''Sustainable and efficient fog-assisted IoT cloud based data collection and delivery for smart cities'', IEEE Trans. on Sustainable Computing, vol. 7, no. 4, pp. 950–957, Oct. 2022 (doi: 10.1109/TSUSC.2022.3188330).

[15] P. Mekbungwan, G. Pau, K. Kanchanasut, ''In-network computation for IoT data processing with active NDN in wireless sensor networks'', Proceeding of the CIoT, pp. 197–204, Marrakech, Morocco, Mar. 2022 (doi: 10.1109/CIoT53061.2022.9766613).

[16] E.T. da Silva, A.L.D. Costa, J. M. H. de Macedo, ''On the realization of VANET using named data networking: On improvement of VANET using NDN‐based routing, caching, and security'', International Journal of Communication Systems, vol. 35, no. 18, Article Number: e5348 Dec. 2022 (doi: 10.1002/dac.5348).

[17] B. Hao, G. Wang, M. Zhang, J. Zhu, L. Xing, Q. Wu, ''Stochastic adaptive forwarding strategy based on deep reinforcement learning for secure mobile video communications in NDN'', Security and Communication Networks, vol. 2021, pp. 1–13, April 2021 (doi: 10.1155/2021/6630717).

[18] Z. Sharifian, B. Barekatain, A.A. Quintana, Z. Beheshti, F. Safi, "An enhanced routing algorithm in smart iot networks with mobile nodes", Journal of Intelligent Procedures in Electrical Technology, vol. 16, no. 63, pp. 1-24, December 2025 (in Persian).

[19] M. Meddeb, A. Dhraief, A. Belghith, T. Monteil, K. Drira, H. Mathkour, ''Least fresh first cache replacement policy for NDN-based IoT networks'', Pervasive and Mobile Computing, vol. 52, pp. 60–70, Jan. 2019 (doi: 10.1016/j.pmcj.2018.12.002).

[20] Y. Taj, B. Bakhshi-Sareskanrood, H. ZandHessami, "Reliable relay node selection to real-time messaging in vehicular networks", Journal of Intelligent Procedures in Electrical Technology, vol. 15, no. 59, pp. 53-80, December 2024 (in Persian).

[21] C.E. Shannon, ''A mathematical theory of communication'', Bell System Technical Journal, vol. 27, pp. 379–423, Oct. 1948.

[22] M. Zhang, H. Luo, H. Zhang, ''A survey of caching mechanisms in information-centric networking'', IEEE Communications Surveys and Tutorials, vol. 17, no. 3, pp. 1473–1499, April 2015 (doi: 10.1109/COM-ST.2015.2420097).

[23] D. Grund, J. Reineke, ''Precise and efficient FIFO-replacement analysis based on static phase detection'', Proceeding of the IEEE/ECRTS, pp. 155–164, Brussels, Belgium, July. 2010 (doi: 10.1109/ECRTS.2010.8).

[24] Z. Li, D. Liu, H. Bi, ''CRFP: A novel adaptive replacement policy combined the LRU and LFU policies'', Proceeding of the IEEE/CIT, pp. 72–79, Sydney, QLD, July 2008 (doi: 10.1109/CIT.2008.Workshops.22).

[25] S. Chootong, J. Thaenthong, ''Cache replacement mechanism with content popularity for vehicular content-centric networks (VCCN)'', Proceeding of the IEEE/JCSSE, NakhonSiThammarat, Thailand, pp. 1–6, July 2017 (doi: 10.1109/JCSSE.2017.8025901).

[26] Y. Li, M. Yu, R. Li, ''A cache replacement strategy based on hierarchical popularity in NDN'', Proceeding of the IEEE/ICUFN, pp. 159–161, Prague, Czech, July 2018 (doi: 10.1109/ICUFN.2018.8436597).

[27] Y. Liu, T. Zhi, H. Xi, W. Quan, H. Zhang, ''A novel cache replacement scheme against cache pollution attack in content-centric networks'', Proceeding of the IEEE/CIC, pp. 207–212, Changchun, China, Aug. 2019 (doi: 10.1109/ICCChina.2019.8855925).

[28] M.A.P. Putra, H. Situmorang, N.R. Syambas, ''Least recently frequently used replacement policy named data networking approach'', Proceeding of the IEEE/ICEEI, pp. 423–427, Bandung, Indonesia, July 2019 (doi: 10.1109/ICEEI47359.2019.8988828).

[29] N. Alzakari, A.B. Dris, S. Alahmadi, ''Randomized least frequently used cache replacement strategy for named data networking'', Proceeding of IEEE/ICCAIS, pp. 1–6, Riyadh, Saudi Arabia, Mar. 2020 (doi: 10.1109/IC­CA­IS4889­3.2020.9096733).

[30] S. Al-Ahmadi, ''A new efficient cache replacement strategy for named data networking'', International Journal of Computer Networks and Communications, vol. 13, no. 5, pp. 19–35, Sept. 2021 (doi: 10.5121/ijcnc.2­021.1­35­02).

[31] S. Rashid, S.A. Razak, F.A. Ghaleb, ''IMU: A content replacement policy for CCN, based on immature content selection'', Applied Sciences, vol. 12, no. 1, Article Number: 344, Dec. 2021 (doi: 10.3390/app12010344).

[32] E.T. Silva, J.M.H. Macedo, A.L.D. Costa, ''NDN content store and caching policies: Performance Evaluation'', Computers, vol. 11, no. 3, Article Number: 37, Mar. 2022 (doi: 10.3390/computers11030037).

[33] J. Hou, H. Lu, A. Nayak, ''A GNN-based proactive caching strategy in NDN networks'', Peer-to-Peer Networking and Applications, vol. 16, no. 2, pp. 997-1009, Mar. 2023 (doi: 10.1007/s12083-023-01464-2).

[34] Y. Zha, P. Cui, Y. Hu, L. Xue, J. Lan, Y. Wang, ''An NDN cache-optimization strategy based on dynamic popularity and replacement value'', Electronics, vol. 11, no. 19, Article Number: 3014, Sept. 2022 (doi: 10.3390/electronics11193014).

[35] J. Hou, H. Xia, H. Lu, A. Nayak, ''A graph neural network approach for caching performance optimization in NDN networks'', IEEE Access, vol., pp. 112657–112668, Oct. 2022 (doi: 10.1109/ACCESS.2022.3217236).

[36] A. Narayanan, S. Verma, E. Ramadan, P. Babaie, Z.L. Zhang, ''Making content caching policies “smart” using the deepcache framework'', ACM SIGCOMM Computer Communication Review, vol. 48, no. 5, pp. 64–69, Jan. 2019 (doi: 10.1145/3310165.3310174).

[37] B. Panigrahi, S. Shailendra, H.K. Rath, A. Simha, ''Universal caching model and markov-based cache analysis for information centric networks'', Photonic Network Communications, vol. 30, no. 3, pp. 428–438, Dec. 2015 (doi: 10.1007/s11107-015-0570-7).

[38] J. Yao, B. Yin, X. Tan, ''A SMDP-based forwarding scheme in named data networking'', Neurocomputing, vol. 306, pp. 213–225, Sept. 2018 (doi: 10.1016/j.neucom.2018.03.057).