Indranil Gupta (Indy) September 26, 2013 Lecture 10 Peer-to-peer Systems I Reading: Gnutella paper on website  2013, I. Gupta Computer Science 425 Distributed.

Slides:



Advertisements
Similar presentations
Peer-to-Peer and Social Networks An overview of Gnutella.
Advertisements

INF 123 SW ARCH, DIST SYS & INTEROP LECTURE 12 Prof. Crista Lopes.
Peer to peer INF 123 – Software Architecture 1.
CSE 486/586, Spring 2014 CSE 486/586 Distributed Systems Peer-to-Peer Architecture Steve Ko Computer Sciences and Engineering University at Buffalo.
CS 425 / ECE 428 Distributed Systems Fall 2014 Indranil Gupta (Indy) Lecture 9-10: Peer-to-peer Systems All slides © IG.
CompSci 356: Computer Network Architectures Lecture 21: Content Distribution Chapter 9.4 Xiaowei Yang
Gnutella 2 GNUTELLA A Summary Of The Protocol and it’s Purpose By
Peer-to-Peer Networks João Guerreiro Truong Cong Thanh Department of Information Technology Uppsala University.
Cis e-commerce -- lecture #6: Content Distribution Networks and P2P (based on notes from Dr Peter McBurney © )
Paul Solomine Security of P2P Systems. P2P Systems Used to download copyrighted files illegally. The RIAA is watching you… Spyware! General users become.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
CS 525 Advanced Distributed Systems Spring 09 Indranil Gupta Lecture 2 Introduction to Peer to Peer Systems January 22, 2009.
Peer-to-Peer Intro Jani & Sami Peltotalo.
Gnutella, Freenet and Peer to Peer Networks By Norman Eng Steven Hnatko George Papadopoulos.
Indranil Gupta (Indy) September 21, 2010 Lecture 9 Peer-to-peer Systems I Reading: Gnutella paper on website  2010, I. Gupta Computer Science 425 Distributed.
Security in P2P Networks A study of the gnutella protocol and it’s weaknesses By: Imran Qureshi Date: December 9, 2004.
CS 525 Advanced Distributed Systems Spring 2015 Indranil Gupta (Indy) Lecture 4, 5 Peer to Peer Systems January 29, 2015 All slides © IG 1.
Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.
Peer-peer and Application-level Networking CS 218 Fall 2003 Multicast Overlays P2P applications Napster, Gnutella, Robust Overlay Networks Distributed.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Client-Server vs P2P or, HTTP vs Bittorrent. Client-Server Architecture SERVER client.
P2P File Sharing Systems
Peer-to-Peer Computing CS587x Lecture Department of Computer Science Iowa State University.
1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.
Introduction Widespread unstructured P2P network
Lecture 12 Peer-to-Peer systems (Search Capabilities in Distributed Systems) Sections 10.1, 10.2, plus Paper “The Gnutella Protocol Specification v0.4”
By Shobana Padmanabhan Sep 12, 2007 CSE 473 Class #4: P2P Section 2.6 of textbook (some pictures here are from the book)
BitTorrent Internet Technologies and Applications.

