{"id":"https://openalex.org/W1492906811","doi":"https://doi.org/10.1080/17445760.2015.1057587","title":"Fault-tolerant routing over shortest node-disjoint paths in hypercubes","display_name":"Fault-tolerant routing over shortest node-disjoint paths in hypercubes","publication_year":2015,"publication_date":"2015-07-16","ids":{"openalex":"https://openalex.org/W1492906811","doi":"https://doi.org/10.1080/17445760.2015.1057587","mag":"1492906811"},"language":"en","primary_location":{"id":"doi:10.1080/17445760.2015.1057587","doi":"https://doi.org/10.1080/17445760.2015.1057587","is_oa":false,"landing_page_url":"https://doi.org/10.1080/17445760.2015.1057587","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W1492906811"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5045474955","display_name":"Lokendra Singh Umrao","orcid":"https://orcid.org/0000-0001-6362-4476","observed_orcids":["https://orcid.org/0000-0001-6362-4476"]},"institutions":[{"id":"https://openalex.org/I56404289","display_name":"Indian Institute of Technology BHU","ror":"https://ror.org/01kh5gc44","country_code":"IN","type":"education","lineage":["https://openalex.org/I56404289","https://openalex.org/I91357014"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Lokendra Singh Umrao","raw_affiliation_strings":["Department of Computer Science & Engineering, Indian Institute of Technology (BHU), Varanasi, Uttar Pradesh 221 005, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology (BHU), Varanasi, Uttar Pradesh 221 005, India","institution_ids":["https://openalex.org/I56404289"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077150926","display_name":"Ravi Shankar Singh","orcid":"https://orcid.org/0000-0002-5394-7551","observed_orcids":["https://orcid.org/0000-0002-5394-7551"]},"institutions":[{"id":"https://openalex.org/I56404289","display_name":"Indian Institute of Technology BHU","ror":"https://ror.org/01kh5gc44","country_code":"IN","type":"education","lineage":["https://openalex.org/I56404289","https://openalex.org/I91357014"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ravi Shankar Singh","raw_affiliation_strings":["Department of Computer Science & Engineering, Indian Institute of Technology (BHU), Varanasi, Uttar Pradesh 221 005, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology (BHU), Varanasi, Uttar Pradesh 221 005, India","institution_ids":["https://openalex.org/I56404289"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045474955"],"corresponding_institution_ids":["https://openalex.org/I56404289"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"31","issue":"3","first_page":"294","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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.9994999766349792,"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":9.999999747378752e-05,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.0,"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/fault-tolerant-routing","display_name":"fault-tolerant routing","score":0.9959999918937683},{"id":"https://openalex.org/keywords/hypercube-networks","display_name":"hypercube networks","score":0.8930000066757202},{"id":"https://openalex.org/keywords/vertex-disjoint-paths","display_name":"node-disjoint paths","score":0.9629999995231628},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9399999976158142},{"id":"https://openalex.org/keywords/distributed-routing-algorithm","display_name":"distributed routing algorithm","score":0.7730000019073486},{"id":"https://openalex.org/keywords/process-failures","display_name":"process failures","score":0.7480000257492065},{"id":"https://openalex.org/keywords/message-delivery","display_name":"message delivery","score":0.6029999852180481}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7340996265411377},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6035875678062439},{"id":"https://openalex.org/C2777880217","wikidata":"https://www.wikidata.org/wiki/Q4674282","display_name":"Acknowledgement","level":2,"score":0.5920994281768799},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5487488508224487},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5114137530326843},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.496707022190094},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4958992898464203},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4809243381023407},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4683135449886322},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45683830976486206},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4516217112541199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44912150502204895},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.20200714468955994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1841428577899933},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.17962118983268738},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12265324592590332},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06366947293281555},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/17445760.2015.1057587","doi":"https://doi.org/10.1080/17445760.2015.1057587","is_oa":false,"landing_page_url":"https://doi.org/10.1080/17445760.2015.1057587","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1537714433","https://openalex.org/W1538529406","https://openalex.org/W1967259079","https://openalex.org/W2004178113","https://openalex.org/W2017861455","https://openalex.org/W2023415255","https://openalex.org/W2036007014","https://openalex.org/W2064672441","https://openalex.org/W2119888753","https://openalex.org/W2120120110","https://openalex.org/W2122056736","https://openalex.org/W2124470961","https://openalex.org/W2142730954","https://openalex.org/W2150082598","https://openalex.org/W2160984008","https://openalex.org/W2170837631","https://openalex.org/W2171625696","https://openalex.org/W2906689411","https://openalex.org/W3169463464"],"related_works":["https://openalex.org/W1602130209","https://openalex.org/W2438326796","https://openalex.org/W1538529406","https://openalex.org/W2349620165","https://openalex.org/W1035526991","https://openalex.org/W2384114136","https://openalex.org/W2063583978","https://openalex.org/W2171625696","https://openalex.org/W4392306334","https://openalex.org/W2385099539"],"abstract_inverted_index":{"This":[0],"paper":[1],"presented":[2],"a":[3,79,91,99,146],"routing":[4,26,41,56,140],"algorithm":[5,89,95,117,138],"that":[6,96],"finds":[7],"n":[8,108],"disjoint":[9,112],"shortest":[10,29,71,81],"paths":[11,31,73,85,144],"from":[12],"the":[13,22,37,128,136],"source":[14],"node":[15,19],"s":[16],"to":[17,35,53,77],"target":[18],"d":[20],"in":[21,42,75,135,145],"n-dimensional":[23],"hypercube.":[24],"Fault-tolerant":[25],"over":[27,110,142],"all":[28,70,107],"node-disjoint":[30,72,143],"has":[32,58],"been":[33,59],"investigated":[34,60],"overcome":[36],"failure":[38],"encountered":[39],"during":[40],"hypercube":[43,62,147],"networks.":[44,63],"In":[45],"this":[46],"paper,":[47],"we":[48],"proposed":[49,65,88,137],"an":[50],"efficient":[51],"approach":[52,66],"provide":[54],"fault-tolerant":[55],"which":[57],"on":[61,69],"The":[64,87],"is":[67,90],"based":[68],"concept":[74],"order":[76],"find":[78],"fault-free":[80],"path":[82],"among":[83],"several":[84],"provided.":[86],"simple":[92],"uniform":[93],"distributed":[94,116],"can":[97],"tolerate":[98],"large":[100],"number":[101],"of":[102],"process":[103],"failures,":[104],"while":[105],"delivering":[106],"messages":[109,120,131,141],"optimal-length":[111],"paths.":[113],"However,":[114],"no":[115],"uses":[118],"acknowledgement":[119,130],"(acks)":[121,132],"for":[122,126,139],"fault":[123],"tolerance.":[124],"So,":[125],"dealing":[127],"faults,":[129],"are":[133],"included":[134],"network.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}
