Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks

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