Nicholas J. A. Harvey
ABSTRACT
We present a deterministic scalable overlay network. In contrast, most previous overlays use randomness or hashing (pseudo-randomness) to achieve a uniform distribution of data and routing traffic.
- I. Abraham et al. A generic scheme for building overlay networks in adversarial scenarios. In IPDPS '03. Google Scholar
Digital Library
- N. Harvey et al. SkipNet: A Scalable Overlay Network with Practical Locality Properties. In USITS '03. Google ScholarDigital Library
- J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic Skip Lists. In SODA '92. Google ScholarDigital Library
- I. Stoica et al. Chord: A scalable Peer-To-Peer lookup service for internet applications. In SIGCOMM '01. Google ScholarDigital Library
Index Terms
- Brief announcement: deterministic skipnet
Recommendations
Brief announcement: an incentive-compatible capacity assignment algorithm for bulk data distribution using P2P
PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computingIn recent years, the rapid growth of peer-to-peer (P2P) networks has provided a new paradigm for content distribution. To improve the efficiency of a P2P system, it is important to provide incentives for the peers to participate and contribute their ...
Brief announcement: decentralized, connectivity-preserving, and cost-effective structured overlay maintenance
DISC'06: Proceedings of the 20th international conference on Distributed ComputingSince their introduction, structured overlays have been used as an important substrate for many peer-to-peer applications. In a structured peer-to-peer overlay, each node maintains a partial list of other nodes in the system, and these partial lists ...
Brief announcement: performance analysis of cyclon, an inexpensive membership management for unstructured p2p overlays
DISC'06: Proceedings of the 20th international conference on Distributed ComputingUnstructured overlays form an important class of peer-to-peer networks, notably for content-based searching algorithms. Being able to build overlays with low diameter, that are resilient to unpredictable joins and leaves, in a totally distributed manner ...
Comments