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

Loading...
Publication Logo

Date

2010

Journal Title

Journal ISSN

Volume Title

Publisher

Iaria Xps Press

Open Access Color

OpenAIRE Downloads

OpenAIRE Views

Research Projects

Journal Issue

Abstract

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.

Description

2nd International Conference on Advances in P2P Systems (AP2PS) -- OCT 25-30, 2010 -- Florence, ITALY

Keywords

peer-to-peer, clustering, interest, search, Jensen-Shannon Divergence, Locality

Fields of Science

Citation

WoS Q

N/A

Scopus Q

N/A

Source

Proceedıngs of the Second Internatıonal Conference on Advances in P2P Systems (Ap2Ps 2010)

Volume

Issue

Start Page

63

End Page

69
SCOPUS™ Citations

1

checked on Mar 06, 2026

Web of Science™ Citations

1

checked on Mar 06, 2026

Page Views

2

checked on Mar 06, 2026

Google Scholar Logo
Google Scholar™

Sustainable Development Goals

SDG data is not available