Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
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
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Using the small-world model to improve Freenet performance
Computer Networks: The International Journal of Computer and Telecommunications Networking
Motivating participation in peer to peer communities
ESAW'02 Proceedings of the 3rd international conference on Engineering societies in the agents world III
An S2P-based resource discovery mechanism for tuple-based pervasive systems
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.00 |
Small-world phenomenon has been observed in existing peer-to-peer (P2P) networks, such as Gnutella and Freenet. Due to the similarity of P2P networks to social networks, the previous small-world model proposed by Duncan Watts can be adopted in the design of P2P networks: each node is connected to some neighbouring nodes, and a group of nodes keep a small number of long links to randomly chosen distant nodes. Unfortunately, current unstructured search algorithms have difficulty distinguishing these random long-range shortcuts. This paper presents small world architecture for P2P networks (SWAN) with a semi-structured P2P search algorithm that is used to create and find long-range shortcuts toward remote peer groups. In SWAN, not every peer node needs to be connected to remote groups, but every peer node can easily find which peer nodes have external connections to a specific peer group.