Title: A dynamically semantic platform for efficient information retrieval in P2P networks

Authors: Athena Eftychiou; Bogdan Vrusias; Nick Antonopoulos

Addresses: Department of Computing, University of Surrey, Surrey, GU2 7XH, UK ' Department of Computing, University of Surrey, Surrey, GU2 7XH, UK ' School of Computing & Mathematics, University of Derby, Derby, DE22 1GB, UK

Abstract: To build a scalable, robust and accurate P2P network, the network must be able to manage efficiently large amounts of information. This paper proposes a semantic-driven model where the network topology is adaptively shaped, based on the peers' semantic knowledge and the association between network size, peer connectivity and frequency of requested concepts. The proposed architecture follows a two-layer approach: the upper layer forms the semantic knowledge of the network through super-peers; the lower layer of peers represents the network resources. The network knowledge is formally represented by a domain-specific ontology using collective intelligence techniques. During the resource discovery process the query is intelligently routed in the semantic layer via ontology-supported decisions, achieving in this way, based on experimental results, higher query success and reduced network traffic. The proposed model has been experimentally evaluated and results show the semantic-driven network outperforms existing P2P networks.

Keywords: P2P networks; peer-to-peer networks; domain ontology; collective intelligence; distributed information retrieval; P2P search; semantic routing; adaptive topology; semantic-driven models; scalability; peer overloading; network topology; semantic knowledge; network size; peer connectivity; request frequency; network resources; resource discovery; network traffic; query success.

DOI: 10.1504/IJGUC.2012.051424

International Journal of Grid and Utility Computing, 2012 Vol.3 No.4, pp.271 - 283

Received: 30 Jun 2011
Accepted: 28 Jan 2012

Published online: 16 Jan 2013 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article