Skip to main content
SpringerLink
Log in

Fault-tolerant broadcast in anonymous systems

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The broadcast service spreads a message m among all processes of a distributed system, such that each process eventually delivers m. A basic broadcast service does not impose any delivery guarantee in a system with failures. Fault-tolerant broadcast is a fundamental problem in distributed systems that adds certainty in the delivery of messages when crashes can happen in the system. Traditionally, the fault-tolerant broadcast service has been studied in classical distributed systems when each process has a unique identity. However, very recently have appeared new distributed systems, such as sensor networks, where unique identity is not always possible to be included in each sensor node (due to small storage capacity, reduced computational power, a huge number of elements to be identified, etc.). In this paper, we study the definition and implementability of the fault-tolerant broadcast service in anonymous asynchronous systems, that is, in asynchronous systems where all processes have the same identity, and, hence, they are indistinguishable (they may have the same code).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. A weaker version of the AB service is also possible using the RB properties instead of the URB properties. Sometimes this stronger version is called the uniform atomic broadcast (UAB) service [27].

  2. We can find other papers in the literature that solve Consensus in anonymous systems with a failure detector that can not be implementable [16, 18]. That is, they can solve it theoretically, but not practically.

  3. Actually [9], solves Consensus in a more general system such that a particular case is the anonymous asynchronous system.

