{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T17:36:25Z","timestamp":1782668185249,"version":"3.54.5"},"reference-count":34,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>Named data networking (NDN) represents a transformative shift in network architecture, prioritizing content names over host addresses to enhance data dissemination. Efficient queue and resource management is critical to NDN performance, especially under dynamic and high\u2010traffic conditions. A novel hybrid strategy, DRR\u2010MDPF, is introduced, integrating the Markov decision process forwarding (MDPF) model with the deficit round robin (DRR) algorithm. Optimal forwarding decisions are intelligently predicted based on key metrics such as bandwidth, delay, and the number of unsatisfied Interests, whereas fair and adaptive bandwidth allocation among competing data flows is ensured by DRR. Each router is modeled as a learning agent capable of adjusting its strategies through continuous feedback and probabilistic updates. According to simulation results obtained using ndnSIM, DRR\u2010MDPF was found to significantly outperform state\u2010of\u2010the\u2010art strategies including SAF, RFA, SMDPF, and LA\u2010MDPF across various metrics such as throughput, interest satisfaction rate (ISR), packet drop rate, content retrieval time, and load balancing. Notably, DRR\u2010MDPF maintains robustness under limited cache sizes and heavy traffic, offering enhanced adaptability and lower computational complexity due to its single\u2010path routing design. More accurate interface selection is achieved due to the multi\u2010metric decision\u2010making capability of DRR\u2010MDPF, leading to optimized network performance. Overall, DRR\u2010MDPF serves as an intelligent, adaptive, and scalable queue management solution for NDN, effectively addressing core challenges such as resource allocation, congestion control, and route optimization in dynamic networking environments.<\/jats:p>","DOI":"10.1002\/cpe.70486","type":"journal-article","created":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T07:35:35Z","timestamp":1766129735000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["<scp>DRR<\/scp>\n                    \u2010\n                    <scp>MDPF<\/scp>\n                    : A Queue Management Strategy Based on Dynamic Resource Allocation and Markov Decision Process\u00a0in Named Data Networking (\n                    <scp>NDN<\/scp>\n                    )"],"prefix":"10.1002","volume":"38","author":[{"given":"Fatemeh","family":"Roshanzadeh","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Dezful Branch Islamic Azad University  Dezful Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamid","family":"Barati","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Dezful Branch Islamic Azad University  Dezful Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Barati","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Dezful Branch Islamic Azad University  Dezful Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2025,12,18]]},"reference":[{"key":"e_1_2_13_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECS.2015.7124841"},{"key":"e_1_2_13_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2018.8599682"},{"key":"e_1_2_13_4_1","doi-asserted-by":"publisher","DOI":"10.35940\/ijitee.K1258.09811S19"},{"key":"e_1_2_13_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-008-0148-8"},{"key":"e_1_2_13_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2614710"},{"key":"e_1_2_13_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.09.012"},{"key":"e_1_2_13_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154970.3154975"},{"key":"e_1_2_13_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108515"},{"key":"e_1_2_13_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3133016"},{"key":"e_1_2_13_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2022.03.038"},{"key":"e_1_2_13_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3189183"},{"key":"e_1_2_13_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2022.3196344"},{"key":"e_1_2_13_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-04080-0"},{"key":"e_1_2_13_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2023.3262198"},{"key":"e_1_2_13_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-024-03350-x"},{"key":"e_1_2_13_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3447467"},{"key":"e_1_2_13_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2024.3395184"},{"key":"e_1_2_13_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-024-05903-4"},{"key":"e_1_2_13_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2024.2422040"},{"key":"e_1_2_13_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2023.103772"},{"key":"e_1_2_13_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-025-07250-6"},{"issue":"1","key":"e_1_2_13_23_1","first-page":"2022","article-title":"A Quantitative Measure of Fairness and Discrimination","volume":"21","author":"Jain R. K.","year":"1984","journal-title":"Eastern Research Laboratory, Digital Equipment Corporation, Hudson, MA"},{"key":"e_1_2_13_24_1","first-page":"331","volume-title":"Handbooks in Operations Research and Management Science","author":"Puterman M. L.","year":"1990"},{"key":"e_1_2_13_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2420686"},{"key":"e_1_2_13_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-0864-6_3"},{"key":"e_1_2_13_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74759-0_440"},{"key":"e_1_2_13_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.11.005"},{"key":"e_1_2_13_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.08.058"},{"key":"e_1_2_13_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-016-0209-8"},{"key":"e_1_2_13_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2020.000014"},{"key":"e_1_2_13_32_1","doi-asserted-by":"publisher","DOI":"10.3390\/s21155174"},{"key":"e_1_2_13_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-2859-7"},{"key":"e_1_2_13_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-020-07909-8"},{"key":"e_1_2_13_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.03.057"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.70486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T04:49:10Z","timestamp":1768193350000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.70486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,18]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10.1002\/cpe.70486"],"URL":"https:\/\/doi.org\/10.1002\/cpe.70486","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,18]]},"assertion":[{"value":"2025-07-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70486"}}