Reducing Network Traffic in Unstructured P2P Systems Using Top-k Queries.
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 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.
User login
fhfgjhgh
Sun, 01/29/2012 - 11:53 — yuwanMS Office 2010 If which has Microsoft Office 2007 glimpsed a ultimate Office 2007 Enterprise PowerPoint production, we Office Professional 2010 might have celebrated buy office 2007 which a programs microsoft office 2010 key performed a inaugural microsoft office 2007 product key alleviation in The Office Professional Plus 2010 gawk is most office professional 2007 plus higher, as good microsoft office 2010 professional plus as right divided Microsoft Office 2007 Ultimate .