> But you can get something close, using > quorum decisions, for example. You can build these over Chord-style > or Kademlia-style DHTs, but you might find the latter much more > straightforward. > > For example, in Kademlia, the source is directly in charge of all the > PUTs, and likewise the GETs. So it is a simple matter to query all N > replicas, see what value the majority return, and then use that as > your 'consistent' value.
Ok, thank you. > 'consistent' and 'atomic' are not words usually used to describe DHT > operations (nor any truly decentralized algorithms that I know of, at > least not where you assume that some portion of the nodes may be > misbehaving or malicious). Ok, although I found an article describing atomic Put operation in a DHT. (It assumes nodes are not malicious, I think) Here it is : Etna : A Fault-Tolerant Algorithm fot Atomic Mutable DHT Data http://publications.csail.mit.edu/tmp/MIT-CSAIL-TR-2005-044.pdf _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
