Semantic partitioning of peer-to-peer search space

Rostami, H ; Sharif University of Technology | 2009

914 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.comcom.2008.11.020
  3. Publisher: 2009
  4. Abstract:
  5. Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be conceived as an ontology-based distributed hash table (DHT). Also, we introduce a lookup service for the network which is very scalable and independent of the network size and just depends on depth of the ontology tree. Further, we introduce a broadcast algorithm on the network. We present worst case analysis of both lookup and broadcast algorithms and measure their performance using simulation. The results show that our scheme is highly scalable and can be used in real P2P applications. © 2008 Elsevier B.V. All rights reserved
  6. Keywords:
  7. Grid computing ; Ontology ; Partition tree ; Peer-to-peer ; Semantic routing ; Broadcasting ; Computer applications ; Computer networks ; Distributed computer systems ; Grid computing ; Information theory ; Overlay networks ; Scalability ; Semantics ; Telecommunication networks ; Broadcast algorithms ; Distributed hash tables ; Future applications ; Lookup services ; Lookups ; Network sizes ; Ontology-based ; P2p applications ; P2p networks ; P2p overlays ; Partition tree ; Peer-to-peer ; Peer-to-peer networks ; Search queries ; Search spaces ; Semantic partitioning ; Semantic routing ; Upper ontologies ; Worst-case analysis
  8. Source: Computer Communications ; Volume 32, Issue 4 , 2009 , Pages 619-633 ; 01403664 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S014036640800604X