A framework for proving the self-organization of dynamic systems

Details A framework for proving the self-organization of dynamic systems A framework for proving the self-organization of dynamic systems

2010-11-10

arxiv.org/abs/1011.2312v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

This paper aims at providing a rigorous definition of self- organization, one of the most desired properties for dynamic systems (e.g., peer-to-peer systems, sensor networks, cooperative robotics, or ad-hoc networks). We characterize different classes of self-organization through liveness and safety properties that both capture information re- garding the system entropy. We illustrate these classes through study cases. The first ones are two representative P2P overlays (CAN and Pas- try) and the others are specific implementations of \Omega (the leader oracle) and one-shot query abstractions for dynamic settings. Our study aims at understanding the limits and respective power of existing self-organized protocols and lays the basis of designing robust algorithm for dynamic systems.

Affiliated with

Also associated with

No associations

Rating

A framework for proving the self-organization of dynamic systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A framework for proving the self-organization of dynamic systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A framework for proving the self-organization of dynamic systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-613636