Name
Abstract | ||
|---|---|---|
Fault-tolerance and lookup consistency are considered crucial properties for building applications on top of structured overlay networks. Many of these networks use the ring topology for the organization or their peers. The network must handle multiple joins, leaves and failures of peers while keeping the connection between every pair of successor-predecessor correct. This property makes the maintenance of the ring very costly and temporarily impossible to achieve, requiring periodic stabilization for fixing the ring. We introduce the relaxed-ring topology that does not rely on a perfect successor-predecessor relationship and it does not need a any periodic maintenance. Leaves and failures are considered as the same type of event providing a fault-tolerant and self-organizing maintenance of the ring. Relaxed-ring's limitations with respect to failure handling are formally identified, providing strong guarantees to develop applications on top of the architecture. Besides permanent failures, the paper analyses temporary failures and false suspicions caused by broken links, which are often ignored. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1142/S0129626408003478 | PARALLEL PROCESSING LETTERS |
Keywords | Field | DocType |
peer-to-peer, network topology, relaxed-ring, self-configuration, fault-tolerance | Virtual network,Topology,Joins,Peer-to-peer,Computer science,Self-organization,Network topology,Fault tolerance,Ring network,Overlay network,Distributed computing | Journal |
Volume | Issue | ISSN |
18 | 3 | 0129-6264 |
Citations | PageRank | References |
5 | 0.49 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Boris Mejías | 1 | 20 | 4.45 |
| Peter Van Roy | 2 | 617 | 67.19 |