Evaluation Study of a Distributed Caching Based on Query Similarity in a P2P Network

Mouna Kacimi; Kokou Yetongnon

2nd International ICST Conference on Scalable Information Systems

Research Article

Evaluation Study of a Distributed Caching Based on Query Similarity in a P2P Network

Download537 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/infoscale.2007.963,
    author={Mouna Kacimi and Kokou Yetongnon},
    title={Evaluation Study of a Distributed Caching Based on Query Similarity in a P2P Network},
    proceedings={2nd International ICST Conference on Scalable Information Systems},
    proceedings_a={INFOSCALE},
    year={2010},
    month={5},
    keywords={P2P Networks Similarity Search Caching},
    doi={10.4108/infoscale.2007.963}
}

Mouna Kacimi
Kokou Yetongnon
Year: 2010
Evaluation Study of a Distributed Caching Based on Query Similarity in a P2P Network
INFOSCALE
ICST
DOI: 10.4108/infoscale.2007.963

Mouna Kacimi¹^,*, Kokou Yetongnon²^,*

1: Max-Planck Institut fur Informatik 66123 Saarbrucken, Germany
2: Laboratoire LE2I, University of Bourgogne Dijon 21078 Cedex France

*Contact email: mkacimi@mpi-inf.mpg.de, kokou.yetongnon@u-bourgogne.fr

Abstract

Several caching techniques have been used to reduce the bandwidth consumption and to provide faster answers in P2P systems. In this paper, we address the problem of reducing unnecessary traffic in the Hybrid Overlay Network (HON), which consists in organizing peers and data in an n-dimensional feature space for efficient similarity search. We propose a distributed caching schema that group similar queries to increase the success hit and avoid redundancy. We show through extensive simulations that caching in HON decreases significantly the query scope improving search performance.

Keywords: P2P Networks Similarity Search Caching

Published: 2010-05-16
Modified: 2011-09-11

: http://dx.doi.org/10.4108/infoscale.2007.963