23. • march 2000, Justin Frankel and Tom Pepper
• topology is completely random
• routing and search using flooding with TTL
and hop counter
• really slow
• lot’s of signalling traffic
34. • DHT
• Highly scalable
• Each node only knows of m number of other nodes
• Each node has a unique identifier
• Each node is responsible for a segment of the data
• Ids are 160 bits (SHA-1 for Uniform Distribution)
• CHORD is awesome
64. • Chord inspired P2P overlay network
designed for the Web Platform
• Uses CHORD routing scheme
• Uses WebRTC for transport
• WebSockets for Signalling
• Peers (browsers) route messages amongst
them
• 48 bits Ids
• Brings a full DHT to the browser
WEBRTC-EXPLORER
71. PAPERS
• A study on peer-to-peer based discovery of grid resource information by
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
• Peer-to-peer architecture case study: Gnutella network by M. Ripeanu
• Dynamo : Amazon ’ s Highly Available Key-value Store by Giuseppe
DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash
Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, Werner
Vogels
• The Gnutella Protocol Specification v0.6 by Tor Klingberg, Raphael Manfredi
• Chord : A Scalable Peer-to-peer Lookup Service for Internet by Ion Stoica,
Robert Morris, David Karger, M Frans Kaashoek, Hari Balakrishnan Ý