{"id":"https://openalex.org/W1684488688","doi":"https://doi.org/10.1109/tc.1986.1676752","title":"On Fault-Tolerant Distributor Communication Architecture","display_name":"On Fault-Tolerant Distributor Communication Architecture","publication_year":1986,"publication_date":"1986-03-01","ids":{"openalex":"https://openalex.org/W1684488688","doi":"https://doi.org/10.1109/tc.1986.1676752","mag":"1684488688"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1986.1676752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1986.1676752","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5037416660","display_name":"Guha","orcid":null},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Guha","raw_affiliation_strings":["Department of Mathematics, Jadavpur University","Department of Mathematics, Jadavpur University#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Jadavpur University","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"Department of Mathematics, Jadavpur University#TAB#","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110755828","display_name":"Sen Sen","orcid":null},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]},{"id":"https://openalex.org/I155781252","display_name":"University of South Carolina","ror":"https://ror.org/02b6qw903","country_code":"US","type":"education","lineage":["https://openalex.org/I155781252"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"Sen","raw_affiliation_strings":["Department of Computer Science, University of South Carolina, Columbia, SC, USA","Jadavpur university,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of South Carolina, Columbia, SC, USA","institution_ids":["https://openalex.org/I155781252"]},{"raw_affiliation_string":"Jadavpur university,","institution_ids":["https://openalex.org/I170979836"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037416660"],"corresponding_institution_ids":["https://openalex.org/I170979836"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.13977823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"C-35","issue":"3","first_page":"281","last_page":"283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9941999912261963,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9896000027656555,"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/computer-science","display_name":"Computer science","score":0.7738486528396606},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7162081003189087},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.6165643334388733},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6073470711708069},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5896360278129578},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.5628964900970459},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5596120357513428},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5236829519271851},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5223825573921204},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5030326247215271},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4924198389053345},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.4878280460834503},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.47493937611579895},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4703020453453064},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.443828284740448},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4236510694026947},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.41550230979919434},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.411072313785553},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4043926000595093},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27557462453842163},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.17969146370887756},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09031963348388672}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7738486528396606},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7162081003189087},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.6165643334388733},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6073470711708069},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5896360278129578},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.5628964900970459},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5596120357513428},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5236829519271851},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5223825573921204},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5030326247215271},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4924198389053345},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.4878280460834503},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.47493937611579895},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4703020453453064},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.443828284740448},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4236510694026947},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.41550230979919434},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.411072313785553},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4043926000595093},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27557462453842163},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.17969146370887756},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09031963348388672},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1986.1676752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1986.1676752","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1829285233","https://openalex.org/W1971937118","https://openalex.org/W1987020722","https://openalex.org/W2022286645","https://openalex.org/W2085319748","https://openalex.org/W2113113620","https://openalex.org/W2134484974","https://openalex.org/W2136747096","https://openalex.org/W2160645305"],"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/W1971025399"],"abstract_inverted_index":{"A":[0],"new":[1],"routing":[2,66],"algorithm":[3,22,67],"is":[4,59],"proposed":[5],"in":[6,14,64],"this":[7,21],"correspondence":[8],"for":[9],"the":[10,24,28,34,37,41,47,52,65,73],"network":[11,42],"architecture":[12],"developed":[13],"[1].":[15],"It":[16],"has":[17],"been":[18],"shown":[19],"that":[20],"gives":[23],"shortest":[25,70],"path":[26,71,80],"between":[27],"source":[29,74],"to":[30,75],"destination,":[31,76],"when":[32,49],"all":[33],"processors":[35,53],"and":[36],"communication":[38],"links":[39],"of":[40,51],"are":[43,54],"non-":[44],"faulty.":[45],"For":[46],"situation":[48],"some":[50],"faulty,":[55],"a":[56,79],"heuristic":[57],"function":[58],"given,":[60],"which":[61],"if":[62,77],"used":[63],"will":[68],"give":[69],"from":[72],"such":[78],"exists.":[81]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}