When self-stabilization meets real platforms: An experimental study of a peer-to-peer service discovery system

Caron, Eddy; Chuffart, Florent; Tedeschi, Cédric

doi:10.1016/j.future.2012.10.003

Cited by 5 publications

(7 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, the SST protocol was implemented within the service discovery component of SBAM 2 , a decentralized middleware system, and deployed over a real platform [10]. Those experiments confirmed the behavior presented in Section 5.…”

Section: Resultssupporting

confidence: 67%

Self-Stabilizing Prefix Tree Based Overlay Networks

Caron

Datta

Petit³

et al. 2016

Int. J. Found. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

International audienceIn this paper, we focus on making tries self-stabilizing over such platforms, and propose a self-stabilizing maintenance algorithm for a prefix tree using a message passing model. The proof of self-stabilization is provided, and simulation results are given, to better capture its performances. Still based on simulations, we provide evidences that the protocol, beyond its capacity to repair the structure, can significantly improve the system’s availability, even when the system is not yet stabilized

show abstract

Section: Resultssupporting

confidence: 67%

Self-Stabilizing Prefix Tree Based Overlay Networks

Caron

Datta

Petit³

et al. 2016

Int. J. Found. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…M N simply models the set of natural numbers {0, 1, ..., N − 1}. 8 We first proved that Inj captures finite cardinality ordering (similar corollaries exist for Larger and Same). The following predicate Num_Card is then used to express that a setoid A has cardinality at least (resp.…”

Section: Finitementioning

confidence: 88%

A Framework for Certified Self-Stabilization

Altisen

Corbineau

Devismes

2016

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

Abstract. We propose a general framework to build certified proofs of distributed selfstabilizing algorithms with the proof assistant Coq. We first define in Coq the locally shared memory model with composite atomicity, the most commonly used model in the self-stabilizing area. We then validate our framework by certifying a non trivial part of an existing silent self-stabilizing algorithm which builds a k-clustering of the network. We also certify a quantitative property related to the output of this algorithm. Precisely, we show that the computed k-clustering contains at most n−1 k+1 + 1 clusterheads, where n is the number of nodes in the network. To obtain these results, we also developed a library which contains general tools related to potential functions and cardinality of sets.

show abstract

“…Now, progress in self-stabilization has led to consider more and more complex distributed systems running in increasingly more adversarial environments. As an illustrative example, the three first algorithms proposed by Dijkstra in 1974 [21] were designed for oriented ring topologies and assuming sequential executions only, while nowadays most self-stabilizing algorithms are designed for fully asynchronous arbitrary connected networks, e.g., [19,12], and even for networks, such as peer-to-peer systems, where the topology (frequently) varies over the time, e.g., [11]. Consequently, the design of self-stabilizing algorithms becomes more and more intricate, and accordingly, their proofs of correctness and complexity.…”

Section: Related Work Previous Work Dealing With Padecmentioning

confidence: 99%

Squeezing Streams and Composition of Self-stabilizing Algorithms

Altisen

Corbineau

Devismes

2019

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

Composition is a fundamental tool when dealing with complex systems. We study the hierarchical collateral composition which is used to combine self-stabilizing distributed algorithms. The PADEC library is a framework developed with the Coq proof assistant and dedicated to the certification of self-stabilizing algorithms. We enrich PADEC with the composition operator and a sufficient condition to show its correctness. The formal proof of the condition leads us to develop new tools and methods on potentially infinite streams, these latter ones being used to model the algorithms' executions. The cornerstone has been the definition of the function Squeeze which removes duplicates from streams.

show abstract

When self-stabilization meets real platforms: An experimental study of a peer-to-peer service discovery system

Cited by 5 publications

References 20 publications

Self-Stabilizing Prefix Tree Based Overlay Networks

Self-Stabilizing Prefix Tree Based Overlay Networks

A Framework for Certified Self-Stabilization

Squeezing Streams and Composition of Self-stabilizing Algorithms

Contact Info

Product

Resources

About