Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries - Computer Science > DatabasesReport as inadecuate




Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries - Computer Science > Databases - Download this document for free, or read online. Document in PDF available to download.

Abstract: 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 areirrelevant for users. One solution to this problem is to use Top-k querieswhereby the user can specify a limited number k of the most relevant answers.In this paper, we present FD, a Fully Distributed framework for executingTop-k queries in unstructured P2P systems, with the objective of reducingnetwork traffic. FD consists of a family of algorithms that are simple buteffec-tive. FD is completely distributed, does not depend on the existence ofcertain peers, and addresses the volatility of peers during query execution. Wevali-dated FD through implementation over a 64-node cluster and simulationusing the BRITE topology generator and SimJava. Our performance evaluationshows that FD can achieve major performance gains in terms of communication andresponse time.



Author: Reza Akbarinia INRIA - Lina, Esther Pacitti INRIA - Lina, Patrick Valduriez INRIA - Lina

Source: https://arxiv.org/







Related documents