On synchrony in dynamic distributed systems

Abstract Many modern distributed services are deployed in dynamic systems. Cloud services are an example. They are expected to provide service to a potentially huge amount of users and may require a wide geographical deployment in multiple data centres. Their service processes vary in volume in accordance with workload variations, showing an adaptive behaviour in order to minimise economical costs. Dynamic distributed systems may be classifed considering two axes: (a) the number of processes that compose the system, and (b) the diameter of the networking graph that interconnects those processes. Other important features of dynamic systems can be derived from these two characteristics, e.g., their attainable synchrony. We analyse the level of synchrony that may be achieved in each dynamic system class and revise the existing techniques for transforming an initially asynchronous large dynamic system into another one with a higher synchrony level. With this, a larger set of problems may be handled in dynamic distributed systems. This facilitates the implementation and provision of additional services in those systems.

[1]  Michael Merritt,et al.  Computing with Infinitely Many Processes , 2000, DISC.

[2]  Alysson Neves Bessani,et al.  Byzantine Consensus with Unknown Participants , 2008, OPODIS.

[3]  Rajeev Motwani,et al.  The price of validity in dynamic networks , 2004, SIGMOD '04.

[4]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[5]  Roberto Beraldi,et al.  The hierarchical daisy architecture for causal delivery , 1999, Distributed Syst. Eng..

[6]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[7]  Randy H. Katz,et al.  Decompiling CODASYL DML into retional queries , 1982, TODS.

[8]  Jennifer L. Welch,et al.  Simulating Synchronous Processors , 1987, Inf. Comput..

[9]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[10]  Marimuthu Palaniswami,et al.  Internet of Things (IoT): A vision, architectural elements, and future directions , 2012, Future Gener. Comput. Syst..

[11]  Roberto Baldoni,et al.  Eventual Leader Election in Infinite Arrival Message-Passing System Model with Bounded Concurrency , 2010, 2010 European Dependable Computing Conference.

[12]  Francesc D. Muñoz-Escoí,et al.  Parallel Interconnection of Broadcast Systems with Multiple FIFO Channels , 2009, OTM Conferences.

[13]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[14]  Marcos K. Aguilera,et al.  On implementing omega with weak reliability and synchrony assumptions , 2003, PODC '03.

[15]  Roy Friedman,et al.  Limitations of Fast Consistency Conditions for Distributed Shared Memories , 1996, Inf. Process. Lett..

[16]  Antonio Fernández,et al.  On the interconnection of causal memory systems , 2004, J. Parallel Distributed Comput..

[17]  Irving L. Traiger,et al.  Transactions and consistency in distributed database systems , 1982, TODS.

[18]  André Schiper,et al.  Reaching Agreement with Unknown Participants in Mobile Self-Organized Networks in Spite of Process Crashes , 2005 .

[19]  Francesc D. Muñoz-Escoí,et al.  A survey on elasticity management in PaaS systems , 2017, Computing.

[20]  Francesc D. Muñoz-Escoí,et al.  Scalability approaches for causal multicast: a survey , 2016, Computing.

[21]  Louise E. Moser,et al.  Byzantine Fault Detectors for Solving Consensus , 2003, Comput. J..

[22]  Farnam Jahanian,et al.  The inter-group router approach to scalable group composition , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[23]  André Schiper,et al.  Consensus with Unknown Participants or Fundamental Self-Organization , 2004, ADHOC-NOW.

[24]  Paulo Veríssimo,et al.  Causal separators for large-scale multicast communication , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[25]  Achour Mostéfaoui,et al.  From static distributed systems to dynamic systems , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

[26]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[27]  Sébastien Tixeuil,et al.  Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[28]  Faith Ellen,et al.  Hundreds of impossibility results for distributed computing , 2003, Distributed Computing.

[29]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

[30]  Antonio Fernández,et al.  On the interconnection of message passing systems , 2008, Inf. Process. Lett..

[31]  Pascal Bouvry,et al.  Survey on Broadcast Algorithms for Mobile Ad Hoc Networks , 2015, ACM Comput. Surv..

[32]  Alysson Neves Bessani,et al.  Knowledge Connectivity Requirements for Solving Byzantine Consensus with Unknown Participants , 2018, IEEE Transactions on Dependable and Secure Computing.

[33]  Anne-Marie Kermarrec,et al.  Efficient and adaptive epidemic-style protocols for reliable and scalable multicast , 2006, IEEE Transactions on Parallel and Distributed Systems.

[34]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[35]  Marcos K. Aguilera,et al.  A pleasant stroll through the land of infinitely many creatures , 2004, SIGA.

[36]  Antonio Fernández,et al.  Implementing unreliable failure detectors with unknown membership , 2006, Inf. Process. Lett..

[37]  Mikel Larrea,et al.  On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems , 2004, IEEE Trans. Computers.