Fast information sharing in a complete network

DOI10.1016/0166-218X(93)90180-VzbMATH Open0797.68005OpenAlexW2052871647MaRDI QIDQ1209151FDOQ1209151

Vaidy S. Sunderam, Peter 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

Recommendations

• Fast gossiping by short messages
• Optimal algorithms for dissemination of information in some interconnection networks
• Quick gossiping by telegraphs
• Fast Gossiping by Short Messages
• Broadcast and gossip in line-communication mode

zbMATH Keywords

information disseminationdistributed computing systemsinformation exchangedistribution of information

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209151)