{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:31:14Z","timestamp":1781076674517,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T00:00:00Z","timestamp":1513728000000},"content-version":"vor","delay-in-days":19,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004612","name":"Funda\u00e7\u00e3o Arauc\u00e1ria","doi-asserted-by":"publisher","award":["341\/10 proj. 19.836"],"award-info":[{"award-number":["341\/10 proj. 19.836"]}],"id":[{"id":"10.13039\/501100004612","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["311451\/2016-0"],"award-info":[{"award-number":["311451\/2016-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Braz Comput Soc"],"published-print":{"date-parts":[[2017,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Reliable broadcast is a fundamental building block in fault-tolerant distributed systems. It consists of a basic primitive that provides agreement among processes of the system on the delivery of each broadcast message, i.e., either none or all correct processes deliver the message, despite failures of processes. In this work, we propose a reliable broadcast solution on top of VCube, assuming that the system is asynchronous. VCube is an autonomic monitoring layer that organizes processes on a hypercube-like overlay which provides several logarithmic properties even in the presence of processes failures. We consider that processes can fail by crashing, do not recover, and faults are eventually detected by all correct processes. The protocol tolerates false suspicions by sending additional messages to suspected processes but logarithmic properties of the algorithm are still kept. Experimental results show the efficiency of the proposed solution compared to an one-to-all strategy.<\/jats:p>","DOI":"10.1186\/s13173-017-0064-9","type":"journal-article","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T11:40:20Z","timestamp":1513770020000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An autonomic hierarchical reliable broadcast protocol for asynchronous distributed systems with failure detection"],"prefix":"10.1186","volume":"23","author":[{"given":"\u00c9lise","family":"Jeanneau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9516-1282","authenticated-orcid":false,"given":"Luiz A.","family":"Rodrigues","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luciana","family":"Arantes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elias P.","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,12,20]]},"reference":[{"key":"64_CR1","first-page":"419","volume-title":"DSN","author":"J Leit\u00e3o","year":"2007","unstructured":"Leit\u00e3o J, Pereira J, Rodrigues L (2007) HyParView: a membership protocol for reliable gossip-based broadcast In: DSN, 419\u2013429.. IEEE, Edinburgh. doi:10.1109\/DSN.2007.56."},{"key":"64_CR2","first-page":"1","volume-title":"GLOBECOM\u201909","author":"Z Yang","year":"2009","unstructured":"Yang Z, Li M, Lou W (2009) R-code: network coding based reliable broadcast in wireless mesh networks with unreliable links In: GLOBECOM\u201909, 1\u20136.. IEEE, Honolulu. doi:10.1109\/GLOCOM.2009.5426175."},{"key":"64_CR3","unstructured":"Bonomi S, Del Pozzo A, Baldoni R (2013) Intrusion-tolerant reliable broadcast. Technical report."},{"key":"64_CR4","unstructured":"Hadzilacos V, Toueg S (1993) Fault-tolerant broadcasts and related problems:97\u2013145. Chap. Distributed systems."},{"key":"64_CR5","volume-title":"Introduction to reliable distributed programming","year":"2006","unstructured":"Guerraoui R, Rodrigues L (eds)2006. Introduction to reliable distributed programming. Springer, Berlin, Germany."},{"issue":"2","key":"64_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225\u2013267. doi:10.1145\/226643.226647.","journal-title":"J ACM"},{"issue":"1","key":"64_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6423(84)90009-1","volume":"4","author":"FB Schneider","year":"1984","unstructured":"Schneider FB, Gries D, Schlichting RD (1984) Fault-tolerant broadcasts. Sci Comput Program 4(1):1\u201315.","journal-title":"Sci Comput Program"},{"issue":"2","key":"64_CR8","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/12.485370","volume":"45","author":"P Fragopoulou","year":"1996","unstructured":"Fragopoulou P, Akl SG (1996) Edge-disjoint spanning trees on the star network with applications to fault tolerance. IEEE Trans Comput 45(2):174\u2013185. doi:10.1109\/12.485370.","journal-title":"IEEE Trans Comput"},{"key":"64_CR9","first-page":"169","volume-title":"ACM\/IFIP\/USENIX 11th International Conference on Middleware. Middleware\u201910","author":"K Kim","year":"2010","unstructured":"Kim K, Mehrotra S, Venkatasubramanian N (2010) FaReCast: Fast, reliable application layer multicast for flash dissemination In: ACM\/IFIP\/USENIX 11th International Conference on Middleware. Middleware\u201910, 169\u2013190.. Springer, Berlin, Heidelberg."},{"issue":"12","key":"64_CR10","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/12.9743","volume":"37","author":"P Ramanathan","year":"1988","unstructured":"Ramanathan P, Shin KG (1988) Reliable broadcast in hypercube multicomputers. IEEE Trans Comput 37(12):1654\u20131657. doi:10.1109\/12.9743.","journal-title":"IEEE Trans Comput"},{"key":"64_CR11","first-page":"933","volume-title":"Proceedings of the 2014 IEEE 28th International Conference on Advanced Information Networking and Applications. AINA \u201914","author":"M Raynal","year":"2014","unstructured":"Raynal M, Stainer J, Cao J, Wu W (2014) A simple broadcast algorithm for recurrent dynamic systems In: Proceedings of the 2014 IEEE 28th International Conference on Advanced Information Networking and Applications. AINA \u201914, 933\u2013939.. IEEE, Victoria. doi:10.1109\/AINA.2014.115."},{"issue":"1","key":"64_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/MC.2003.1160055","volume":"36","author":"JO Kephart","year":"2003","unstructured":"Kephart JO, Chess DM (2003) The vision of autonomic computing. Computer 36(1):41\u201350.","journal-title":"Computer"},{"key":"64_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/ScalA.2014.14","volume-title":"5th Work. on Latest Advances in Scalable Algorithms for Large-Scale Systems. ScalA\u201914","author":"EP Duarte Jr","year":"2014","unstructured":"Duarte Jr EP, Bona LCE, Ruoso VK (2014) VCube: a provably scalable distributed diagnosis algorithm In: 5th Work. on Latest Advances in Scalable Algorithms for Large-Scale Systems. ScalA\u201914, 17\u201322.. IEEE Press, Piscataway. doi:10.1109\/ScalA.2014.14."},{"key":"64_CR14","first-page":"1","volume-title":"10th European Dependable Computing Conference. EDCC\u201914","author":"LA Rodrigues","year":"2014","unstructured":"Rodrigues LA, Arantes L, Duarte Jr EP (2014) An autonomic implementation of reliable broadcast based on dynamic spanning trees In: 10th European Dependable Computing Conference. EDCC\u201914, 1\u201312.. IEEE, Newcastle. doi:10.1109\/EDCC.2014.31."},{"issue":"5","key":"64_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S1383-7621(96)00023-9","volume":"42","author":"J Wu","year":"1996","unstructured":"Wu J (1996) Optimal broadcasting in hypercubes with link faults using limited global information. J Syst Archit 42(5):367\u2013380.","journal-title":"J Syst Archit"},{"key":"64_CR16","volume-title":"HyperCast: a protocol for maintaining multicast Group Members in a Logical Hypercube Topology","year":"1999","unstructured":"Liebeherr J, Beam TK (1999) HyperCast: a protocol for maintaining multicast Group Members in a Logical Hypercube Topology(Rizzo L, Fdida S, eds.). Springer, Berlin, Heidelberg. doi:http:\/\/dx.doi.org\/10.1007\/978-3-540-46703-8\/_5."},{"key":"64_CR17","first-page":"293","volume-title":"Proceedings of the 29th IEEE International Symposium on Reliable Distributed Systems","author":"M Ferreira","year":"2010","unstructured":"Ferreira M, Leit\u00e3o J, Rodrigues L (2010) Thicket: a protocol for building and maintaining multiple trees in a p2p overlay In: Proceedings of the 29th IEEE International Symposium on Reliable Distributed Systems, 293\u2013302.. IEEE, New Delhi. doi:10.1109\/SRDS.2010.19."},{"issue":"6","key":"64_CR18","first-page":"981","volume":"18","author":"P Urb\u00e1n","year":"2002","unstructured":"Urb\u00e1n P, D\u00e9fago X, Schiper A (2002) Neko: a single environment to simulate and prototype distributed algorithms. J Inf Sci Eng 18(6):981\u2013997.","journal-title":"J Inf Sci Eng"},{"key":"64_CR19","first-page":"153","volume-title":"Proc. of the 15th Int\u2019l Conf. on Distr. Comp. Systems","author":"S Bulgannawar","year":"1995","unstructured":"Bulgannawar S, Vaidya NH (1995) A distributed k-mutual exclusion algorithm In: Proc. of the 15th Int\u2019l Conf. on Distr. Comp. Systems, 153\u2013160.. IEEE Computer Society, Los Alamitos. doi:10.1109\/ICDCS.1995.500014."}],"container-title":["Journal of the Brazilian Computer Society"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13173-017-0064-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-017-0064-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-017-0064-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T13:43:47Z","timestamp":1723643027000},"score":1,"resource":{"primary":{"URL":"https:\/\/journal-bcs.springeropen.com\/articles\/10.1186\/s13173-017-0064-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1186\/s13173-017-0064-9","relation":{},"ISSN":["1678-4804"],"issn-type":[{"value":"1678-4804","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12]]},"assertion":[{"value":"26 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"All authors agree to the submitted version.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"15"}}