TELKOMNIKA (Telecommunication Computing Electronics and Control)
Vol 11, No 2: June 2013

Efficient Content Location Using Semantic Small World in Peer-to-Peer Networks

Yong Chen (University of Posts and Telecommunications)
Wei-zhong Xiao (University of Posts and Telecommunications)
Huan-lin Liu (University of Posts and Telecommunications)
Long-zhao Sun (University of Posts and Telecommunications)



Article Info

Publish Date
01 Jun 2013

Abstract

        Locating content in unstructured peer-to-peer networks is a challenging problem. This paper presents a novel semantic small world resource search mechanism to address the problem. By using vector space model to compute the semantic relevance and applying small world properties such as low average hop distance and high clustering coefficient to construct a cluster overlay. In semantic small world system, the search mechanism is divided into two parts, searching at cluster and outside cluster through inner link and short link, so that it can achieve the incremental research. It significantly reduces the average path length and query cost. Meanwhile, the simulation results show that semantic small world scheme outperforms K-random walks and flooding scheme than higher query hit rate and lower query latency.

Copyrights © 2013






Journal Info

Abbrev

TELKOMNIKA

Publisher

Subject

Computer Science & IT

Description

Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of ...