Premium
SELF‐ORGANIZING PEER‐TO‐PEER SOCIAL NETWORKS
Author(s) -
Wang Fang,
Sun Yaoru
Publication year - 2008
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.2008.00328.x
Subject(s) - computer science , peer to peer , shared resource , scalability , hebbian theory , distributed computing , flexibility (engineering) , resource (disambiguation) , exploit , self organization , artificial intelligence , computer network , computer security , artificial neural network , statistics , mathematics , database
Peer‐to‐peer (P2P) systems provide a new solution to distributed information and resource sharing because of its outstanding properties in decentralization, dynamics, flexibility, autonomy, and cooperation, summarized as DDFAC in this paper. After a detailed analysis of the current P2P literature, this paper suggests to better exploit peer social relationships and peer autonomy to achieve efficient P2P structure design. Accordingly, this paper proposes Self‐organizing peer‐to‐peer social networks (SoPPSoNs) to self‐organize distributed peers in a decentralized way, in which neuron‐like agents following extended Hebbian rules found in the brain activity represent peers to discover useful peer connections. The self‐organized networks capture social associations of peers in resource sharing, and hence are called P2P social networks. SoPPSoNs have improved search speed and success rate as peer social networks are correctly formed. This has been verified through tests on real data collected from the Gnutella system. Analysis on the Gnutella data has verified that social associations of peers in reality are directed, asymmetric and weighted, validating the design of SoPPSoN. The tests presented in this paper have also evaluated the scalability of SoPPSoN, its performance under varied initial network connectivity and the effects of different learning rules.