Self-Organization in Peer-to-Peer Systems

Self-Organization in Peer-to-Peer Systems (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jonathan Ledlie , Jacob Taylor , Laura Serban , Margo Seltzer

Venue:	In Proceedings of the 2002 SIGOPS European Workshop, St. Emilion
Citations:	20 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Self-Organization in Peer-to-Peer Systems	user correction - Legacy Corrections
AUTHOR NAME	Jonathan Ledlie	user correction - Legacy Corrections
AUTHOR AFFIL	Harvard University; 33 Oxford St., Cambridge MA.	user correction - Legacy Corrections
AUTHOR ADDR	USA	user correction - Legacy Corrections
AUTHOR NAME	Jacob Taylor	user correction - Legacy Corrections
AUTHOR AFFIL	Harvard University; 33 Oxford St., Cambridge MA.	user correction - Legacy Corrections
AUTHOR ADDR	USA	user correction - Legacy Corrections
AUTHOR NAME	Laura Serban	user correction - Legacy Corrections
AUTHOR AFFIL	Harvard University; 33 Oxford St., Cambridge MA.	user correction - Legacy Corrections
AUTHOR ADDR	USA	user correction - Legacy Corrections
AUTHOR NAME	Margo Seltzer	user correction - Legacy Corrections
AUTHOR AFFIL	Harvard University; 33 Oxford St., Cambridge MA.	user correction - Legacy Corrections
AUTHOR ADDR	USA	user correction - Legacy Corrections
ABSTRACT	This paper addresses the problem of forming groups in peer-to-peer (P2P) systems and examines what dependability means in decentralized distributed systems. Much of the literature in this field assumes that the participants form a local picture of global state, yet little research has been done discussing how this state remains stable as nodes enter and leave the system. We assume that nodes remain in the system long enough to benefit from retaining state, but not sufficiently long that the dynamic nature of the problem can be ignored. We look at the components that describe a system's dependability and argue that next-generation decentralized systems must explicitly delineate the information dispersal mechanisms (e.g., probe, event-driven, broadcast), the capabilities assumed about constituent nodes (bandwidth, uptime, re-entry distributions), and distribution of information demands (needles in a haystack vs. hay in a haystack [13]). We evaluate two systems based on these criteria: Chord [22] and a heterogeneous-node hierarchical grouping scheme [11]. The former gives a failed request rate under normal P2P conditions and a prototype of the latter a similar rate under more strenuous conditions with an order of magnitude more organizational messages. This analysis suggests several methods to greatly improve the prototype.	user correction - Legacy Corrections
YEAR	2002	INFERENCE
VENUE	In Proceedings of the 2002 SIGOPS European Workshop, St. Emilion	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	27 found	ParsCit 1.0