Improving the dependability of prefix-based routing in DHTs
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
HyPeer: Structured overlay with flexible-choice routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A flabellate overlay network for multi-attribute search
Journal of Parallel and Distributed Computing
Adaptive link recovery scheme for structured peer-to-peer networks under churn
Proceedings of the 2011 ACM Symposium on Applied Computing
Using diffusive load balancing to improve performance of peer-to-peer systems for hosting services
AIMS'11 Proceedings of the 5th international conference on Autonomous infrastructure, management, and security: managing the dynamics of networks and services
Leveraging social network concepts for efficient peer-to-peer live streaming systems
Proceedings of the 20th ACM international conference on Multimedia
Virtual Tree: A robust architecture for interval valid queries in dynamic distributed systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave events per second. In this paper we introduce eQuus, a novel distributed hash table (DHT) suitable for highly dynamic environments. eQuus guarantees that lookups are always fast-- in terms of both the delay and the total number of routing hops--, although peers may join and leave the network at any time and concurrently. 1 Introduction