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
Service Location Protocol: Automatic Discovery of IP Network Services
IEEE Internet Computing
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
| Hi-index | 0.00 |
Peer group, a concept originally introduced in IS-IS toolkit, is a strong method to supportdynamic coordination among huge numbers of networked devices. Despite its strength, we still have only a few good method to support the concept.The author proposes a method of dynamic peer discovery (rendezvous) using very simpleset operation on peer groups, based on Internet Indirection Infrastructure (i3)[9]. To makerendezvous effective, it should be easy and efficient to make basic set operation among distributed infrastructure DHT nodes. In the proposed method, bloom .lter is used to get intersection between two or more peer groups.