Fault tolerant routing in the star and pancake interconnection networks

DOI10.1016/0020-0190(93)90043-9zbMath0777.68026OpenAlexW2004696782WikidataQ56287381 ScholiaQ56287381MaRDI QIDQ2365821

Ugo Vaccaro, A. Vozella, Luisa Gargano

Publication date: 29 June 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90043-9

zbMATH Keywords

fault toleranceinterconnection networksrouting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items

On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ Restricted connectivity for three families of interconnection networks ⋮ Minimum time broadcast in faulty star networks ⋮ The (conditional) matching preclusion for burnt pancake graphs ⋮ Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults ⋮ The super connectivity of the pancake graphs and the super laceability of the star graphs ⋮ Deterministic Models of Communication Faults ⋮ Ring embedding in faulty pancake graphs ⋮ Fault-tolerant routing in burnt pancake graphs ⋮ Unnamed Item ⋮ Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property ⋮ Broadcasting in hypercubes and star graphs with dynamic faults. ⋮ Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

Cites Work

• Unnamed Item
• Unnamed Item
• New results in graph routing
• On fault tolerant routings in general networks
• Efficient fault-tolerant routings in networks
• A new look at fault-tolerant network routing
• Fault-tolerant routings in a \(\kappa\)-connected network
• Decomposing a star graph into disjoint cycles
• Optimal fault-tolerant routings for connected graphs
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
• Bounds for sorting by prefix reversal
• On Group Graphs and Their Fault Tolerance
• Highly fault-tolerant communication network models
• A group-theoretic model for symmetric interconnection networks
• Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry