{"id":"https://openalex.org/W2014722142","doi":"https://doi.org/10.1109/infcom.2012.6195833","title":"A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering","display_name":"A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2014722142","doi":"https://doi.org/10.1109/infcom.2012.6195833","mag":"2014722142"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2012.6195833","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195833","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},"type":"conference-paper","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/A5008612044","display_name":"Emilie Danna","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emilie Danna","raw_affiliation_strings":["Google, Inc., Mountain View, CA, USA","Google Inc., 1600 Amphitheatre Parkway, Mountain View , CA , 94043 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, Inc., Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Inc., 1600 Amphitheatre Parkway, Mountain View , CA , 94043 , USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043433616","display_name":"Subhasree Mandal","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhasree Mandal","raw_affiliation_strings":["Google, Inc., Mountain View, CA, USA","Google Inc., 1600 Amphitheatre Parkway, Mountain View , CA , 94043 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, Inc., Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Inc., 1600 Amphitheatre Parkway, Mountain View , CA , 94043 , USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039301888","display_name":"Arjun Singh","orcid":"https://orcid.org/0000-0002-3475-077X"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arjun Singh","raw_affiliation_strings":["Google, Inc., Mountain View, CA, USA","Google Inc., 1600 Amphitheatre Parkway, Mountain View , CA , 94043 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, Inc., Mountain View, CA, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Inc., 1600 Amphitheatre Parkway, Mountain View , CA , 94043 , USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"846","last_page":"854"},"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.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8416436910629272},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.8226823806762695},{"id":"https://openalex.org/keywords/max-min-fairness","display_name":"Max-min fairness","score":0.5846570134162903},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5226366519927979},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.5182545185089111},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4780726432800293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46035143733024597},{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.45685911178588867},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.41285771131515503},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3428327441215515},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.32538658380508423},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.17143839597702026},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.165623277425766},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.1596372425556183},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.11174112558364868},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08231711387634277}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8416436910629272},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.8226823806762695},{"id":"https://openalex.org/C177972170","wikidata":"https://www.wikidata.org/wiki/Q17097315","display_name":"Max-min fairness","level":3,"score":0.5846570134162903},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5226366519927979},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.5182545185089111},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4780726432800293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46035143733024597},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.45685911178588867},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.41285771131515503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3428327441215515},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.32538658380508423},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.17143839597702026},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.165623277425766},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.1596372425556183},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.11174112558364868},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08231711387634277},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2012.6195833","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195833","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1605451826","https://openalex.org/W2021474514","https://openalex.org/W2022485714","https://openalex.org/W2038861084","https://openalex.org/W2078098553","https://openalex.org/W2085812530","https://openalex.org/W2088506653","https://openalex.org/W2097713078","https://openalex.org/W2111162397","https://openalex.org/W2114265329","https://openalex.org/W2119751760","https://openalex.org/W2122011919","https://openalex.org/W2135800242","https://openalex.org/W2139318963","https://openalex.org/W2147524058","https://openalex.org/W2159715570","https://openalex.org/W2163907500","https://openalex.org/W2613173048","https://openalex.org/W4240896209","https://openalex.org/W6672807701"],"related_works":["https://openalex.org/W2057526413","https://openalex.org/W2361713743","https://openalex.org/W1605983382","https://openalex.org/W2136681811","https://openalex.org/W2138888940","https://openalex.org/W2374431462","https://openalex.org/W2084765981","https://openalex.org/W1977807590","https://openalex.org/W1999684000","https://openalex.org/W2402400303"],"abstract_inverted_index":{"One":[0],"of":[1,4,35,105,113,120],"the":[2,27,33,48,58,64,68,76,81,86,111,117,126,163],"goals":[3],"traffic":[5],"engineering":[6],"is":[7,30,122],"to":[8,46,61,75,85,93,128],"achieve":[9,154],"a":[10,43,94,103,155],"flexible":[11],"trade-off":[12,65,164],"between":[13,165],"fairness":[14,51,69,100,166],"and":[15,26,50,136,147,158,167],"throughput":[16,49,82],"so":[17],"that":[18,97,151],"users":[19],"are":[20],"satisfied":[21,31],"with":[22,32,53],"their":[23],"bandwidth":[24],"allocation":[25],"network":[28,36,59],"operator":[29,60],"utilization":[34],"resources.":[37],"In":[38],"this":[39],"paper,":[40],"we":[41],"propose":[42],"novel":[44],"way":[45],"balance":[47],"objectives":[52],"linear":[54,106,138],"programming.":[55],"It":[56],"allows":[57],"precisely":[62],"control":[63],"by":[66,101],"bounding":[67],"degradation":[70,83],"for":[71,141],"each":[72],"commodity":[73],"compared":[74,84],"max-min":[77,99],"fair":[78],"solution":[79],"or":[80],"optimal":[87],"throughput.":[88,168],"We":[89,108,124],"also":[90],"present":[91],"improvements":[92],"previous":[95],"algorithm":[96,127],"achieves":[98],"solving":[102],"series":[104],"programs.":[107],"significantly":[109],"reduce":[110],"number":[112],"steps":[114],"needed":[115],"when":[116],"access":[118],"rate":[119],"commodities":[121],"limited.":[123],"extend":[125],"two":[129],"important":[130],"practical":[131,160],"use":[132],"cases:":[133],"importance":[134],"weights":[135],"piece-wise":[137],"utility":[139],"functions":[140],"commodities.":[142],"Our":[143],"experiments":[144],"on":[145,162],"synthetic":[146],"real":[148],"networks":[149],"show":[150],"our":[152],"algorithms":[153],"significant":[156],"speedup":[157],"provide":[159],"insights":[161]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}