{"id":"https://openalex.org/W2115471557","doi":"https://doi.org/10.1002/(sici)1097-0037(200005)35:3<207::aid-net4>3.0.co;2-f","title":"Shortest path routing and fault-tolerant routing on de Bruijn networks","display_name":"Shortest path routing and fault-tolerant routing on de Bruijn networks","publication_year":2000,"publication_date":"2000-05-01","ids":{"openalex":"https://openalex.org/W2115471557","doi":"https://doi.org/10.1002/(sici)1097-0037(200005)35:3<207::aid-net4>3.0.co;2-f","mag":"2115471557"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(200005)35:3<207::aid-net4>3.0.co;2-f","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(200005)35:3<207::aid-net4>3.0.co;2-f","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-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/A5078224175","display_name":"Jyh-Wen Mao","orcid":null},"institutions":[{"id":"https://openalex.org/I142974352","display_name":"National Sun Yat-sen University","ror":"https://ror.org/00mjawt10","country_code":"TW","type":"education","lineage":["https://openalex.org/I142974352"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jyh-Wen Mao","raw_affiliation_strings":["Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan 804","Department of Applied Mathematics , National Sun Yat-sen University , Kaohsiung, Taiwan 804"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung, Taiwan 804","institution_ids":["https://openalex.org/I142974352"]},{"raw_affiliation_string":"Department of Applied Mathematics , National Sun Yat-sen University , Kaohsiung, Taiwan 804","institution_ids":["https://openalex.org/I142974352"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004244212","display_name":"Chang\u2010Biau Yang","orcid":"https://orcid.org/0000-0001-6643-5523"},"institutions":[{"id":"https://openalex.org/I142974352","display_name":"National Sun Yat-sen University","ror":"https://ror.org/00mjawt10","country_code":"TW","type":"education","lineage":["https://openalex.org/I142974352"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chang-Biau Yang","raw_affiliation_strings":["Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan 804","Department of Computer Science and Engineering, National Sun Yat\u2010sen University, Kaohsiung, Taiwan 804"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan 804","institution_ids":["https://openalex.org/I142974352"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, National Sun Yat\u2010sen University, Kaohsiung, Taiwan 804","institution_ids":["https://openalex.org/I142974352"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004244212"],"corresponding_institution_ids":["https://openalex.org/I142974352"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.8572,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.81301537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"35","issue":"3","first_page":"207","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.996399998664856,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.996399998664856,"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/T11342","display_name":"Carbon and Quantum Dots Applications","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9828000068664551,"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/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6725984811782837},{"id":"https://openalex.org/keywords/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.6524196267127991},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.629207193851471},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6232532858848572},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5750653743743896},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.572925329208374},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.571860671043396},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5647434592247009},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5500843524932861},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.5130090117454529},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.448609322309494},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.43225789070129395},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3658922612667084},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3590019941329956},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34148108959198},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.29730814695358276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27183255553245544},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24894124269485474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16758844256401062},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0580446720123291}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6725984811782837},{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.6524196267127991},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.629207193851471},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6232532858848572},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5750653743743896},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.572925329208374},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.571860671043396},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5647434592247009},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5500843524932861},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.5130090117454529},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.448609322309494},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.43225789070129395},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3658922612667084},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3590019941329956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34148108959198},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.29730814695358276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27183255553245544},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24894124269485474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16758844256401062},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0580446720123291}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/(sici)1097-0037(200005)35:3<207::aid-net4>3.0.co;2-f","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(200005)35:3<207::aid-net4>3.0.co;2-f","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.9208","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.9208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://par.cse.nsysu.edu.tw/~cbyang/person/publish/j00bruijn.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1829285233","https://openalex.org/W2029894006","https://openalex.org/W2046805643","https://openalex.org/W2071712440","https://openalex.org/W2080888633","https://openalex.org/W2098296467","https://openalex.org/W2100877540","https://openalex.org/W2115670901","https://openalex.org/W2118433864","https://openalex.org/W2119368737","https://openalex.org/W2141806175","https://openalex.org/W2410583980"],"related_works":["https://openalex.org/W2204759952","https://openalex.org/W2154023691","https://openalex.org/W2121598558","https://openalex.org/W1972487624","https://openalex.org/W2064711473","https://openalex.org/W1997440971","https://openalex.org/W2186932829","https://openalex.org/W1971025399","https://openalex.org/W3020950764","https://openalex.org/W2922383892"],"abstract_inverted_index":{"In":[0,80],"this":[1],"paper,":[2],"we":[3,62],"study":[4],"the":[5,9,26,44,78,97,101,105,137,144],"routing":[6,23,38,60,66,91],"problem":[7],"for":[8],"undirected":[10,27],"binary":[11,28,45],"de":[12,29,46],"Bruijn":[13,30,47],"interconnection":[14],"network.":[15,31,79],"Researchers":[16],"have":[17],"never":[18],"proposed":[19],"a":[20,35],"shortest":[21,36,58,102,138],"path":[22,37,59,139],"algorithm":[24,92,120],"on":[25,56],"We":[32],"first":[33,89],"propose":[34,63],"algorithm,":[39,61],"whose":[40],"time":[41],"complexity":[42],"in":[43,77,143],"network":[48],"of":[49,96,108],"2m":[50],"nodes":[51],"is":[52,69,100,107,140],"O(m2).":[53],"Then,":[54],"based":[55],"our":[57,81],"two":[64,83,98,123],"fault-tolerant":[65,90,145],"schemes.":[67],"It":[68],"assumed":[70],"that":[71,94],"at":[72,110,128],"most":[73,111,129],"one":[74,95],"node":[75],"fails":[76],"schemes,":[82],"node-disjoint":[84,124],"paths":[85,99,125],"are":[86],"found.":[87],"Our":[88,118],"guarantees":[93],"path,":[103],"and":[104,131],"other":[106],"length":[109],"m":[112,115,130,132],"+":[113,116,133],"log2":[114],"4.":[117],"second":[119],"can":[121],"find":[122],"with":[126],"lengths":[127],"4,":[134],"respectively,":[135],"if":[136],"not":[141],"required":[142],"routing.":[146],"\u00a9":[147],"2000":[148],"John":[149],"Wiley":[150],"&":[151],"Sons,":[152],"Inc.":[153]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}