{"id":"https://openalex.org/W2028255354","doi":"https://doi.org/10.1109/mascot.2009.5366162","title":"Quality of service issues and nonconvex Network Utility Maximization for inelastic services in the Internet","display_name":"Quality of service issues and nonconvex Network Utility Maximization for inelastic services in the Internet","publication_year":2009,"publication_date":"2009-09-01","ids":{"openalex":"https://openalex.org/W2028255354","doi":"https://doi.org/10.1109/mascot.2009.5366162","mag":"2028255354"},"language":"en","primary_location":{"id":"doi:10.1109/mascot.2009.5366162","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascot.2009.5366162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems","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/A5040305670","display_name":"Ghulam Abbas","orcid":"https://orcid.org/0000-0003-3836-1373"},"institutions":[{"id":"https://openalex.org/I44852757","display_name":"Liverpool Hope University","ror":"https://ror.org/03ctjbj91","country_code":"GB","type":"education","lineage":["https://openalex.org/I44852757"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"G. Abbas","raw_affiliation_strings":["Intelligent and Distributed Systems Laboratory, Liverpool Hope University, UK","Intelligent and Distributed Systems Laboratory, Liverpool Hope University, L16 9JD, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Intelligent and Distributed Systems Laboratory, Liverpool Hope University, UK","institution_ids":["https://openalex.org/I44852757"]},{"raw_affiliation_string":"Intelligent and Distributed Systems Laboratory, Liverpool Hope University, L16 9JD, United Kingdom","institution_ids":["https://openalex.org/I44852757"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081696143","display_name":"Atulya K. Nagar","orcid":"https://orcid.org/0000-0001-5549-6435"},"institutions":[{"id":"https://openalex.org/I44852757","display_name":"Liverpool Hope University","ror":"https://ror.org/03ctjbj91","country_code":"GB","type":"education","lineage":["https://openalex.org/I44852757"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A.K. Nagar","raw_affiliation_strings":["Intelligent and Distributed Systems Laboratory, Liverpool Hope University, UK","Intelligent and Distributed Systems Laboratory, Liverpool Hope University, L16 9JD, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Intelligent and Distributed Systems Laboratory, Liverpool Hope University, UK","institution_ids":["https://openalex.org/I44852757"]},{"raw_affiliation_string":"Intelligent and Distributed Systems Laboratory, Liverpool Hope University, L16 9JD, United Kingdom","institution_ids":["https://openalex.org/I44852757"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062823430","display_name":"Hissam Tawfik","orcid":"https://orcid.org/0000-0002-3613-0910"},"institutions":[{"id":"https://openalex.org/I44852757","display_name":"Liverpool Hope University","ror":"https://ror.org/03ctjbj91","country_code":"GB","type":"education","lineage":["https://openalex.org/I44852757"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"H. Tawfik","raw_affiliation_strings":["Intelligent and Distributed Systems Laboratory, Liverpool Hope University, UK","Intelligent and Distributed Systems Laboratory, Liverpool Hope University, L16 9JD, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Intelligent and Distributed Systems Laboratory, Liverpool Hope University, UK","institution_ids":["https://openalex.org/I44852757"]},{"raw_affiliation_string":"Intelligent and Distributed Systems Laboratory, Liverpool Hope University, L16 9JD, United Kingdom","institution_ids":["https://openalex.org/I44852757"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079825375","display_name":"John Y. Goulermas","orcid":"https://orcid.org/0000-0003-0381-124X"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J.Y. Goulermas","raw_affiliation_strings":["Department of Electrical Engineering and Electronics, University of Liverpool, UK","Department of Electrical Engineering and Electronics, University of Liverpool, L69 3BX (United Kingdom)"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Electronics, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"Department of Electrical Engineering and Electronics, University of Liverpool, L69 3BX (United Kingdom)","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5040305670"],"corresponding_institution_ids":["https://openalex.org/I44852757"],"apc_list":null,"apc_paid":null,"fwci":0.6857,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.71273867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":null,"first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":1.0,"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":1.0,"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.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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9994999766349792,"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.9305366277694702},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7427811622619629},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6983983516693115},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5081233978271484},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5073944926261902},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1734781563282013},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12126654386520386}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9305366277694702},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7427811622619629},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6983983516693115},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5081233978271484},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5073944926261902},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1734781563282013},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12126654386520386}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mascot.2009.5366162","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mascot.2009.5366162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W291003596","https://openalex.org/W1540474102","https://openalex.org/W1548751632","https://openalex.org/W1554755917","https://openalex.org/W1563449476","https://openalex.org/W1572996156","https://openalex.org/W1609755472","https://openalex.org/W1984031944","https://openalex.org/W1986490170","https://openalex.org/W1987497363","https://openalex.org/W1998362379","https://openalex.org/W2007255736","https://openalex.org/W2022451981","https://openalex.org/W2037710455","https://openalex.org/W2038888321","https://openalex.org/W2075317014","https://openalex.org/W2084387308","https://openalex.org/W2096295989","https://openalex.org/W2109881441","https://openalex.org/W2112947567","https://openalex.org/W2143002315","https://openalex.org/W2146416675","https://openalex.org/W2156568423","https://openalex.org/W2159743267","https://openalex.org/W2160972440","https://openalex.org/W2162986857","https://openalex.org/W2172097551","https://openalex.org/W2787523326","https://openalex.org/W3173138228","https://openalex.org/W4213221859","https://openalex.org/W4234534407","https://openalex.org/W4245749353","https://openalex.org/W4296180618"],"related_works":["https://openalex.org/W2037613239","https://openalex.org/W3183857959","https://openalex.org/W2894990380","https://openalex.org/W195910675","https://openalex.org/W2363143319","https://openalex.org/W4243844638","https://openalex.org/W2127198104","https://openalex.org/W2757616806","https://openalex.org/W1992541996","https://openalex.org/W1964718673"],"abstract_inverted_index":{"Network":[0],"utility":[1,53],"maximization":[2],"(NUM)":[3],"provides":[4,59],"an":[5],"important":[6],"perspective":[7],"to":[8,97,145,164,195],"conduct":[9],"rate":[10,210],"allocation":[11,211],"where":[12,191],"optimal":[13,159],"performance,":[14],"in":[15,63,71,213],"terms":[16,214],"of":[17,36,68,91,134,207],"maximal":[18],"aggregate":[19],"bandwidth":[20,80],"utility,":[21],"is":[22,81,115,194],"generally":[23],"achieved":[24],"such":[25],"that":[26,45,51,72,125],"each":[27],"source":[28],"adaptively":[29],"adjusts":[30],"its":[31,222],"transmission":[32,95],"rate.":[33],"Behind":[34],"most":[35],"the":[37,66,89,106,118,127,147,151,162,167,170,192,205,208],"recent":[38],"literature":[39],"on":[40,117],"NUM,":[41],"common":[42],"assumptions":[43],"are":[44,48,55],"traffic":[46],"flows":[47],"elastic":[49,101],"and":[50,102,104,108,174,185,220,224],"their":[52],"functions":[54],"strictly":[56],"concave.":[57],"This":[58,86],"design":[60],"simplicity":[61],"but,":[62],"practice,":[64],"limits":[65],"applicability":[67],"resulting":[69],"protocols,":[70],"severe":[73],"QoS":[74,216],"problems":[75],"may":[76],"be":[77],"encountered":[78],"when":[79],"shared":[82],"by":[83],"inelastic":[84],"flows.":[85,229],"paper":[87],"investigates":[88],"problem":[90],"distributively":[92],"allocating":[93],"data":[94],"rates":[96],"multiclass":[98,218],"services,":[99,219],"both":[100],"inelastic,":[103],"overcomes":[105],"restrictive":[107],"often":[109],"unrealistic":[110],"assumptions.":[111],"The":[112],"proposed":[113,209],"method":[114,144],"based":[116,142],"Lagrangian":[119],"Relaxation":[120],"for":[121,217,226],"a":[122,132,138,179],"dual":[123,148],"formulation":[124],"decomposes":[126],"higher":[128],"dimension":[129],"NUM":[130],"into":[131],"number":[133],"subproblems.":[135,168],"We":[136,203],"use":[137,178],"novel":[139],"Surrogate":[140],"Subgradient":[141],"stochastic":[143],"solve":[146,165],"problem.":[149],"Unlike":[150],"ordinary":[152],"subgradient":[153,156],"methods,":[154],"surrogate":[155],"can":[157],"compute":[158],"prices":[160],"without":[161],"need":[163],"all":[166],"For":[169],"lower":[171],"dimension,":[172],"nonlinear":[173],"nonconvex":[175],"subproblems":[176],"we":[177],"hybrid":[180],"particle":[181],"swarm":[182],"optimization":[183],"(PSO)":[184],"sequential":[186],"quadratic":[187],"programming":[188],"(SQP)":[189],"method,":[190],"objective":[193],"achieve":[196],"fast":[197],"convergence":[198],"as":[199,201],"well":[200],"accuracy.":[202],"demonstrate":[204],"efficiency":[206],"algorithm,":[212],"maintaining":[215],"validate":[221],"scalability":[223],"accuracy":[225],"large":[227],"scale":[228]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}