Peer-to-Peer Overlay Networks. Outline Overview of P2P overlay networks Applications of overlay networks Classification of overlay networks – Structured.
1 Telematica di Base Applicazioni P2P. 2 The Peer-to-Peer System Architecture  peer-to-peer is a network architecture where computer resources and services.
Lecture 13 Peer-to-Peer systems (Part II) CS 425/ECE 428/CSE 424 Distributed Systems (Fall 2009) CS 425/ECE 428/CSE 424 Distributed Systems (Fall 2009)
Introduction of P2P systems
Chapter 2: Application layer
2: Application Layer1 Chapter 2 outline r 2.1 Principles of app layer protocols r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail r 2.5 DNS r 2.6 Socket.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
CS 425 / ECE 428 Distributed Systems Fall 2015 Indranil Gupta (Indy) Sep 15-17, 2015 Lecture 7-8: Peer-to-peer Systems All slides © IG.
The Start Shawn Fanning (19-yr-old student nicknamed Napster) developed the original Napster application and service in January 1999 while a freshman.
2: Application Layer1 Chapter 2: Application layer r 2.1 Principles of network applications  app architectures  app requirements r 2.2 Web and HTTP r.
Peer-to-Peer File Sharing Jennifer Rexford COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
PEER TO PEER (P2P) NETWORK By: Linda Rockson 11/28/06.
Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park
1 Indranil Gupta (Indy) Lecture 4 Peer to Peer Systems January 30, 2014 All Slides © IG CS 525 Advanced Distributed Systems Spring 2014.
Computer Networking P2P. Why P2P? Scaling: system scales with number of clients, by definition Eliminate centralization: Eliminate single point.
Indranil Gupta (Indy) September 27, 2012 Lecture 10 Peer-to-peer Systems II Reading: Chord paper on website (Sec 1-4, 6-7)  2012, I. Gupta Computer Science.
Peer-to-Peer By Rui Zhang, Chen Teng, Li Dong, Quanshuan He & Yongzheng Zhang.
NETE4631 Network Information Systems (NISs): Peer-to-Peer (P2P) Suronapee, PhD 1.
ADVANCED COMPUTER NETWORKS Peer-Peer (P2P) Networks 1.
Peer-to-peer systems (part I) Slides by Indranil Gupta (modified by N. Vaidya)
A Reputation-Based Approach for Choosing Reliable Resources in Peer-to-Peer Networks E. Damiani S. De Capitani di Vimercati S. Paraboschi P. Samarati F.
CS Spring 2014 CS 414 – Multimedia Systems Design Lecture 37 – Introduction to P2P (Part 1) Klara Nahrstedt.
Peer to Peer Networking. Network Models => Mainframe Ex: Terminal User needs direct connection to mainframe Secure Account driven  administrator controlled.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
P2P Search COP6731 Advanced Database Systems. P2P Computing  Powerful personal computer Share computing resources P2P Computing  Advantages: Shared.
P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 37 – Introduction to P2P (Part 1) Klara Nahrstedt.
1 Indranil Gupta (Indy) Lecture 4 Peer to Peer Systems January 28, 2010 All Slides © IG CS 525 Advanced Distributed Systems Spring 2010.
1 Indranil Gupta (Indy) Lecture 4 Peer to Peer Systems January 27, 2011 All Slides © IG CS 525 Advanced Distributed Systems Spring 2011.
CS 525 Advanced Distributed Systems Spring 2016 Indranil Gupta (Indy) Lecture 4, 5 Peer to Peer Systems January 28, 2016 All slides © IG 1.
Distributed Systems Lecture 10 P2P systems 1. Previous lecture Leader election – Problem – Algorithms 2.
CS 425 / ECE 428 Distributed Systems Fall 2015 Indranil Gupta (Indy) Peer-to-peer Systems All slides © IG.
CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 24 – Introduction to Peer-to-Peer (P2P) Systems Klara Nahrstedt (presented by Long Vu)
Lecture 7: Peer-to-peer Systems I
BitTorrent Vs Gnutella.
Lecture 7: Peer-to-peer Systems I
CS 525 Advanced Distributed Systems Spring 2017
CS 525 Advanced Distributed Systems Spring 2018
Lecture 7: Peer-to-peer Systems I
Presentation transcript:

Indranil Gupta (Indy) September 26, 2013 Lecture 10 Peer-to-peer Systems I Reading: Gnutella paper on website  2013, I. Gupta Computer Science 425 Distributed Systems CS 425 / ECE 428 Fall 2013

2 Why Study Peer to peer (P2P) systems? To understand how they work To understand the techniques and principles within them To modify, adapt, reuse these techniques and principles in other related areas –Cloud computing: key-value stores borrow heavily from p2p systems –To build your own p2p system To grow the body of knowledge about distributed systems

3 Some Questions Why do people get together? –to share information –to share and exchange resources they have books, class notes, experiences, videos, music cd’s How can computers help people –find information –find resources –exchange and share resources

4 Existing technologies: The Web! –Search engines –Forums: chat rooms, blogs, ebay –Online business But, the web is heavy weight if you want specific resources: say a Beatles’ song “PennyLane” A search engine will give you their bio, lyrics, chords, articles on them, and then perhaps the mp3 But you want only the song, nothing else! If you can find a peer who has a copy of the Beatles song (mp3), perhaps in exchange for your UIUC Homeocoming videos, that would be great! –Napster: a solution light weight that was lighter than the Web

5

