Fast information sharing in a complete network

DOI10.1016/0166-218X(93)90180-VMaRDI QIDQ1209151zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

distributed computing systemsdistribution of informationinformation disseminationinformation exchange

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(10)

• Quick gossiping by telegraphs
• Gossiping and broadcasting versus computing functions in networks.
• Lower bounds on systolic gossip
• Gossiping with multiple sends and receives
• Oriented hypercubes
• Clique here: on the distributed complexity in fully-connected networks
• scientific article; zbMATH DE number 6385 (Why is no real title available?)
• Gossiping and broadcasting versus computing functions in networks
• Gossiping in vertex-disjoint paths mode in interconnection networks
• The infection time of graphs

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)