Fault-tolerant peer-to-peer search on small-world networks.
Full text is not in this repository.
Official URL: http://tinyurl.com/y88rche
This item is available in the Library Catalogue
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.
|Research Areas:||A. Middlesex University Schools and Centres > School of Science and Technology > Computer and Communications Engineering|
|Citations on ISI Web of Science:||7|
|Deposited On:||07 Apr 2010 14:23|
|Last Modified:||13 May 2014 15:37|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year