Fault-tolerant peer-to-peer search on small-world networks

Liu, Lu; Antonopoulos, Nick; Mackin, Stephen

Abstract

This paper presents a small world architecture for P2P networks (SWAN) for content discovery in multi-group P2P systems. A semi-structured P2P algorithm of SWAN is utilized 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. From our analysis and simulation, SWAN has the advantages of both structured and unstructured P2P networks, and can achieve good performance in both stable and dynamic environments.

Citation

Liu, L., Antonopoulos, N., & Mackin, S. (2007). Fault-tolerant peer-to-peer search on small-world networks. Future Generation Computer Systems, 23(8), 921-931. https://doi.org/10.1016/j.future.2007.03.002

• Journal Article Type: Article
• Acceptance Date: Mar 1, 2007
• Online Publication Date: Mar 12, 2007
• Publication Date: 2007-11
• Deposit Date: Feb 13, 2019
• Journal: Future Generation Computer Systems
• Print ISSN: 0167-739X
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 23
• Issue: 8
• Pages: 921-931
• DOI: https://doi.org/10.1016/j.future.2007.03.002
• Keywords: Peer-to-peer, Small world, Information search,
• Public URL: http://researchrepository.napier.ac.uk/Output/1557099