GIA: Making Gnutella-like P2P Systems Scalable Yatin Chawathe Intel Research Seattle Sylvia Ratnasamy, Lee Breslau, Scott Shenker, and Nick Lanham.

Slides:



Advertisements
Similar presentations
Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
Advertisements

Peer-to-Peer and Social Networks An overview of Gnutella.
Massively Distributed Database Systems Distributed Hash Spring 2014 Ki-Joune Li Pusan National University.
Structuring Unstructured Peer-to-Peer Networks Stefan Schmid Roger Wattenhofer Distributed Computing Group HiPC 2007 Goa, India.
Technion –Israel Institute of Technology Computer Networks Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi.
1 An Overview of Gnutella. 2 History The Gnutella network is a fully distributed alternative to the centralized Napster. Initial popularity of the network.
Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.
Improving Gnutella Willy Henrique Säuberli Seminar in Distributed Computing, 16. November 2005 Papers: I.Making Gnutella-like P2P Systems Scalable; SIGCOMM.
An Overview of Peer-to-Peer Networking CPSC 441 (with thanks to Sami Rollins, UCSB)
Peer-to-Peer Networks as a Distribution and Publishing Model Jorn De Boever (june 14, 2007)
Technion –Israel Institute of Technology Software Systems Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi Melamed.
Cis e-commerce -- lecture #6: Content Distribution Networks and P2P (based on notes from Dr Peter McBurney © )
Peer-to-Peer Content Sharing. P2P File Sharing Benefits Why use a P2P model for a file sharing application?
Rutgers PANIC Laboratory The State University of New Jersey Self-Managing Federated Services Francisco Matias Cuenca-Acuna and Thu D. Nguyen Department.
1 Maximizing Remote Work in Flooding-based P2P Systems Qixiang Sun Neil Daswani Hector Garcia-Molina Stanford University.
Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao Cisco Systems, Inc. (Joint work with Christine Lv, Edith Cohen, Kai Li and Scott Shenker)
Making Gnutella-like P2P Systems Scalable Presented by: Karthik Lakshminarayanan Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott.
A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Application Presented by Tony Sung On Loy, MC Lab, CUHK IE 1 A Distributed Search.
1 Client-Server versus P2P  Client-server Computing  Purpose, definition, characteristics  Relationship to the GRID  Research issues  P2P Computing.
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
1 Seminar: Information Management in the Web Gnutella, Freenet and more: an overview of file sharing architectures Thomas Zahn.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Introduction to Peer-to-Peer Networks. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network that.
1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.
P2P Group Meeting (ICS/FORTH) Monday, 21 February, 2005 Making Gnutella-like P2P Systems Scalable (Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick.
1 - CS7701 – Fall 2004 Review of: Making Gnutella-like P2P Systems Scalable Paper by: – Yatin Chawathe (AT&T) –Sylvia Ratnasamy (Intel) –Lee Breslau (AT&T)
Introduction to Peer-to-Peer Networks. What is a P2P network A P2P network is a large distributed system. It uses the vast resource of PCs distributed.
Peer-to-Peer Networking. Presentation Introduction Characteristics and Challenges of Peer-to-Peer Peer-to-Peer Applications Classification of Peer-to-Peer.
Peer to Peer Research survey TingYang Chang. Intro. Of P2P Computers of the system was known as peers which sharing data files with each other. Build.
1 School of Computing Science Simon Fraser University CMPT 880: Internet Architectures and Protocols Introduction to Peer-to-Peer Systems Instructor: Dr.
1 Exploiting locality for scalable information retrieval in peer-to-peer networks D. Zeinalipour-Yazti, Vana Kalogeraki, Dimitrios Gunopulos Manos Moschous.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
Super-peer Network. Motivation: Search in P2P Centralised (Napster) Flooding (Gnutella)  Essentially a breadth-first search using TTLs Distributed Hash.
Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.
GIA: Making Gnutella-like P2P Systems Scalable Yatin Chawathe Sylvia Ratnasamy, Scott Shenker, Nick Lanham, Lee Breslau (Several slides have been taken.
A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.
Peer-to-Peer Network Tzu-Wei Kuo. Outline What is Peer-to-Peer(P2P)? P2P Architecture Applications Advantages and Weaknesses Security Controversy.
Content Distribution in Unstructured Peer-to-Peer Networks Daniel Stutzbach Committee Members: Professor Reza Rejaie Professor Ginnie Lo Professor Art.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
GIA: Making Gnutella-like P2P Systems Scalable Yatin Chawathe Sylvia Ratnasamy, Scott Shenker, Nick Lanham, Lee Breslau Parts of it has been adopted from.
PEER TO PEER (P2P) NETWORK By: Linda Rockson 11/28/06.
A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside
CS 640: Introduction to Computer Networks Aditya Akella Lecture 24 - Peer-to-Peer.
"A Measurement Study of Peer-to-Peer File Sharing Systems" Stefan Saroiu, P. Krishna Gummadi Steven D. Gribble, "A Measurement Study of Peer-to-Peer File.
By Jonathan Drake.  The Gnutella protocol is simply not scalable  This is due to the flooding approach it currently utilizes  As the nodes increase.
1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.
An overview of Gnutella
P2p, Fall 06 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems Search in Unstructured P2p.
Gerhard Haßlinger Search Methods in Dynamic Wireless Networks  Challenges for search in wireless networks  Random walks and flooding for search with.
Aug 22, 2002Sigcomm 2002 Replication Strategies in Unstructured Peer-to-Peer Networks Edith Cohen AT&T Labs-research Scott Shenker ICIR.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
CS Spring 2014 CS 414 – Multimedia Systems Design Lecture 37 – Introduction to P2P (Part 1) Klara Nahrstedt.
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
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.
School of Electrical Engineering &Telecommunications UNSW Cost-effective Broadcast for Fully Decentralized Peer-to-peer Networks Marius Portmann & Aruna.
Decentralized Trust Management for Ad-Hoc Peer-to-Peer Networks Thomas Repantis Vana Kalogeraki Department of Computer Science & Engineering University.
Peer-to-Peer File Sharing Systems Group Meeting Speaker: Dr. Xiaowen Chu April 2, 2004 Centre for E-transformation Research Department of Computer Science.
Distributed Caching and Adaptive Search in Multilayer P2P Networks Chen Wang, Li Xiao, Yunhao Liu, Pei Zheng The 24th International Conference on Distributed.
CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 24 – Introduction to Peer-to-Peer (P2P) Systems Klara Nahrstedt (presented by Long Vu)
Unstructured Networks: Search Márk Jelasity. 2 Outline ● Emergence of decentralized networks ● The Gnutella network: how it worked and looked like ● Search.
Peer to peer Internet telephony challenges, status and trend
OBJECT LOCATION IN UNSTRUCTURED P2P NETWORKS USING RANDOM WALK
Peer-to-Peer Data Management
Peer-to-Peer and Social Networks
Early Measurements of a Cluster-based Architecture for P2P Systems
GIA: Making Gnutella-like P2P Systems Scalable
Elders know best Lifespan-based ideas in P2P systems
Presentation transcript:

GIA: Making Gnutella-like P2P Systems Scalable Yatin Chawathe Intel Research Seattle Sylvia Ratnasamy, Lee Breslau, Scott Shenker, and Nick Lanham

SIGCOMM 2003 The Peer-to-peer Phenomenon Internet-scale distributed system – Distributed file-sharing applications – E.g., Napster, Gnutella, KaZaA File sharing is the dominant P2P app Mass-market – Mostly music, some video, software

SIGCOMM 2003 The Problem Potentially millions of users – Wide range of heterogeneity – Large transient user population Existing search solutions cannot scale – Flooding-based solutions limit capacity – Distributed Hash Tables (DHTs) not necessarily appropriate

SIGCOMM 2003 Why Not DHTs Structured solution – Given a filename, find its location Can DHTs do file sharing? – Probably, but with lots of extra work: Caching, keyword searching Do we need DHTs? – Not necessarily: Great at finding rare files, but most queries are for popular files Note: Not questioning the utility of DHTs in general, merely for mass-market file sharing

SIGCOMM 2003 Our Solution: GIA Unstructured, but take node capacity into account – High-capacity nodes have room for more queries: so, send most queries to them Will work only if high-capacity nodes: – Have correspondingly more answers, and – Are easily reachable from other nodes

SIGCOMM 2003 Make high-capacity nodes easily reachable – Dynamic topology adaptation Make high-capacity nodes have more answers – One-hop replication Search efficiently – Biased random walks Prevent overloaded nodes – Active flow control Make high-capacity nodes easily reachable – Dynamic topology adaptation Make high-capacity nodes have more answers – One-hop replication Search efficiently – Biased random walks Prevent overloaded nodes – Active flow control GIA Design Query

SIGCOMM 2003 Dynamic Topology Adaptation Make high-capacity nodes have high degree (i.e., more neighbors) Per-node level of satisfaction, S: – 0  no neighbors, 1  enough neighbors – Function of: Node’s capacity● Neighbors’ capacities Neighbors’ degrees● Their age – When S << 1, look for neighbors aggressively

SIGCOMM 2003 Simulation Results Compare four systems – FLOOD: TTL-scoped, random topologies – RWRT: Random walks, random topologies – SUPER: Supernode-based search – GIA: search using GIA protocol suite Metric: – Collapse point: aggregate throughput that the system can sustain

SIGCOMM 2003 Questions What is the relative performance of the four algorithms? Which of the GIA components matters the most? How does the system behave in the face of transient nodes?

SIGCOMM 2003 System Performance GIA outperforms SUPER, RWRT & FLOOD by many orders of magnitude in terms of aggregate query load % % %

SIGCOMM 2003 Factor Analysis AlgorithmCollapse point RWRT RWRT+OHR RWRT+BIAS RWRT+TADAPT RWRT+FLWCTL AlgorithmCollapse point GIA 7 GIA – OHR GIA – BIAS 6 GIA – TADAPT 0.2 GIA – FLWCTL 2 No single component is useful by itself; the combination of all of them is what makes GIA scalable

SIGCOMM 2003 Transient Behavior Static SUPER Static RWRT (1% repl) Even under heavy churn GIA outperforms the other algorithms by many orders of magnitude

SIGCOMM 2003 Summary GIA: scalable Gnutella – 3–5 orders of magnitude improvement in system capacity Unstructured approach is good enough! – DHTs may be overkill – Incremental changes to deployed systems Status: Prototype implementation deployed on PlanetLab

SIGCOMM 2003 Why Not DHTs Structured solution – Given a filename, find its location – Tightly controlled topology & file placement Unsuitable for file-sharing – Transient clients cause overhead – Poorly suited for keyword searches – Can find rare files, but that may not matter Note: Not questioning the utility of DHTs in general, merely for mass-market file sharing

SIGCOMM 2003 GIA Design Make high-capacity nodes easily reachable – Dynamic topology adaptation Make high-capacity nodes have more answers – One-hop replication Search efficiently – Biased random walks instead of flooding Prevent nodes from getting overloaded – Active flow control Make high-capacity nodes easily reachable – Dynamic topology adaptation Make high-capacity nodes have more answers – One-hop replication Search efficiently – Biased random walks instead of flooding Prevent nodes from getting overloaded – Active flow control

SIGCOMM 2003 Make high-capacity nodes easily reachable – Dynamic topology adaptation Make high-capacity nodes have more answers – One-hop replication Search efficiently – Biased random walks Prevent overloaded nodes – Active flow control Make high-capacity nodes easily reachable – Dynamic topology adaptation Make high-capacity nodes have more answers – One-hop replication Search efficiently – Biased random walks Prevent overloaded nodes – Active flow control GIA Design

SIGCOMM 2003 Factor Analysis RWRT OHR BIAS TADAPT FLOWCTL GIA 7 – OHR – BIAS 6 – TADAPT 0.2 – FLOWCTL 2 No single component is useful by itself; the combination of all of them is what makes GIA scalable