{"id":"https://openalex.org/W2003193855","doi":"https://doi.org/10.1109/infcom.2012.6195640","title":"A distributed Newton's method for joint multi-hop routing and flow control: Theory and algorithm","display_name":"A distributed Newton's method for joint multi-hop routing and flow control: Theory and algorithm","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2003193855","doi":"https://doi.org/10.1109/infcom.2012.6195640","mag":"2003193855"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2012.6195640","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195640","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":"article","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/A5100409661","display_name":"Jia Liu","orcid":"https://orcid.org/0000-0001-8844-3233"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jia Liu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ohio State Uinversity, Columbus, OH, USA","Department of Electrical and Computer Engineering, the Ohio State University, Columbus, 43210, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ohio State Uinversity, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, the Ohio State University, Columbus, 43210, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043357545","display_name":"Hanif D. Sherali","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hanif D. Sherali","raw_affiliation_strings":["Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA","Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, 24061, USA"],"affiliations":[{"raw_affiliation_string":"Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, 24061, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100409661"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":3.546,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.92997791,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2489","last_page":"2497"},"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.9995999932289124,"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.9995999932289124,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9965999722480774,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.7662627100944519},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6622974872589111},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.6028667092323303},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5996811389923096},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.587035059928894},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.579832136631012},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.5651503801345825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5046490430831909},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.43547502160072327},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41633331775665283},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.260910302400589},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.15850886702537537},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.13559207320213318},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.11632692813873291}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.7662627100944519},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6622974872589111},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.6028667092323303},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5996811389923096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.587035059928894},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.579832136631012},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.5651503801345825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5046490430831909},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43547502160072327},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41633331775665283},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.260910302400589},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.15850886702537537},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.13559207320213318},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.11632692813873291},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2012.6195640","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195640","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":25,"referenced_works":["https://openalex.org/W1578099820","https://openalex.org/W1632601927","https://openalex.org/W1974303270","https://openalex.org/W2000151369","https://openalex.org/W2003193855","https://openalex.org/W2010997912","https://openalex.org/W2033384536","https://openalex.org/W2093187490","https://openalex.org/W2105177639","https://openalex.org/W2107172705","https://openalex.org/W2112952306","https://openalex.org/W2158504546","https://openalex.org/W2158893758","https://openalex.org/W2159715570","https://openalex.org/W2164991395","https://openalex.org/W2172054180","https://openalex.org/W2296319761","https://openalex.org/W2481108008","https://openalex.org/W2610857016","https://openalex.org/W2787523326","https://openalex.org/W3101071905","https://openalex.org/W3102033508","https://openalex.org/W4234534407","https://openalex.org/W4240896209","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W2983297293","https://openalex.org/W4388964614","https://openalex.org/W4221162014","https://openalex.org/W2972343833","https://openalex.org/W2169345436","https://openalex.org/W2053964895","https://openalex.org/W2952728270","https://openalex.org/W2996136316","https://openalex.org/W2970432723","https://openalex.org/W1560140409"],"abstract_inverted_index":{"The":[0,82,169],"fast":[1],"growing":[2],"scale":[3,186],"and":[4,32,58,75,100,109,117,136,159],"heterogeneity":[5],"of":[6,13,23,80,96,173,187,199,215],"current":[7],"communication":[8],"networks":[9],"necessitate":[10],"the":[11,20,33,94,97,105,119,139,143,155,166,184,213,223],"design":[12,26,230],"distributed":[14,24,67,88,176],"cross-layer":[15,25,228],"optimization":[16],"algorithms.":[17],"So":[18],"far,":[19],"standard":[21],"approach":[22],"is":[27,37,71,127,179,232],"based":[28],"on":[29,52],"dual":[30,110,160],"decomposition":[31],"subgradient":[34],"algorithm,":[35],"which":[36,70],"a":[38,43,54,65,72,77,87,196],"first-order":[39,192,235],"method":[40,74,90,178],"that":[41,125,180,231],"has":[42],"slow":[44],"convergence":[45,200],"rate.":[46],"In":[47],"this":[48],"paper,":[49],"we":[50,123,149],"focus":[51],"solving":[53],"joint":[55],"multi-path":[56],"routing":[57],"flow":[59],"control":[60],"(MRFC)":[61],"problem":[62,121],"by":[63],"designing":[64],"new":[66],"Newton's":[68,89,177],"method,":[69],"second-order":[73,237],"enjoys":[76],"quadratic":[78,197],"rate":[79,198],"convergence.":[81],"major":[83],"challenges":[84],"in":[85,92,138,191,202,227],"developing":[86],"lie":[91],"decentralizing":[93],"computation":[95],"Hessian":[98],"matrix":[99],"its":[101],"inverse":[102],"for":[103,145,153],"both":[104,154],"primal":[106,156],"Newton":[107,157,204],"direction":[108,158],"variable":[111,161],"updates.":[112],"By":[113],"appropriately":[114],"reformulating,":[115],"rearranging,":[116],"exploiting":[118],"special":[120],"structures,":[122],"show":[124],"it":[126,181],"possible":[128],"to":[129,211,222,236],"decompose":[130],"such":[131],"computations":[132],"into":[133],"source":[134],"nodes":[135],"links":[137],"network,":[140],"thus":[141,163],"eliminating":[142],"need":[144],"global":[146],"information.":[147],"Furthermore,":[148],"derive":[150],"closed-form":[151],"expressions":[152],"updates,":[162],"significantly":[164],"reducing":[165],"computational":[167],"complexity.":[168],"most":[170],"attractive":[171],"feature":[172],"our":[174,216],"proposed":[175,217],"requires":[182],"almost":[183],"same":[185],"information":[188],"exchange":[189],"as":[190,201],"methods,":[193],"while":[194],"achieving":[195],"centralized":[203],"methods.":[205,238],"We":[206],"provide":[207],"extensive":[208],"numerical":[209],"results":[210],"demonstrate":[212],"efficacy":[214],"algorithm.":[218],"Our":[219],"work":[220],"contributes":[221],"advanced":[224],"paradigm":[225],"shift":[226],"network":[229],"evolving":[233],"from":[234]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}