Routing Algorithms for DHTs: Some Open Questions Sylvia Ratnasamy () Scott Shenker ()

First Page		Document Content
Date: 2004-08-20 15:06:14 Distributed hash table Tapestry Chord Routing Pastry Peer-to-peer Flooding Koorde Tulip Overlay Distributed data storage Computing Network architecture		Routing Algorithms for DHTs: Some Open Questions Sylvia Ratnasamy () Scott Shenker () Add to Reading List Source URL: www.eecs.berkeley.edu Download Document from Source Website File Size: 62,87 KB Share Document on Facebook

	Topology-aware routing in structured peer-to-peer overlay networks Miguel Castro Peter Druschel DocID: 1oYV4 - View Document
	Appears in Proceedings of the USENIX Annual Technical Conference, JuneHandling Churn in a DHT Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz University of California, Berkeley and Intel Research, B DocID: 1lY4s - View Document
	DRAFT: To appear in Theory of Computing Systems NovemberDistributed Object Location in a Dynamic Network ∗ DocID: 1kCH5 - View Document
	Theory Comput. Systems OF1–OF36DOI: s00224Theory of Computing Systems DocID: 1gCdg - View Document
	Appears in Proc. of ACM/IFIP/USENIX Intl. Middleware Conf. (MiddlewareApproximate Object Location and Spam Filtering on Peer-to-peer Systems Feng Zhou, Li Zhuang, Ben Y. Zhao, Ling Huang, Anthony D. Joseph, and J DocID: 1gA1J - View Document