Content Search. Unstructured P2P. Jukka K. Nurminen

Similar documents
Content Search. Unstructured P2P

Peer-to-Peer Data Management. Hans-Dieter Ehrich Institut für Informationssysteme Technische Universität Braunschweig

*Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen)

Introduction to Peer-to-Peer Networks

Distributed Hash Tables (DHT)

Advanced Distributed Systems. Peer to peer systems. Reference. Reference. What is P2P? Unstructured P2P Systems Structured P2P Systems

*Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen)

Peer-peer and Application-level Networking. CS 218 Fall 2003

CS 3516: Advanced Computer Networks

Telecommunication Services Engineering Lab. Roch H. Glitho

CS 640 Introduction to Computer Networks. Today s lecture. What is P2P? Lecture30. Peer to peer applications

Architectures for Distributed Systems

12/5/16. Peer to Peer Systems. Peer-to-peer - definitions. Client-Server vs. Peer-to-peer. P2P use case file sharing. Topics

Peer-to-Peer Architectures and Signaling. Agenda

Peer-to-Peer Systems. Winter semester 2014 Jun.-Prof. Dr.-Ing. Kalman Graffi Heinrich Heine University Düsseldorf

P2P Computing. Nobuo Kawaguchi. Graduate School of Engineering Nagoya University. In this lecture series. Wireless Location Technologies

Peer to Peer Computing

Peer-to-Peer Protocols and Systems. TA: David Murray Spring /19/2006

Peer-to-Peer Applications Reading: 9.4

Unit background and administrivia. Foundations of Peer-to- Peer Applications & Systems

Unit 8 Peer-to-Peer Networking

Lecture 21 P2P. Napster. Centralized Index. Napster. Gnutella. Peer-to-Peer Model March 16, Overview:

CS 3516: Computer Networks

Peer-to-Peer Systems. Network Science: Introduction. P2P History: P2P History: 1999 today

Peer-to-Peer Internet Applications: A Review

Introduction to Peer-to-Peer Systems

Peer-to-peer. T Applications and Services in Internet, Fall Jukka K. Nurminen. 1 V1-Filename.ppt / / Jukka K.

Telematics Chapter 9: Peer-to-Peer Networks

Introduction to P2P Computing

CPSC156a: The Internet Co-Evolution of Technology and Society

Peer-to-Peer Networks

Department of Computer Science Institute for System Architecture, Chair for Computer Networks. File Sharing

Scalable overlay Networks

Peer-to-peer & Energy Consumption

Peer-to-peer systems and overlay networks

CS555: Distributed Systems [Fall 2017] Dept. Of Computer Science, Colorado State University

Peer-to-Peer Systems. Internet Computing Workshop Tom Chothia

Scaling Problem Computer Networking. Lecture 23: Peer-Peer Systems. Fall P2P System. Why p2p?

A Survey of Peer-to-Peer Content Distribution Technologies

L3S Research Center, University of Hannover

Decentralized supplementary services for Voice-over-IP telephony

DHT Optimizations for mobile devices. Seminar Mobile Systems Supervisor: Thomas Bocek Student: Dario Nakic

P2P content distribution Jukka K. Nurminen

P2P content distribution

P2P Networks - General

Peer-to-Peer Systems. Chapter General Characteristics

Peer-to-peer systems

Peer-to-Peer Computing

Acknowledgements. Peer-peer Computing & Networking CS 699/IT 818 Fall Peer-peer computing and networking. Peer-peer network.

CSCI-1680 P2P Rodrigo Fonseca

Overlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma

Outline. Peer-to-Peer. P2p file-sharing. Wither p2p? What s out there? The p2p challenge C1: Search(human s goals) -> file

Overlay networks. To do. Overlay networks. P2P evolution DHTs in general, Chord and Kademlia. Turtles all the way down. q q q

Peer-to-Peer Signalling. Agenda

Overlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma

DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES

Overlay networks. Today. l Overlays networks l P2P evolution l Pastry as a routing overlay example

Distributed Data Management. Profr. Dr. Wolf-Tilo Balke Institut für Informationssysteme Technische Universität Braunschweig

6 Structured P2P Networks

P2P Applications. Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza

A Resource Exchange Architecture for Peer-to-Peer File Sharing Applications

Distributed Information Processing

Last Lecture SMTP. SUNY at Buffalo; CSE 489/589 Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 1

Georges Da Costa Introduction on Peer to Peer systems

Advanced Computer Networks

Introduction to Computer Networks

Distributed hash table - Wikipedia, the free encyclopedia

Peer to Peer Systems and Probabilistic Protocols

Peer-to-Peer (P2P) Systems

Overlay and P2P Networks. Introduction. Prof. Sasu Tarkoma

6. Peer-to-peer (P2P) networks I.

Slides for Chapter 10: Peer-to-Peer Systems

