Small world architecture for peer-to-peer networks.
Liu, Lu and Mackin, Stephen and Antonopoulos, Nick (2006) Small world architecture for peer-to-peer networks. In: Web intelligence and intelligent agent technology workshops, 2006. WI-IAT 2006 workshops. 2006 IEEE/WIC/ACM international conference: proceedings. Institute of Electrical and Electronics Engineers, pp. 451-454. ISBN 0769527493
Full text is not in this repository.
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.
|Item Type:||Book Section|
|Research Areas:||Middlesex University Schools and Centres > School of Science and Technology > Computer and Communications Engineering|
|Deposited On:||16 Apr 2010 09:42|
|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