{"id":"https://openalex.org/W2525766229","doi":"https://doi.org/10.1109/tnet.2015.2480418","title":"An Asynchronous Fixed-Point Algorithm for Resource Sharing With Coupled Objectives","display_name":"An Asynchronous Fixed-Point Algorithm for Resource Sharing With Coupled Objectives","publication_year":2015,"publication_date":"2015-10-15","ids":{"openalex":"https://openalex.org/W2525766229","doi":"https://doi.org/10.1109/tnet.2015.2480418","mag":"2525766229"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2015.2480418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2015.2480418","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-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/A5032424832","display_name":"Di Niu","orcid":"https://orcid.org/0000-0002-5250-7327"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Di Niu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083596391","display_name":"Baochun Li","orcid":"https://orcid.org/0000-0003-2404-0974"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Baochun Li","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032424832"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":1.7864,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.89652063,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"24","issue":"5","first_page":"2593","last_page":"2606"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T13553","display_name":"Age of Information Optimization","score":0.9934999942779541,"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.8229556083679199},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.8074346780776978},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.663119912147522},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5443633794784546},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5016474723815918},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.43930357694625854},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.41732853651046753},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.4120633602142334},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40522485971450806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36526209115982056},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1057634949684143}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8229556083679199},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8074346780776978},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.663119912147522},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5443633794784546},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5016474723815918},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43930357694625854},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.41732853651046753},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.4120633602142334},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40522485971450806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36526209115982056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1057634949684143},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2015.2480418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2015.2480418","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1583497301","https://openalex.org/W1603765807","https://openalex.org/W1979361375","https://openalex.org/W1982545958","https://openalex.org/W1987497363","https://openalex.org/W2035536069","https://openalex.org/W2037798990","https://openalex.org/W2097882016","https://openalex.org/W2109168557","https://openalex.org/W2112486185","https://openalex.org/W2121663029","https://openalex.org/W2123893388","https://openalex.org/W2126956578","https://openalex.org/W2138772603","https://openalex.org/W2143477261","https://openalex.org/W2158893758","https://openalex.org/W2159715570","https://openalex.org/W2162986857","https://openalex.org/W2164278908","https://openalex.org/W2165374450","https://openalex.org/W2167217653","https://openalex.org/W2220199421","https://openalex.org/W4240896209","https://openalex.org/W4292363360","https://openalex.org/W6676214487"],"related_works":["https://openalex.org/W2359120930","https://openalex.org/W2037613239","https://openalex.org/W2781777036","https://openalex.org/W2390469630","https://openalex.org/W2059050877","https://openalex.org/W1971290991","https://openalex.org/W4378770495","https://openalex.org/W1944783162","https://openalex.org/W2766289720","https://openalex.org/W1528719522"],"abstract_inverted_index":{"Distributed":[0],"resource":[1,86],"allocation":[2],"and":[3,112,161],"sharing":[4,87],"can":[5],"often":[6],"be":[7,69],"formulated":[8],"as":[9],"a":[10,24,80,130,173,184,190],"utility":[11],"maximization":[12],"problem,":[13],"with":[14,89,181],"the":[15,18,38,50,95,106,113,120,145,148,168],"objective":[16,39,91,186],"being":[17],"sum":[19],"of":[20,61,134,147,177,193],"user":[21,110],"utilities":[22,111],"minus":[23],"coupled":[25,90,114,185,194],"cost.":[26],"A":[27],"traditional":[28],"distributed":[29,83,153],"solution":[30,84],"to":[31,64,85,171],"such":[32,54],"problems,":[33],"called":[34],"\u201cconsistency":[35],"pricing,\u201d":[36],"decouples":[37],"function":[40],"via":[41],"dual":[42,159],"decomposition,":[43,160],"which":[44,66],"is":[45],"then":[46],"iteratively":[47],"solved":[48],"by":[49,104],"subgradient":[51],"method.":[52],"However,":[53],"gradient-based":[55],"approaches":[56],"may":[57,67],"require":[58],"many":[59],"iterations":[60],"message":[62],"passing":[63],"converge,":[65],"not":[68,182],"sufficient":[70],"in":[71],"large-scale":[72],"real-time":[73],"applications.":[74],"In":[75,163],"this":[76],"paper,":[77],"we":[78,143,165],"propose":[79],"new":[81],"fixed-point-like":[82],"problems":[88,180],"functions.":[92],"While":[93],"preserving":[94],"simple":[96],"pricing":[97],"interpretation,":[98],"our":[99],"approach":[100,172],"speeds":[101],"up":[102],"convergence":[103,123],"exploiting":[105],"structural":[107],"difference":[108],"between":[109],"cost":[115],"function.":[116],"We":[117],"theoretically":[118],"analyze":[119],"asynchronous":[121],"algorithm":[122,150,170],"conditions":[124],"based":[125,138],"on":[126,139],"contraction":[127],"mapping.":[128],"Through":[129],"detailed":[131],"case":[132],"study":[133],"cloud":[135],"bandwidth":[136],"reservation":[137],"real-world":[140],"workload":[141],"traces,":[142],"demonstrate":[144],"benefits":[146],"proposed":[149,169],"over":[151],"state-of-the-art":[152],"optimization":[154,179],"techniques":[155],"including":[156],"gradient":[157],"descent,":[158],"ADMM.":[162],"addition,":[164],"also":[166,189],"extend":[167],"more":[174],"general":[175],"class":[176,192],"consensus":[178],"only":[183],"function,":[187],"but":[188],"certain":[191],"constraints.":[195]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}