6 A Brief History [6/99] Shawn Fanning (freshman Northeastern U.) releases Napster online music service [12/99] RIAA sues Napster, asking $100K per download [3/00] 25% UWisc traffic Napster, many universities ban it [00] 60M users [2/01] US Federal Appeals Court: users violating copyright laws, Napster is abetting this [9/01] Napster decides to run paid service, pay % to songwriters and music companies [Today] Napster protocol is open, people free to develop opennap clients and servers

7 Napster Structure S S S P P PP P P Client machines (“Peers”) napster.com Servers Store their own files Store a directory, i.e., filenames with peer pointers Filename Info about PennyLane.mp :1006 …..

8 Napster Operations Client Connect to a Napster server Upload list of music files that you want to share –Server maintains list of tuples. Server stores no files. Search –Send server keywords to search with –(Server searches its list with the keywords) –Server returns a list of hosts - tuples - to client –Client pings each host in the list to find transfer rates –Client fetches file from best host All communication uses TCP

9 Napster Search S S S P P PP P P Peers napster.com Servers Store their own files Store peer pointers for all files 3. Response 1. Query 2. All servers search their lists (ternary tree algo.) 4. ping candidates 5. download from best host

10 Problems Centralized server a source of congestion Centralized server single point of failure No security: plaintext messages and passwds Courts declared napster.com responsible for users’ copyright violation –“Indirect infringement”

11 Gnutella Eliminate the servers Client machines search and retrieve amongst themselves Clients act as servers too, called servents [3/00] release by AOL, 88K users by 3/03 Original design underwent several modifications Available as an open protocol today

12 Gnutella P P P P P P Servents (“Peers”) P Connected in an overlay graph (== each link is an implicit Internet path) Store their own files Also store “peer pointers”

13 How do I search for my Beatles file? Gnutella routes different messages within the overlay graph Gnutella protocol has 5 main message types –Query (search) –QueryHit (response to query) –Ping (to probe network for other peers) –Pong (reply to ping, contains address of another peer) –Push (used to initiate file transfer) We’ll go into the message structure and protocol now (note: all fields except IP address are in little-endian format)

14 Descriptor ID Payload descriptor TTL Hops Payload length Descriptor Header Type of payload 0x00 Ping 0x01 Pong 0x40 Push 0x80 Query 0x81 Queryhit Decremented at each hop, Message dropped when ttl=0 ttl_initial usually 7 to 10 Incremented at each hop ID of this search transaction Number of bytes in message following this header Payload Gnutella Message Header Format

15 Minimum Speed Search criteria (keywords) Query (0x80) 0 1 ….. Payload Format in Gnutella Query Message

16 Gnutella Search P P P P P P P Who has PennyLane.mp3? Query’s flooded out, ttl-restricted, forwarded only once TTL=2

17 Num. hits port ip_address speed (fileindex,filename,fsize) servent_id n n+16 QueryHit (0x81) : successful result to a query Results Unique identifier of responder; a function of its IP address Info about responder Payload Format in Gnutella Query Reply Message

18 Gnutella Search P P P P P P P Who has PennyLane.mp3? Successful results QueryHit’s routed on reverse path

19 Avoiding excessive traffic To avoid duplicate transmissions, each peer maintains a list of recently received messages Query forwarded to all neighbors except peer from which received Each Query (identified by DescriptorID) forwarded only once QueryHit routed back only to peer from which Query received with same DescriptorID –If neighbor does not exist anymore, drop QueryHit Duplicates with same DescriptorID and Payload descriptor (msg type) are dropped QueryHit with DescriptorID for which Query was not seen is dropped

20 After receiving QueryHit messages Requestor chooses “best” QueryHit responder –Initiates HTTP request directly to responder’s ip+port GET /get/ / /HTTP/1.0\r\n Connection: Keep-Alive\r\n Range: bytes=0-\r\n User-Agent: Gnutella\r\n \r\n Responder then replies following start message, followed by packets containing file: HTTP 200 OK\r\n Server: Gnutella\r\n Content-type:application/binary\r\n Content-length: 1024 \r\n \r\n HTTP is the file transfer protocol. Why? Why the “range” field in the GET request? What if responder is behind firewall that disallows incoming connections?

21 Dealing with Firewalls P P P P P P P Requestor sends Push to responder asking for file transfer Has PennyLane.mp3 But behind firewall (Why is the Push routed and not sent directly?)

