Sign up & Download
Sign in

Semantic social overlay networks

by Alexander Loser Alexander Loser, Steffen Staab Steffen Staab, Christoph Tempich Christoph Tempich
IEEE Journal on Selected Areas in Communications (2007)

Abstract

Peer selection for query routing is a core task in peer-to-peer networks. Unstructured peer-to-peer systems (like Gnutella) ignore this problem, leading to an abundance of network traffic. Structured peer-to-peer systems (like Chord) enforce a particular, global way of distributing data among the peers in order to solve this problem, but then encounter problems of network volatility and conflicts with the autonomy of the peer data management. In this paper, we propose a new mechanism, INGA, which is based on the observation that query routing in social networks is made possible by locally available knowledge about the expertise of neighbors and a semantics-based peer selection function. We validate INGA by simulation experiments with different data sets. We compare INGA with competing peer selection mechanisms on resulting parameters like recall, message gain or number of messages produced

Cite this document (BETA)

Available from ieeexplore.ieee.org
Page 1
hidden

Semantic social overlay networks

Plain text is unavailable for this page.

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Already have an account? Sign in

Readership Statistics

11 Readers on Mendeley
by Discipline
 
 
by Academic Status
 
64% Ph.D. Student
 
18% Researcher (at an Academic Institution)
 
9% Student (Master)
by Country
 
18% Brazil
 
9% Germany
 
9% Italy