Sequential information dissemination by packets

DOI10.1002/NET.3230220402zbMATH Open0752.94021OpenAlexW2062421867MaRDI QIDQ4018992FDOQ4018992

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

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

zbMATH Keywords

information disseminationgossipingpacketscensus taking

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (9)

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

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)