We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Architectural Alternatives for Information Filtering in Structured Overlays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

Content providers are naturally distributed and produce large amounts of new information every day. Peer-to-peer information filtering is a promising approach that offers scalability, adaptivity to high dynamics, and failure resilience. The authors developed two approaches that utilize the chord distributed hash table as the routing substrate, but one stresses retrieval effectiveness, whereas the other relaxes recall guarantees to achieve lower message traffic and thus better scalability. This article highlights the two approaches' main characteristics, presents the issues and trade-offs involved in their design, and compares them in terms of scalability, efficiency, and filtering effectiveness.

Published in:

Internet Computing, IEEE  (Volume:11 ,  Issue: 4 )