DMCA
Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks (2003)
Cached
Download Links
by
Kirsten Hildrum
,
John Kubiatowicz
| Venue: | IN PROCEEDINGS OF THE 17TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING |
| Citations: | 57 - 4 self |
BibTeX
@INPROCEEDINGS{Hildrum03asymptoticallyefficient,
author = {Kirsten Hildrum and John Kubiatowicz},
title = { Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks},
booktitle = {IN PROCEEDINGS OF THE 17TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING},
year = {2003},
pages = {321--336},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
