Probabilistic heuristics for disseminating information in networks
| dc.creator | Stauffer, A. O. | |
| dc.creator | Barbosa, V. C. | |
| dc.date | 2004-09-01 | |
| dc.date.accessioned | 2026-07-07T08:05:50Z | |
| dc.date.available | 2026-07-07T08:05:50Z | |
| dc.description | We study the problem of disseminating a piece of information through all the nodes of a network, given that it is known originally only to a single node. In the absence of any structural knowledge on the network other than the nodes' neighborhoods, this problem is traditionally solved by flooding all the network's edges. We analyze a recently introduced probabilistic algorithm for flooding and give an alternative probabilistic heuristic that can lead to some cost-effective improvements, like better trade-offs between the message and time complexities involved. We analyze the two algorithms both mathematically and by means of simulations, always within a random-graph framework and considering relevant node-degree distributions. | |
| dc.identifier | https://arxiv.org/abs/cs/0409001 | |
| dc.identifier | http://arxiv.org/abs/cs/0409001 | |
| dc.identifier | IEEE/ACM Transactions on Networking 15 (2007), 425-435 | |
| dc.identifier | doi:10.1109/TNET.2007.892877 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/130405 | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | C.2.2; F.2.2 | |
| dc.title | Probabilistic heuristics for disseminating information in networks | |
| dc.type | text |