Premium
Double‐layer P2P networks supporting semantic search and keeping scalability
Author(s) -
Liu Xianru,
Wang Shiguo,
Ji Hong
Publication year - 2014
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2591
Subject(s) - computer science , scalability , layer (electronics) , peer to peer , bloom filter , resource (disambiguation) , protocol (science) , application layer , network layer , node (physics) , computer network , distributed computing , database , medicine , chemistry , alternative medicine , organic chemistry , structural engineering , pathology , software deployment , engineering , operating system
SUMMARY In peer‐to‐peer (P2P) networks, with the aim to support semantic search and keep scalability at the same time, a novel double‐layer P2P protocol is proposed. Firstly, keywords representing resource characteristics are compressed into bloom filters and structured P2P layer is constructed. Secondly, through analyzing one's bloom filters, each node extracts its interest, which is represented by a characteristic vector V . After obtaining common interest among nodes through comparing their V s, a small‐world model is constructed, and another unstructured P2P layer is obtained. Consequently, on the basis of the decentralized architecture, a double‐layer semantic search P2P protocol is structured. When objective resource is being located, its similarity to local interest is used to determine whether it should be located in unstructured P2P semantic layer or structured layer adaptively, which not only improves search efficiency but also supports semantic location more widely. Copyright © 2013 John Wiley & Sons, Ltd.