{"id":"https://openalex.org/W7158892057","doi":"https://doi.org/10.48550/arxiv.2604.26349","title":"Asymptotically Robust Learning-Augmented Algorithms for Preemptive FIFO Buffer Management","display_name":"Asymptotically Robust Learning-Augmented Algorithms for Preemptive FIFO Buffer Management","publication_year":2026,"publication_date":"2026-04-29","ids":{"openalex":"https://openalex.org/W7158892057","doi":"https://doi.org/10.48550/arxiv.2604.26349"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.26349","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26349","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.26349","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134891858","display_name":"Wen-Han Hsieh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hsieh, Wen-Han","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134908304","display_name":"Ya-Chun Liang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liang, Ya-Chun","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/T12288","display_name":"Optimization and Search Problems","score":0.9804999828338623,"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/T12288","display_name":"Optimization and Search Problems","score":0.9804999828338623,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.00800000037997961,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.0026000000070780516,"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/competitive-analysis","display_name":"Competitive analysis","score":0.824999988079071},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6834999918937683},{"id":"https://openalex.org/keywords/fifo","display_name":"FIFO (computing and electronics)","score":0.6644999980926514},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6358000040054321},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6092000007629395},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5357000231742859},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5153999924659729},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5026999711990356},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4763999879360199}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.824999988079071},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6834999918937683},{"id":"https://openalex.org/C2777145635","wikidata":"https://www.wikidata.org/wiki/Q515636","display_name":"FIFO (computing and electronics)","level":2,"score":0.6644999980926514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6643000245094299},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6358000040054321},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6092000007629395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6090999841690063},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5357000231742859},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5153999924659729},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5026999711990356},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4763999879360199},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.4684000015258789},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C40842320","wikidata":"https://www.wikidata.org/wiki/Q19423","display_name":"Buffer overflow","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38190001249313354},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C3265923","wikidata":"https://www.wikidata.org/wiki/Q669129","display_name":"Arithmetic underflow","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33970001339912415},{"id":"https://openalex.org/C54108766","wikidata":"https://www.wikidata.org/wiki/Q391064","display_name":"Packet loss","level":3,"score":0.3154999911785126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C34628019","wikidata":"https://www.wikidata.org/wiki/Q13636890","display_name":"Algorithmics","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27070000767707825},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.26759999990463257},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C48721391","wikidata":"https://www.wikidata.org/wiki/Q1265942","display_name":"FIFO and LIFO accounting","level":3,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.26349","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26349","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.26349","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.26349","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,176],"present":[1],"a":[2,18,126,166,172,204],"learning-augmented":[3,208],"online":[4,16,92,218],"algorithm":[5,29,40,160,202,219],"for":[6,89,207],"the":[7,28,50,68,85,90,112,142,148,179,212],"preemptive":[8],"FIFO":[9,25],"buffer":[10,209],"management":[11],"problem,":[12,93],"where":[13,48],"packets":[14,34,132],"arrive":[15],"to":[17,35,171],"finite-capacity":[19],"buffer,":[20],"must":[21],"be":[22],"transmitted":[23],"in":[24,99],"order,":[26],"and":[27,45,72,97,164],"may":[30],"preemptively":[31],"discard":[32],"buffered":[33],"accommodate":[36],"future":[37],"arrivals.":[38],"Our":[39],"simultaneously":[41],"achieves":[42],"1-consistency,":[43],"\u03b7-smoothness,":[44],"asymptotic":[46,75,222],"\\sqrt{3}-robustness,":[47],"\u03b7denotes":[49],"prediction":[51,69,117,139],"error.":[52],"Specifically,":[53],"it":[54],"attains":[55],"an":[56,74,115,190],"optimal":[57,144],"competitive":[58,76,180],"ratio":[59,77],"of":[60,78,108,114,130],"1":[61],"under":[62,80],"perfect":[63],"predictions,":[64,83],"degrades":[65],"smoothly":[66],"as":[67],"error":[70,118,154],"increases,":[71],"maintains":[73],"\\sqrt{3}":[79],"arbitrarily":[81],"inaccurate":[82],"matching":[84],"best-known":[86],"worst-case":[87,173],"guarantee":[88,157],"classical":[91],"established":[94],"by":[95,183,189],"Englert":[96],"Westermann":[98],"2009":[100],"[Algorithmica":[101],"53(4):":[102],"523-548].":[103],"A":[104],"key":[105],"technical":[106],"contribution":[107],"our":[109,136,159,201],"work":[110],"is":[111,133,187],"introduction":[113],"\\emph{output-based":[116],"metric}.":[119],"Because":[120],"capacity":[121,192],"constraints":[122],"dictate":[123],"that":[124,178,194,200],"only":[125],"strictly":[127],"bounded":[128,188],"subset":[129],"arriving":[131],"ultimately":[134],"transmitted,":[135],"metric":[137],"assesses":[138],"quality":[140],"over":[141],"resulting":[143],"schedules":[145],"rather":[146],"than":[147],"raw":[149],"input":[150],"sequences,":[151],"avoiding":[152],"artificial":[153],"penalties.":[155],"To":[156],"robustness,":[158],"dynamically":[161],"monitors":[162],"predictions":[163],"executes":[165],"\\emph{buffer-clearing":[167],"strategy}":[168],"upon":[169],"transitioning":[170],"fallback":[174,213],"mechanism.":[175],"prove":[177],"loss":[181],"incurred":[182],"this":[184],"clearing":[185],"operation":[186],"additive":[191],"constant":[193],"vanishes":[195],"asymptotically.":[196],"Finally,":[197],"we":[198],"show":[199],"provides":[203],"generalized":[205],"framework":[206],"management:":[210],"substituting":[211],"module":[214],"with":[215],"any":[216],"\u03b2-competitive":[217],"immediately":[220],"yields":[221],"\u03b2-robustness.":[223]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-01T00:00:00"}