Optimal gossiping in paths and cycles

DOI10.1016/S1570-8667(03)00038-8zbMath1077.68120MaRDI QIDQ1827271

Yanyan Li

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

GossipingInterconnection networksAnalysis of algorithmsInformation dissemination

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10)

Related Items

Optimal gossiping in square 2D meshes

Cites Work

• Unnamed Item
• Optimal sequential gossiping by short messages
• Fast gossiping on square mesh computers
• Methods and problems of communication in usual networks
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Fast Gossiping for the Hypercube
• Sequential information dissemination by packets
• Fast Gossiping by Short Messages
• Time and Cost Trade-Offs in Gossiping
• Parallel Information Dissemination by Packets