[p2p-hackers] published key chenge frequency in DHT

[Ole Laursen]

xiangsong hou <xiangsong.hou at gmail.com> writes:

> as we know,DHT can deal with node join/leave frequently.
> i want to know if DHT can deal with publishde key change frequently.
> for example,in grid computing resouce dicovery use DHT,the published key
> (represent cpu or memeory) is change very frequently,so assigned node is
> change frequently.
> how to deal with this situation in DHT?

I'm not totally sure what you are referring to, but I wrote my
master's thesis together with two other guys on a design that used a
DHT for distributing jobs for mass/grid computing. The DHT stored the
jobs and indexed them based on keywords. The main problem was load
balancing the index. We spent quite some time studying relevant
literature and reviewed some of it in the thesis.

You can find it here - we called the system U.P.:

  http://www.cs.aau.dk/~olau/writings/

Unfortunately, we never had time to optimize the load-balancing
algorithm properly (we only had one semester).

-- 
Ole Laursen
http://www.cs.aau.dk/~olau/