Article

A Greedy Approach to Replicated Content Placement Using Graph Coloring

06/2002;
Source: CiteSeer

ABSTRACT Connectivity within ad-hoc and peer-to-peer networks undergoes constant change. One approach to reducing the cost of nding information within these networks is to replicate the information among multiple points within the network. A desirable replication approach should cache copies of all pieces of information as close to each node as possible without exceeding the storage resources of the nodes within the network. In addition, the approach should require minimum communication overhead among participating nodes and should adjust the locations of stored content as connectivity within the network changes. Here, we formulate this caching problem as a graph coloring problem, where the color of the node determines the content that the node should store. We present a distributed algorithm where each node chooses its color in a greedy manner, minimizing its own distance to the color furthest from it. We demonstrate convergence of this algorithm and evaluate its performance in the context of its ability to place information near all nodes in the network.

0 0
 · 
0 Bookmarks
 · 
21 Views

Full-text (2 Sources)

View
4 Downloads
Available from
14 Dec 2012

Keywords

ad-hoc
 
algorithm
 
caching problem
 
color
 
color furthest
 
Connectivity
 
distributed algorithm
 
graph coloring problem
 
greedy manner
 
locations
 
minimum communication overhead
 
multiple points
 
nding information
 
networks
 
nodes
 
own distance
 
peer-to-peer networks undergoes constant change
 
place information
 
possible
 
storage resources