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
Providing administrative control and autonomy in structured peer-to-peer overlays
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Spurring adoption of DHTs with openhash, a public DHT service
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
UsenetDHT: a low overhead usenet server
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
OpenDHT: a public DHT service and its uses
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
An optimized two-tier P2P architecture for contextualized keyword searches
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
UsenetDHT: a low-overhead design for Usenet
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
CNP: A Protocol for Reducing Maintenance Cost of Structured P2P
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Enabling routing control in a DHT
IEEE Journal on Selected Areas in Communications
Providing KBR service for multiple applications
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Arpeggio: metadata searching and content sharing with chord
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
S-Chord: hybrid topology makes chord efficient
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
The hybrid chord protocol: a peer-to-peer lookup service for context-aware mobile applications
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Providing administrative control and autonomy in structured peer-to-peer overlays
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
UsenetDHT: a low overhead usenet server
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Understanding and mitigating the impact of load imbalance in the memory caching tier
Proceedings of the 4th annual Symposium on Cloud Computing
An efficient privacy-preserving solution for finding the nearest doctor
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
In most of the P2P systems developed so far, all nodes play essentially the same role. In some applications, however, different machine capabilities or owner preferences may mean that only a subset of nodes in the system should participate in offering a particular service. Arranging for each service to be supported by a different peer to peer network is, we argue here, a wasteful solution. Instead, we propose a version of the Chord peer-to-peer protocol that allows any subset of nodes in the network to jointly offer a service without forming their own Chord ring. Our variant supports the same efficient join/leave/insert/delete operations that the subgroup would get if they did form their own separate peer to peer network, but requires significantly less resources than the separate network would. For each subgroup of k machines, our protocol uses O(k) additional storage in the primal Chord ring. The insertion or deletion of a node in the subgroup and the lookup of the next node of a subgroup all require O(log n) hops.