Skip to Main content Skip to Navigation
Conference papers

Bundling Messages to Reduce the Cost of Tree-Based Broadcast Algorithms

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.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : João Paulo de Araujo Connect in order to contact the contributor
Submitted on : Tuesday, December 18, 2018 - 4:42:41 PM
Last modification on : Monday, December 6, 2021 - 5:12:03 PM
Long-term archiving on: : Wednesday, March 20, 2019 - 10:55:38 AM


Files produced by the author(s)



Luiz Rodrigues, Elias Duarte Júnior, João Paulo de Araujo, Luciana Arantes, Pierre Sens. Bundling Messages to Reduce the Cost of Tree-Based Broadcast Algorithms. LADC 2018 - 8th Latin-American Symposium on Dependable Computing, Oct 2018, Foz do Iguaçu, Brazil. ⟨10.1109/LADC.2018.00022⟩. ⟨hal-01959395⟩



Record views


Files downloads