Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On name resolution in peer-to-peer networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
IEEE Communications Magazine
Failure recovery for structured P2P networks: protocol design and performance evaluation
Proceedings of the joint international conference on Measurement and modeling of computer systems
Failure recovery for structured p2p networks: protocol design and performance under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
GridJet: An underlying data-transporting protocol for accelerating Web communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In a system proposed by Plaxton, Rajaraman and Richa(PRR), the expected cost of accessing a replicated objectwas proved to be asymptotically optimal for a static set ofnodes and pre-existence of consistent and optimal neighbortables in nodes [9]. To implement PRR's hypercube routingscheme in a dynamic, distributed environment, such asthe Internet, various protocols are needed (for node joining,leaving, table optimization, and failure recovery). Inthis paper, we first present a conceptual foundation, calledC-set trees, for protocol design and reasoning about consistency.We then present the detailed specification of ajoin protocol. In our protocol, only nodes that are joiningneed to keep extra state information about the join process.We present a rigorous proof that the join protocol generatesconsistent neighbor tables for an arbitrary number ofconcurrent joins. The crux of our proof is based upon inductionon a C-set tree. Our join protocol can also be usedfor building consistent neighbor tables for a set of nodes atnetwork initialization time. Lastly, we present both analyticand simulation results on the communication cost of a joinin our protocol.