A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Exploring the Design Space of Distributed and Peer-to-Peer Systems: Comparing the Web, TRIAD, and Chord/CFS
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
Despite the existence of many peer-to-peer systems, some of their design choices and implications are not well understood. ...
This paper compares several distributed and peer-to-peer systems by evaluating a key set of architectural decisions: naming, addressing, routing, topology, and name lookup. ...
Summary We presented a design decomposition of the WWW, TRIAD [5] and Chord/CFS [2] (as representative of recent peer-to-peer architectures [3, 6, 10] ). ...
doi:10.1007/3-540-45748-8_20
fatcat:zwdlxumzqvew5appdurfwmoigu
Workshop Report for IPTPS'02 1st International Workshop on Peer-to-Peer Systems 7–8 March 2002 — MIT Faculty Club, Cambridge, MA, USA
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Chair: Scott Shenker Scott Shenker gave a brief overview of the problem space, noting that a great deal of work was being done on Distributed Hash Tables (DHTs) that were location independent routing algorithms ...
A: We try to optimize "behind the curtain" in the background so as not to affect performance. Also a lot of the behavior is local and nodes are replaced by a proximity network. ...
Thanks to George Danezis for comparing this account to his own detailed notes of the event and pointing out everything I'd forgotten to include. ...
doi:10.1007/3-540-45748-8_1
fatcat:qfrj4tgn4fa63gb6adyhczvkke