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

Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks (2003)

by Kirsten Hildrum , John Kubiatowicz

Venue:	IN PROCEEDINGS OF THE 17TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING
Citations:	37 - 4 self

User correction supplied by mph

Datum	Value	Source
TITLE	Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks	user correction
AUTHOR NAME	Kirsten Hildrum	user correction
AUTHOR AFFIL	University of California, Berkeley	user correction
AUTHOR NAME	John Kubiatowicz	user correction
AUTHOR AFFIL	University of California, Berkeley	user correction
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.	user correction - Legacy Corrections
YEAR	2003	INFERENCE
VENUE	IN PROCEEDINGS OF THE 17TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	321--336	INFERENCE
CITATIONS	18 found	ParsCit 1.0