22 servent_id fileindex ip_address port Push (0x40) same as in received QueryHit Address at which requestor can accept incoming connections

23 Responder establishes a TCP connection at ip_address, port specified. Sends GIV : / \n\n Requestor then sends GET to responder (as before) and file is transferred What if requestor is behind firewall too? –Gnutella gives up –Can you think of an alternative solution?

24 Ping-Pong P2P systems have churn – peers continuously joining, leaving, and failing Peers initiate Ping’s periodically Ping’s flooded out like Query’s, Pong’s routed along reverse path (like QueryHit’s) Pong replies used to update set of neighboring peers to keep neighbor lists fresh in spite of churn Port ip_address Num. files shared Num. KB shared Pong (0x01) Ping (0x00) no payload

25 Gnutella Summary No servers Peers/servents maintain “neighbors”, this forms an overlay graph Peers store their own files Queries flooded out, ttl restricted QueryHit (replies) reverse path routed Supports file transfer through firewalls Periodic Ping-pong to continuously refresh neighbor lists –List size specified by user at peer : heterogeneity means some peers may have more neighbors –Gnutella found to follow power law distribution: P(#links = L) ~ (k is a constant)

26 Problems Ping/Pong constituted 50% traffic –Solution: Multiplex, cache and reduce frequency of pings/pongs Repeated searches with same keywords –Solution: Cache Query, QueryHit messages Modem-connected hosts do not have enough bandwidth for passing Gnutella traffic –Solution: use a central server to act as proxy for such peers –Another solution:  FastTrack System (in a few slides)

27 Problems (contd.) Large number of freeloaders –70% of users in 2000 were freeloaders –Only download files, never upload own files –Endemic to all p2p systems in deployment Flooding causes excessive traffic –Is there some way of maintaining meta-information about peers that leads to more intelligent routing?  Structured Peer-to-peer systems e.g., Chord System (next lecture)

28 FastTrack Hybrid between Gnutella and Napster Takes advantage of “healthier” participants in the system Underlying technology in Kazaa, KazaaLite, Grokster Proprietary protocol, but some details available Like Gnutella, but with some peers designated as supernodes

29 A FastTrack-like System P P P P Peers S S Supernodes P

30 FastTrack (contd.) A supernode stores a directory listing ( ), similar to Napster servers A peer searches by contacting a nearby supernode Supernode membership changes over time Any peer can become (and stay) a supernode, provided it has earned enough reputation –Kazaalite: participation level (=reputation) of a user between 0 and Initially 10, then affected by length of periods of connectivity and total number of uploads.

31 BitTorrent – A Quick Overview Tracker, per file Peer Website links to.torrent (leecher, has some blocks) (seed) (seed, has full file) (new, leecher) 1. Get tracker 2. Get peers 3. Get file blocks (receives heartbeats, joins and leaves from peers)

32 BitTorrent – A Quick Overview (2) File split into blocks (32 KB – 256 KB) Download Local Rarest First block policy: prefer early download of blocks that are least replicated among neighbors –Exception: New node allowed to pick one random neighbor: helps in bootstrapping Tit for tat bandwidth usage: Provide blocks to neighbors that provided it the best download rates –Incentive for nodes to provide good download rates –Both Leechers and Seeds Choking: Limit number of neighbors to which concurrent uploads <= a number (5), i.e., the “best” neighbors –Everyone else choked –Periodically re-evaluate this set (e.g., 10 s) –Optimistic unchoke: periodically (e.g., ~30 s), unchoke a random neigbhor – helps keep unchoked set fresh

33 Wrap-up Notes Applies to all p2p systems How does a peer join the system –Send an http request to well-known url for that P2P service - –Message routed (after DNS lookup) to a well known server which then initializes new peers’ neighbor table –Server only maintains a partial list of online clients

34 Summary Napster: protocol overview, more details available on webpage Gnutella protocol FastTrack protocol BitTorrent Protocols continually evolving, software for new clients and servers conforming to respective protocols: developer forums at –Napster: –Gnutella: Others –Peer to peer working groups:

35 For Next Lecture Read “Chord” paper from website –Sections 1-4, 6-7 MP2 –By now you should have a design for, and have started coding the failure detector Blue Waters Datacenter Tour! –On Oct 9 th. Watch Piazza for signup sheet.