Fast information sharing in a complete network

DOI10.1016/0166-218X(93)90180-VzbMath0797.68005OpenAlexW2052871647MaRDI QIDQ1209151

Vaidy S. Sunderam, Peter M. Winkler

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90180-v

zbMATH Keywords

information exchangeinformation disseminationdistributed computing systemsdistribution of information

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (8)

Gossiping and broadcasting versus computing functions in networks ⋮ Oriented hypercubes ⋮ The infection time of graphs ⋮ Gossiping with multiple sends and receives ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ Gossiping and broadcasting versus computing functions in networks. ⋮ Lower bounds on systolic gossip ⋮ Quick gossiping by telegraphs

Cites Work

• New gossips and telephones
• Spreading information by conferences
• Gossips and telegraphs
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• A survey of gossiping and broadcasting in communication networks

This page was built for publication: Fast information sharing in a complete network