P2P Applications. Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Canale A-L Prof.ssa Chiara Petrioli

Overlay and P2P Networks. Introduction and unstructured networks. Prof. Sasu Tarkoma

Overlay and P2P Networks. Introduction. Prof. Sasu Tarkoma

Distributed Knowledge Organization and Peer-to-Peer Networks

Flooded Queries (Gnutella) Centralized Lookup (Napster) Routed Queries (Freenet, Chord, etc.) Overview N 2 N 1 N 3 N 4 N 8 N 9 N N 7 N 6 N 9

Using peer to peer. Marco Danelutto Dept. Computer Science University of Pisa

Chapter 10: Peer-to-Peer Systems

CPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University

Assignment 5. Georgia Koloniari

Simulations of Chord and Freenet Peer-to-Peer Networking Protocols Mid-Term Report

Overlay and P2P Networks. Unstructured networks. PhD. Samu Varjonen

GNUnet Distributed Data Storage

Introduction to Peer-to-Peer Networks

Page 1. How Did it Start?" Model" Main Challenge" CS162 Operating Systems and Systems Programming Lecture 24. Peer-to-Peer Networks"

Introduction to Distributed Systems

internet technologies and standards

Peer to Peer Networks

Overlay Networks: Motivations. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Motivations (cont d) Goals.

EE 122: Peer-to-Peer Networks

Content Overlays. Nick Feamster CS 7260 March 12, 2007

Lecture 8: Application Layer P2P Applications and DHTs

Introduction on Peer to Peer systems

EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Overlay Networks: Motivations

Overlay networks. T o do. Overlay networks. P2P evolution DHTs in general, Chord and Kademlia. q q q. Turtles all the way down

Latest Peer-to-Peer Technologies II Artjom Lind 1

Overlay and P2P Networks. Introduction. Prof. Sasu Tarkoma

Peer to Peer Networks

Scaling Problem Millions of clients! server and network meltdown. Peer-to-Peer. P2P System Why p2p?

Transcription:

Content Search Unstructured P2P Jukka K. Nurminen *Partly adapted from original slides provided by Rüdiger Schollmeier and Jörg Eberspächer (Technische Universität München) 1 V1-Filename.ppt / yyyy-mm-dd / Initials

X.1 The Architectures of 1 st and 2 nd Gen. P2P Client-Server Peer-to-Peer 1. Server is the central entity and only provider of service and content. Network managed by the Server 1. Resources are shared between the peers 2. Resources can be accessed directly from other peers 3. Peer is provider and requestor (Servent concept) 2. Server as the higher performance system. Unstructured P2P Structured P2P 3. Clients as the lower performance system Centralized P2P Pure P2P Hybrid P2P DHT-Based Example: WWW 1. All features of Peer-to-Peer included 2. Central entity is necessary to provide the service 3. Central entity is some kind of index/group database Example: Napster 1. All features of Peer-to-Peer included 2. Any terminal entity can be removed without loss of functionality No central entities Examples: Gnutella 0.4, Freenet 1. All features of Peer-to-Peer included 2. Any terminal entity can be removed without loss of functionality dynamic central entities Example: Gnutella 0.6, JXTA 1. All features of Peer-to-Peer included 2. Any terminal entity can be removed without loss of functionality No central entities 4. Connections in the overlay are fixed Examples: Chord, CAN 1 st Gen. 2 nd Gen. 2 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X. Overview 1. Centralized Peer-to-Peer Networks 2. Pure Peer-to-Peer Networks 3. Hybrid Peer-to-Peer Networks 3 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.2 Definition of centralized P2P All peers are connected to central entity Peers establish connections between each other on demand to exchange user data (e.g. mp3 compressed data) Central entity is necessary to provide the service Central entity is some kind of index/group database Central entity is lookup/routing table 4 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.2 Example: Napster Program for sharing files over the Internet A disruptive application/technology? Brief History: May 1999: Shawn Fanning (freshman, Northeastern University) founds Napster Online music service December 1999: First Lawsuit March 2000: University of Wisconsin reports that 25% of its IP traffic is Napster traffic December 2000: estimated 60 million users February 2001: US Circuit Court of appeals: napster knew users violating copyright laws Shut down of the service 5 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

