{"id":"https://openalex.org/W7133791902","doi":"https://doi.org/10.48550/arxiv.2603.04353","title":"A Constrained RL Approach for Cost-Efficient Delivery of Latency-Sensitive Applications","display_name":"A Constrained RL Approach for Cost-Efficient Delivery of Latency-Sensitive Applications","publication_year":2026,"publication_date":"2026-03-04","ids":{"openalex":"https://openalex.org/W7133791902","doi":"https://doi.org/10.48550/arxiv.2603.04353"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.04353","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091439100","display_name":"Ozan Ayg\u00fcn","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ayg\u00fcn, Ozan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087157844","display_name":"Vincenzo Norman Vitale","orcid":"https://orcid.org/0000-0002-0365-8575"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vitale, Vincenzo Norman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066992345","display_name":"Antonia M. Tulino","orcid":"https://orcid.org/0000-0002-6050-4150"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tulino, Antonia M.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128154920","display_name":"Hao Feng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Feng, Hao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084526367","display_name":"Elza Erkip","orcid":"https://orcid.org/0000-0001-8718-8648"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erkip, Elza","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5036654426","display_name":"Jaime Llorca","orcid":"https://orcid.org/0000-0002-6713-5861"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Llorca, Jaime","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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":null,"last_page":null},"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.61080002784729,"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.61080002784729,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.20430000126361847,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.022099999710917473,"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.7483000159263611},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6190000176429749},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5938000082969666},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.5196999907493591},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.5095999836921692},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.45879998803138733},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.445499986410141},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4129999876022339}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7767999768257141},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7483000159263611},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6190000176429749},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5938000082969666},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.5196999907493591},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5095999836921692},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.45879998803138733},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.445499986410141},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4129999876022339},{"id":"https://openalex.org/C54108766","wikidata":"https://www.wikidata.org/wiki/Q391064","display_name":"Packet loss","level":3,"score":0.3959999978542328},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.3783000111579895},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.35690000653266907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.349700003862381},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3418000042438507},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.31690001487731934},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31139999628067017},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.30790001153945923},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.26179999113082886}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.04353","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.04353","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.04353","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.04353","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Next-generation":[0],"networks":[1],"aim":[2],"to":[3,7,24,51,97,137],"provide":[4],"performance":[5],"guarantees":[6],"real-time":[8],"interactive":[9],"services":[10],"that":[11,115],"require":[12],"timely":[13,106,122],"and":[14,56,89,131],"cost-efficient":[15],"packet":[16,123],"delivery.":[17],"In":[18],"this":[19],"context,":[20],"the":[21,33,77,116],"goal":[22],"is":[23],"reliably":[25],"deliver":[26],"packets":[27],"with":[28,70],"strict":[29,71],"deadlines":[30],"imposed":[31],"by":[32],"application":[34],"while":[35,104],"minimizing":[36],"overall":[37],"resource":[38,101],"allocation":[39,102],"cost.":[40],"A":[41],"large":[42],"body":[43],"of":[44],"work":[45],"has":[46],"leveraged":[47],"stochastic":[48],"optimization":[49],"techniques":[50,96],"design":[52],"efficient":[53],"dynamic":[54],"routing":[55],"scheduling":[57],"solutions":[58],"under":[59],"average":[60],"delay":[61,73],"constraints;":[62],"however,":[63],"these":[64],"methods":[65],"fall":[66,129],"short":[67],"when":[68,126],"faced":[69],"per-packet":[72],"requirements.":[74],"We":[75],"formulate":[76],"minimum-cost":[78],"delay-constrained":[79],"network":[80],"control":[81],"problem":[82],"as":[83],"a":[84,109],"constrained":[85,91],"Markov":[86],"decision":[87],"process":[88],"utilize":[90],"deep":[92],"reinforcement":[93],"learning":[94],"(CDRL)":[95],"effectively":[98],"minimize":[99],"total":[100],"cost":[103,135],"maintaining":[105],"throughput":[107],"above":[108],"target":[110],"reliability":[111],"level.":[112],"Results":[113],"indicate":[114],"proposed":[117],"CDRL-based":[118],"solution":[119],"can":[120],"ensure":[121],"delivery":[124],"even":[125],"existing":[127],"baselines":[128],"short,":[130],"it":[132],"achieves":[133],"lower":[134],"compared":[136],"other":[138],"throughput-maximizing":[139],"methods.":[140]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-06T00:00:00"}