{"id":"https://openalex.org/W2010407023","doi":"https://doi.org/10.1145/1141277.1141368","title":"Enforcing path uniqueness in internet routing","display_name":"Enforcing path uniqueness in internet routing","publication_year":2006,"publication_date":"2006-04-23","ids":{"openalex":"https://openalex.org/W2010407023","doi":"https://doi.org/10.1145/1141277.1141368","mag":"2010407023"},"language":"en","primary_location":{"id":"doi:10.1145/1141277.1141368","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1141277.1141368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM symposium on Applied computing","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/A5077389505","display_name":"Daniel Lucraft","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Daniel Lucraft","raw_affiliation_strings":["IC-PARC, Imperial College London","IC-Parc, Imperial College London#TAB#"],"affiliations":[{"raw_affiliation_string":"IC-PARC, Imperial College London","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"IC-Parc, Imperial College London#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089660083","display_name":"Andrew Eremin","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrew Eremin","raw_affiliation_strings":["IC-PARC, Imperial College London","IC-Parc, Imperial College London#TAB#"],"affiliations":[{"raw_affiliation_string":"IC-PARC, Imperial College London","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"IC-Parc, Imperial College London#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005036369","display_name":"Farid Ajili","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Farid Ajili","raw_affiliation_strings":["IC-PARC, Imperial College London","IC-Parc, Imperial College London#TAB#"],"affiliations":[{"raw_affiliation_string":"IC-PARC, Imperial College London","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"IC-Parc, Imperial College London#TAB#","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077389505"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":0.6036,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7096949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"399","last_page":"403"},"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.9993000030517578,"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.9991999864578247,"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/computer-science","display_name":"Computer science","score":0.7609224319458008},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7301524877548218},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6073013544082642},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5980625748634338},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5621666312217712},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5391855835914612},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5232966542243958},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.5193166136741638},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.49921488761901855},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.4940977394580841},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.45758500695228577},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45221060514450073},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4336598515510559},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.26869139075279236},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15717685222625732},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13242951035499573},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11116313934326172}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7609224319458008},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7301524877548218},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6073013544082642},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5980625748634338},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5621666312217712},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5391855835914612},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5232966542243958},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.5193166136741638},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.49921488761901855},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.4940977394580841},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.45758500695228577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45221060514450073},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4336598515510559},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.26869139075279236},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15717685222625732},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13242951035499573},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11116313934326172},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1141277.1141368","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1141277.1141368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM symposium on Applied computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1516402079","https://openalex.org/W1993927700","https://openalex.org/W2068562012","https://openalex.org/W2096655151","https://openalex.org/W4242272122","https://openalex.org/W4388745419"],"related_works":["https://openalex.org/W2035900373","https://openalex.org/W2030140188","https://openalex.org/W1534342069","https://openalex.org/W2541025055","https://openalex.org/W2347445325","https://openalex.org/W2153322197","https://openalex.org/W2769209783","https://openalex.org/W1992443296","https://openalex.org/W2126842185","https://openalex.org/W2289590069"],"abstract_inverted_index":{"Often":[0],"an":[1],"IP":[2,85],"network":[3,16],"administrator":[4],"will":[5],"desire":[6],"to":[7,40,65,90],"provision":[8],"unique":[9],"paths":[10],"for":[11,61],"traffic":[12],"demands":[13],"while":[14],"avoiding":[15],"congestion.":[17],"Under":[18],"destination":[19],"based":[20],"shortest":[21],"path":[22],"protocols":[23],"this":[24],"must":[25],"be":[26,103],"achieved":[27],"indirectly":[28],"via":[29],"careful":[30],"selection":[31],"of":[32,53,57,98,108],"link":[33],"metrics.":[34],"We":[35,49],"demonstrate":[36],"that":[37],"current":[38],"approaches":[39,79],"metric":[41],"optimisation":[42],"cannot":[43],"reliably":[44,91],"produce":[45,66,92],"such":[46],"unique-path":[47,67,93,100],"routings.":[48,94],"present":[50],"two":[51],"methods":[52],"enhancing":[54],"the":[55],"capability":[56],"local":[58],"search":[59],"algorithms":[60],"optimising":[62],"these":[63],"metrics":[64],"solutions:":[68],"a":[69],"more":[70],"intelligent":[71],"move":[72],"operator":[73],"and":[74,87],"adaptive":[75],"penalisation":[76],"schemes.":[77,117],"These":[78],"are":[80,88],"evaluated":[81],"on":[82],"four":[83],"real-world":[84],"backbones,":[86],"shown":[89],"By":[95],"appropriate":[96],"choice":[97],"parameters,":[99],"solutions":[101],"may":[102],"found":[104],"either":[105],"quicker":[106],"or":[107],"better":[109],"quality":[110],"than":[111],"those":[112],"produced":[113],"by":[114],"fixed":[115],"penalty":[116]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}