Paper Info
Title
Recall-based cluster reformulation by selfish peers
Abstract
Recently, clustered overlays in which peers are grouped based on the similarity of their content or interests have been proposed to improve performance in peer-to-peer systems. Since such systems are highly dynamic, the overlay network needs to be updated frequently to cope with changes. In this paper, we introduce an approach for updating a clus- tered overlay based on local decisions made by individual peers. We model the cluster-reformulation problem as a game where peers determine their cluster membership based on potential gains in the recall of their queries. We also de- fine global criteria for the overall quality of the system and propose strategies for peer relocation that consider different behavioral patterns for the peers. Our preliminary experi- mental evaluation shows that our strategies cope well with changes in the overlay network.
Year
DOI
Venue
2008
10.1109/ICDEW.2008.4498317
ICDE Workshops
Keywords
Field
DocType
game theory,peer-to-peer computing,game theory,overlay network,peer-to-peer system,recall-based cluster reformulation problem
Convergence (routing),Relocation,Behavioral pattern,Computer science,Game theory,Overlay,Recall,Database,Overlay network,Maintenance engineering
Conference
ISSN
ISBN
Citations 
1943-2895
978-1-4244-2162-6
5
PageRank 
References 
Authors
0.42
8
2
Name
Order
Citations
PageRank
Georgia Koloniari122016.49
evaggelia pitoura21968321.56