Towards a universal approach for the finite departure problem in overlay networks
From MaRDI portal
Publication:5207914
Recommendations
- Towards a universal approach for the finite departure problem in overlay networks
- On Stabilizing Departures in Overlay Networks
- Relays: a new approach for the finite departure problem in overlay networks
- Building self-stabilizing overlay networks with the transitive closure framework
- On underlay-aware self-stabilizing overlay networks
Cites work
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
- Building self-stabilizing overlay networks with the transitive closure framework
- How to spread adversarial nodes?
- Impossibility of distributed consensus with one faulty process
- Re-Chord: a self-stabilizing chord overlay network
- Skip graphs
- Spanders: distributed spanning expanders
- The forgiving graph: a distributed data structure for low stretch under adversarial attack
- The hyperring: a low-congestion deterministic data structure for distributed environments
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Time complexity of distributed topological self-stabilization: the case of graph linearization
- Towards a scalable and robust DHT
- Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
- Towards worst-case churn resistant peer-to-peer systems
- Unreliable failure detectors for reliable distributed systems
- Viceroy, a scalable and dynamic emulation of the butterfly
Cited in
(3)
This page was built for publication: Towards a universal approach for the finite departure problem in overlay networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207914)