On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Capacity Planning for Web Services: metrics, models, and methods
Capacity Planning for Web Services: metrics, models, and methods
Using AI in Knowledge Management: Knowledge Bases and Ontologies
IEEE Intelligent Systems
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Using locality of reference to improve performance of peer-to-peer applications
WOSP '04 Proceedings of the 4th international workshop on Software and performance
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Hi-index | 0.00 |
Some semantic approaches in the Peer-to-Peer information retrieval systems extends the connections of the nodes with promosing links. However, this extension causes clustering in the query propagation tree, which decreases the number of reached nodes and the efficiency of the retrieval. Moreover, the clustering causes unnecessary network traffic and redundant information processing at the nodes.In this paper we will propose a more optimal network topology for such semantic Peer-to-Peer systems that eliminiates clustering in the propagation tree. To be able to analytically describe the clustering effect, we will present a model that is aware of the clustering through an appropriate coefficient that shows the influence of the counterproductive links in the propagation tree. With the new topology, the number of messages required for a successful query can significantly be decreased, while the hit rate is increased by the semantic protocol. The low number of messages makes the protocols feasible in mobile Peer-to-Peer networks. We will validate our results with a series of simulation.