Faster gossiping on butterfly networks

DOI10.1016/J.TCS.2004.09.032zbMath1079.68008OpenAlexW2076750131MaRDI QIDQ1770425

Jop F. Sibeyn

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.032

zbMATH Keywords

AlgorithmRoutingGossipingButterflyNetwork

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Cites Work

• Unnamed Item
• Unnamed Item
• Quick gossiping by telegraphs
• Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• Broadcasting and Gossiping in de Bruijn Networks
• Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols

This page was built for publication: Faster gossiping on butterfly networks