Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anceaume, E., Défago, X., Gradinariu, M., Roy, M.: Towards a theory of self-organization. Technical Report 1694, IRISA (2005)
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)
Babaoglu, O., Meling, H., Montresor, A.: Anthill: A framework for the developments of agent-based peer-to-peer systems. In: ICDCS 2002 (2002)
Capkun, S., Buttyan, L., Hubaux, J.P.: Self-organized public-key management for mobile ad-hoc networks. Transactions on Mobile Computing (January-March 2003)
Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)
Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci. (1997)
Druschel, P., Rowstron, A.: Past: A large-scale, persistent peer-to-peer storage utility. In: HotOS VIII (May 2001)
Fujibayashi, K., Murata, S., Sugawara, K., Yamamura, M.: Self-organizing formation algorithm for active elements. In: SRDS 2002, pp. 416–422 (October 2002)
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)
Kan, G.: Harnessing the benefits of a disruptive technology. O’Reilley & Associates (March 2001)
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)
Montresor, A., Jelasity, M., Babaoğlu, Ö.: Robust aggregation protocols for large-scale overlay networks. In: Proc. DSN, pp. 19–28 (June 2004)
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)
Ratnasamy, S.P.: A Scalable Content-Addressable Network. PhD thesis, University of California at Berkeley (2002)
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)
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)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in p2p systems. In: Proc. Infocom 2003 (2003)
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)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric paterns. SIAM Journal of Computing 28, 1347–1363 (1999)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anceaume, E., Défago, X., Gradinariu, M., Roy, M. (2006). Towards a Theory of Self-organization. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds) Principles of Distributed Systems. OPODIS 2005. Lecture Notes in Computer Science, vol 3974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795490_16
Download citation
DOI: https://doi.org/10.1007/11795490_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36321-7
Online ISBN: 978-3-540-36322-4
eBook Packages: Computer ScienceComputer Science (R0)