Efficient resource discovery in self-organized unstructured peer-to-peer networks

Liu, Lu; Antonopoulos, Nick; Mackin, Stephen; Xu, Jie; Russell, Duncan

Abstract

In unstructured peer‐to‐peer (P2P) networks, two autonomous peer nodes can be connected if users in those nodes are interested in each other's data. Owing to the similarity between P2P networks and social networks, where peer nodes can be regarded as people and connections can be regarded as relationships, social strategies are useful for improving the performance of resource discovery by self‐organizing autonomous peers on unstructured P2P networks. In this paper, we present an efficient social‐like peer‐to‐peer (ESLP) method for resource discovery by mimicking different human behaviours in social networks. ESLP has been simulated in a dynamic environment with a growing number of peer nodes. From the simulation results and analysis, ESLP achieved better performance than current methods.

• Journal Article Type: Article
• Acceptance Date: Feb 11, 2008
• Online Publication Date: Jun 4, 2008
• Publication Date: 2009-02
• Deposit Date: Feb 13, 2019
• Journal: Concurrency and Computation: Practice and Experience
• Print ISSN: 1532-0626
• Electronic ISSN: 1532-0634
• Publisher: Wiley
• Peer Reviewed: Peer Reviewed
• Volume: 21
• Issue: 2
• Pages: 159-183
• DOI: https://doi.org/10.1002/cpe.1329
• Keywords: Peer to peer, social networks, small world, search, simulation,
• Public URL: http://researchrepository.napier.ac.uk/Output/1557143