Napster 1. Register shared content 2. Search 3. Transfer content 6 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.2 Napster animation 7 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.2 Topology of Centralized P2P Servent Connection between 2 servents (TCP) Connection between router & servent Connection between routers (Core) 8 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.2 Discussion Advantages Simple Efficient, little load for peers => also weak peers (mobiles) able to participate Fast and complete lookup (one hop lookup) Central managing/trust authority Advertising business model Clear legal responsibility Disadvantages Single Point of Failure easily attackable Bottleneck Potential of congestion Other applications and application areas BiTorrent VoIP (SIP, H.323) 9 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X. Overview 1. Centralized Peer-to-Peer Networks 2. Pure Peer-to-Peer Networks 3. Hybrid Peer-to-Peer Networks 10 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.3 Definition of Pure P2P Any terminal entity can be removed without loss of functionality No central entities employed in the overlay Peers establish connections between each other randomly To route request and response messages To insert request messages into the overlay 11 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.3 Example: Gnutella 0.4 Program for sharing files over the Internet Focus: decentralized method of searching for files A disruptive application/technology? Brief History: March 2000: open source release by by Justin Frankel and Tom Pepper of Nullsoft, a division of AOL, and almost immediately withdrawn Spring 2001: further developments to improve scalability Gnutella 0.6 (Hybrid P2P) Since then: available in a lot of implementations (Limewire, bearshare, ) Developed further on (privacy, scalability, performance, ) 12 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

Gnutella 1. Search 2. Transfer content 13 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

Gnutella Animation 14 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.3 The Gnutella Network Measurements taken at the LKN in May 2002 15 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.3 Discussion Advantages Genuine P2P Fully distributed, no servers No single point of failure Can provide anonymity Disadvantages Flooding creates a lot of traffic Unequal distribution of load No responsible party Business model? Legal responsibility? Overlay topology not optimal, as no complete view available, no coordinator Zigzag routes, loops If not adapted to physical structure delay and total network load increases Other applications and application areas Freenet Focus on anonymity and privacy Content is transferred in chunks over the signaling network 16 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X. Overview 1. Centralized Peer-to-Peer Networks 2. Pure Peer-to-Peer Networks 3. Hybrid Peer-to-Peer Networks 17 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.4 Definition of Hybrid P2P Main characteristic, compared to pure P2P: Introduction of another dynamic hierarchical layer Hub based network Reduces the signaling load without reducing the reliability Election process to select an assign Superpeers Superpeers: high degree (degree>>20, depending on network size) Leafnodes: connected to one or more Superpeers (degree<7) leafnode Superpeer 18 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.4 Example: Gnutella 0.6 Program for sharing files over the Internet Focus: decentralized method of searching for files Higher signaling efficiency than Pure P2P Same reliability (no single point of failure) Basis of most file-sharing applications (not BitTorrent) Brief History: Spring 2001: resulted from Gnutella 0.4 by further developments to improve scalability Gnutella 0.6 (Hybrid P2P) Since then: available in a lot of implementations (Limewire, bearshare, ) Developed further on (privacy, scalability, performance, ) 19 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

Gnutella 0.6 Animation 20 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

118 X.4 Topology of Hybrid P2P 116 39 100 116 18 118 18 7 43 3, 43 100 7 39 3 Abstract network structure of a part of the Gnutella network (222 nodes Geographical view given by Figure on the right, measured on 01.08.2002 Geographical view of a part of the Gnutella network (222 nodes); The numbers depict the node numbers from the abstract view ( Figure on the left, measured on 01.08.2002) Virtual network not matched to physical network. See path from node 118 to node 18. Superpeer (hub) structure clearly visible in abstract view 21 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

How Skype works Salman A. Baset and Henning Schulzrinne. An analysis of the Skype peer-to-peer Internet Telephony Protocol, Columbia University 22 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.4 Discussion Advantages No single point of failure Can provide anonymity Heterogeneous devices Disadvantages Still high signaling traffic, because of decentralization No definitive statement possible if content is not available or not found Overlay topology not optimal, as no complete view available, no coordinator Zigzag routes, loops Can not be adapted to physical network completely because of hub structure Asymmetric load (Superpeers have to bear a significantly higher load) Application areas File-sharing (Edonkey, Kazaa/FastTrack, Emule) VoIP (Skype) 23 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen

X.1 The Architectures of 1 st and 2 nd Gen. P2P Client-Server Peer-to-Peer 1. Server is the central entity and only provider of service and content. Network managed by the Server 1. Resources are shared between the peers 2. Resources can be accessed directly from other peers 3. Peer is provider and requestor (Servent concept) 2. Server as the higher performance system. Unstructured P2P Structured P2P 3. Clients as the lower performance system Centralized P2P Pure P2P Hybrid P2P DHT-Based Example: WWW 1. All features of Peer-to-Peer included 2. Central entity is necessary to provide the service 3. Central entity is some kind of index/group database Example: Napster 1. All features of Peer-to-Peer included 2. Any terminal entity can be removed without loss of functionality No central entities Examples: Gnutella 0.4, Freenet 1. All features of Peer-to-Peer included 2. Any terminal entity can be removed without loss of functionality dynamic central entities Example: Gnutella 0.6, JXTA 1. All features of Peer-to-Peer included 2. Any terminal entity can be removed without loss of functionality No central entities 4. Connections in the overlay are fixed Examples: Chord, CAN 1 st Gen. 2 nd Gen. 24 V1-Filename.ppt /2007-09-17 / Jukka K. Nurminen