Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems

Caron, Eddy; Desprez, Frédéric; Petit, Franck; Tedeschi, Cédric

doi:10.1007/978-3-540-76627-8_9

Cited by 12 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It requires an average number of rounds proportional to the height of the tree, thus providing a good scalability. This result has been confirmed by simulation using actual data sets in [52].…”

Section: Fault Tolerance Mechanism In the Dlptsupporting

confidence: 63%

See 1 more Smart Citation

Habilitation à diriger des recherches

Mathématique¹,

Modèles²,

et al. 2019

Revue Mabillon

View full text Add to dashboard Cite

Section: Fault Tolerance Mechanism In the Dlptsupporting

confidence: 63%

“…In [52] we have presented the first snap-stabilizing greatest common prefix tree for peer-to-peer systems. It provides an alternative to tree-structured peer-to-peer networks suffering from the high cost of replication and an innovating way to implement fault tolerance over large distributed systems.…”

Section: Fault Tolerance Mechanism In the Dlptmentioning

confidence: 99%

Habilitation à diriger des recherches

Mathématique¹,

Modèles²,

et al. 2019

Revue Mabillon

View full text Add to dashboard Cite

“…An alternative approach is to self-stabilize from churn. Self-stabilization allows the peerto-peer network to recover from an arbitrary state once the disruptions cease [9,10,14,16,18,22,23,25,29,30,32,35]. Using oracles allows a peer-to-peer network to recover from an initial incorrect state, even disconnection [16,30].…”

Section: Introductionmentioning

confidence: 99%

Churn Possibilities and Impossibilities

2019

View full text Add to dashboard Cite

Churn is processes joining or leaving the peer-to-peer overlay network. We study handling of various churn variants. Cooperative churn requires leaving processes to participate in the churn algorithm while adversarial churn allows the processes to just quit. Infinite churn considers unbounded number of churning processes throughout a single computation. Unlimited churn does not place a bound on the number of concurrently churning processes. Fair churn handling requires that each churn request is eventually satisfied. A local solution involves only a limited part of the network in handing a churn request. We prove that it is impossible to handle adversarial unlimited churn. We sketch a global solution to all variants of cooperative churn and focus on local churn handling. We prove that a local fair solution to infinite churn, whether limited or unlimited, is impossible. On the constructive side, we present an algorithm that maintains a linear topology and handles the least restrictive unfair churn: infinite and unlimited. We extend this solution to a 1-2 skip list, describe enhancements for generalized skip lists and skip graphs.

show abstract

“…Once the system reaches such good behavior, typically specified by a set of legitimate states, it remains in this set thereafter in the absence of new faults. The past decades saw the initial concept maturing and spanning various problems [7], [6], [3], [1], and networks [10], [5], [18], [21].…”

Section: Introductionmentioning

confidence: 99%

Rigorous Performance Evaluation of Self-Stabilization Using Probabilistic Model Checking

Fallahi

Bonakdarpour

Tixeuil

2013

2013 IEEE 32nd International Symposium on Reliable Distributed Systems

View full text Add to dashboard Cite

We propose a new metric for effectively and accurately evaluating the performance of self-stabilizing algorithms. Self-stabilization is a versatile category of fault-tolerance that guarantees system recovery to normal behavior within a finite number of steps, when the state of the system is perturbed by transient faults (or equally, the initial state of the system can be some arbitrary state). The performance of self-stabilizing algorithms is conventionally characterized in the literature by asymptotic computation complexity. We argue that such characterization of performance is too abstract and does not reflect accurately the realities of deploying a distributed algorithm in practice. Our new metric for characterizing the performance of self-stabilizing algorithms is the expected mean value of recovery time. Our metric has several crucial features. Firstly, it encodes accurate average case speed of recovery. Secondly, we show that our evaluation method can effectively incorporate several other parameters that are of importance in practice and have no place in asymptotic computation complexity. Examples include the type of distributed scheduler, likelihood of occurrence of faults, the impact of faults on speed of recovery, and network topology. We utilize a deep analysis technique, namely, probabilistic model checking to rigorously compute our proposed metric. All our claims are backed by detailed case studies and experiments.

show abstract

Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems

Cited by 12 publications

References 17 publications

Habilitation à diriger des recherches

Habilitation à diriger des recherches

Churn Possibilities and Impossibilities

Rigorous Performance Evaluation of Self-Stabilization Using Probabilistic Model Checking

Contact Info

Product

Resources

About