{"id":"https://openalex.org/W2123376500","doi":"https://doi.org/10.1109/icnp.2010.5762749","title":"Routing in max-min fair networks: A game theoretic approach","display_name":"Routing in max-min fair networks: A game theoretic approach","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2123376500","doi":"https://doi.org/10.1109/icnp.2010.5762749","mag":"2123376500"},"language":"en","primary_location":{"id":"doi:10.1109/icnp.2010.5762749","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp.2010.5762749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 18th IEEE International Conference on Network Protocols","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/A5048130147","display_name":"Dejun Yang","orcid":"https://orcid.org/0000-0002-1811-4423"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dejun Yang","raw_affiliation_strings":["CIDSE Department, Arizona State University, Tempe, AZ, USA","CIDSE Dept. at Arizona State University, Tempe, 85287, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIDSE Department, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CIDSE Dept. at Arizona State University, Tempe, 85287, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoliang Xue","raw_affiliation_strings":["CIDSE Department, Arizona State University, Tempe, AZ, USA","CIDSE Dept. at Arizona State University, Tempe, 85287, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIDSE Department, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CIDSE Dept. at Arizona State University, Tempe, 85287, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010754242","display_name":"Xi Fang","orcid":"https://orcid.org/0000-0002-3783-2041"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xi Fang","raw_affiliation_strings":["CIDSE Department, Arizona State University, Tempe, AZ, USA","CIDSE Dept. at Arizona State University, Tempe, 85287, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIDSE Department, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CIDSE Dept. at Arizona State University, Tempe, 85287, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111921078","display_name":"Satyajayant Misra","orcid":null},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satyajayant Misra","raw_affiliation_strings":["CS Department, New Mexico State University, Las Cruces, NM, USA","CS Dept. at New Mexico State University, Las Cruces, 88003, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CS Department, New Mexico State University, Las Cruces, NM, USA","institution_ids":["https://openalex.org/I10052268"]},{"raw_affiliation_string":"CS Dept. at New Mexico State University, Las Cruces, 88003, USA","institution_ids":["https://openalex.org/I10052268"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100405987","display_name":"Jin Zhang","orcid":"https://orcid.org/0000-0002-7464-2247"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jin Zhang","raw_affiliation_strings":["CIDSE Department, Arizona State University, Tempe, AZ, USA","CIDSE Dept. at Arizona State University, Tempe, 85287, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIDSE Department, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"CIDSE Dept. at Arizona State University, Tempe, 85287, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.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"}},"topics":[{"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"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9955999851226807,"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.7230780720710754},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.7164947390556335},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.5932937860488892},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.5343754887580872},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.49966001510620117},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.49593648314476013},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.47854098677635193},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4721265733242035},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.4675433039665222},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4267022907733917},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.417791485786438},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.4123861789703369},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.41107162833213806},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3643651008605957},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3301079273223877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18619444966316223},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.11967989802360535}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7230780720710754},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7164947390556335},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.5932937860488892},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5343754887580872},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.49966001510620117},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.49593648314476013},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.47854098677635193},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4721265733242035},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.4675433039665222},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4267022907733917},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.417791485786438},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.4123861789703369},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.41107162833213806},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3643651008605957},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3301079273223877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18619444966316223},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.11967989802360535},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icnp.2010.5762749","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp.2010.5762749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 18th IEEE International Conference on Network Protocols","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.6479","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.6479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.public.asu.edu/~dyang16/doc/ICNP2010-MAXBAR.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":23,"referenced_works":["https://openalex.org/W1526250527","https://openalex.org/W1611178753","https://openalex.org/W1987300875","https://openalex.org/W1994537767","https://openalex.org/W2004993199","https://openalex.org/W2026402358","https://openalex.org/W2073440460","https://openalex.org/W2090820749","https://openalex.org/W2105808107","https://openalex.org/W2111889949","https://openalex.org/W2112197510","https://openalex.org/W2123878303","https://openalex.org/W2125258707","https://openalex.org/W2130556831","https://openalex.org/W2142065670","https://openalex.org/W2152119126","https://openalex.org/W2157289131","https://openalex.org/W2613173048","https://openalex.org/W3163287424","https://openalex.org/W4230500858","https://openalex.org/W6631508959","https://openalex.org/W6646796786","https://openalex.org/W6737445176"],"related_works":["https://openalex.org/W2236801283","https://openalex.org/W3144192480","https://openalex.org/W3125511878","https://openalex.org/W2050089535","https://openalex.org/W2892220642","https://openalex.org/W1491291158","https://openalex.org/W2024471263","https://openalex.org/W4300514062","https://openalex.org/W2949715110","https://openalex.org/W2223636084"],"abstract_inverted_index":{"In":[0,70],"this":[1],"paper,":[2],"we":[3,72],"study":[4],"the":[5,17,46,63,75,79,83,86,139,143,153,169,178,181],"problem":[6,36],"of":[7,22,48,78,85,97],"routing":[8,68,183],"in":[9,120,160],"networks":[10],"with":[11,112,172],"max-min":[12,116],"fair":[13,117],"congestion":[14,118],"control":[15,119],"at":[16,55],"link":[18],"level.":[19],"The":[20,35],"goal":[21],"each":[23,102],"user":[24,61,107],"is":[25,37,52],"to":[26,65,108,130,146,157],"maximize":[27],"its":[28,33,67],"own":[29],"bandwidth":[30,100,114],"by":[31,137],"selecting":[32],"path.":[34],"formulated":[38],"as":[39,88],"a":[40,56,89,94,106,110,126],"non-cooperative":[41],"game.":[42],"We":[43,91,123],"first":[44],"prove":[45,135],"existence":[47],"Nash":[49,57],"Equilibria.":[50],"This":[51],"important,":[53],"because":[54],"Equilibrium":[58],"(NE),":[59],"no":[60],"has":[62],"incentive":[64],"change":[66],"strategy.":[69],"addition,":[71],"investigate":[73],"how":[74],"selfish":[76],"behavior":[77],"users":[80],"may":[81],"affect":[82],"performance":[84],"network":[87,144,154],"whole.":[90],"next":[92],"introduce":[93],"novel":[95],"concept":[96],"observed":[98],"available":[99],"on":[101],"link.":[103],"It":[104],"allows":[105],"find":[109],"path":[111],"maximum":[113],"under":[115],"polynomial":[121],"time.":[122],"then":[124],"present":[125],"game":[127,141],"based":[128],"algorithm":[129],"compute":[131],"an":[132,147,158],"NE":[133,159],"and":[134,165],"that":[136,152],"following":[138],"natural":[140],"course":[142],"converges":[145],"NE.":[148],"Extensive":[149],"experiments":[150],"show":[151],"can":[155],"converge":[156],"less":[161],"than":[162],"10":[163],"iterations":[164],"also":[166],"significantly":[167],"improves":[168],"fairness":[170],"compared":[171],"other":[173],"algorithms.":[174],"Our":[175],"results":[176],"have":[177],"implication":[179],"for":[180],"future":[182],"protocol":[184],"design.":[185]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}