(Enter summary)
Abstract: MultiChord is a new variant of the Chord namespace management algorithm [7] that includes lightweight mechanisms
for accommodating a limited rate of change, specifically, process joins and failures. This paper describes the
algorithm formally and evaluates its performance, using both simulation and analysis. Our main result is that lookups
are provably correct---that is, each lookup returns results that are consistent with a hypothetical ideal system that differs
from the actual system only ... (Update)
Active bibliography (related documents): More All
0.0: MultiChord: A Resilient Namespace Management Protocol - Lynch, Stoica
(Correct)
0.0: Koorde: A simple degree-optimal distributed hash table - Kaashoek, Karger (2003)
(Correct)
0.0: Looking up Data in P2P Systems - Balakrishnan, al. (2003)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
@misc{ berkeley-nancy,
author = "Mit Uc Berkeley",
title = "Nancy Lynch Ion Stoica",
url = "citeseer.ist.psu.edu/736605.html" }
Citations (may not include all citations):
1225
Chord: A scalable peer-to-peer lookup service for internet a..
- Stoica, Morris et al. - 2001
718
Distributed Algorithms (context) - Lynch - 1996
477
distributed object location and routing for large-scale peer.. (context) - Rowstron, Druschel et al.
128
Viceroy: A scalable and dynamic emulation of the butterfly
- Malkhi, Naor et al.
120
Kademlia: A peer-to-peer information system based on the xor..
- Maymounkov, Mazi
81
Distributed object location in a dynamic network
- Hildrum, Kubiatowicz et al.
45
Analysis of the evolution of peer-to-peer systems (context) - Liben-Nowell, Balakrishnan et al.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC