{"id":"https://openalex.org/W2760903256","doi":"https://doi.org/10.1109/infocom.2017.8057155","title":"Non-concave network utility maximization: A distributed optimization approach","display_name":"Non-concave network utility maximization: A distributed optimization approach","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2760903256","doi":"https://doi.org/10.1109/infocom.2017.8057155","mag":"2760903256"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2017.8057155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2017.8057155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2017 - IEEE Conference on Computer Communications","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/A5090211825","display_name":"Mahmoud Ashour","orcid":"https://orcid.org/0000-0002-8678-6547"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahmoud Ashour","raw_affiliation_strings":["The Department of Electrical Engineering and Computer Science, The Pennsylvania State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Department of Electrical Engineering and Computer Science, The Pennsylvania State University","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100696194","display_name":"Jingyao Wang","orcid":"https://orcid.org/0000-0003-1013-5374"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jingyao Wang","raw_affiliation_strings":["The Department of Mechanics and Engineering Science, Peking University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Department of Mechanics and Engineering Science, Peking University","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035668981","display_name":"Constantino Lagoa","orcid":"https://orcid.org/0000-0001-6871-3240"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Constantino Lagoa","raw_affiliation_strings":["The Department of Electrical Engineering and Computer Science, The Pennsylvania State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Department of Electrical Engineering and Computer Science, The Pennsylvania State University","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076553434","display_name":"Necdet Serhat Aybat","orcid":"https://orcid.org/0000-0002-9839-9894"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Necdet Aybat","raw_affiliation_strings":["The Department of Industrial Engineering, The Pennsylvania State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Department of Industrial Engineering, The Pennsylvania State University","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112489758","display_name":"Hao Che","orcid":"https://orcid.org/0009-0001-9852-320X"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hao Che","raw_affiliation_strings":["The Department of Computer Science and Engineering, The University of Texas, Arlington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Department of Computer Science and Engineering, The University of Texas, Arlington","institution_ids":["https://openalex.org/I189196454"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3488,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.80829876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"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.9990000128746033,"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.9990000128746033,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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.9966999888420105,"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.7366560101509094},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6409995555877686},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6028027534484863},{"id":"https://openalex.org/keywords/utility-maximization-problem","display_name":"Utility maximization problem","score":0.5679822564125061},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5058633685112},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4683624505996704},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4675195515155792},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4593425691127777},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.45569413900375366},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4261578619480133},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.38758665323257446},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3628968894481659},{"id":"https://openalex.org/keywords/utility-maximization","display_name":"Utility maximization","score":0.3502468764781952},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27437931299209595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1547035574913025}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7366560101509094},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6409995555877686},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6028027534484863},{"id":"https://openalex.org/C2779044140","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization problem","level":3,"score":0.5679822564125061},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5058633685112},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4683624505996704},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4675195515155792},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4593425691127777},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.45569413900375366},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4261578619480133},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.38758665323257446},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3628968894481659},{"id":"https://openalex.org/C2985793214","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization","level":2,"score":0.3502468764781952},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27437931299209595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1547035574913025},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2017.8057155","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2017.8057155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2017 - IEEE Conference on Computer Communications","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":18,"referenced_works":["https://openalex.org/W1540474102","https://openalex.org/W1552176735","https://openalex.org/W1594882248","https://openalex.org/W1967344706","https://openalex.org/W1976944900","https://openalex.org/W2048187015","https://openalex.org/W2058532290","https://openalex.org/W2071848902","https://openalex.org/W2112947567","https://openalex.org/W2118139512","https://openalex.org/W2134577144","https://openalex.org/W2159715570","https://openalex.org/W2159743267","https://openalex.org/W2164278908","https://openalex.org/W2492150193","https://openalex.org/W2602166704","https://openalex.org/W4240896209","https://openalex.org/W4292363360"],"related_works":["https://openalex.org/W2951390543","https://openalex.org/W3121912968","https://openalex.org/W2949260239","https://openalex.org/W2949594337","https://openalex.org/W3123067344","https://openalex.org/W4299412355","https://openalex.org/W2953072363","https://openalex.org/W3125423763","https://openalex.org/W2950840434","https://openalex.org/W2729827172"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3,120],"algorithm":[4,93,134,165],"for":[5,96],"optimal":[6,121],"decentralized":[7],"traffic":[8,18,108,117,170],"engineering":[9],"in":[10,109,177],"communication":[11,148],"networks.":[12],"We":[13],"aim":[14],"at":[15,140],"distributing":[16],"the":[17,20,25,50,66,88,97,100,114,133,164,169,188],"among":[19],"available":[21],"routes":[22],"such":[23],"that":[24,86,112],"network":[26,35,69,116,126],"utility":[27,36,59,70],"is":[28,40,94,155,166,171],"maximized.":[29],"In":[30],"some":[31],"practical":[32],"applications,":[33],"modeling":[34],"using":[37,143],"non-concave":[38,58],"functions":[39],"of":[41,52,57,79,87,99,163,179],"particular":[42],"interest,":[43],"e.g.,":[44],"video":[45],"streaming.":[46],"Therefore,":[47],"we":[48],"tackle":[49],"problem":[51,73],"optimizing":[53],"a":[54,77,110,180],"generalized":[55],"class":[56],"functions.":[60],"The":[61,150,161],"approach":[62],"used":[63],"to":[64,85,119,125,173,195],"solve":[65],"resulting":[67],"non-convex":[68],"maximization":[71],"(NUM)":[72],"relies":[74],"on":[75],"designing":[76],"sequence":[78],"convex":[80,101],"relaxations":[81],"whose":[82],"solutions":[83],"converge":[84],"original":[89],"problem.":[90],"A":[91],"distributed":[92],"proposed":[95],"solution":[98],"relaxation.":[102],"Each":[103],"user":[104,142],"independently":[105,137],"controls":[106],"its":[107],"way":[111],"drives":[113],"overall":[115],"allocation":[118],"operating":[122],"point":[123],"subject":[124],"capacity":[127],"constraints.":[128],"All":[129],"computations":[130],"required":[131],"by":[132],"are":[135,193],"performed":[136],"and":[138,146],"locally":[139],"each":[141],"local":[144],"information":[145,153],"minimal":[147],"overhead.":[149],"only":[151],"non-local":[152],"needed":[154],"binary":[156],"feedback":[157],"from":[158],"congested":[159],"links.":[160],"robustness":[162],"demonstrated,":[167],"where":[168],"shown":[172],"be":[174],"automatically":[175],"rerouted":[176],"case":[178],"link":[181],"failure":[182],"or":[183],"having":[184],"new":[185],"users":[186],"joining":[187],"network.":[189],"Numerical":[190],"simulation":[191],"results":[192],"presented":[194],"validate":[196],"our":[197],"findings.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}