{"id":"https://openalex.org/W2135975002","doi":"https://doi.org/10.1109/icc.2011.5963218","title":"Worst-Case Fair Bin Sort Queuing (WBSQ): An O(1) Worst-Case Fair Scheduler","display_name":"Worst-Case Fair Bin Sort Queuing (WBSQ): An O(1) Worst-Case Fair Scheduler","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2135975002","doi":"https://doi.org/10.1109/icc.2011.5963218","mag":"2135975002"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2011.5963218","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5963218","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-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/A5005814735","display_name":"Zyad Dwekat","orcid":null},"institutions":[{"id":"https://openalex.org/I110995367","display_name":"Sprint (United States)","ror":"https://ror.org/04rxdpa15","country_code":"US","type":"company","lineage":["https://openalex.org/I110995367"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zyad A. Dwekat","raw_affiliation_strings":["Sprint Network Services, Raleigh, NC, USA","[Sprint Network Services, Raleigh, NC, USA]"],"affiliations":[{"raw_affiliation_string":"Sprint Network Services, Raleigh, NC, USA","institution_ids":["https://openalex.org/I110995367"]},{"raw_affiliation_string":"[Sprint Network Services, Raleigh, NC, USA]","institution_ids":["https://openalex.org/I110995367"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069999271","display_name":"George N. Rouskas","orcid":"https://orcid.org/0000-0001-8250-8913"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George N. Rouskas","raw_affiliation_strings":["Department of Computer Science, North Carolina State University, Raleigh, NC, USA","Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, North Carolina State University, Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]},{"raw_affiliation_string":"Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA#TAB#","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005814735"],"corresponding_institution_ids":["https://openalex.org/I110995367"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19636316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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.9994999766349792,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9994000196456909,"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/computer-science","display_name":"Computer science","score":0.7644941806793213},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.7621741890907288},{"id":"https://openalex.org/keywords/fair-queuing","display_name":"Fair queuing","score":0.739213228225708},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6602432131767273},{"id":"https://openalex.org/keywords/weighted-fair-queueing","display_name":"Weighted fair queueing","score":0.556983470916748},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4756438434123993},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4587976336479187},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3376922607421875},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3330090641975403},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.14161521196365356},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.11104607582092285},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.1103411316871643}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7644941806793213},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.7621741890907288},{"id":"https://openalex.org/C143647952","wikidata":"https://www.wikidata.org/wiki/Q1392979","display_name":"Fair queuing","level":5,"score":0.739213228225708},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6602432131767273},{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.556983470916748},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4756438434123993},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4587976336479187},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3376922607421875},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3330090641975403},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.14161521196365356},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.11104607582092285},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.1103411316871643},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/icc.2011.5963218","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5963218","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.169.1772","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.1772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.ncsu.edu/faculty/rouskas//Publications/Submitted/Submitted-WBSQ-2010.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.178.3280","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.3280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.ncsu.edu/faculty/rouskas/Publications/Submitted/Submitted-WBSQ-2010.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.431.6395","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.6395","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.ncsu.edu/faculty/rouskas/Publications/Conferences/ICC-WBSQ-2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2139475785","https://openalex.org/W2141313758","https://openalex.org/W2163450360","https://openalex.org/W2166220427","https://openalex.org/W2171872428","https://openalex.org/W2176566884","https://openalex.org/W3143248510","https://openalex.org/W4236965295"],"related_works":["https://openalex.org/W159818114","https://openalex.org/W2023235331","https://openalex.org/W3151854040","https://openalex.org/W1566006727","https://openalex.org/W4246924208","https://openalex.org/W2040343479","https://openalex.org/W2132767805","https://openalex.org/W2581865514","https://openalex.org/W1912482272","https://openalex.org/W2062664162"],"abstract_inverted_index":{"The":[0],"design":[1],"of":[2,62,78],"packet":[3],"schedulers":[4],"involves":[5],"a":[6,33],"tradeoff":[7],"between":[8],"implementation":[9],"complexity,":[10],"on":[11,19],"one":[12],"hand,":[13],"and":[14,16,41,48,64,75,83],"delay":[15,42,76],"fairness":[17,40,74],"guarantees,":[18],"the":[20,72],"other.":[21],"In":[22],"this":[23,57],"paper,":[24],"we":[25],"present":[26],"worst-case":[27,39,73],"fair":[28],"bin":[29],"sort":[30],"queuing":[31],"(WBSQ),":[32],"new":[34],"scheduler":[35],"that":[36],"has":[37,45],"good":[38],"properties,":[43],"yet":[44],"low":[46],"complexity":[47],"is":[49],"amenable":[50],"to":[51],"simple":[52],"hardware":[53],"implementation.":[54],"WBSQ":[55,79],"achieves":[56],"performance":[58],"by":[59],"combining":[60],"features":[61],"BSFQ":[63],"WF":[65],"<sup":[66],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[67],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[68],"Q+.":[69],"We":[70],"establish":[71],"properties":[77],"through":[80],"both":[81],"analysis":[82],"simulation.":[84]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}