{"id":"https://openalex.org/W2095073910","doi":"https://doi.org/10.1137/s0097539701399666","title":"Buffer Overflow Management in QoS Switches","display_name":"Buffer Overflow Management in QoS Switches","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2095073910","doi":"https://doi.org/10.1137/s0097539701399666","mag":"2095073910"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539701399666","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701399666","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/A5113535127","display_name":"Alexander Kesselman","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Alexander Kesselman","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016606156","display_name":"Zvi Lotker","orcid":"https://orcid.org/0000-0002-3759-5584"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Zvi Lotker","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014637159","display_name":"Yishay Mansour","orcid":"https://orcid.org/0000-0001-6891-2645"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yishay Mansour","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016261142","display_name":"Boaz Patt-Shamir","orcid":"https://orcid.org/0000-0001-8398-8218"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Boaz Patt-Shamir","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111449864","display_name":"Maxim Sviridenko","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maxim Sviridenko","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5113535127"],"corresponding_institution_ids":["https://openalex.org/I149899117"],"apc_list":null,"apc_paid":null,"fwci":6.2574,"has_fulltext":false,"cited_by_count":169,"citation_normalized_percentile":{"value":0.96685096,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"33","issue":"3","first_page":"563","last_page":"583"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.7516223192214966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6941506266593933},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6444087028503418},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6407980918884277},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6337565183639526},{"id":"https://openalex.org/keywords/buffer-overflow","display_name":"Buffer overflow","score":0.5226901769638062},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5127302408218384},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4567481279373169},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44430598616600037},{"id":"https://openalex.org/keywords/packet-loss","display_name":"Packet loss","score":0.43764394521713257},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.43158629536628723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3989647626876831},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21646150946617126}],"concepts":[{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.7516223192214966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6941506266593933},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6444087028503418},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6407980918884277},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6337565183639526},{"id":"https://openalex.org/C40842320","wikidata":"https://www.wikidata.org/wiki/Q19423","display_name":"Buffer overflow","level":2,"score":0.5226901769638062},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5127302408218384},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4567481279373169},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44430598616600037},{"id":"https://openalex.org/C54108766","wikidata":"https://www.wikidata.org/wiki/Q391064","display_name":"Packet loss","level":3,"score":0.43764394521713257},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.43158629536628723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3989647626876831},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21646150946617126},{"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/s0097539701399666","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701399666","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":[{"score":0.4000000059604645,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1879402272","https://openalex.org/W2003902046","https://openalex.org/W2013760396","https://openalex.org/W2023171863","https://openalex.org/W2069832779","https://openalex.org/W2105818147","https://openalex.org/W2156867662","https://openalex.org/W2158733823","https://openalex.org/W2752885492"],"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/W1930615501"],"abstract_inverted_index":{"We":[0,65,138,209,241],"consider":[1,237],"two":[2,231],"types":[3],"of":[4,15,69,93,103,123,190,205],"buffering":[5],"policies":[6],"that":[7,127,141,145,186],"are":[8],"used":[9],"in":[10,26,29,35,72,108,214,219,256],"network":[11],"switches":[12],"supporting":[13],"Quality":[14],"Service":[16],"(QoS).":[17],"In":[18,43,75,180],"the":[19,27,33,39,44,67,85,90,112,120,124,131,142,147,155,170,176,181,187,206,211,215,238,248,251],"FIFO":[20,113,254],"type,":[21,46],"packets":[22,129,149,153],"must":[23,57],"be":[24,58,162],"transmitted":[25,94],"order":[28],"which":[30,55,174],"they":[31],"arrive;":[32],"constraint":[34],"this":[36,257],"case":[37,68,217],"is":[38,63,87,99,154,199],"limited":[40],"buffer":[41,198],"space.":[42],"bounded-delay":[45,182,197,252],"each":[47,78],"packet":[48,73,79,233],"has":[49,80],"a":[50,100,195],"maximum":[51],"delay":[52,207,223],"time":[53],"by":[54],"it":[56,62],"transmitted,":[59],"or":[60],"otherwise":[61],"lost.":[64],"study":[66,247],"overloads":[70],"resulting":[71],"loss.":[74],"our":[76],"model,":[77],"an":[81,135],"intrinsic":[82],"value,":[83],"and":[84,218,229,246,253],"goal":[86],"to":[88],"maximize":[89],"total":[91],"value":[92,133],"packets.":[95,179],"Our":[96],"main":[97],"contribution":[98],"thorough":[101],"investigation":[102],"some":[104],"natural":[105],"greedy":[106,125,143,157,172,212],"algorithms":[107,245],"various":[109],"models.":[110],"For":[111],"model":[114,183],"we":[115,184,236],"prove":[116,140],"tight":[117],"bounds":[118],"on":[119],"competitive":[121,188],"ratio":[122,189],"algorithm":[126,144,160,193,213],"discards":[128],"with":[130],"lowest":[132],"when":[134],"overflow":[136],"occurs.":[137],"also":[139],"drops":[146,175],"earliest":[148],"among":[150],"all":[151],"low-value":[152],"best":[156],"algorithm.":[158],"This":[159],"can":[161],"as":[163,165],"much":[164],"1.5":[166],"times":[167],"better":[168],"than":[169],"tail-drop":[171],"policy,":[173],"latest":[177],"lowest-value":[178],"show":[185],"any":[191],"on-line":[192],"for":[194],"uniform":[196],"bounded":[200],"away":[201],"from":[202],"1,":[203,228],"independent":[204],"size.":[208],"analyze":[210],"general":[216],"three":[220],"special":[221],"cases:":[222],"bound":[224],"2,":[225],"link":[226],"bandwidth":[227],"only":[230],"possible":[232],"values.":[234],"Finally,":[235],"off-line":[239],"scenario.":[240],"give":[242],"efficient":[243],"optimal":[244],"relation":[249],"between":[250],"models":[255],"case.":[258]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":11}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}