{"id":"https://openalex.org/W1980912325","doi":"https://doi.org/10.1109/icc.2012.6363668","title":"The successive approximation approach for multi-path utility maximization problem","display_name":"The successive approximation approach for multi-path utility maximization problem","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W1980912325","doi":"https://doi.org/10.1109/icc.2012.6363668","mag":"1980912325"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2012.6363668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2012.6363668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Communications (ICC)","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/A5008946371","display_name":"Phuong Luu Vo","orcid":"https://orcid.org/0000-0003-3909-4385"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Phuong L. Vo","raw_affiliation_strings":["Department of Computer Engineering, Kyung Hee University, South Korea","Department of Computer Engineering Kyung Hee University, Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"Department of Computer Engineering Kyung Hee University, Korea#TAB#","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061680998","display_name":"L\u00ea Anh Tu\u1ea5n","orcid":"https://orcid.org/0000-0003-0208-9478"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Anh T. Le","raw_affiliation_strings":["Department of Computer Engineering, Kyung Hee University, South Korea","Department of Computer Engineering Kyung Hee University, Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"Department of Computer Engineering Kyung Hee University, Korea#TAB#","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034052371","display_name":"Choong Seon Hong","orcid":"https://orcid.org/0000-0003-3484-7333"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Choong S. Hong","raw_affiliation_strings":["Department of Computer Engineering, Kyung Hee University, South Korea","Department of Computer Engineering Kyung Hee University, Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kyung Hee University, South Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"Department of Computer Engineering Kyung Hee University, Korea#TAB#","institution_ids":["https://openalex.org/I35928602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008946371"],"corresponding_institution_ids":["https://openalex.org/I35928602"],"apc_list":null,"apc_paid":null,"fwci":0.7451,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.72179754,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1255","last_page":"1259"},"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.9998999834060669,"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.9998999834060669,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9980999827384949,"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.9977999925613403,"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/path","display_name":"Path (computing)","score":0.7301138043403625},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6996806263923645},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6808475255966187},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5870214104652405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5560904741287231},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5257716178894043},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4929914176464081},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.491731196641922},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.47491252422332764},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.457057923078537},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.43877556920051575},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41335529088974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33928483724594116},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2588827610015869},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11958464980125427},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.051247239112854004}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7301138043403625},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6996806263923645},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6808475255966187},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5870214104652405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5560904741287231},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5257716178894043},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4929914176464081},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.491731196641922},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.47491252422332764},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.457057923078537},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.43877556920051575},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41335529088974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33928483724594116},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2588827610015869},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11958464980125427},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.051247239112854004},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc.2012.6363668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2012.6363668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.723.2952","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.2952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://networking.khu.ac.kr/layouts/net/publications/data/2012InternationalConference11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1969648546","https://openalex.org/W2011222041","https://openalex.org/W2037710455","https://openalex.org/W2075434761","https://openalex.org/W2103621877","https://openalex.org/W2112820013","https://openalex.org/W2118442492","https://openalex.org/W2126956578","https://openalex.org/W2140985887","https://openalex.org/W2147524058","https://openalex.org/W2161615677","https://openalex.org/W2163822469","https://openalex.org/W2296319761","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W1964872188","https://openalex.org/W2187391117","https://openalex.org/W1981809986","https://openalex.org/W2949367465","https://openalex.org/W2587048717","https://openalex.org/W4235203617","https://openalex.org/W2006359264","https://openalex.org/W3029201158","https://openalex.org/W4794847","https://openalex.org/W2056357792"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,30,76],"solve":[4],"the":[5,22,28,46,56,59,69,73,87],"network":[6],"utility":[7],"maximization":[8],"(NUM)":[9],"problem":[10,40,61],"for":[11],"networks":[12],"with":[13,21],"both":[14],"multi-path":[15,82,97],"and":[16,25,38,99],"single-path":[17,100],"users.":[18],"To":[19],"deal":[20],"non-strictly":[23],"convexity":[24],"non-separability":[26],"of":[27,54,68,81,91],"problem,":[29],"approximate":[31],"it":[32],"to":[33,58,63],"a":[34,52,64,79],"new":[35],"strictly":[36],"convex":[37],"separable":[39],"which":[41],"is":[42,102],"efficiently":[43],"solved":[44],"by":[45],"standard":[47],"dual-based":[48],"decomposition":[49],"approach.":[50],"After":[51],"sequence":[53],"approximations,":[55],"solution":[57,67],"approximation":[60],"converges":[62],"globally":[65],"optimal":[66],"original":[70],"NUM.":[71],"From":[72],"theoretical":[74],"analysis,":[75],"also":[77],"introduce":[78],"design":[80],"Reno":[83],"(mReno)":[84],"based":[85],"on":[86],"reverse":[88],"engineering":[89],"framework":[90],"TCP":[92],"Reno.":[93],"The":[94],"fairness":[95],"among":[96],"users":[98,101],"guaranteed.":[103]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}