{"id":"https://openalex.org/W2055951638","doi":"https://doi.org/10.1109/drcn.2007.4762270","title":"Optimization of resilient weight systems for shortest-path routing in IP networks","display_name":"Optimization of resilient weight systems for shortest-path routing in IP networks","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W2055951638","doi":"https://doi.org/10.1109/drcn.2007.4762270","mag":"2055951638"},"language":"en","primary_location":{"id":"doi:10.1109/drcn.2007.4762270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2007.4762270","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/A5109065477","display_name":"Mateusz Dzida","orcid":null},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Mateusz Dzida","raw_affiliation_strings":["Institute of Telecommunications Research and Development Center of Polish Telecom, Warsaw University of Technology","R&D Center of Polish Telecom, Warsaw Univ. of Technol., Warsaw"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications Research and Development Center of Polish Telecom, Warsaw University of Technology","institution_ids":["https://openalex.org/I108403487"]},{"raw_affiliation_string":"R&D Center of Polish Telecom, Warsaw Univ. of Technol., Warsaw","institution_ids":["https://openalex.org/I108403487"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026376024","display_name":"Micha\u0142 Zago\u017cd\u017con","orcid":null},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Michal Zagozdzon","raw_affiliation_strings":["Institute of Telecommunications Research and Development Center of Polish Telecom, Warsaw University of Technology","R&D Center of Polish Telecom, Warsaw Univ. of Technol., Warsaw"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications Research and Development Center of Polish Telecom, Warsaw University of Technology","institution_ids":["https://openalex.org/I108403487"]},{"raw_affiliation_string":"R&D Center of Polish Telecom, Warsaw Univ. of Technol., Warsaw","institution_ids":["https://openalex.org/I108403487"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081391892","display_name":"Micha\u0142 Pi\u00f3ro","orcid":"https://orcid.org/0000-0002-9347-9764"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Michal Pioro","raw_affiliation_strings":["Institute of Telecommunications Research and Development Center of Polish Telecom, Warsaw University of Technology","Inst. of Telecommun., Warsaw Univ. of Technol., Warsaw"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications Research and Development Center of Polish Telecom, Warsaw University of Technology","institution_ids":["https://openalex.org/I108403487"]},{"raw_affiliation_string":"Inst. of Telecommun., Warsaw Univ. of Technol., Warsaw","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109065477"],"corresponding_institution_ids":["https://openalex.org/I108403487"],"apc_list":null,"apc_paid":null,"fwci":1.92800202,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85659279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"53","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9965000152587891,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9965000152587891,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9760000109672546,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10986","display_name":"RFID technology advancements","score":0.9704999923706055,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6251485347747803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6079980134963989},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5861279964447021},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5652406215667725},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.5555852055549622},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5375139117240906},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5357230305671692},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5299773216247559},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5249747633934021},{"id":"https://openalex.org/keywords/ip-forwarding","display_name":"IP forwarding","score":0.4957443177700043},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49069201946258545},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4270256757736206},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4176444113254547},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4119293689727783},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41090887784957886},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.35893702507019043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2914409041404724},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1863211989402771},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1388184130191803},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08347254991531372}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6251485347747803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6079980134963989},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5861279964447021},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5652406215667725},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.5555852055549622},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5375139117240906},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5357230305671692},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5299773216247559},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5249747633934021},{"id":"https://openalex.org/C174809319","wikidata":"https://www.wikidata.org/wiki/Q5973191","display_name":"IP forwarding","level":5,"score":0.4957443177700043},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49069201946258545},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4270256757736206},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4176444113254547},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4119293689727783},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41090887784957886},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.35893702507019043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2914409041404724},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1863211989402771},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1388184130191803},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08347254991531372},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/drcn.2007.4762270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2007.4762270","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"},{"id":"pmh:oai:lup.lub.lu.se:43cd7407-b49b-460d-8b2f-4fa66215939e","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/1024474","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1485595694","https://openalex.org/W1518880548","https://openalex.org/W1538983961","https://openalex.org/W1559215823","https://openalex.org/W1575609038","https://openalex.org/W1582342575","https://openalex.org/W1603421663","https://openalex.org/W1682076822","https://openalex.org/W1866042042","https://openalex.org/W1993927700","https://openalex.org/W1996637843","https://openalex.org/W2096655151","https://openalex.org/W2152825263","https://openalex.org/W2242172514","https://openalex.org/W2339500526","https://openalex.org/W3145789150","https://openalex.org/W4241499524","https://openalex.org/W4247255165","https://openalex.org/W6632157684","https://openalex.org/W6634813736","https://openalex.org/W6690131717"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1997440971","https://openalex.org/W2064711473","https://openalex.org/W1972487624","https://openalex.org/W1515277195","https://openalex.org/W2186932829","https://openalex.org/W2121598558","https://openalex.org/W2237860883","https://openalex.org/W1698965822","https://openalex.org/W1579931977"],"abstract_inverted_index":{"In":[0],"the":[1,23,40,45,53,59,62,67,87,108,117,156,182,192,198,201,207,219,225,241,248],"paper":[2,129],"we":[3],"address":[4],"traffic":[5,88,145,208],"engineering":[6,209],"problems":[7],"related":[8,211],"to":[9,77,93,107,111,116,151,191,212],"optimization":[10,251],"of":[11,22,35,42,160,200,218,247,257],"routing":[12,20,28,140],"in":[13,127,131,155,163],"IP":[14,43,48,170],"networks":[15],"applying":[16],"destination-based":[17],"shortest":[18,54,68,109],"path":[19,69],"(SPR)":[21],"OSPF":[24],"type.":[25],"An":[26],"SPR":[27],"pattern":[29],"is":[30,84,96,185,253],"determined":[31,51],"by":[32,187,255],"a":[33,71,78,133,139,178,229,236,258],"system":[34,137,184],"(administrative)":[36],"weights":[37,190,199],"defined":[38],"over":[39,214],"set":[41],"links:":[44],"routes":[46],"for":[47],"forwarding":[49],"are":[50,172],"as":[52,228],"paths":[55,110],"computed":[56],"locally":[57],"at":[58],"nodes":[60],"using":[61],"current":[63],"link":[64,135,152,221],"weights.":[65],"When":[66],"from":[70,90,103],"certain":[72,169],"node":[73,91],"(node":[74],"v,":[75],"say)":[76,83],"particular":[79],"destination":[80,94,112],"(destination":[81],"t,":[82,113],"not":[85,149,196],"unique,":[86],"routed":[89],"v":[92,104],"t":[95],"split":[97],"equally":[98],"among":[99],"all":[100,164,215],"links":[101,171],"outgoing":[102],"that":[105,142,176],"belong":[106],"i.e.,":[114],"according":[115],"Equal":[118],"Cost":[119],"Multiple-Paths":[120],"(ECMP)":[121],"rule.":[122],"The":[123,245],"basic":[124],"problem":[125,227],"considered":[126,165,226],"this":[128],"consists":[130],"finding":[132],"resilient":[134],"weight":[136,183,250],"generating":[138],"scheme":[141],"satisfies":[143],"given":[144],"demands":[146],"and":[147,162,195,234],"does":[148],"lead":[150],"overloads":[153],"both":[154],"normal":[157],"network":[158],"state":[159],"operation":[161],"failure":[166,179,216],"states":[167],"when":[168],"failed.":[173],"We":[174,205,223],"assume":[175],"if":[177],"occurs":[180],"then":[181],"modified":[186],"assigning":[188],"infinite":[189],"failed":[193],"links,":[194],"altering":[197],"remaining,":[202],"operating":[203],"links.":[204],"consider":[206],"goal":[210],"minimization,":[213],"states,":[217],"maximal":[220],"overload.":[222],"formulate":[224],"mixed":[230],"integer":[231],"programme":[232],"(MIP)":[233],"propose":[235],"heuristic":[237],"algorithm":[238],"based":[239],"on":[240],"tabu":[242],"search":[243],"meta-heuristic.":[244],"efficiency":[246],"proposed":[249],"method":[252],"illustrated":[254],"means":[256],"numerical":[259],"study.":[260]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}