Hello, Thanks a lot for your reply Kazuyuki.
> > How about those you investigated? > These overlays work well for a reasonable amount of key (<10.000), but crash more or less (java exceptions, cpu/memory explosion, freeze, ....) when inserting millions of key per node. In theory, all overlays are designed to support millions of entries, but in practice, there are never tested. The authors just supposed that if it works with 10.000 keys, then it works for 10.000.000 keys. But it's rarely the case. > The amount of heap is a promising candidate for a bottleneck. I guess > it is common for DHT implementations not to limit the number of items > a node can hold and go down when many items are put. Large heap will > extend the limit. > And then CPU will become the issue (XML parsing, message marshalling, ...), and then memory again, and so on .... :-) > I have measured performance of Overlay Weaver and Bamboo and noticed > that other operations (e.g. XML processing) than DHT operations took a > large part of the measured time. > Yes, I observed the same behavior on the overlays I've tested. So, you're not aware of academic projects supporting massive items insertion ? Thanks, Daniel Truffer _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
