Name
Abstract | ||
|---|---|---|
Hierarchical broadcast strategies based on trees are scalable since they distribute the workload among processes and disseminate messages in parallel. In this work we propose an efficient best-effort broadcast algorithm that employs multiple spanning trees to propagate messages that are bundled on tree intersections. The algorithm is autonomic in the sense that it employs dynamic trees rooted at the source process and which rebuild themselves after processes crash. Experimental results obtained with simulation are presented showing the performance to the algorithm in terms of the latency and the number and sizes of messages employed. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/LADC.2018.00022 | 2018 Eighth Latin-American Symposium on Dependable Computing (LADC) |
Keywords | Field | DocType |
Computer crashes,Topology,Hypercubes,Peer-to-peer computing,Heuristic algorithms,Wireless sensor networks,Indexes | Broadcasting,Computer science,Workload,Latency (engineering),Dissemination,Spanning tree,Wireless sensor network,Hypercube,Scalability,Distributed computing | Conference |
ISSN | ISBN | Citations |
2471-6820 | 978-1-5386-8489-4 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luiz A. Rodrigues | 1 | 13 | 5.74 |
| Elias P. Duarte | 2 | 44 | 10.94 |
| João Paulo de Araujo | 3 | 4 | 2.45 |
| Luciana Arantes | 4 | 220 | 37.48 |
| Pierre Sens | 5 | 526 | 51.65 |