OceanStore Papers


	The OceanStore Project Paper Abstract Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks Kirsten Hildrum and John D. Kubiatowicz To appear in Proceedings of 17th International Symposium on Distributed Computing, October 2003.

In this paper, we show that two peer-to-peer systems, Pastry and Tapestry can be made tolerant to certain classes of failures and a limited class of attacks. These systems are said to operate properly if they can find the closest node matching a requested ID. The system must also be able to dynamically construct the necessary routing information when new nodes enter or the network changes. We show that with an additional factor of O(log n) storage overhead and O(log^2 n) communication overhead, they can continue to achieve both of these goals in the presence of a constant fraction nodes that do not obey the protocol. Our techniques are similar in spirit to those of Saia et al. and Naor and Wieder. Some simple simulations show that these techniques are useful even with constant overhead.

[ Paper: PDF (192K), Postscript (267K), Compressed PostScript (91K) ]
(c) Springer-Verlag. The aboved mentioned proceedings will appear as part of the LNCS series.

Last modified on 07/15/2003 by Kris Hildrum.