Sciweavers

Share
ICDCS
2003
IEEE

Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network

9 years 2 months ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes and pre-existence of consistent and optimal neighbor tables in nodes [8]. To implement PRR’s hypercube routing scheme in a dynamic, distributed environment, such as the Internet, various protocols are needed (for node joining, leaving, table optimization, and failure recovery). In this paper, we first present a conceptual foundation, called C-set trees, for protocol design and reasoning about consistency. We then present the detailed specification of a join protocol. In our protocol, only nodes that are joining need to keep extra state information about the join process. We present a rigorous proof that the join protocol generates consistent neighbor tables for an arbitrary number of concurrent joins. The crux of our proof is based upon induction on a C-set tree. Our join protocol can also be used for build...
Huaiyu Liu, Simon S. Lam
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where ICDCS
Authors Huaiyu Liu, Simon S. Lam
Comments (0)
books