{"id":"https://openalex.org/W2043721862","doi":"https://doi.org/10.1016/0169-7552(90)90122-9","title":"Distributed and fail-safe routing algorithms in toroidal-based metropolitan area networks","display_name":"Distributed and fail-safe routing algorithms in toroidal-based metropolitan area networks","publication_year":1990,"publication_date":"1990-06-01","ids":{"openalex":"https://openalex.org/W2043721862","doi":"https://doi.org/10.1016/0169-7552(90)90122-9","mag":"2043721862"},"language":"en","primary_location":{"id":"doi:10.1016/0169-7552(90)90122-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0169-7552(90)90122-9","pdf_url":null,"source":{"id":"https://openalex.org/S3084184","display_name":"Computer Networks and ISDN Systems","issn_l":"0169-7552","issn":["0169-7552","1879-2324"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Networks and ISDN Systems","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/A5111485037","display_name":"Johnny S. Wong","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Johnny S.K Wong","raw_affiliation_strings":["Computer Science Department, Iowa State University, Ames, IA 50011, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Iowa State University, Ames, IA 50011, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112814386","display_name":"Youngdon Kang","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Youngdon Kang","raw_affiliation_strings":["Computer Science Department, Iowa State University, Ames, IA 50011, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Iowa State University, Ames, IA 50011, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111485037"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":1.9608,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87706588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"5","first_page":"379","last_page":"391"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9979000091552734,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9979000091552734,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9970999956130981,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9957000017166138,"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.8181219100952148},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6275946497917175},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5368407964706421},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5155220031738281},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5080444812774658},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4830237329006195},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.46580061316490173},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4614962041378021},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4225809574127197},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4119439125061035},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.385474294424057},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3778708577156067},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2892313003540039},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1789366900920868},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17472663521766663},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06538325548171997}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8181219100952148},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6275946497917175},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5368407964706421},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5155220031738281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5080444812774658},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4830237329006195},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.46580061316490173},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4614962041378021},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4225809574127197},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4119439125061035},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.385474294424057},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3778708577156067},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2892313003540039},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1789366900920868},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17472663521766663},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06538325548171997},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0169-7552(90)90122-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0169-7552(90)90122-9","pdf_url":null,"source":{"id":"https://openalex.org/S3084184","display_name":"Computer Networks and ISDN Systems","issn_l":"0169-7552","issn":["0169-7552","1879-2324"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Networks and ISDN Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W146397162","https://openalex.org/W1985988333","https://openalex.org/W2029187109","https://openalex.org/W2149464191","https://openalex.org/W2150519657","https://openalex.org/W2165681304","https://openalex.org/W2169528473","https://openalex.org/W2293738792","https://openalex.org/W2293938620","https://openalex.org/W6605970467","https://openalex.org/W6806412085"],"related_works":["https://openalex.org/W1997091564","https://openalex.org/W2108305519","https://openalex.org/W2607223747","https://openalex.org/W2102655743","https://openalex.org/W2081964190","https://openalex.org/W2117123509","https://openalex.org/W2594015745","https://openalex.org/W2138640781","https://openalex.org/W2381844443","https://openalex.org/W2102969916"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}