{"id":"https://openalex.org/W4307886765","doi":"https://doi.org/10.1137/21m1469753","title":"A \\(\\boldsymbol{\\phi }\\) -Competitive Algorithm for Scheduling Packets with Deadlines","display_name":"A \\(\\boldsymbol{\\phi }\\) -Competitive Algorithm for Scheduling Packets with Deadlines","publication_year":2022,"publication_date":"2022-10-28","ids":{"openalex":"https://openalex.org/W4307886765","doi":"https://doi.org/10.1137/21m1469753"},"language":"en","primary_location":{"id":"doi:10.1137/21m1469753","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1469753","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":"https://openalex.org/A5022904512","display_name":"Pavel Vesel\u00fd","orcid":"https://orcid.org/0000-0003-1169-7934"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Vesel\u00fd","raw_affiliation_strings":["Computer Science Institute of Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic (, )"],"raw_orcid":"https://orcid.org/0000-0003-1169-7934","affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic (, )","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024529572","display_name":"Marek Chrob\u00e1k","orcid":"https://orcid.org/0000-0002-8673-2709"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marek Chrobak","raw_affiliation_strings":["Department of Computer Science, University of California at Riverside, Riverside CA 92521 USA ()"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California at Riverside, Riverside CA 92521 USA ()","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007826587","display_name":"\u0141ukasz Je\u017c","orcid":"https://orcid.org/0000-0002-7375-0641"},"institutions":[{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"\u0141ukasz Je\u017c","raw_affiliation_strings":["Institute of Computer Science, University of Wroc\u0142aw, Wroc\u0142aw, Poland ()"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroc\u0142aw, Wroc\u0142aw, Poland ()","institution_ids":["https://openalex.org/I4210087266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061997850","display_name":"Ji\u0159\u0131\u0301 Sgall","orcid":"https://orcid.org/0000-0003-3658-4848"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u00ed Sgall","raw_affiliation_strings":["Computer Science Institute of Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic (, )"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic (, )","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2672,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.55873137,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"51","issue":"5","first_page":"1626","last_page":"1691"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8694530725479126},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.830643355846405},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.8005084991455078},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7308691740036011},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6491814851760864},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6491039395332336},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.556090235710144},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.45510825514793396},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4293728470802307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3989160656929016},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3496320843696594},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.28448498249053955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20489585399627686}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8694530725479126},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.830643355846405},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.8005084991455078},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7308691740036011},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6491814851760864},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6491039395332336},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.556090235710144},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.45510825514793396},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4293728470802307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3989160656929016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3496320843696594},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28448498249053955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20489585399627686},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/21m1469753","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1469753","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2365396832","display_name":null,"funder_award_id":"ERC-2014-CoG 647557","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G2866263633","display_name":null,"funder_award_id":"CCF-2153723","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3618012969","display_name":null,"funder_award_id":"UNCE/SCI/004","funder_id":"https://openalex.org/F4320309755","funder_display_name":"Univerzita Karlova v Praze"},{"id":"https://openalex.org/G4058268884","display_name":null,"funder_award_id":"2016/22/E/ST6/00499","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G4530288581","display_name":null,"funder_award_id":"CCF-1536026","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5664323314","display_name":null,"funder_award_id":"19-27871X","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G6343711268","display_name":null,"funder_award_id":"2020/39/B/ST6/01679","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G6850321799","display_name":null,"funder_award_id":"2016/21/D/ST6/02402","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309755","display_name":"Univerzita Karlova v Praze","ror":"https://ror.org/024d6js02"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1974319951","https://openalex.org/W1991173480","https://openalex.org/W2000013497","https://openalex.org/W2008545695","https://openalex.org/W2010459659","https://openalex.org/W2014256412","https://openalex.org/W2033562126","https://openalex.org/W2075737586","https://openalex.org/W2095073910","https://openalex.org/W2132894080","https://openalex.org/W2134822363","https://openalex.org/W2165659786","https://openalex.org/W2168012204","https://openalex.org/W2911984265","https://openalex.org/W3174345738"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W4390751688","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405"],"abstract_inverted_index":{".In":[0],"the":[1,13,65,82,93,108,113,137,145,149,162,192,196],"online":[2,142,171,183],"packet":[3,38,55,117],"scheduling":[4,109],"problem":[5,103,121,177],"with":[6,107],"deadlines":[7,75],"(":[8],"\\(\\textsf{PacketSchD}\\)":[9,123,186],",":[10],"for":[11,185],"short),":[12],"goal":[14],"is":[15,67,85,104,134,191],"to":[16,31,86,135],"schedule":[17,90,155,166],"transmissions":[18],"of":[19,96,115,129,141,153,164],"packets":[20,70,97],"that":[21,91,98,124],"arrive":[22],"over":[23],"time":[24,61],"in":[25,59],"a":[26,35,40,46,88,127,154,165,169,180],"network":[27],"switch":[28],"and":[29,45,76,161],"need":[30],"be":[32,57,77],"sent":[33],"across":[34],"link.":[36],"Each":[37],"has":[39,125],"deadline,":[41],"representing":[42],"its":[43,51],"urgency,":[44],"nonnegative":[47],"weight,":[48],"which":[49],"represents":[50],"priority.":[52],"Only":[53],"one":[54],"can":[56],"transmitted":[58],"any":[60],"slot,":[62],"so":[63],"if":[64],"system":[66],"overloaded,":[68],"some":[69],"will":[71],"inevitably":[72],"miss":[73],"their":[74],"dropped.":[78],"In":[79],"this":[80,175],"scenario,":[81],"natural":[83],"objective":[84],"compute":[87],"transmission":[89],"maximizes":[92],"total":[94,151],"weight":[95,152,163],"are":[99],"successfully":[100],"transmitted.":[101],"The":[102,119],"inherently":[105],"online,":[106],"decisions":[110],"made":[111],"without":[112],"knowledge":[114],"future":[116],"arrivals.":[118],"central":[120],"concerning":[122],"been":[126],"subject":[128],"intensive":[130],"study":[131],"since":[132],"2001":[133],"determine":[136],"optimal":[138],"competitive":[139],"ratio":[140,147],"algorithms,":[143],"namely":[144],"worst-case":[146],"between":[148],"optimum":[150],"(computed":[156],"by":[157,168,178],"an":[158],"offline":[159],"algorithm)":[160],"computed":[167],"(deterministic)":[170],"algorithm.":[172],"We":[173],"solve":[174],"open":[176],"presenting":[179],"\\(\\phi\\)":[181],"-competitive":[182],"algorithm":[184],"(where":[187],"\\(\\phi":[188],"\\approx":[189],"1.618\\)":[190],"golden":[193],"ratio),":[194],"matching":[195],"previously":[197],"established":[198],"lower":[199],"bound.Keywordsonline":[200],"algorithmspacket":[201],"schedulingbuffer":[202],"managementMSC":[203],"codes68W27":[204]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2022-11-06T00:00:00"}