References

  1. Akyildiz IF, Weilian S, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Netw 38(4):393–422

    Article  Google Scholar 

  2. Angluin D, Aspnes J, Diamadi Z, Fischer MJ, Peralta R (2006) Computation in networks of passively mobile finite-state sensors. Distrib Comput 18(4):235–253

    Article  MATH  Google Scholar 

  3. Arabnia HR (1990) A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach. J Parallel Distrib Comput 10(2):188–192

    Article  Google Scholar 

  4. Arabnia HR (1995) A distributed stereocorrelation algorithm. In: Proceedings of the 4th international conference on computer communications and networks (ICCCN ’95), Las Vegas, Nevada, USA, 20–23 Sept 1995, p 479

  5. Arabnia HR, Bhandarkar SM (1996) Parallel stereocorrelation on a reconfigurable multi-ring network. J Supercomput 10(3):243–269

    Article  MATH  Google Scholar 

  6. Arabnia HR, Oliver MA (1987) Arbitrary rotation of raster images with SIMD machine architectures. Comput Graph Forum 6(1):3–11

    Article  Google Scholar 

  7. Arabnia HR, Oliver MA (1987) A transputer network for the arbitrary rotation of digitised images. Comput J 30(5):425–432

    Article  Google Scholar 

  8. Arabnia HR, Oliver MA (1989) A transputer network for fast operations on digitised images. Comput Graph Forum 8(1):3–11

    Article  Google Scholar 

  9. Arévalo S, Anta AF, Imbs D, Jiménez E, Raynal M (2012) Failure detectors in homonymous distributed systems (with an application to consensus). In: 2012 IEEE 32nd international conference on distributed computing systems, Macau, China, pp 275–284, 18–21 June 2012

  10. Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations, and advanced topics. Wiley, New York

    Book  Google Scholar 

  11. Baldoni R, Cimmino S, Marchetti C (2006) A classification of total order specifications and its application to fixed sequencer-based implementations. J Parallel Distrib Comput 66(1):108–127

    Article  MATH  Google Scholar 

  12. Bhandarkar SM, Arabnia HR (1995) The hough transform on a reconfigurable multi-ring network. J Parallel Distrib Comput 24(1):107–114

    Article  Google Scholar 

  13. Bhandarkar SM, Arabnia HR (1995) The REFINE multiprocessor—theoretical properties and algorithms. Parallel Comput 21(11):1783–1805

    Article  Google Scholar 

  14. Bhandarkar SM, Arabnia HR, Smith JW (1995) A reconfigurable architecture for image processing and computer vision. IJPRAI 9(2):201–229

    Google Scholar 

  15. Birman KP, Joseph TA (1987) Reliable communication in the presence of failures. ACM Trans Comput Syst 5(1):47–76

    Article  Google Scholar 

  16. Bonnet F, Raynal M (2010) Consensus in anonymous distributed systems: is there a weakest failure detector? In: 24th IEEE international conference on advanced information networking and applications, AINA 2010, Perth, Australia, pp 206–213, 20–13 April 2010

  17. Bonnet F, Raynal M (2011) The price of anonymity: optimal consensus despite asynchrony, crash, and anonymity. TAAS 6(4):23

    Article  Google Scholar 

  18. Bonnet F, Raynal M (2013) Anonymous asynchronous systems: the case of failure detectors. Distrib Comput 26(3):141–158

    Article  MATH  Google Scholar 

  19. Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225–267

    Article  MathSciNet  MATH  Google Scholar 

  20. Chang J-M, Maxemchuk NF (1984) Reliable broadcast protocols. ACM Trans Comput Syst 2(3):251–273

    Article  Google Scholar 

  21. Chothia T, Chatzikokolakis K (2005) A survey of anonymous peer-to-peer file-sharing. In: Embedded and ubiquitous computing—EUC 2005 Workshops, EUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES, Nagasaki, Japan, Proceedings, pp 744–755, 6–9 Dec 2005

  22. Défago X, Schiper A, Urbán P (2004) Total order broadcast and multicast algorithms: taxonomy and survey. ACM Comput Surv 36(4):372–421

    Article  Google Scholar 

  23. Di Luna GA, Baldoni R, Bonomi S, Chatzigiannakis I (2014) Conscious and unconscious counting on anonymous dynamic networks. In: Chatterjee M, Cao J, Kothapalli K, Rajsbaum S (eds) Distributed computing and networking. Lecture notes in computer science, vol 8314. Springer, Berlin Heidelberg, pp 257–271

    Chapter  Google Scholar 

  24. Fischer MJ, Lynch NA, Paterson M (1985) Impossibility of distributed consensus with one faulty process. J ACM 32(2):374–382

    Article  MathSciNet  MATH  Google Scholar 

  25. Garcia-Molina H, Spauster A (1991) Ordered and reliable multicast communication. ACM Trans Comput Syst 9(3):242–271

    Article  Google Scholar 

  26. Guerraoui R (1995) Revistiting the relationship between non-blocking atomic commitment and consensus. In: Distributed algorithms, 9th international Workshop, WDAG ’95, Le Mont-Saint-Michel, France, 13–15 Sept 1995, Proceedings, pp 87–100

  27. Hadzilacos V, Toueg S (1994) A modular approach to fault-tolerant broadcasts and related problems. Technical report, Cornell University, Ithaca (USA), Tech Report #94–1425, ACM, New York, p 83

  28. Lamport L, Shostak RE, Pease MC (1982) The byzantine generals problem. ACM Trans Program Lang Syst 4(3):382–401

    Article  MATH  Google Scholar 

  29. Di Luna GA, Baldoni R, Bonomi S, Chatzigiannakis I (2014) Counting in anonymous dynamic networks under worst-case adversary. In: IEEE 34th international conference on distributed computing systems, ICDCS 2014, Madrid, Spain, 30 June–3 July 2014, pp 338–347

  30. Michail O, Chatzigiannakis I, Spirakis PG (2013) Naming and counting in anonymous unknown dynamic networks. In: Higashino T, Katayama Y, Masuzawa T, Potop-Butucaru M, Yamashita M (eds) Stabilization, safety, and security of distributed systems. Lecture notes in computer science, vol 8255. Springer, New York, pp 281–295

    Chapter  Google Scholar 

  31. Mostéfaoui A, Rajsbaum S, Raynal M, Travers C (2008) On the computability power and the robustness of set agreement-oriented failure detector classes. Distrib Comput 21(3):201–222

    Article  MATH  Google Scholar 

  32. Ould-Ahmed-Vall EM, Blough DM, Heck-Ferri BS, Riley GF (2009) Distributed global ID assignment for wireless sensor networks. Ad Hoc Netw 7(6):1194–1216

    Article  Google Scholar 

  33. Raynal M (2010) Communication and agreement abstractions for fault-tolerant asynchronous distributed systems. Morgan & Claypool Publishers, San Rafael

    Google Scholar 

  34. Arif Wani M, Arabnia HR (2003) Parallel edge-region-based segmentation algorithm targeted at reconfigurable multiring network. J Supercomput 25(1):43–62

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad Politécnica de Madrid, Madrid, Spain

    Ernesto Jiménez, Sergio Arévalo & Jian Tang

  2. EPN, Quito, Ecuador

    Ernesto Jiménez

Authors
  1. Ernesto Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Arévalo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jian Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ernesto Jiménez.

Additional information

This work has been partially funded by PROMETEO Project-SENESCYT, Ecuador, the Spanish Research Council (MICCIN) under project BigDataPaaS (TIN2013-46883), and by the Regional Government of Madrid (CM) under project Cloud4BigData (S2013/ICE-2894) cofunded by FSE & FEDER.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiménez, E., Arévalo, S. & Tang, J. Fault-tolerant broadcast in anonymous systems. J Supercomput 71, 4172–4191 (2015). https://doi.org/10.1007/s11227-015-1512-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-015-1512-y

Keywords

Search

Navigation