Research Article
Efficient Query Routing by Improved Peer Description in P2P Networks
@INPROCEEDINGS{10.4108/ICST.INFOSCALE2008.3549, author={Wai Gen Yee and Linh Thai Nguyen and Dongmei Jia and Ophir Frieder}, title={Efficient Query Routing by Improved Peer Description in P2P Networks}, proceedings={3rd International ICST Conference on Scalable Information Systems}, publisher={ICST}, proceedings_a={INFOSCALE}, year={2010}, month={5}, keywords={Peer-to-peer file-sharing collection description routing}, doi={10.4108/ICST.INFOSCALE2008.3549} }- Wai Gen Yee
Linh Thai Nguyen
Dongmei Jia
Ophir Frieder
Year: 2010
Efficient Query Routing by Improved Peer Description in P2P Networks
INFOSCALE
ICST
DOI: 10.4108/ICST.INFOSCALE2008.3549
Abstract
Peer-to-peer file-sharing systems commonly use the set-of-terms model to describe succinctly a peer's shared file set: the union of the terms in the share files. This information is used to guide query routing decisions. The problem with this model, however, is that it falsely suggests term co-occurrences that do not exist in any single file. Consequently, queries get routed erroneously to peers that have no matching files, wasting network and computation resources in the process. We reduce the amount of co-occurrence errors by partitioning each peer's file set and representing the peer as several file partitions instead of one. Experimental evidence demonstrates that it is possible to reduce the network traffic between neighbors by up to 60% at virtually no cost.
