Results 1 -
1 of
1
Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks
- IN PROCEEDINGS OF THE 17TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING
, 2003
"... 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 and a limited class of attacks. These systems are said to operate properly if they can find the closest node matching a requested ID. ..."
Abstract
-
Cited by 37 (4 self)
- Add to MetaCart
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 and a limited class of attacks. These systems are said to operate properly if they can find the closest node matching a requested ID.
