Communication complexity of gossiping by packets

DOI10.1006/JPDC.1997.1357zbMATH Open0888.68013OpenAlexW2031081633MaRDI QIDQ1373799FDOQ1373799

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

Recommendations

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

zbMATH Keywords

gossiping algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (5)

• Communication complexity of gossiping by packets
• Communication complexity of fault-tolerant information diffusion
• Sequential information dissemination 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)