Broadcasting in hypercubes and star graphs with dynamic faults.

DOI10.1016/S0020-0190(98)00074-XzbMATH Open1078.68584OpenAlexW2065132355MaRDI QIDQ2583571FDOQ2583571

Gianluca De Marco, Ugo Vaccaro

Publication date: 17 January 2006

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00074-x

Recommendations

• Optimal broadcasting in hypercubes with dynamic faults
• On optimal broadcasting in faulty hypercubes
• Dynamic faults have small effect on broadcasting in hypercubes.
• Broadcasting in hypercubes with randomly distributed Byzantine faults
• Fault-Tolerant Broadcasting on the Arrangement Graph
• Communication-efficient broadcasting in complete networks with dynamic faults
• Fault-tolerant broadcast graphs
• scientific article; zbMATH DE number 1138357
• Reliable broadcasting in hypercubes with random link and node failures
• Broadcasting in synchronous networks with dynamic faults

zbMATH Keywords

Fault toleranceBroadcastingHypercubeStar graph

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cites Work

• A survey of gossiping and broadcasting in communication networks
• A group-theoretic model for symmetric interconnection networks
• Fault-tolerant broadcasting and gossiping in communication networks
• On Group Graphs and Their Fault Tolerance
• Methods and problems of communication in usual networks
• Title not available (Why is that?)
• A novel routing scheme on the star and pancake networks and its applications
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• Decomposing a star graph into disjoint cycles
• Fault tolerant routing in the star and pancake interconnection networks
• Broadcasting in a hypercube when some calls fail
• Broadcasting in synchronous networks with dynamic faults
• Minimum time broadcast in faulty star networks
• Topological properties of star graphs
• Reliable broadcasting
• A note on optimal time broadcast in faulty hypercubes
• Fault—tolerant hypercube broadcasting via information dispersal
• Broadcasting on recursively decomposable Cayley graphs
• Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry

Cited In (10)

• Agreement in synchronous networks with ubiquitous faults
• Optimal broadcasting in injured hypercubes using directed safety levels.
• A note on optimal time broadcast in faulty hypercubes
• Optimal broadcasting in hypercubes with dynamic faults
• Computing input multiplicity in anonymous synchronous networks with dynamic faults
• Fault-tolerant broadcast graphs
• Dynamic faults have small effect on broadcasting in hypercubes.
• Deterministic Models of Communication Faults
• A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model
• Title not available (Why is that?)

This page was built for publication: Broadcasting in hypercubes and star graphs with dynamic faults.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583571)