{"id":"https://openalex.org/W1524481615","doi":"https://doi.org/10.1109/drcn.2015.7149024","title":"Multi-failure restoration with minimal flow operations in software defined networks","display_name":"Multi-failure restoration with minimal flow operations in software defined networks","publication_year":2015,"publication_date":"2015-03-01","ids":{"openalex":"https://openalex.org/W1524481615","doi":"https://doi.org/10.1109/drcn.2015.7149024","mag":"1524481615"},"language":"en","primary_location":{"id":"doi:10.1109/drcn.2015.7149024","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2015.7149024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","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/A5087536048","display_name":"Saeed Akhavan Astaneh","orcid":null},"institutions":[{"id":"https://openalex.org/I39470171","display_name":"University of Ontario Institute of Technology","ror":"https://ror.org/016zre027","country_code":"CA","type":"education","lineage":["https://openalex.org/I39470171"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Saeed Astaneh","raw_affiliation_strings":["University of Ontario Institute of Technology","University of Ontario Institute of Technology,"],"affiliations":[{"raw_affiliation_string":"University of Ontario Institute of Technology","institution_ids":["https://openalex.org/I39470171"]},{"raw_affiliation_string":"University of Ontario Institute of Technology,","institution_ids":["https://openalex.org/I39470171"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001883078","display_name":"Shahram Shah Heydari","orcid":"https://orcid.org/0000-0002-6107-7728"},"institutions":[{"id":"https://openalex.org/I39470171","display_name":"University of Ontario Institute of Technology","ror":"https://ror.org/016zre027","country_code":"CA","type":"education","lineage":["https://openalex.org/I39470171"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Shahram Shah Heydari","raw_affiliation_strings":["University of Ontario Institute of Technology","University of Ontario Institute of Technology,"],"affiliations":[{"raw_affiliation_string":"University of Ontario Institute of Technology","institution_ids":["https://openalex.org/I39470171"]},{"raw_affiliation_string":"University of Ontario Institute of Technology,","institution_ids":["https://openalex.org/I39470171"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087536048"],"corresponding_institution_ids":["https://openalex.org/I39470171"],"apc_list":null,"apc_paid":null,"fwci":1.6641,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85114255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"36","issue":null,"first_page":"263","last_page":"266"},"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.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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"}},{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9925000071525574,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7885798215866089},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.7686171531677246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.706038236618042},{"id":"https://openalex.org/keywords/software-defined-networking","display_name":"Software-defined networking","score":0.6695720553398132},{"id":"https://openalex.org/keywords/openflow","display_name":"OpenFlow","score":0.6605116128921509},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6204069256782532},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6182851791381836},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.607162356376648},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.5629169344902039},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5027456283569336},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.45264413952827454},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.44041895866394043},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4285493791103363},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3694097101688385},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21562418341636658},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13159939646720886},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10700541734695435},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10116377472877502}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7885798215866089},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.7686171531677246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.706038236618042},{"id":"https://openalex.org/C77270119","wikidata":"https://www.wikidata.org/wiki/Q1655198","display_name":"Software-defined networking","level":2,"score":0.6695720553398132},{"id":"https://openalex.org/C192697461","wikidata":"https://www.wikidata.org/wiki/Q4045918","display_name":"OpenFlow","level":3,"score":0.6605116128921509},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6204069256782532},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6182851791381836},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.607162356376648},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5629169344902039},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5027456283569336},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.45264413952827454},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.44041895866394043},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4285493791103363},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3694097101688385},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21562418341636658},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13159939646720886},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10700541734695435},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10116377472877502},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/drcn.2015.7149024","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn.2015.7149024","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Climate action","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322675","display_name":"Mitacs","ror":"https://ror.org/00cjrc276"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W945610164","https://openalex.org/W1545368974","https://openalex.org/W1829787244","https://openalex.org/W1977545325","https://openalex.org/W1984828902","https://openalex.org/W1989632973","https://openalex.org/W2061494008","https://openalex.org/W2068176614","https://openalex.org/W2085267507","https://openalex.org/W2126487423","https://openalex.org/W2170824703","https://openalex.org/W4213060235","https://openalex.org/W6632650464","https://openalex.org/W6638835209"],"related_works":["https://openalex.org/W4220837700","https://openalex.org/W2012852954","https://openalex.org/W4377008240","https://openalex.org/W1675062406","https://openalex.org/W2558363974","https://openalex.org/W2295167007","https://openalex.org/W2066879250","https://openalex.org/W4250919833","https://openalex.org/W2324336707","https://openalex.org/W2089521921"],"abstract_inverted_index":{"We":[0,108,159],"consider":[1],"dynamic":[2],"flow":[3,44,96,115,193],"restoration":[4,116],"in":[5,8,17,27,63],"multi-failure":[6],"scenarios":[7,55],"OpenFlow-based":[9],"Software-Defined":[10],"Networks":[11],"(SDNs).":[12],"Flexibility":[13],"of":[14,29,58,95,122,191],"network":[15,37],"configuration":[16],"these":[18],"networks":[19],"makes":[20],"it":[21],"possible":[22,140],"to":[23,50,70,80,196],"dynamically":[24],"restore":[25],"flows":[26,59],"case":[28],"multilink":[30],"failures.":[31],"To":[32],"re-route":[33],"the":[34,51,67,93,110,114,120,128,138,146,152,167,189,199],"failed":[35],"flows,":[36],"devices":[38],"such":[39,72],"as":[40],"switches":[41],"carry":[42],"out":[43],"operations,":[45],"i.e.,":[46],"add":[47],"new":[48],"flow-entries":[49],"flow-tables.":[52],"In":[53],"disaster":[54,106],"where":[56],"thousands":[57],"must":[60,77],"be":[61,78],"restored":[62],"a":[64,82,124,155],"short":[65],"time,":[66],"time":[68],"required":[69,192],"perform":[71],"operations":[73,97,194],"is":[74],"significant":[75],"and":[76,101,118,143,169],"minimized":[79],"maintain":[81],"carrier-grade":[83],"network.":[84],"Shortest-path":[85],"based":[86],"techniques":[87],"do":[88],"not":[89],"take":[90],"into":[91,113],"account":[92],"number":[94,190],"(namely,":[98],"operation":[99,111,134,141,148],"cost)":[100],"therefore":[102],"are":[103],"inefficient":[104],"for":[105,166],"scenarios.":[107],"incorporate":[109],"cost":[112,131,149,201],"problem,":[117],"formulate":[119],"problem":[121],"finding":[123],"path":[125,130,157,200],"1)":[126],"with":[127,132,137,145,154,163,175],"lowest":[129,139],"capped":[133],"cost,":[135,142],"2)":[136],"3)":[144],"minimum":[147],"amongst":[150],"all":[151],"paths":[153],"Dijkstra-like":[156,164],"cost.":[158],"propose":[160],"optimal":[161],"algorithms":[162],"complexity":[165],"second":[168],"third":[170],"problems.":[171],"The":[172],"simulation":[173],"results":[174],"European":[176],"Reference":[177],"Network":[178],"(ERnet)":[179],"show":[180],"that":[181],"our":[182],"proposed":[183],"methods":[184],"on":[185],"average":[186],"can":[187],"reduce":[188],"up":[195],"15%":[197],"while":[198],"rises":[202],"less":[203],"than":[204],"3%.":[205]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}