Amnesiac flooding: synchronous stateless information dissemination

DOI10.1007/978-3-030-67731-2_5zbMATH Open1490.68044OpenAlexW3125459524MaRDI QIDQ831783FDOQ831783

Volker Turau

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_5

Recommendations

• Repeated uncoordinated information dissemination by flooding
• On flooding in the presence of random faults
• Parsimonious flooding in dynamic graphs
• Probabilistic flooding for efficient information dissemination in random graph topologies
• scientific article; zbMATH DE number 2013829

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Cites Work

• Total domination in graphs
• Some remarks on domination
• Distributed Computing: A Locality-Sensitive Approach
• Gromov hyperbolic spaces
• The shortest-path problem for graphs with random arc-lengths
• Relations between packing and covering numbers of a tree
• Stateless Information Dissemination Algorithms
• On Termination of a Flooding Process
• Title not available (Why is that?)

Cited In (2)

• Synchronous concurrent broadcasts for intermittent channels with bounded capacities
• Termination of amnesiac flooding

This page was built for publication: Amnesiac flooding: synchronous stateless information dissemination

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