Hierarchical broadcast and gossip networks

DOI10.1016/S0020-0190(00)00014-4zbMath1014.68003OpenAlexW2073998417WikidataQ126807893 ScholiaQ126807893MaRDI QIDQ1607034

Guillaume Fertin

Publication date: 25 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00014-4

zbMATH Keywords

gossip networkhierarchical broadcast networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (1)

The epistemic gossip problem

Cites Work

• Unnamed Item
• Hierarchical broadcast networks
• Minimum broadcast digraphs
• New gossips and telephones
• Gossips and telegraphs
• Methods and problems of communication in usual networks
• A study of minimum gossip graphs
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• A survey of gossiping and broadcasting in communication networks

This page was built for publication: Hierarchical broadcast and gossip networks