On Mar 6, 2008, at 12:58 AM, Karl Ebener wrote: > I am trying to develop/improve a DHT for my thesis and I seem to have > come up with a problem I would love to discuss/hear your thoughts on:
Do you care if the ordering is preserved or is it sufficient that all elements are included in the list but without regard to order (which would also mean that any operations used to combine bits of data are commutative)? Accomplishing this is possible without a huge amount of difficulty in a lot of existing DHT systems, but if you care about ordering then you are in for a world of pain. For starters you are going to run into Brewer's CAP conjecture and will need to modify your application-layer accordingly. jim _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
