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

gossipinggraphsnetworks

Mathematics Subject Classification ID

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

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

(37)

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

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)