[p2p-hackers] How to solve the "Britney problem"?
em at em.no-ip.com
Tue Dec 28 16:56:27 UTC 2004
DHT's such as Kademlia work well when they are used to store large numbers
of items with different keys. But let's suppose, for example, that a lot
of nodes want to advertise their IP addresses as the place where people
can find an instance of a very common resource, such as, say, an open
proxy for some kind of protocol. All the records will then have the same
key: Hash("Resource XYZ available here"), which means that the few unlucky
DHT nodes with ID close to that hash will be requested to store the
pointers for ALL the records. To some extent this already happens with
filesharing applications: nodes with ID close to Hash("britney") are
requested to store metadata information for all Britney Spear's MP3 files.
However, those may amount, at most, to few hundred or maybe thousand
records; but in the case I mentioned before the number of records may grow
unbounded as more and more resource providers jpin the scheme. Are there
techniques devised specifically to solve this problem?
More information about the P2p-hackers