Advertisement

Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks

  • Arnaud Casteigts
  • Serge Chaumette
  • Afonso Ferreira
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5869)

Abstract

Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at their assumptions on the underlying network. This paper focuses on the study of such assumptions in dynamic networks, where the connectivity is expected to change, predictably or not, during the execution. Our main contribution is a theoretical framework dedicated to such analysis. By combining several existing components (local computations, graph relabellings, and evolving graphs), this framework allows to express detailed properties on the network dynamics and to prove that a given property is necessary, or sufficient, for the success of an algorithm. Consequences of this work include (i) the possibility to compare distributed algorithms on the basis of their topological requirements, (ii) the elaboration of a formal classification of dynamic networks with respect to these properties, and (iii) the possibility to check automatically whether a network trace belongs to one of the classes, and consequently to know which algorithm should run on it.

Keywords

Dynamic networks distributed algorithms evolving graphs local interactions topological assumptions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AAD+06]
    Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4), 235–253 (2006)CrossRefzbMATHGoogle Scholar
  2. [AAER07]
    Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing 20(4), 279–304 (2007)CrossRefzbMATHGoogle Scholar
  3. [BF03]
    Bhadra, S., Ferreira, A.: Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 259–270. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. [BRS03]
    Bettstetter, C., Resta, G., Santi, P.: The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Transactions on Mobile Computing 2(3), 257–269 (2003)CrossRefGoogle Scholar
  5. [CMZ06]
    Chalopin, J., Métivier, Y., Zielonka, W.: Local computations in graphs: The case of cellular edge local computations. Fundamenta Informaticae 74(1), 85–114 (2006)MathSciNetzbMATHGoogle Scholar
  6. [Fer04]
    Ferreira, A.: Building a reference combinatorial model for MANETs. IEEE Network 18(5), 24–29 (2004); A preliminary version appeared as On models and algorithms for dynamic communication networks: The case for evolving graphs, Algotel 2002, Meze, FRCrossRefGoogle Scholar
  7. [GMMS02]
    Godard, E., Métivier, Y., Mosbah, M., Sellami, A.: Termination detection of distributed algorithms by graph relabelling systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 106–119. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. [LMS99]
    Litovsky, I., Métivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: World Scientific (ed.) Handbook of graph grammars and computing by graph transformation, vol. III, pp. 1–56. World Scientific, Singapore (1999)CrossRefGoogle Scholar
  9. [Lyn89]
    Lynch, N.: A hundred impossibility proofs for distributed computing. In: PODC 1989: Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, pp. 1–28. ACM, New York (1989)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Arnaud Casteigts
    • 1
  • Serge Chaumette
    • 2
  • Afonso Ferreira
    • 3
  1. 1.SITEUniversity of OttawaCanada
  2. 2.LaBRIUniversité de BordeauxFrance
  3. 3.CNRS - MASCOTTE ProjectINRIA Sophia AntipolisFrance

Personalised recommendations