On the public citation graph

Cluster-Fault Tolerant Routing in a Torus

0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0037(200001)35:1<83::aid-net7>3.0.co;2-dopenalex-snapshot
Cluster fault-tolerant routing in star graphs
inferredcites →https://doi.org/10.1007/11576235_20openalex-snapshot
Online Adaptive Fault-Tolerant Routing in 2D Torus
inferredcites →https://doi.org/10.1007/978-3-319-07518-1_35openalex-snapshot
Tofu Interconnect 2: System-on-Chip Integration of High-Performance Interconnect
inferredcites →https://doi.org/10.1007/978-3-642-13136-3_27openalex-snapshot
Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs
inferredcites →https://doi.org/10.1007/978-3-642-14279-6openalex-snapshot
Graph Theory
inferredcites →https://doi.org/10.1007/s11276-016-1432-7openalex-snapshot
Hybrid data dissemination protocol (HDDP) for wireless sensor networks
inferredcites →https://doi.org/10.1016/0020-0190(95)00135-yopenalex-snapshot
Node-to-node cluster fault tolerant routing in star graphs
inferredcites →https://doi.org/10.1016/j.chb.2016.04.023openalex-snapshot
An empirical examination of consumer adoption of Internet of Things services: Network externalities and concern for information privacy perspectives
inferredcites →https://doi.org/10.1016/j.ipl.2010.04.023openalex-snapshot
Fault-tolerant routing in burnt pancake graphs
inferredcites →https://doi.org/10.1016/j.jnca.2015.07.014openalex-snapshot
Fault resilience in sensor networks: Distributed node-disjoint multi-path multi-sink forwarding
inferredcites →https://doi.org/10.1016/s0167-8191(98)00050-7openalex-snapshot
Node-to-set and set-to-set cluster fault tolerant routing in hypercubes
inferredcites →https://doi.org/10.1093/comjnl/39.1.14openalex-snapshot
An Efficient Algorithm for Node-to-node Routing in Hypercubes with Faulty Clusters
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.2234openalex-snapshot
Topological properties of hypercubes
inferredcites →https://doi.org/10.1109/12.620486openalex-snapshot
K-pairwise cluster fault tolerant routing in hypercubes
inferredcites →https://doi.org/10.1109/71.808128openalex-snapshot
Unicast in hypercubes with large number of faulty nodes
inferredcites →https://doi.org/10.1109/71.940745openalex-snapshot
Recursive diagonal torus: an interconnection network for massively parallel computers
inferredcites →https://doi.org/10.1109/aispas.1995.401342openalex-snapshot
Fault tolerant routing in toroidal networks
inferredcites →https://doi.org/10.1109/cybermatics_2018.2018.00290openalex-snapshot
On the Torus Pairwise Disjoint-Path Routing Problem
inferredcites →https://doi.org/10.1145/2465.2467openalex-snapshot
The cosmic cube
inferredcites →https://doi.org/10.1515/amcs-2015-0052openalex-snapshot
Torus–Connected Cycles: A Simple and Scalable Topology for Interconnection Networks
inferredcites →https://doi.org/10.15803/ijnc.5.2_272openalex-snapshot
Hypercube Fault Tolerant Routing with Bit Constraint
inferredcites →https://doi.org/10.15803/ijnc.7.2_173openalex-snapshot
A Set-to-Set Disjoint Paths Routing Algorithm in Tori
inferredcites →https://doi.org/10.2503/hortj.okd-136openalex-snapshot
Shortening of the Juvenile Phase of the Southern Highbush Blueberry (Vaccinium corymbosum L. interspecific hybrid) Grown in Controlled Rooms under Artificial Light
inferredcites →https://doi.org/10.3390/s18113912openalex-snapshot
Torus Pairwise Disjoint-Path Routing
inferredcites →https://doi.org/10.3390/s19081833openalex-snapshot
State-of-the-Art Internet of Things in Protected Agriculture
inferredcites →https://doi.org/10.4064/fm-10-1-96-115openalex-snapshot
Zur allgemeinen Kurventheorie

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-79728-7_32openalex-snapshot
Assessing the Super $$P_k$$-Connectedness of Crossed Cubes
inferred← citeshttps://doi.org/10.1007/978-3-031-08819-3_26openalex-snapshot
On the Conditional $$P_k$$-connectivity of Hypercube-Based Architectures
inferred← citeshttps://doi.org/10.1007/978-3-031-35836-4_24openalex-snapshot
Vulnerability of the Hypercube Network Based on $$P_2$$-cuts
inferred← citeshttps://doi.org/10.1007/978-3-031-96093-2_27openalex-snapshot
Cluster-Cuts of BCube-Based Data Center Networks
inferred← citeshttps://doi.org/10.1007/978-981-96-6294-4_14openalex-snapshot
A Stochastic Edge-Fault-Tolerant Routing Algorithm in Torus Networks
inferred← citeshttps://doi.org/10.1007/s11227-022-04450-2openalex-snapshot
A 3-disjoint path design of non-blocking shuffle exchange network by extra port alignment
inferred← citeshttps://doi.org/10.1007/s11227-022-04494-4openalex-snapshot
Exact assessment of the super $$P_k$$-connectivity for the crossed cube interconnection network
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128397openalex-snapshot
Reliability evaluation for bijection-connected networks based on the super P-connectivity
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.017openalex-snapshot
Cluster connectivity of hypercube-based networks under the super fault-tolerance condition
inferred← citeshttps://doi.org/10.1109/csce60160.2023.00344openalex-snapshot
Fault-tolerant Routing Methods in Bicubes
inferred← citeshttps://doi.org/10.1109/spec55080.2022.10058401openalex-snapshot
On Routing Tolerant to Power Supply Failure of a Cabinet of a Torus-Based Supercomputer
inferred← citeshttps://doi.org/10.18178/jacn.2024.12.2.291openalex-snapshot
Enhanced Number Plate Recognition for Restricted Area Access Control Using Deep Learning Models and EasyOCR Integration
inferred← citeshttps://doi.org/10.3390/app10228252openalex-snapshot
TFBN: A Cost Effective High Performance Hierarchical Interconnection Network
inferred← citeshttps://doi.org/10.3390/computers12090173openalex-snapshot
Torus-Connected Toroids: An Efficient Topology for Interconnection Networks
inferred← citeshttps://doi.org/10.3390/math11143255openalex-snapshot
Dual Protection Routing Trees on Graphs
inferred← citeshttps://doi.org/10.3390/su15086766openalex-snapshot
Static Evaluation of a Midimew Connected Torus Network for Next Generation Supercomputers
inferred← citeshttps://doi.org/10.3390/sym14081740openalex-snapshot
Fault Tolerant Addressing Scheme for Oxide Interconnection Networks
inferred← citeshttps://doi.org/10.4018/ijsi.309965openalex-snapshot
The SOF Programming Paradigm
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.