Broadcasting in hypercubes and star graphs with dynamic faults.

DOI10.1016/S0020-0190(98)00074-XMaRDI QIDQ2583571zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

BroadcastingFault toleranceHypercubeStar graph

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(16)

• Broadcasting in a hypercube when some calls fail
• Optimal broadcasting in injured hypercubes using directed safety levels.
• Dynamic faults have small effect on broadcasting in hypercubes.
• Optimal broadcasting in hypercubes with dynamic faults
• A note on optimal time broadcast in faulty hypercubes
• Dimension ordering and broadcast algorithms in faulty SIMD hypercubes
• Agreement in synchronous networks with ubiquitous faults
• Reliable broadcasting in hypercubes with random link and node failures
• Deterministic Models of Communication Faults
• Fault-tolerant broadcast graphs
• scientific article; zbMATH DE number 1138357 (Why is no real title available?)
• A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model
• scientific article; zbMATH DE number 1420908 (Why is no real title available?)
• Broadcasting in star graphs with Byzantine failures
• Optimal time broadcasting in faulty star networks
• Computing input multiplicity in anonymous synchronous networks with dynamic faults

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)