Semantic routing of search queries in P2P networks

Rostami, H ; Sharif University of Technology | 2008

427 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.jpdc.2008.06.005
  3. Publisher: 2008
  4. Abstract:
  5. Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Heavy network traffic limits the scalability of P2P networks. Indexing is a method to reduce this traffic. But indexes tend to become large with the growth of the network. Also, limiting the size of these indexes causes loss of indexing information. In this paper we introduce a novel ontology based index (OI) which limits the size of the indexes without sacrificing indexing information. We show that the method can be employed by many P2P networks. The OI sits on top of routing and maintenance modules of a P2P network and enhances it. The OI prunes branches of search trees which have no chance to proceed to a response. Also the OI guarantees that an enhanced routing algorithm and its basic version have the same result set for a given search query. This means that the OI reduces traffic without reducing quality of service. To measure the performance of the OI we apply it on Chord (DHT based) and HyperCup (non-DHT based) P2P networks and show that it reduces the networks' traffic significantly. © 2008 Elsevier Inc. All rights reserved
  6. Keywords:
  7. Client server computer systems ; Distributed computer systems ; Grid computing ; Indexing (of information) ; Information theory ; Internet ; Ontology ; Quality of service ; Routing algorithms ; Semantics ; Future applications ; Heavy network traffics ; Infra structures ; P2p networks ; Peer-to-peer ; Peer-to-peer networks ; Search queries ; Search trees ; Semantic routing ; Computer networks
  8. Source: Journal of Parallel and Distributed Computing ; Volume 68, Issue 12 , 2008 , Pages 1590-1602 ; 07437315 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0743731508001093