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
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Parallel Routing in Hypercube Networks with Faulty Nodes
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Dynamic Load Sharing in Peer-to-Peer Systems: When Some Peers Are More Equal than Others
IEEE Internet Computing
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The various designs of peer-to-peer distributed hash tables (DHTs) differ mostly in their performance and the properties they provide. They usually rely on a single greedy routing strategy aiming at achieving short communication paths. In this paper, we propose a new peer-to-peer DHT overlay design, HyPeer, that uses the ''flexible-choice routing'' principle to support multiple routing strategies, each driven by a different objective: fault tolerance, load balance, low latency. Our overlay is loosely based on a hypercube structure providing redundant paths that can be selectively followed at runtime according to the desired goal. HyPeer approximates a hypercube by extending a ring-based DHT overlay and controlling the placement of nodes when they join the network. Experimental evaluation confirms that HyPeer succeeds in improving the routing performance according to our three design objectives, while only slightly increasing the average path length.