by Konstantinos Oikonomou, Dimitrios Kogias, Ioannis Stavrakakis
Abstract:
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) flooding approaches that are used to disseminate globally information in unstructured peer-to-peer and other networks. A key challenge in using probabilistic flooding is the determination of the forwarding probability so that global network outreach is achieved while keeping the message overhead as low as possible. In this paper, by showing that a probabilistic flooding network, generated by applying probabilistic flooding to a connected random graph network, can be (asymptotically) ``bounded'' by properly parameterized random graph networks and by invoking random graph theory results, asymptotic values of the forwarding probability are derived guaranteeing (probabilistically) successful coverage, while significantly reducing the message overhead with respect to traditional flooding. Asymptotic expressions with respect to the average number of messages and the average time required to complete network coverage are also derived, illustrating the benefits of the properly parameterized probabilistic flooding scheme. Simulation results support the claims and expectations of the analytical results and reveal certain aspects of probabilistic flooding not covered by the analysis.
Reference:
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis Stavrakakis, "Probabilistic Flooding for Efficient Information Dissemination in Random Graph Topologies", In Computer Networks, Elsevier, vol. 54, no. 10, pp. 1615-1629, 2010.
Bibtex Entry:
@article{oikonomou2010probabilistic,
abstract = {Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) flooding approaches that are used to disseminate globally information in unstructured peer-to-peer and other networks. A key challenge in using probabilistic flooding is the determination of the forwarding probability so that global network outreach is achieved while keeping the message overhead as low as possible. In this paper, by showing that a probabilistic flooding network, generated by applying probabilistic flooding to a connected random graph network, can be (asymptotically) ``bounded'' by properly parameterized random graph networks and by invoking random graph theory results, asymptotic values of the forwarding probability are derived guaranteeing (probabilistically) successful coverage, while significantly reducing the message overhead with respect to traditional flooding. Asymptotic expressions with respect to the average number of messages and the average time required to complete network coverage are also derived, illustrating the benefits of the properly parameterized probabilistic flooding scheme. Simulation results support the claims and expectations of the analytical results and reveal certain aspects of probabilistic flooding not covered by the analysis.},
author = {Oikonomou, Konstantinos and Kogias, Dimitrios and Stavrakakis, Ioannis},
date-modified = {2021-11-13 16:27:18 +0200},
doi = {10.1016/j.comnet.2010.01.007},
issn = {1389-1286},
journal = {Computer Networks},
keywords = {own, refereed, ana, R:ID:PF},
number = {10},
pages = {1615--1629},
publisher = {Elsevier},
title = {{{Probabilistic Flooding for Efficient Information Dissemination in Random Graph Topologies}}},
volume = {54},
year = {2010},
Bdsk-Url-1 = {https://doi.org/10.1016/j.comnet.2010.01.007}}