{"id":"https://openalex.org/W2007092769","doi":"https://doi.org/10.1109/drcn.2007.4762277","title":"Between fully dynamic routing and robust stable routing","display_name":"Between fully dynamic routing and robust stable routing","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W2007092769","doi":"https://doi.org/10.1109/drcn.2007.4762277","mag":"2007092769"},"language":"en","primary_location":{"id":"doi:10.1109/drcn.2007.4762277","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2007.4762277","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 6th International Workshop on Design and Reliable Communication Networks","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/A5071827996","display_name":"Walid Ben\u2010Ameur","orcid":"https://orcid.org/0000-0003-2865-1123"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210116811","display_name":"Institut National des T\u00e9l\u00e9communications et des Technologies de l'Information et de la Communication","ror":"https://ror.org/023rzn231","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210116811"]}],"countries":["DZ","FR"],"is_corresponding":true,"raw_author_name":"Walid Ben-Ameur","raw_affiliation_strings":["Institut National des T\u00e9l\u00e9communications, GET/INT CNRS/Samovar, Evry, France","GET/INT CNRS/Samovar, Inst. Nat. des Telecommun., Evry"],"affiliations":[{"raw_affiliation_string":"Institut National des T\u00e9l\u00e9communications, GET/INT CNRS/Samovar, Evry, France","institution_ids":["https://openalex.org/I4210116811","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"GET/INT CNRS/Samovar, Inst. Nat. des Telecommun., Evry","institution_ids":["https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071827996"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210116811"],"apc_list":null,"apc_paid":null,"fwci":2.9145,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.90250042,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9950000047683716,"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.6812639236450195},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6209294199943542},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5549809336662292},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5406955480575562},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5236244797706604},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4059757590293884},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32004714012145996},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3118954002857208},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.21692302823066711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14329010248184204}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6812639236450195},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6209294199943542},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5549809336662292},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5406955480575562},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5236244797706604},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4059757590293884},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32004714012145996},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3118954002857208},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21692302823066711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14329010248184204}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/drcn.2007.4762277","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2007.4762277","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 6th International Workshop on Design and Reliable Communication Networks","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":26,"referenced_works":["https://openalex.org/W179830015","https://openalex.org/W1494355250","https://openalex.org/W1530143763","https://openalex.org/W1604234417","https://openalex.org/W1608405214","https://openalex.org/W1963888335","https://openalex.org/W1970837734","https://openalex.org/W1995285162","https://openalex.org/W2009529053","https://openalex.org/W2011039300","https://openalex.org/W2042861566","https://openalex.org/W2044807855","https://openalex.org/W2047204731","https://openalex.org/W2072947773","https://openalex.org/W2079003301","https://openalex.org/W2088007832","https://openalex.org/W2105291450","https://openalex.org/W2117781171","https://openalex.org/W2120998805","https://openalex.org/W2123138012","https://openalex.org/W2139054829","https://openalex.org/W2161201881","https://openalex.org/W4229690180","https://openalex.org/W4238668657","https://openalex.org/W4253347690","https://openalex.org/W6629425166"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2136173851","https://openalex.org/W2029407480","https://openalex.org/W4253436398","https://openalex.org/W2556128816"],"abstract_inverted_index":{"Due":[0],"to":[1,18,33,49,73],"the":[2,5,8,24,63,83,109],"success":[3],"of":[4,10,126],"Internet":[6],"and":[7,102,115],"diversity":[9],"communication":[11],"applications,":[12],"it":[13,46],"is":[14,47,56,66,129],"becoming":[15],"increasingly":[16],"difficult":[17,72],"forecast":[19],"traffic":[20,25,31,60,85],"patterns.":[21],"To":[22],"capture":[23],"variations,":[26],"a":[27,34,51,75,90,97,117],"flexible":[28],"model":[29],"where":[30,79],"belongs":[32],"polytope":[35],"was":[36],"introduced":[37],"in":[38,107,131],"[5],":[39],"[6],":[40],"[4].":[41],"Using":[42],"this":[43,127,132],"uncertainty":[44,110],"model,":[45],"possible":[48,69],"compute":[50],"robust":[52,100,118],"stable":[53],"routing":[54,80,101,119],"which":[55],"valid":[57],"for":[58,120],"any":[59],"matrix":[61],"inside":[62],"polytope.":[64],"It":[65,105],"also":[67],"theoretically":[68],"but":[70],"practically":[71],"consider":[74],"fully":[76],"dynamic":[77,103],"strategy":[78,91],"depends":[81],"on":[82],"current":[84],"matrix.":[86],"We":[87],"will":[88],"propose":[89],"that":[92],"can":[93],"be":[94],"seen":[95],"as":[96],"compromise":[98],"between":[99],"routing.":[104],"consists":[106],"partitioning":[108],"set":[111],"into":[112],"some":[113],"subsets":[114],"considering":[116],"each":[121],"subset.":[122],"A":[123],"theoretical":[124],"study":[125],"problem":[128],"provided":[130],"paper.":[133]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}