Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries

Details Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries

2009-09-14

arxiv.org/abs/0909.2623v1

Distributed and Parallel Databases 19, 2-3 (2006) 67-86

Computer Science

Databases

Scientific paper

10.1007/s10619-006-8313-5

A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solution to this problem is to use Top-k queries whereby the user can specify a limited number (k) of the most relevant answers. In this paper, we present FD, a (Fully Distributed) framework for executing Top-k queries in unstructured P2P systems, with the objective of reducing network traffic. FD consists of a family of algorithms that are simple but effec-tive. FD is completely distributed, does not depend on the existence of certain peers, and addresses the volatility of peers during query execution. We vali-dated FD through implementation over a 64-node cluster and simulation using the BRITE topology generator and SimJava. Our performance evaluation shows that FD can achieve major performance gains in terms of communication and response time.

Affiliated with

Also associated with

No associations

Rating

Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-565534