Looking for a Definition of Dynamic Distributed Systems

  • Roberto Baldoni
  • Marin Bertier
  • Michel Raynal
  • Sara Tucci-Piergiovanni
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4671)


This paper is a position paper on the nature of dynamic systems. While there is an agreement on the definition of what a static distributed system is, there is no agreed definition on what a dynamic distributed system is. This paper is a first step in that direction. To that end, it emphasizes two orthogonal dimensions that are present in any dynamic distributed system, namely the varying and possibly very large number of entities that currently define the system, and the fact that each of these entities knows only a few other entities (its neighbors) and possibly will never be able to know the whole system it is a member of. To illustrate the kind of issues one has to cope with in dynamic systems, the paper considers, as a “canonical” problem, a simple data aggregation problem. It shows the type of dynamic systems in which that problem can be solved and the ones in which it cannot be solved. The aim of the paper is to give the reader an idea of the subtleties and difficulties encountered when one wants to understand the nature of dynamic distributed systems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aguilera, M.K.: A Pleasant Stroll Through the Land of Infinitely Many Creatures. ACM SIGACT News, Distributed Computing Column 35(2), 36–59 (2004)CrossRefGoogle Scholar
  2. 2.
    Bawa, M., Gionis, A., Garcia-Molina, H., Motwani, R.: The Price of Validity in Dynamic Networks. In: SIGMOD. Proc. ACM Int’l Conference on Management of Data, pp. 515–526. ACM Press, New York (2004)CrossRefGoogle Scholar
  3. 3.
    Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM 43(2), 225–267 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Chandra, T., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM 43(4), 685–722 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Chandy, K.M., Lamport, L.: Distributed Snapshots: Determining Global States of Distributed Systems. ACM Trans. on Computer Systems 3(1), 63–75 (1985)CrossRefGoogle Scholar
  6. 6.
    Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32(2), 374–382 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 161–16 (2001)Google Scholar
  8. 8.
    Hadzilacos, V., Toueg, S.: Reliable Broadcast and Related Problems. In: Distributed Systems, pp. 97–145. ACM Press, New York (1993)Google Scholar
  9. 9.
    Merritt, M., Taubenfeld, G.: Computing with Infinitely Many Processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  10. 10.
    Raynal, M.: A Short Introduction to Failure Detectors for Asynchronous Distributed Systems. ACM SIGACT News, Distr. Computing Column 36(1), 53–70 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Roberto Baldoni
    • 1
  • Marin Bertier
    • 2
  • Michel Raynal
    • 2
  • Sara Tucci-Piergiovanni
    • 1
  1. 1.IRISA, Campus de Beaulieu, 35042 RennesFrance
  2. 2.Computer Science Department, University La Sapienza, RomaItaly

Personalised recommendations