Logo image
Back
A path-traceable query routing mechanism for search in unstructured peer-to-peer networks
Journal article   Peer reviewed

A path-traceable query routing mechanism for search in unstructured peer-to-peer networks

Ming Xu, Shuigeng Zhou, Jihong Guan and Xiaohua Hu
Journal of network and computer applications, v 33(2), pp 115-127
2010
DOI: https://doi.org/10.1016/j.jnca.2009.11.003

Abstract

Dynamic network Network topologies Peer-to-peer (P2P) Query routing
Unstructured Peer-to-Peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. Searching for content in unstructured P2P networks is a challenging task because the distribution of objects has no association with the organization of peers. Proposed methods in recent years either depend too much on objects replication rate or suffer from a sharp decline in performance when objects stored in peers change rapidly, although their performance is better than flooding or random walk algorithms to some extent. In this paper, we propose a novel query routing mechanism for improving query performance in unstructured P2P networks. We design a data structure called traceable gain matrix (TGM) that records every query's gain at each peer along the query hit path, and allows for optimizing query routing decision effectively. Experimental results show that our query routing mechanism achieves relatively high query hit rate with low bandwidth consumption in different types of network topologies under static and dynamic network conditions.

Metrics

12 Record Views
13 citations in Web of Science
23 citations in Scopus

Details

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Collaboration types
Domestic collaboration
International collaboration
Web of Science research areas
Computer Science, Hardware & Architecture
Computer Science, Interdisciplinary Applications
Computer Science, Software Engineering
Logo image