Sharif Digital Repository

Peer-to-peer networks are beginning to form the infrastructure of future applications. The use of semantic information to organize nodes in a P2P network is a prosperous approach. In this paper we present a novel method, called Semantic Partition Tree, which organizes nodes in a semantic space, using an upper ontology. In this approach each node can find a target in a time proportioned to the depth of the upper ontology, which is significantly less than the number of nodes in the network. Also we simulated our method with several configurations and measured its performance. The results of the simulation show that our scheme is highly scalable and can be used by real P2P networks. © 2007 IEEE... 

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...