A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit exception handler… (More)
This paper presents a middleware architecture and a generic orchestrating protocol for implementing distributed atomic transactions for large scale dynamic sy stems in a self-managing manner. In… (More)
Atomic memory is a fundamental building block for classical distributed applications. The new emergent large scale applications such as e-auctions or e-commerce need similar fundamental abstractions… (More)
Publish Subscribe systems provide a useful platform for delivering data events from publishers to subscribers in a decoupled fashion in distributed networks These systems have many applications… (More)
This paper aims at providing a deenition of self-organization for dynamic and open systems such as peer-to-peer networks. We propose a deenition of self-organization based on the locality principle |… (More)
We study a special type of self-stabilizing algorithms composition : the cross-over composition (A B). The cross-over composition is the generalization of the algorithm compiler idea introduced in… (More)