{"id":"https://openalex.org/W7116040802","doi":"https://doi.org/10.1002/cpe.70486","title":"<scp>DRR</scp> \u2010 <scp>MDPF</scp> : A Queue Management Strategy Based on Dynamic Resource Allocation and Markov Decision Process\u00a0in Named Data Networking ( <scp>NDN</scp> )","display_name":"<scp>DRR</scp> \u2010 <scp>MDPF</scp> : A Queue Management Strategy Based on Dynamic Resource Allocation and Markov Decision Process\u00a0in Named Data Networking ( <scp>NDN</scp> )","publication_year":2025,"publication_date":"2025-12-18","ids":{"openalex":"https://openalex.org/W7116040802","doi":"https://doi.org/10.1002/cpe.70486"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.70486","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.70486","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Fatemeh Roshanzadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I4210155764","display_name":"Islamic Azad University, Dezful Branch","ror":"https://ror.org/05d1wpf45","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210155764"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Fatemeh Roshanzadeh","raw_affiliation_strings":["Department of Computer Engineering, Dezful Branch Islamic Azad University  Dezful Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Dezful Branch Islamic Azad University  Dezful Iran","institution_ids":["https://openalex.org/I4210155764"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Hamid Barati","orcid":null},"institutions":[{"id":"https://openalex.org/I4210155764","display_name":"Islamic Azad University, Dezful Branch","ror":"https://ror.org/05d1wpf45","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210155764"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Hamid Barati","raw_affiliation_strings":["Department of Computer Engineering, Dezful Branch Islamic Azad University  Dezful Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Dezful Branch Islamic Azad University  Dezful Iran","institution_ids":["https://openalex.org/I4210155764"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ali Barati","orcid":null},"institutions":[{"id":"https://openalex.org/I4210155764","display_name":"Islamic Azad University, Dezful Branch","ror":"https://ror.org/05d1wpf45","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210155764"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ali Barati","raw_affiliation_strings":["Department of Computer Engineering, Dezful Branch Islamic Azad University  Dezful Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Dezful Branch Islamic Azad University  Dezful Iran","institution_ids":["https://openalex.org/I4210155764"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210155764"],"apc_list":{"value":4740,"currency":"USD","value_usd":4740},"apc_paid":null,"fwci":0.9389,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83276426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"38","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5940999984741211},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.5077999830245972},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.49570000171661377},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.46219998598098755},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.44350001215934753},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4075999855995178},{"id":"https://openalex.org/keywords/active-queue-management","display_name":"Active queue management","score":0.3953000009059906},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.3894999921321869},{"id":"https://openalex.org/keywords/adaptability","display_name":"Adaptability","score":0.38609999418258667},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.3605000078678131}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9006999731063843},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6273999810218811},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5940999984741211},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5659000277519226},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.5077999830245972},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.49570000171661377},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.46219998598098755},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.44350001215934753},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4075999855995178},{"id":"https://openalex.org/C34793927","wikidata":"https://www.wikidata.org/wiki/Q583367","display_name":"Active queue management","level":4,"score":0.3953000009059906},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.3894999921321869},{"id":"https://openalex.org/C177606310","wikidata":"https://www.wikidata.org/wiki/Q5674297","display_name":"Adaptability","level":2,"score":0.38609999418258667},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.35910001397132874},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C128220111","wikidata":"https://www.wikidata.org/wiki/Q4531011","display_name":"Queue management system","level":3,"score":0.3409999907016754},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.3343999981880188},{"id":"https://openalex.org/C203274722","wikidata":"https://www.wikidata.org/wiki/Q7001161","display_name":"Network performance","level":2,"score":0.3172999918460846},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.31459999084472656},{"id":"https://openalex.org/C129763632","wikidata":"https://www.wikidata.org/wiki/Q1454667","display_name":"Network management","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.3050000071525574},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.29679998755455017},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.28679999709129333},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C54108766","wikidata":"https://www.wikidata.org/wiki/Q391064","display_name":"Packet loss","level":3,"score":0.26739999651908875},{"id":"https://openalex.org/C101403955","wikidata":"https://www.wikidata.org/wiki/Q6707083","display_name":"Lyapunov optimization","level":5,"score":0.2524999976158142},{"id":"https://openalex.org/C77270119","wikidata":"https://www.wikidata.org/wiki/Q1655198","display_name":"Software-defined networking","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.70486","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.70486","pdf_url":null,"source":{"id":"https://openalex.org/S11065456","display_name":"Concurrency and Computation Practice and Experience","issn_l":"1532-0626","issn":["1532-0626","1532-0634"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency and Computation: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1591744510","https://openalex.org/W1965028510","https://openalex.org/W2104773786","https://openalex.org/W2141587120","https://openalex.org/W2510601772","https://openalex.org/W2522231289","https://openalex.org/W2553305406","https://openalex.org/W2751166006","https://openalex.org/W2779945518","https://openalex.org/W2800471367","https://openalex.org/W2899134098","https://openalex.org/W3046893130","https://openalex.org/W3109372024","https://openalex.org/W3190967931","https://openalex.org/W3204580729","https://openalex.org/W3204813133","https://openalex.org/W4206171742","https://openalex.org/W4220960947","https://openalex.org/W4243756002","https://openalex.org/W4285188674","https://openalex.org/W4289792523","https://openalex.org/W4301422153","https://openalex.org/W4360995441","https://openalex.org/W4387911326","https://openalex.org/W4396654682","https://openalex.org/W4396853089","https://openalex.org/W4401935108","https://openalex.org/W4403922183","https://openalex.org/W4403982693","https://openalex.org/W4409853717"],"related_works":[],"abstract_inverted_index":{"ABSTRACT":[0],"Named":[1],"data":[2,20,88],"networking":[3,225],"(NDN)":[4],"represents":[5],"a":[6,99],"transformative":[7],"shift":[8],"in":[9,223],"network":[10,194],"architecture,":[11],"prioritizing":[12],"content":[13,147],"names":[14],"over":[15],"host":[16],"addresses":[17],"to":[18,29,114,123,172,184,192],"enhance":[19],"dissemination.":[21],"Efficient":[22],"queue":[23,205],"and":[24,35,74,82,110,132,150,161,167,203,220],"resource":[25,216],"management":[26,206],"is":[27,43,90,96,181],"critical":[28],"NDN":[30],"performance,":[31],"especially":[32],"under":[33,157],"dynamic":[34,224],"high\u2010traffic":[36],"conditions.":[37],"A":[38],"novel":[39],"hybrid":[40],"strategy,":[41],"DRR\u2010MDPF,":[42,190],"introduced,":[44],"integrating":[45],"the":[46,54,75,185],"Markov":[47],"decision":[48],"process":[49],"forwarding":[50,61],"(MDPF)":[51],"model":[52],"with":[53],"deficit":[55],"round":[56],"robin":[57],"(DRR)":[58],"algorithm.":[59],"Optimal":[60],"decisions":[62],"are":[63],"intelligently":[64],"predicted":[65],"based":[66],"on":[67],"key":[68],"metrics":[69,136],"such":[70,137,214],"as":[71,98,138,199,215],"bandwidth,":[72],"delay,":[73],"number":[76],"of":[77,103,189],"unsatisfied":[78],"Interests,":[79],"whereas":[80],"fair":[81],"adaptive":[83],"bandwidth":[84],"allocation":[85],"among":[86],"competing":[87],"flows":[89],"ensured":[91],"by":[92],"DRR.":[93],"Each":[94],"router":[95],"modeled":[97],"learning":[100],"agent":[101],"capable":[102],"adjusting":[104],"its":[105,173],"strategies":[106,127],"through":[107],"continuous":[108],"feedback":[109],"probabilistic":[111],"updates.":[112],"According":[113],"simulation":[115],"results":[116],"obtained":[117],"using":[118],"ndnSIM,":[119],"DRR\u2010MDPF":[120,154,197],"was":[121],"found":[122],"significantly":[124],"outperform":[125],"state\u2010of\u2010the\u2010art":[126],"including":[128],"SAF,":[129],"RFA,":[130],"SMDPF,":[131],"LA\u2010MDPF":[133],"across":[134],"various":[135],"throughput,":[139],"interest":[140],"satisfaction":[141],"rate":[142],"(ISR),":[143],"packet":[144],"drop":[145],"rate,":[146],"retrieval":[148],"time,":[149],"load":[151],"balancing.":[152],"Notably,":[153],"maintains":[155],"robustness":[156],"limited":[158],"cache":[159],"sizes":[160],"heavy":[162],"traffic,":[163],"offering":[164],"enhanced":[165],"adaptability":[166],"lower":[168],"computational":[169],"complexity":[170],"due":[171,183],"single\u2010path":[174],"routing":[175],"design.":[176],"More":[177],"accurate":[178],"interface":[179],"selection":[180],"achieved":[182],"multi\u2010metric":[186],"decision\u2010making":[187],"capability":[188],"leading":[191],"optimized":[193],"performance.":[195],"Overall,":[196],"serves":[198],"an":[200],"intelligent,":[201],"adaptive,":[202],"scalable":[204],"solution":[207],"for":[208],"NDN,":[209],"effectively":[210],"addressing":[211],"core":[212],"challenges":[213],"allocation,":[217],"congestion":[218],"control,":[219],"route":[221],"optimization":[222],"environments.":[226]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-12-19T00:00:00"}