Name
Abstract | ||
|---|---|---|
In many large-scale content sharing applications, participants or nodes are connected with each other based on their content or interests, thus forming clusters. In this paper, we model the formation of such clustered overlays as a strategic game, where nodes determine their cluster membership with the goal of improving the recall of their queries. We study the evolution of such overlays both theoretically and experimentally in terms of stability, optimality, load balance, and the required overhead. We show that, in general, decisions made independently by each node using only local information lead to overall cost-effective cluster configurations that are also dynamically adaptable to system updates such as churn and query or content changes. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TPDS.2011.155 | Parallel and Distributed Systems, IEEE Transactions |
Keywords | Field | DocType |
local information lead,required overhead,clustered overlay networks,load balance,strategic game,game-theoretic approach,content change,overall cost-effective cluster configuration,large-scale content,cluster membership,game theory,cost effectiveness,protocols,routing,stability analysis,distributed system,topology,games,overlay network,computer aided software engineering,distributed processing,distributed systems,clustering | Cluster (physics),Load balancing (computing),Computer science,Data sharing,Game theory,Computer-aided software engineering,Cluster analysis,Overlay,Overlay network,Distributed computing | Journal |
Volume | Issue | ISSN |
23 | 4 | 1045-9219 |
Citations | PageRank | References |
5 | 0.43 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Georgia Koloniari | 1 | 220 | 16.49 |
| evaggelia pitoura | 2 | 1968 | 321.56 |