{"id":"https://openalex.org/W1968420854","doi":"https://doi.org/10.1109/icccn.2013.6614175","title":"Providing Near-Optimal Fair-Queueing Guarantees at Round-Robin Amortized Cost","display_name":"Providing Near-Optimal Fair-Queueing Guarantees at Round-Robin Amortized Cost","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W1968420854","doi":"https://doi.org/10.1109/icccn.2013.6614175","mag":"1968420854"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2013.6614175","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11380/968700","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015054071","display_name":"Paolo Valente","orcid":"https://orcid.org/0000-0002-1842-4974"},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Paolo Valente","raw_affiliation_strings":["Department of Physics, Computer Science and Mathematics, University of Modena and Reggio Emilia, Italy","Dept. of Phys., Comput. Sci., & Math., Univ. of Modena & Reggio Emilia, Modena, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Physics, Computer Science and Mathematics, University of Modena and Reggio Emilia, Italy","institution_ids":["https://openalex.org/I122346577"]},{"raw_affiliation_string":"Dept. of Phys., Comput. Sci., & Math., Univ. of Modena & Reggio Emilia, Modena, Italy","institution_ids":["https://openalex.org/I122346577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015054071"],"corresponding_institution_ids":["https://openalex.org/I122346577"],"apc_list":null,"apc_paid":null,"fwci":1.0733,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73288994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","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/T10138","display_name":"Network Traffic and Congestion Control","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/T10714","display_name":"Software-Defined Networks and 5G","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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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.7728301286697388},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.7118790149688721},{"id":"https://openalex.org/keywords/weighted-round-robin","display_name":"Weighted round robin","score":0.684484601020813},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.6210294961929321},{"id":"https://openalex.org/keywords/weighted-fair-queueing","display_name":"Weighted fair queueing","score":0.5847517251968384},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5320696830749512},{"id":"https://openalex.org/keywords/linux-kernel","display_name":"Linux kernel","score":0.5127302408218384},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.46895402669906616},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.43628451228141785},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4280811548233032},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4123193919658661},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3918555974960327},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3084298372268677},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.2837548553943634},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.21469220519065857},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.16690149903297424},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1633109152317047},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.14027827978134155}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7728301286697388},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.7118790149688721},{"id":"https://openalex.org/C141306801","wikidata":"https://www.wikidata.org/wiki/Q7979905","display_name":"Weighted round robin","level":5,"score":0.684484601020813},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.6210294961929321},{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.5847517251968384},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5320696830749512},{"id":"https://openalex.org/C553261973","wikidata":"https://www.wikidata.org/wiki/Q14579","display_name":"Linux kernel","level":2,"score":0.5127302408218384},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.46895402669906616},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.43628451228141785},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4280811548233032},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4123193919658661},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3918555974960327},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3084298372268677},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.2837548553943634},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.21469220519065857},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.16690149903297424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1633109152317047},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.14027827978134155},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icccn.2013.6614175","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.unimore.it:11380/968700","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/968700","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:iris.unimore.it:11380/968700","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/968700","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1976385534","https://openalex.org/W2058819785","https://openalex.org/W2097831241","https://openalex.org/W2105545278","https://openalex.org/W2105582092","https://openalex.org/W2112512248","https://openalex.org/W2138893881","https://openalex.org/W2144036146","https://openalex.org/W2156530904","https://openalex.org/W2158323258","https://openalex.org/W2163450360","https://openalex.org/W2169821621","https://openalex.org/W6636548729"],"related_works":["https://openalex.org/W1912482272","https://openalex.org/W2126330374","https://openalex.org/W2581865514","https://openalex.org/W1944332568","https://openalex.org/W4246924208","https://openalex.org/W2132767805","https://openalex.org/W257206475","https://openalex.org/W2105816758","https://openalex.org/W2121291107","https://openalex.org/W1968420854"],"abstract_inverted_index":{"Round-robin":[0],"schedulers":[1,17,34,78],"are":[2,35],"the":[3,57,119,130,142,145],"most":[4],"efficient":[5],"solution":[6],"for":[7,55],"providing":[8,79],"strong":[9],"QoS":[10],"guarantees":[11,82,137],"on":[12],"high-speed":[13],"links.":[14],"Yet":[15],"these":[16],"suffer":[18],"from":[19],"a":[20,51,105,139],"high":[21],"worst-case":[22],"delay":[23],"with":[24,151,156],"respect":[25],"to":[26,37,70,89,113,123,148],"an":[27,84],"ideal,":[28],"perfectly":[29],"fair":[30],"service.":[31],"More":[32],"costly":[33],"needed":[36,147],"provide":[38],"better":[39,135],"service":[40,81,136],"guarantees.":[41],"In":[42],"this":[43,47,68],"paper":[44],"we":[45,74,98],"tackle":[46],"problem":[48],"by":[49,109],"proposing":[50],"simple":[52],"modification":[53],"scheme":[54,69,112],"reducing":[56],"amortized":[58,85],"execution":[59],"time":[60,143],"of":[61,91],"fair-queueing":[62],"schedulers.":[63],"We":[64],"prove":[65],"that,":[66],"applying":[67,110],"existing":[71],"accurate":[72],"schedulers,":[73],"can":[75],"define":[76],"new":[77,106],"near-optimal":[80],"at":[83],"computational":[86],"cost":[87],"close":[88],"that":[90],"just":[92],"Deficit":[93],"Round":[94],"Robin":[95],"(DRR).":[96],"Finally,":[97],"show":[99],"Quick":[100],"Fair":[101],"Queueing":[102],"Plus":[103],"(QFQ+),":[104],"scheduler":[107],"obtained":[108],"our":[111,124],"QFQ.":[114],"QFQ+":[115,133,152],"replaced":[116],"QFQ":[117],"in":[118,129],"Linux":[120],"kernel.":[121],"According":[122],"experimental":[125],"results,":[126],"and":[127,144],"exactly":[128],"scenarios":[131],"where":[132],"provides":[134],"than":[138,155],"round-robin":[140],"scheduler,":[141],"energy":[146],"process":[149],"packets":[150],"is":[153],"lower":[154],"DRR.":[157]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}