{"id":"https://openalex.org/W2951182030","doi":"https://doi.org/10.1137/1.9781611973082.99","title":"An Optimal Lower Bound for Buffer Management in Multi-Queue Switches","display_name":"An Optimal Lower Bound for Buffer Management in Multi-Queue Switches","publication_year":2011,"publication_date":"2011-01-23","ids":{"openalex":"https://openalex.org/W2951182030","doi":"https://doi.org/10.1137/1.9781611973082.99","mag":"2951182030"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973082.99","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973082.99","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973082.99","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973082.99","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045471772","display_name":"Marcin Bie\u0144kowski","orcid":"https://orcid.org/0000-0002-2453-7772"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"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":true,"raw_author_name":"Marcin Bienkowski","raw_affiliation_strings":["Institute of Computer Science, University of Wroclaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroclaw, Poland","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045471772"],"corresponding_institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"],"apc_list":null,"apc_paid":null,"fwci":0.3655,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.70466116,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1295","last_page":"1305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T10829","display_name":"Interconnection Networks and Systems","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9977999925613403,"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/network-packet","display_name":"Network packet","score":0.8092812299728394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7665466666221619},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6228398084640503},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5972269177436829},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5850541591644287},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5840670466423035},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5590810775756836},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5025217533111572},{"id":"https://openalex.org/keywords/fifo","display_name":"FIFO (computing and electronics)","score":0.4835233688354492},{"id":"https://openalex.org/keywords/network-switch","display_name":"Network switch","score":0.43731489777565},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3904433846473694},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3493792414665222},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16105180978775024},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.12907996773719788},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08223697543144226}],"concepts":[{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.8092812299728394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7665466666221619},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6228398084640503},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5972269177436829},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5850541591644287},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5840670466423035},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5590810775756836},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5025217533111572},{"id":"https://openalex.org/C2777145635","wikidata":"https://www.wikidata.org/wiki/Q515636","display_name":"FIFO (computing and electronics)","level":2,"score":0.4835233688354492},{"id":"https://openalex.org/C119404949","wikidata":"https://www.wikidata.org/wiki/Q4503","display_name":"Network switch","level":2,"score":0.43731489777565},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3904433846473694},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3493792414665222},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16105180978775024},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.12907996773719788},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08223697543144226},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","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/1.9781611973082.99","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973082.99","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973082.99","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1137/1.9781611973082.99","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973082.99","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973082.99","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1568659894","https://openalex.org/W1897771984","https://openalex.org/W1964720438","https://openalex.org/W1970420972","https://openalex.org/W1991173480","https://openalex.org/W2008545695","https://openalex.org/W2013760396","https://openalex.org/W2067963342","https://openalex.org/W2070084440","https://openalex.org/W2070497154","https://openalex.org/W2076648698","https://openalex.org/W2087343661","https://openalex.org/W2105818147","https://openalex.org/W2160702061","https://openalex.org/W2165659786","https://openalex.org/W2168012204"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W2118334700"],"abstract_inverted_index":{"In":[0],"the":[1,9,43,86,94,107,111,124,134,137,144,148],"online":[2],"packet":[3,22,70],"buffering":[4,71],"problem":[5],"(also":[6],"known":[7,127],"as":[8],"unweighted":[10],"FIFO":[11],"variant":[12],"of":[13,88,102,110,130,136,147],"buffer":[14],"management),":[15],"we":[16,152],"focus":[17],"on":[18,106],"a":[19,98,155],"single":[20],"network":[21],"switching":[23],"device":[24,34],"with":[25],"several":[26],"input":[27,40,49],"ports":[28,41,50],"and":[29,91,132],"one":[30],"output":[31,44],"port.":[32,45],"This":[33,122],"forwards":[35],"unit-size,":[36],"unit-value":[37],"packets":[38,54,81,90],"from":[39,76],"to":[42,48,74,79,84],"Buffers":[46],"attached":[47],"may":[51],"accumulate":[52],"incoming":[53,63],"for":[55,117],"later":[56],"transmission;":[57],"if":[58],"they":[59],"cannot":[60],"accommodate":[61],"all":[62],"packets,":[64],"their":[65],"excess":[66],"is":[67],"lost.":[68],"A":[69],"algorithm":[72,138,149],"has":[73],"choose":[75],"which":[77,114],"buffers":[78],"transmit":[80],"in":[82,157],"order":[83],"minimize":[85],"number":[87],"lost":[89],"thus":[92],"maximize":[93],"throughput.":[95],"\r\nWe":[96],"present":[97],"tight":[99],"lower":[100,128],"bound":[101,129],"e/(e-1)":[103],"~":[104],"1.582":[105],"competitive":[108],"ratio":[109],"throughput":[112],"maximization,":[113],"holds":[115],"even":[116],"fractional":[118],"or":[119],"randomized":[120],"algorithms.":[121],"improves":[123],"previously":[125],"best":[126],"1.4659":[131],"matches":[133],"performance":[135,146],"Random":[139,150],"Schedule.":[140],"Our":[141],"result":[142],"contradicts":[143],"claimed":[145],"Permutation;":[151],"point":[153],"out":[154],"flaw":[156],"its":[158],"original":[159],"analysis.":[160]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-19T21:40:30.786675","created_date":"2025-10-10T00:00:00"}