Probabilistic flooding for efficient information dissemination in random graph topologies

DOI10.1016/j.comnet.2010.01.007zbMath1207.68060OpenAlexW2073043188MaRDI QIDQ1957826

Konstantinos Oikonomou, Dimitrios Kogias, Ioannis Stavrakakis

Publication date: 27 September 2010

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2010.01.007

zbMATH Keywords

random graphsinformation disseminationprobabilistic flooding

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Improved degree search algorithms in unstructured P2P networks

This page was built for publication: Probabilistic flooding for efficient information dissemination in random graph topologies