Towards a Theory of Self-organization

  • Emmanuelle Anceaume
  • Xavier Défago
  • Maria Gradinariu
  • Matthieu Roy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3974)


This paper aims at providing a rigorous definition of self-organization, one of the most desired properties for dynamic systems, such as peer-to-peer systems, sensor networks, cooperative robotics, or ad-hoc networks. We propose a framework in order to prove the self-organization of dynamic systems with respect to generic criteria (e.g., similarity, load balancing, geographical neighborhood, battery level) that can be composed in order to construct more complex criteria. We illustrate our theory with a case study that consists in proving the self-organization of CAN, a representative peer-to-peer system.


Sensor Network Mobile Robot Overlay Network Communication Graph Liveness Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anceaume, E., Défago, X., Gradinariu, M., Roy, M.: Towards a theory of self-organization. Technical Report 1694, IRISA (2005)Google Scholar
  2. 2.
    Attie, P., Lynch, N.: Dynamic input/output automata: a formal model for dynamic systems. In: Proc. of the 20st Annual ACM Symposium on Principles of Distributed Computing (PODC 2001), pp. 314–316 (July 2001)Google Scholar
  3. 3.
    Babaoglu, O., Meling, H., Montresor, A.: Anthill: A framework for the developments of agent-based peer-to-peer systems. In: ICDCS 2002 (2002)Google Scholar
  4. 4.
    Capkun, S., Buttyan, L., Hubaux, J.P.: Self-organized public-key management for mobile ad-hoc networks. Transactions on Mobile Computing (January-March 2003)Google Scholar
  5. 5.
    Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)MATHGoogle Scholar
  6. 6.
    Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci. (1997)Google Scholar
  7. 7.
    Druschel, P., Rowstron, A.: Past: A large-scale, persistent peer-to-peer storage utility. In: HotOS VIII (May 2001)Google Scholar
  8. 8.
    Fujibayashi, K., Murata, S., Sugawara, K., Yamamura, M.: Self-organizing formation algorithm for active elements. In: SRDS 2002, pp. 416–422 (October 2002)Google Scholar
  9. 9.
    Felber, P.A., Biersack, E.W., Garcés-Erice, L.: MULTI+: Building Topology-Aware Overlay Multicast Trees. In: Solé-Pareta, J., Smirnov, M., Van Mieghem, P., Domingo-Pascual, J., Monteiro, E., Reichl, P., Stiller, B., Gibbens, R.J. (eds.) QofIS 2004. LNCS, vol. 3266, pp. 11–20. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Kan, G.: Harnessing the benefits of a disruptive technology. O’Reilley & Associates (March 2001)Google Scholar
  11. 11.
    Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, R., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proc. of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000) (November 2000)Google Scholar
  12. 12.
    Montresor, A., Jelasity, M., Babaoğlu, Ö.: Robust aggregation protocols for large-scale overlay networks. In: Proc. DSN, pp. 19–28 (June 2004)Google Scholar
  13. 13.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. SIGCOMM 2001, pp. 161–172. ACM Press, New York (2001)Google Scholar
  14. 14.
    Ratnasamy, S.P.: A Scalable Content-Addressable Network. PhD thesis, University of California at Berkeley (2002)Google Scholar
  15. 15.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  16. 16.
    Rowstron, A., Druschel, P.: Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In: Proc. of the 17th ACM Symposium on Operating Systems Principles (SOSP), pp. 188–201 (2001)Google Scholar
  17. 17.
    Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in p2p systems. In: Proc. Infocom 2003 (2003)Google Scholar
  18. 18.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. of the ACM SIG/COMM, pp. 149–160 (August 2001)Google Scholar
  19. 19.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric paterns. SIAM Journal of Computing 28, 1347–1363 (1999)CrossRefMATHGoogle Scholar
  20. 20.
    Walter, J.E., Welch, J.L., Amato, N.M.: Distributed reconfiguration of metamorphic robot chains. In: Proc. of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 171–180 (2000)Google Scholar
  21. 21.
    Zhang, H., Arora, A.: Gs3: Scalable self-configuration and self-healing in wireless networks. In: Proc. of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 58–67 (2002)Google Scholar
  22. 22.
    Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley (April 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Emmanuelle Anceaume
    • 1
  • Xavier Défago
    • 2
  • Maria Gradinariu
    • 1
  • Matthieu Roy
    • 3
  1. 1.IRISARennesFrance
  2. 2.JAIST and PRESTO, JSTJapan
  3. 3.LAAS-CNRSFrance

Personalised recommendations