Sequential information dissemination by packets

DOI10.1002/NET.3230220402MaRDI QIDQ4018992zbMATH OpenOpenAlexFDO

Authors Anindo Bagchi, E. Schmeichel, S. Louis Hakimi

Publication date 16 January 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230220402

zbMATH Keywords

census takinggossipinginformation disseminationpackets

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Circuits, networks (94C99)

Recommendations

• Optimal sequential gossiping by short messages
• Communication complexity of gossiping by packets
• Communication complexity of gossiping by packets
• Fast gossiping by short messages
• A survey of gossiping and broadcasting in communication networks

Cited in

(9)

• Optimal sequential gossiping by short messages
• Communication complexity of fault-tolerant information diffusion
• On the communication complexity of polling
• Optimal gossiping in paths and cycles
• Optimal serial broadcast of successive chunks
• Optimal gossiping in square 2D meshes
• Fast gossiping by short messages
• Communication complexity of gossiping by packets
• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS

This page was built for publication: Sequential information dissemination by packets

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