Wednesday, February 04, 2004
Handling Churn in a DHT: "This paper addresses the problem of churn—the continuous process of node arrival and departure—in distributed hash tables (DHTs). We demonstrate through experiment that existing DHT implementations break down at churn levels observed in deployed peer-to-peer systems, contrary to simulation-based results. We present Bamboo, a DHT that handles high levels of churn, and discuss the manner in which it does so. We show that Bamboo is able to function effectively for median node session times as short as 1.4 minutes, while using less than 900 bytes/s/node of maintenance bandwidth in a 1000-node system. This churn rate is faster than that observed in real file-sharing systems such as Gnutella, Kazaa, Napster, and Overnet. Since Bamboo’s bandwidth usage scales logarithmically in the number of nodes, we expect this cost to remain within the reach of dialup modems even for very large systems. Moreover, in simulated networks without churn, Bamboo achieves lookup performance comparable with Pastry, an existing DHT with a similar structure."
DistribNet (Draft): "To allow anyone, possibly anonymously, to publish web sites with out having to pay for the bandwidth for a commercial provider or having to put up with the increasingly ad ridden free web sites. The only thing the author of the web site should have to worry about is the contents of the web site itself."
[p2p-hackers] Sloppy Chord: "Here's a little-known DHT approach which is straightforward, (relatively) simple to implement, and has provable O(log n) performance (with very high probability): Symphony: Distributed Hashing in a Small World... In general I think randomized approaches such as this make a LOT more sense than any of Chord/Kademlia/Pastry. They can offer greater flexibility and robustness due to significantly less rigid distribution and routing rules."
Subscribe to Posts [Atom]