Published January 1, 2010 | Version v1
Conference paper Open

An Efficient JSD-Based Search on Interest-Based Hierarchical Clustering of Overlay Networks

  • 1. Ege Univ, Dept Comp Engn, TR-35100 Izmir, Turkey
  • 2. Ege Univ, Int Comp Inst, TR-35100 Izmir, Turkey
  • 3. Izmir Univ Econ, Fac Engn & Comp Sci, TR-35330 Izmir, Turkey

Description

In P2P networks, peers share contents, especially video files, which represent their interests. However, the underlying P2P topology may not represent this interest distribution. Thus, one important aspect of constructing an efficient P2P network is to exploit the interest similarity among peers. In this paper, we propose a hierarchical clustering mechanism for constructing an overlay network that takes interest similarity among peers into account. By measuring the similarity among interests of peers and clusters, interest-based hierarchical clusters are formed by using Jensen-Shannon Divergence metric. The clustering performance metrics, accuracy and correctness, are reported on PlanetLab. For limited keyword collections, a novel Jensen-Shannon Divergence-based search mechanism is implemented. It has been observed that the integrated mechanism provides an efficient method and better performance as compared to classical keyword-based search.

Files

bib-aa72d9d6-8a9f-43b3-9b14-e1094c109e3c.txt

Files (270 Bytes)

Name Size Download all
md5:55e5d722c97d02eb059a7e392d59bd72
270 Bytes Preview Download