Communication complexity of gossiping by packets

DOI10.1006/JPDC.1997.1357MaRDI QIDQ1373799zbMATH OpenOpenAlexFDO

Authors Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro

Publication date 17 December 1997

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1997.1357

zbMATH Keywords

gossiping algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Communication complexity of gossiping by packets
• Fast gossiping by short messages
• Fast Gossiping by Short Messages
• Optimal gossiping in paths and cycles

Cited in

(8)

• Communication complexity of fault-tolerant information diffusion
• On the communication complexity of polling
• The Communication Complexity of Atomic Commitment and of Gossiping
• Sequential information dissemination by packets
• NP-completeness in the gossip monoid
• Communication complexity of gossiping by packets
• Concurrent multicast in weighted networks
• Concurrent multicast in weighted networks

This page was built for publication: Communication complexity of gossiping by packets

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