{"id":"https://openalex.org/W1976026141","doi":"https://doi.org/10.1145/1190095.1190167","title":"Stability of multi-path dual congestion control algorithms","display_name":"Stability of multi-path dual congestion control algorithms","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1976026141","doi":"https://doi.org/10.1145/1190095.1190167","mag":"1976026141"},"language":"en","primary_location":{"id":"doi:10.1145/1190095.1190167","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190095.1190167","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st international conference on Performance evaluation methodolgies and tools - valuetools '06","raw_type":"proceedings-article"},"type":"conference-abstract","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/A5004499095","display_name":"Thomas Voice","orcid":"https://orcid.org/0000-0003-1840-7004"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Thomas Voice","raw_affiliation_strings":["Cambridge University, Cambridge, UK","Cambridge University, Cambridge UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cambridge University, Cambridge, UK","institution_ids":["https://openalex.org/I241749"]},{"raw_affiliation_string":"Cambridge University, Cambridge UK#TAB#","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004499095"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"56","last_page":"56"},"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.9998000264167786,"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.9998000264167786,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9986000061035156,"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.9955999851226807,"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/network-congestion","display_name":"Network congestion","score":0.6845810413360596},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6462912559509277},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6181116104125977},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5986710786819458},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5484085083007812},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5135274529457092},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4902675449848175},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.45306169986724854},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4491278827190399},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4456612467765808},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4429687559604645},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3461587429046631},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.33112800121307373},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.26540738344192505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.264055997133255},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2182009518146515},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.15129491686820984},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14757797122001648}],"concepts":[{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.6845810413360596},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6462912559509277},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6181116104125977},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5986710786819458},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5484085083007812},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5135274529457092},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4902675449848175},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.45306169986724854},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4491278827190399},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4456612467765808},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4429687559604645},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3461587429046631},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33112800121307373},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26540738344192505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.264055997133255},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2182009518146515},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.15129491686820984},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14757797122001648},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1190095.1190167","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190095.1190167","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st international conference on Performance evaluation methodolgies and tools - valuetools '06","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W197877943","https://openalex.org/W1564363694","https://openalex.org/W1572996156","https://openalex.org/W1974662497","https://openalex.org/W1984517191","https://openalex.org/W1989259681","https://openalex.org/W1995067210","https://openalex.org/W2001260709","https://openalex.org/W2011222041","https://openalex.org/W2053507305","https://openalex.org/W2061199207","https://openalex.org/W2069387689","https://openalex.org/W2075434761","https://openalex.org/W2106007310","https://openalex.org/W2125884935","https://openalex.org/W2137331053","https://openalex.org/W2142325999","https://openalex.org/W2147524058","https://openalex.org/W2150593854","https://openalex.org/W2154291530","https://openalex.org/W2154426776","https://openalex.org/W2156390226","https://openalex.org/W2157457404","https://openalex.org/W2159715570","https://openalex.org/W2170178059","https://openalex.org/W2386509573","https://openalex.org/W2598031246","https://openalex.org/W2797302609"],"related_works":["https://openalex.org/W2075768550","https://openalex.org/W3022218857","https://openalex.org/W2369178846","https://openalex.org/W2370289839","https://openalex.org/W2082716031","https://openalex.org/W2933494595","https://openalex.org/W4313347705","https://openalex.org/W1568049691","https://openalex.org/W1590096425","https://openalex.org/W2186005736"],"abstract_inverted_index":{"This":[0,89,128],"paper":[1],"investigates":[2],"fair,":[3],"scalable,":[4],"stable":[5,135],"congestion":[6,213],"controls":[7],"which":[8,58,121,234],"achieve":[9,29],"high":[10],"bandwidth":[11,31],"utilisation":[12],"over":[13],"networks":[14,248],"of":[15,25,42,94,117,139,182,198,209,250,253],"operating":[16],"multi-path":[17,37,115],"routing.":[18],"The":[19,47,157,202],"aim":[20],"is":[21,49,130,155,162,175,206,216],"to":[22,28,39,61,64,132,224,247],"take":[23],"advantage":[24],"path":[26,123],"diversity":[27,124],"efficient":[30],"allocation":[32],"without":[33],"causing":[34],"instability.":[35],"Two":[36],"extensions":[38],"the":[40,56,79,92,107,118,137,165,168,178,186,195,242],"class":[41],"dual":[43,119],"algorithms":[44],"are":[45,104,153],"considered.":[46],"first":[48],"a":[50,65,72,85,143,225,237],"natural":[51],"extension":[52,116,208],"previously":[53],"proposed":[54],"in":[55,136,164],"literature,":[57],"we":[59,160],"show":[60,99],"be":[62,133],"similar":[63],"continuous":[66,80],"time":[67,81,181],"sub-gradient":[68],"method":[69],"for":[70,146,171,211],"solving":[71],"network-wide":[73],"optimisation":[74],"problem.":[75],"We":[76,97],"establish":[77],"that":[78,100,222],"fluid":[82],"model":[83],"possesses":[84],"weak":[86,108],"stability":[87,109,204],"property.":[88],"analysis":[90,205],"assumes":[91],"absence":[93,138],"propagation":[95,102,140,151,260],"delays.":[96,261],"then":[98],"when":[101,125,149],"delays":[103,141,152],"present,":[105,154],"even":[106],"property":[110],"disappearsWe":[111],"develop":[112],"an":[113,207],"alternative":[114],"algorithm,":[120],"considers":[122],"evaluating":[126],"fairness.":[127],"algorithm":[129],"shown":[131],"globally":[134],"and":[142,255],"sufficient":[144,158],"condition":[145,159],"local":[147],"stability,":[148],"heterogeneous":[150,259],"found.":[156],"present":[161],"decentralised":[163],"following":[166],"sense:":[167],"gain":[169],"parameter":[170],"each":[172],"dynamic":[173],"variable":[174],"restricted":[176],"by":[177,194,218],"average":[179],"round-trip":[180,196],"packets":[183],"passing":[184],"through":[185,236],"link":[187,239],"or":[188],"source":[189],"it":[190],"represents,":[191],"but":[192],"not":[193],"times":[197],"any":[199],"other":[200],"packets.":[201],"delay":[203],"results":[210],"single-path":[212],"control.":[214],"It":[215],"obtained":[217],"treating":[219],"possible":[220],"routes":[221],"belong":[223],"given":[226],"origin-destination":[227],"pair":[228],"as":[229,231],"behaving":[230],"separate":[232],"sources":[233,254],"pass":[235],"virtual":[238],"located":[240],"at":[241],"origin.The":[243],"models":[244],"considered":[245],"apply":[246],"consisting":[249],"arbitrary":[251],"interconnections":[252],"links,":[256],"with":[257],"arbitrary,":[258]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-19T07:52:34.831488","created_date":"2025-10-10T00:00:00"}