{"id":"https://openalex.org/W7117873622","doi":"https://doi.org/10.1109/milcom64451.2025.11310531","title":"Dynamic Flow Routing and Scheduling for Time-Critical Network Services","display_name":"Dynamic Flow Routing and Scheduling for Time-Critical Network Services","publication_year":2025,"publication_date":"2025-10-06","ids":{"openalex":"https://openalex.org/W7117873622","doi":"https://doi.org/10.1109/milcom64451.2025.11310531"},"language":null,"primary_location":{"id":"doi:10.1109/milcom64451.2025.11310531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/milcom64451.2025.11310531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"MILCOM 2025 - 2025 IEEE Military Communications Conference (MILCOM)","raw_type":"proceedings-article"},"type":"conference-paper","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":"https://openalex.org/A5034131257","display_name":"Xuanli Lin","orcid":"https://orcid.org/0000-0003-0332-8645"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xuanli Lin","raw_affiliation_strings":["Arizona State University,Tempe,AZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University,Tempe,AZ","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057940216","display_name":"Zhaofeng Zhang","orcid":"https://orcid.org/0000-0002-4285-670X"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhaofeng Zhang","raw_affiliation_strings":["Arizona State University,Tempe,AZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University,Tempe,AZ","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081408920","display_name":"Zunzheng Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zunzheng Zhang","raw_affiliation_strings":["Arizona State University,Tempe,AZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University,Tempe,AZ","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoliang Xue","raw_affiliation_strings":["Arizona State University,Tempe,AZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University,Tempe,AZ","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"624","last_page":"629"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.3127000033855438,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.3127000033855438,"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.2847000062465668,"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/T12216","display_name":"Network Time Synchronization Technologies","score":0.094200000166893,"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/rounding","display_name":"Rounding","score":0.5997999906539917},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5613999962806702},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.46720001101493835},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46059998869895935},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4293999969959259},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.4120999872684479},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.39750000834465027},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.36970001459121704},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.3650999963283539},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.35040000081062317}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7692999839782715},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5997999906539917},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5613999962806702},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5095999836921692},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.46720001101493835},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46059998869895935},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.43560001254081726},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4293999969959259},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.4120999872684479},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.39750000834465027},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.390500009059906},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3650999963283539},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.35040000081062317},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.3481999933719635},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.3366999924182892},{"id":"https://openalex.org/C116537","wikidata":"https://www.wikidata.org/wiki/Q2169973","display_name":"Service provider","level":3,"score":0.32330000400543213},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.3188000023365021},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.31790000200271606},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3084999918937683},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.30090001225471497},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C139940560","wikidata":"https://www.wikidata.org/wiki/Q290036","display_name":"Network simulation","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2906999886035919},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.26969999074935913},{"id":"https://openalex.org/C152623178","wikidata":"https://www.wikidata.org/wiki/Q436417","display_name":"Network delay","level":3,"score":0.262800008058548},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.25619998574256897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/milcom64451.2025.11310531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/milcom64451.2025.11310531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"MILCOM 2025 - 2025 IEEE Military Communications Conference (MILCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W3047159536","https://openalex.org/W3047389456","https://openalex.org/W4285556314","https://openalex.org/W4296550780","https://openalex.org/W4401508511","https://openalex.org/W4403018342","https://openalex.org/W4405103372"],"related_works":[],"abstract_inverted_index":{"A":[0],"key":[1],"challenge":[2],"in":[3,101],"next-generation":[4],"networks":[5],"is":[6,119,123,145],"providing":[7],"intelligent":[8],"network":[9,37,54,74,86,151],"services":[10,87,100],"to":[11,28,44,62,81,88,107,148],"support":[12],"time-sensitive":[13],"applications":[14],"such":[15,94],"as":[16],"AR/VR":[17],"and":[18,40,49,189,205],"the":[19,30,46,96,150,171,186,191,200,207,210],"Internet":[20],"of":[21,52,85,98,209],"Military":[22],"Things":[23],"(IoMT).":[24],"This":[25],"work":[26],"aims":[27],"answer":[29],"question:":[31],"\"How":[32],"can":[33,104],"we":[34,76,169],"design":[35,190],"a":[36,58,67,83,124,129,134,139,156,177],"service":[38,152],"scheduling":[39],"flow":[41,179],"routing":[42],"scheme":[43],"satisfy":[45],"stringent":[47],"demand":[48],"deadline":[50],"requirements":[51],"tactical":[53],"applications?\"":[55],"We":[56,127],"take":[57],"time-expanded":[59,68],"graph-based":[60],"approach":[61,137],"this":[63,102,116],"study.":[64],"Specifically,":[65],"given":[66],"graph":[69],"constructed":[70],"from":[71,176],"an":[72,78],"original":[73,187],"graph,":[75,188],"propose":[77,128],"optimization":[79],"problem":[80,117,144,160,175],"find":[82],"subset":[84,103],"maximize":[89],"their":[90,108,112],"total":[91],"completion":[92],"rewards":[93],"that":[95,161],"data":[97],"all":[99],"be":[105],"transmitted":[106],"destination":[109],"nodes":[110],"by":[111,155],"deadlines.":[113],"Unfortunately,":[114],"solving":[115],"directly":[118],"challenging":[120],"since":[121],"it":[122],"mixed-integer":[125],"program.":[126],"heuristic":[130,194],"algorithm":[131],"based":[132],"on":[133,185],"sequential":[135],"rounding":[136],"where":[138],"linear":[140],"programming":[141],"(LP)":[142],"feasibility":[143,174,183],"iteratively":[146],"solved":[147],"update":[149],"subset,":[153],"guided":[154],"relaxed":[157],"reward":[158],"maximization":[159],"prioritizes":[162],"high-reward":[163],"requests.":[164],"To":[165],"further":[166],"improve":[167],"efficiency,":[168],"fine-tune":[170],"above":[172],"LP":[173],"static":[178],"perspective,":[180],"enabling":[181],"fast":[182],"checks":[184],"corresponding":[192],"efficient":[193],"algorithm.":[195],"The":[196],"simulation":[197],"results":[198],"demonstrate":[199],"trade-off":[201],"among":[202],"different":[203],"approaches":[204],"validate":[206],"effectiveness":[208],"proposed":[211],"algorithms.":[212]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-01T00:00:00"}