Fast Gossiping by Short Messages

DOI10.1137/S0097539795283619MaRDI QIDQ4210076zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, Adele A. Rescigno, Luisa Gargano, Ugo Vaccaro

Publication date 20 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539795283619

zbMATH Keywords

graphsnetworksgossiping

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)

Recommendations

• Fast gossiping by short messages
• Fast gossiping with short unreliable messages
• Gossiping in Minimal Time
• Quick gossiping by telegraphs
• scientific article; zbMATH DE number 15364
• Quick gossiping without duplicate transmissions
• scientific article; zbMATH DE number 4189783
• Gossiping With Multiple Messages
• Quick Gossiping by Conference Calls

Cited in

(34)

• Gossiping in Minimal Time
• GATHERING RADIO MESSAGES IN THE PATH
• Bounded information dissemination in multi-channel wireless networks
• Fast Gossiping for the Hypercube
• Communication complexity of gossiping by packets
• Gossiping in Cayley graphs by packets
• Optimal gathering protocols on paths under interference constraints
• Lower bounds on systolic gossip
• Periodic gossiping in commuted networks
• Communication complexity of fault-tolerant information diffusion
• On the communication complexity of polling
• The total acquisition number of random geometric graphs
• An inclusion hierarchy of irreversible dynamos
• The contraction coefficient of a complete gossip sequence
• Fast information sharing in a complete network
• The total acquisition number of random graphs
• Oblivious gossiping on tori
• Gossiping with interference in radio ring networks
• Multi-level dynamo and opinion spreading
• Quick Gossiping by Conference Calls
• A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem
• Optimal odd gossiping
• The unit acquisition number of binomial random graphs
• Minimum gossip bus networks
• scientific article; zbMATH DE number 1756018 (Why is no real title available?)
• On the hamiltonicity of the Cartesian product
• Gossip algorithms in quantum networks
• Concurrent multicast in weighted networks
• Order optimal information spreading using algebraic gossip
• Gossiping With Multiple Messages
• Optimal gossiping in paths and cycles
• Fast gossiping by short messages
• Odd gossiping
• Optimal gossiping in square 2D meshes

This page was built for publication: Fast Gossiping by Short Messages

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