Node-to-node cluster fault tolerant routing in star graphs

DOI10.1016/0020-0190(95)00135-YzbMath0998.68507MaRDI QIDQ1350230

Shietung Peng, Qian-Ping Gu

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsInterconnection networksFault tolerant routingNode disjoint paths

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (7)

Node-to-set disjoint paths problem in star graphs ⋮ An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs ⋮ Cluster connectivity of hypercube-based networks under the super fault-tolerance condition ⋮ AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH ⋮ Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity ⋮ Conditional fault-tolerant routing of (n,k)-star graphs ⋮ Fault-tolerant routing in burnt pancake graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the fault-diameter of the star graph
• Fault tolerance of the star graph interconnection network
• A group-theoretic model for symmetric interconnection networks
• Cluster fault-tolerant routing in star graphs

This page was built for publication: Node-to-node cluster fault tolerant routing in star graphs