{"id":"https://openalex.org/W2088005711","doi":"https://doi.org/10.1109/lcn.2014.6925808","title":"An approximation to rate-equalization fairness with logarithmic complexity for QoS","display_name":"An approximation to rate-equalization fairness with logarithmic complexity for QoS","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2088005711","doi":"https://doi.org/10.1109/lcn.2014.6925808","mag":"2088005711"},"language":"en","primary_location":{"id":"doi:10.1109/lcn.2014.6925808","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lcn.2014.6925808","pdf_url":"https://ieeexplore.ieee.org/ielx7/6916486/6925725/06925808.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"39th Annual IEEE Conference on Local Computer Networks","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6916486/6925725/06925808.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014205107","display_name":"Jorge A. Cobb","orcid":"https://orcid.org/0000-0002-8211-1913"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jorge A. Cobb","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Dallas, Richardson, TX","Department of Computer Science, The University of Texas at Dallas, Richardson 75080, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Richardson, TX","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Richardson 75080, USA#TAB#","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024657849","display_name":"Suparn Gupta","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Suparn Gupta","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Dallas, Richardson, TX","Department of Computer Science, The University of Texas at Dallas, Richardson 75080, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Richardson, TX","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Richardson 75080, USA#TAB#","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014205107"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":0.3448,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67080127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"426","last_page":"429"},"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9998999834060669,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9991000294685364,"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/weighted-fair-queueing","display_name":"Weighted fair queueing","score":0.9438068866729736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7408732175827026},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.606602668762207},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5311632752418518},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5099314451217651},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.49427127838134766},{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.45423007011413574},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44285133481025696},{"id":"https://openalex.org/keywords/proportionally-fair","display_name":"Proportionally fair","score":0.42183464765548706},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4078529179096222},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.26317864656448364},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.22569364309310913},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.20082587003707886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17166990041732788},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07409259676933289}],"concepts":[{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.9438068866729736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7408732175827026},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.606602668762207},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5311632752418518},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5099314451217651},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.49427127838134766},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.45423007011413574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44285133481025696},{"id":"https://openalex.org/C86127852","wikidata":"https://www.wikidata.org/wiki/Q7250364","display_name":"Proportionally fair","level":5,"score":0.42183464765548706},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4078529179096222},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.26317864656448364},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.22569364309310913},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.20082587003707886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17166990041732788},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07409259676933289},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcn.2014.6925808","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lcn.2014.6925808","pdf_url":"https://ieeexplore.ieee.org/ielx7/6916486/6925725/06925808.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"39th Annual IEEE Conference on Local Computer Networks","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1109/lcn.2014.6925808","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lcn.2014.6925808","pdf_url":"https://ieeexplore.ieee.org/ielx7/6916486/6925725/06925808.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"39th Annual IEEE Conference on Local Computer Networks","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2088005711.pdf","grobid_xml":"https://content.openalex.org/works/W2088005711.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1489831897","https://openalex.org/W1867018545","https://openalex.org/W1964545177","https://openalex.org/W2035862167","https://openalex.org/W2058819785","https://openalex.org/W2088005711","https://openalex.org/W2099440788","https://openalex.org/W2101455058","https://openalex.org/W2133607452","https://openalex.org/W2135425811","https://openalex.org/W2139475785","https://openalex.org/W2142681098","https://openalex.org/W2147181680","https://openalex.org/W2176566884","https://openalex.org/W2293390422","https://openalex.org/W3033143208","https://openalex.org/W4256362460"],"related_works":["https://openalex.org/W2040343479","https://openalex.org/W2107682335","https://openalex.org/W1999684000","https://openalex.org/W1534183152","https://openalex.org/W2076773727","https://openalex.org/W2391505263","https://openalex.org/W2133822874","https://openalex.org/W1964647653","https://openalex.org/W2069036979","https://openalex.org/W2163922947"],"abstract_inverted_index":{"Rate-guaranteed":[0],"scheduling":[1,66],"protocols":[2],"ensure":[3],"that":[4,68,103],"packets":[5],"from":[6],"each":[7,58],"input":[8],"flow":[9],"are":[10],"forwarded":[11],"at":[12],"a":[13,65],"rate":[14,19,37,56,76],"no":[15],"less":[16],"than":[17],"the":[18,22,26,49,54,78,81,94],"reserved":[20,55,75],"by":[21],"flow.":[23,59],"WFQ":[24],"is":[25,77,91],"classical":[27],"example.":[28],"Many":[29],"of":[30,57,84,96],"these":[31],"protocols,":[32],"including":[33],"WFQ,":[34],"provide":[35],"both":[36],"and":[38],"fairness":[39],"guarantees.":[40],"In":[41,60],"particular,":[42],"they":[43],"distribute":[44],"unused":[45,70],"capacity":[46,71],"among":[47,48],"flows":[50,73],"in":[51,93],"proportion":[52],"to":[53,72],"earlier":[61],"work,":[62],"we":[63,99],"presented":[64],"algorithm":[67,102],"distributes":[69],"whose":[74],"least.":[79],"However,":[80],"per-packet":[82],"complexity":[83,111],"this":[85],"algorithm,":[86],"known":[87],"as":[88],"rate-equalization":[89,105],"fairness,":[90,106],"linear":[92],"number":[95],"flows.":[97],"Here,":[98],"present":[100],"an":[101],"approximates":[104],"but":[107],"with":[108],"only":[109],"logarithmic":[110],"per":[112],"packet.":[113]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}