{"id":"https://openalex.org/W4400580852","doi":"https://doi.org/10.1145/3676887","title":"Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop","display_name":"Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop","publication_year":2024,"publication_date":"2024-07-12","ids":{"openalex":"https://openalex.org/W4400580852","doi":"https://doi.org/10.1145/3676887"},"language":"en","primary_location":{"id":"doi:10.1145/3676887","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3676887","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/c5e8a3e0-072c-4a20-98d7-5200cc7335f4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020000065","display_name":"Antonios Antoniadis","orcid":"https://orcid.org/0000-0003-2152-7883"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Antonios Antoniadis","raw_affiliation_strings":["University of Twente, Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007064425","display_name":"Matthias Englert","orcid":"https://orcid.org/0000-0002-8859-7731"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matthias Englert","raw_affiliation_strings":["University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031365316","display_name":"Nicolaos Matsakis","orcid":"https://orcid.org/0000-0002-0386-749X"},"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":"Nicolaos Matsakis","raw_affiliation_strings":["Computer Science Institute of Charles University, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","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, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5020000065"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14730948,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"4","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9959999918937683,"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/queue","display_name":"Queue","score":0.7362170815467834},{"id":"https://openalex.org/keywords/drop","display_name":"Drop (telecommunication)","score":0.669434666633606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43213385343551636},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42109307646751404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41561371088027954},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.36105868220329285},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1909157633781433},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.18487554788589478}],"concepts":[{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.7362170815467834},{"id":"https://openalex.org/C2781345722","wikidata":"https://www.wikidata.org/wiki/Q5308388","display_name":"Drop (telecommunication)","level":2,"score":0.669434666633606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43213385343551636},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42109307646751404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41561371088027954},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.36105868220329285},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1909157633781433},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.18487554788589478}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3676887","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3676887","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/c5e8a3e0-072c-4a20-98d7-5200cc7335f4","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/c5e8a3e0-072c-4a20-98d7-5200cc7335f4","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Antoniadis, A, Englert , M, Matsakis, N & Vesely, P 2024, 'Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop', ACM transactions on algorithms, vol. 20, no. 4, 38. https://doi.org/10.1145/3676887","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:wrap.warwick.ac.uk:188123","is_oa":true,"landing_page_url":null,"pdf_url":"https://wrap.warwick.ac.uk/id/eprint/188123/1/WRAP-Breaking-barrier-2-competitiveness-longest-queue-drop-24.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/c5e8a3e0-072c-4a20-98d7-5200cc7335f4","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/c5e8a3e0-072c-4a20-98d7-5200cc7335f4","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Antoniadis, A, Englert , M, Matsakis, N & Vesely, P 2024, 'Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop', ACM transactions on algorithms, vol. 20, no. 4, 38. https://doi.org/10.1145/3676887","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1062666957","display_name":null,"funder_award_id":"AN 1262/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G2944623379","display_name":null,"funder_award_id":"22-22997S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320320279","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320323322","display_name":"Universit\u00e4t des Saarlandes","ror":"https://ror.org/01jdpyv68"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1970420972","https://openalex.org/W1991173480","https://openalex.org/W2008545695","https://openalex.org/W2010459659","https://openalex.org/W2014256412","https://openalex.org/W2027868809","https://openalex.org/W2033661244","https://openalex.org/W2034699613","https://openalex.org/W2045955023","https://openalex.org/W2067963342","https://openalex.org/W2070119082","https://openalex.org/W2074950314","https://openalex.org/W2075737586","https://openalex.org/W2095073910","https://openalex.org/W2103063579","https://openalex.org/W2116240509","https://openalex.org/W2120354662","https://openalex.org/W2133094699","https://openalex.org/W2134822363","https://openalex.org/W2160702061","https://openalex.org/W2165659786","https://openalex.org/W2168012204","https://openalex.org/W2168857785","https://openalex.org/W2169444479","https://openalex.org/W2171009722","https://openalex.org/W2556516015","https://openalex.org/W4237245674","https://openalex.org/W4307886765"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"We":[0,202],"consider":[1],"the":[2,6,49,64,67,72,78,81,91,107,112,131,138,154,180,186,209,215],"problem":[3,187],"of":[4,8,15,22,28,45,66,75,80,93,114,190,218],"managing":[5],"buffer":[7,33,139],"a":[9,26,32,35,101,147,198,221],"shared-memory":[10,19],"switch":[11,20],"that":[12,204],"transmits":[13,100],"packets":[14,46,76,84],"unit":[16],"value.":[17],"A":[18],"consists":[21],"an":[23,42],"input":[24,50],"port,":[25,51],"number":[27,44,74,113],"output":[29,57,69,98],"ports,":[30],"and":[31,106,167,188],"with":[34],"specific":[36],"capacity.":[37],"In":[38],"each":[39,52,94,97],"time":[40,95],"step,":[41,96],"arbitrary":[43],"arrive":[47],"at":[48],"packet":[53,60,102,129,148],"designated":[54],"for":[55,185,214,220],"one":[56],"port.":[58,70],"Each":[59],"is":[61,109,152,189,197,206],"added":[62],"to":[63,86,110,130,171],"queue":[65,151],"respective":[68],"If":[71],"total":[73],"exceeds":[77],"capacity":[79],"buffer,":[82],"some":[83],"have":[85],"be":[87,172],"irrevocably":[88],"evicted.":[89],"At":[90],"end":[92],"port":[99],"in":[103,137,165],"its":[104,141,194],"queue,":[105],"goal":[108],"maximize":[111],"transmitted":[115],"packets.":[116],"The":[117,159],"Longest":[118],"Queue":[119],"Drop":[120],"(":[121],"LQD":[122,145,160,178,205,219],")":[123],"online":[124,183],"algorithm":[125,161,184],"accepts":[126],"any":[127],"arriving":[128],"buffer.":[132],"However,":[133],"if":[134],"this":[135],"results":[136],"exceeding":[140],"memory":[142],"capacity,":[143],"then":[144],"drops":[146],"from":[149],"whichever":[150],"currently":[153],"longest,":[155],"breaking":[156],"ties":[157],"arbitrarily.":[158],"was":[162],"first":[163,210],"introduced":[164],"1991,":[166],"has":[168],"been":[169],"known":[170,182],"\\(2\\)":[173],"-competitive":[174],"since":[175],"2001.":[176],"Although":[177],"remains":[179],"best":[181],"practical":[191],"interest,":[192],"determining":[193],"true":[195],"competitiveness":[196],"long-standing":[199],"open":[200],"problem.":[201],"show":[203],"1.6918-competitive,":[207],"establishing":[208],"\\((2-\\varepsilon)\\)":[211],"upper":[212],"bound":[213],"competitive":[216],"ratio":[217],"constant":[222],"\\(\\varepsilon{\\,\\gt\\,}0\\)":[223],".":[224]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}