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
Napster: A Walking Copyright Infringement?
IEEE Micro
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
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We distinguish two types of P2P protocols: structured protocols, which use a directed search approach, and unstructured protocols, which use a flooding approach. We propose the Token-Web as a new type of P2P, semi-structured protocols, that combines directed search and controlled flooding. The protocol presumes that most participants are trustworthy and therefore it does not require authentification. However, mechanisms to prevent disruption are set in place. In this paper, we describe the Token-Web and present results of experiments conducted to assess its properties in a simulated environment and on PlanetLab. The results obtained show that the number of tokens tends to stabilize over time, the message drop rate depends on the level of activity in the network, and the query success rate is dependent on the popularity of the resource sought.