CPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University
|
|
- Francis Craig
- 5 years ago
- Views:
Transcription
1 CPSC 4/5 PP Lookup Service Ennan Zhai Computer Science Department Yale University
2 Recall: Lec- Network basics: - OSI model and how Internet works - Socket APIs red PP network (Gnutella, KaZaA, etc.) UseNet and gossip protocol: - UseNet format and peer identity - How gossip protocol runs, pros. and cons. Structured PP network (Chord, CAN, Pastry, etc.) - More (Hybrid PP, BitTorrent, etc.)
3 Lecture Roadmap Background Chord Design Evaluating Chord Comparison
4 Background History of Peer-to-Peer (PP) systems: - Napster, the first PP content sharing system - Unstructured PP network (Gnutella, KaZaA, etc.) - Structured PP network (Chord, CAN, Pastry, etc.) - More (Hybrid PP, BitTorrent, etc.)
5 Background History of Peer-to-Peer (PP) systems: - Napster, the first PP content sharing system - Unstructured PP network (Gnutella, KaZaA, etc.) - Structured PP network (Chord, CAN, Pastry, etc.) - More (Hybrid PP, BitTorrent, etc.)
6 Background History of Peer-to-Peer (PP) systems: - Napster, the first PP content sharing system - Unstructured PP network (Gnutella, KaZaA, etc.) - Structured PP network (Chord, CAN, Pastry, etc.) - More (Hybrid PP, BitTorrent, etc.)
7 Background History of Peer-to-Peer (PP) systems: - Napster, the first PP content sharing system - Unstructured PP network (Gnutella, KaZaA, etc.) - Structured PP network (Chord, CAN, Pastry, etc.) - More (Hybrid PP, BitTorrent, etc.)
8 Background History of Peer-to-Peer (PP) systems: - Napster, the first PP content sharing system - Unstructured PP network (Gnutella, KaZaA, etc.) - Structured PP network (Chord, CAN, Pastry, etc.)? - More (Hybrid PP, BitTorrent, etc.) Pros. Cons.?
9 Background History of Peer-to-Peer (PP) systems: - Napster, the first PP content sharing system - Unstructured PP network (Gnutella, KaZaA, etc.) - Structured PP network (Chord, CAN, Pastry, etc.) - More (Hybrid PP, - Easy BitTorrent, to maintainetc.) Pros. { Cons. { - Finding popular stuff - Fancy local queries - Finding unpopular stuff - No guarantees - Data poisoning and tracking
10 Background History of Peer-to-Peer (PP) systems: - Napster, the first PP content sharing system - Unstructured PP network (Gnutella, KaZaA, etc.) - Structured PP network (Chord, CAN, Pastry, etc.) - More (Hybrid PP, BitTorrent, etc.)
11 Why Chord? Chord s important guarantees: - Decentralized (V.S. Napster) - Scalability: O(log(n)) - Availability (V.S. Gnutella)
12 Lecture Roadmap Background Chord Design Evaluating Chord Comparison
13 Chord In short: A PP lookup service Solves problem of locating a data in a collection of decentralized nodes Supports just one operation: given a key, it maps the key onto a node
14 Initialization: Node
15 Initialization: Node
16 Initialization: Object
17 Initialization: Object
18 Initialization: Table 7 0 [,3) 3 3 [3,5) 3 5 [5,)
19 Initialization: Table 7 0 [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
20 Initialization: Table [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
21 Initialization: Table [,) [,4) 3 4 [4,0) Search an object? [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
22 Search [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
23 Search [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
24 Search [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
25 Search [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
26 Search [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
27 Search [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
28 Search [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
29 Search [,) [,4) 3 4 [4,0) I have! [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
30 Search [,) [,4) 3 4 [4,0) I have! [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
31 If new node joins?
32 Node Joins [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
33 Node Joins [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
34 Object Location Changed [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
35 Object Location Changed [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 Who will be affected? 5 [5,) [4,5) 0 5 [5,7) 0 7 [7,3) 0
36 Table Changed [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) [4,5) 0-> 5 [5,7) 0-> 7 [7,3) 0
37 Table Changed [,) [,4) 3 4 [4,0) [,3) 3 3 [3,5) 3 5 [5,) 0 -> [4,5) 5 [5,7) 7 [7,3) 0
38 Table Changed [,) [,4) 3 4 [4,0) 0 -> 0 7 [,3) 3 3 [3,5) 3 5 [5,) [4,5) 5 [5,7) 7 [7,3) 0
39 New Table [,) [,4) 3 4 [4,0) 7 0 [,3) 3 3 [3,5) 3 5 [5,) 7 [7,0) 0 0 [0,) 0 [,) [4,5) 5 [5,7) 7 [7,3) 0
40 If node leaves?
41 Node Leaves [,) [,4) 3 4 [4,0) 0 7 [,3) 3 3 [3,5) 3 5 [5,) 7 [7,0) 0 0 [0,) 0 [,) [4,5) 5 [5,7) 7 [7,3) 0
42 7 [7,0) 0 0 [0,) 0 [,) 3 [,) [,4) 3 4 [4,0) 0 7 Node Leaves Who will be affected? [,3) 3 3 [3,5) 3 5 [5,) 4 [4,5) 5 [5,7) 7 [7,3) 0
43 Node Leaves [,) [,4) 3 4 [4,0) 0 7 [,3) 3 3 [3,5) 3 5 [5,) 7 [7,0) 0 0 [0,) 0 [,) [4,5) 5 [5,7) 7 [7,3) 0
44 Node Leaves [,) 3 [,4) 3 4 [4,0) [7,0) 0 0 [0,) 0 [,) [4,5) 5 [5,7) 7 [7,3) 0
45 Practical Issues Concurrent operations and failures Failure recovery
46 Concurrent Operations & Errors Basic stabilization protocol is used to keep nodes successor pointers up to date, which is sufficient to ensure the correctness of lookups. Every node runs stabilize periodically to find newly joined/left nodes.
47 Concurrent Operations & Errors Basic stabilization protocol is used to keep nodes successor pointers up to date, which is sufficient to ensure the correctness of lookups. Every node runs stabilize periodically to find newly joined/left nodes.
48 Failure Recovery We should maintain correct successor pointers To do this, each node maintains a successor-list of its r nearest successors on the ring If node n notices that its successor has failed, it replaces it with the first live entry in the list Stabilize will correct finger table and successor-list entries pointing to failed node
49 Failure Recovery We should maintain correct successor pointers To do this, each node maintains a successor-list of its r nearest successors on the ring If node n notices that its successor has failed, it replaces it with the first live entry in the list Stabilize will correct finger table and successor-list entries pointing to failed node
50 Failure Recovery We should maintain correct successor pointers To do this, each node maintains a successor-list of its r nearest successors on the ring If node n notices that its successor has failed, it replaces it with the first live entry in the list Stabilize will correct finger table and successor-list entries pointing to failed node
51 Failure Recovery We should maintain correct successor pointers To do this, each node maintains a successor-list of its r nearest successors on the ring If node n notices that its successor has failed, it replaces it with the first live entry in the list Stabilize will correct finger table and successor-list entries pointing to failed node
52 Lecture Roadmap Background Chord Design Evaluating Chord Comparison
53 Distributed Hash Table All the structured PP models implement DHT abstraction.
54 Provable Guarantees Efficient: O(log N) messages per lookup Scalable: O(log N) state per node Robust: survives massive failures Update only affects O(log N) nodes
55 Final Notes Chord only offers Lookup(key) -> IP address Chord typically does not store the data Object and Node IDs are from SHA- Applications?
56 Other Structured PP Models
57 CAN [SIGCOMM 0]
58 Pastry [Middleware 0]
59 SkipNet
60 PP Search Models PP search model: - Napster and BitTorrent - Unstructured PP network (Gnutella, KaZaA, etc.) - Structured PP network (Chord, CAN, Pastry, etc.) - Hybrid (Yyepas, Gnutella+Pastry, etc.) - More (Hybrid PP, BitTorrent, etc.)
61 Lecture Roadmap Background Chord Design Evaluating Chord Comparison
62 Structured PP vs Unstructured PP Searching Routing performance Peers join/leave overhead Maintenance Scalability Lookups need O(logN) messages The complexity of finger table needs O(logN) entries.
63 Next Lecture In the lec-5, I will cover: - Pollution problems in PP content sharing systems - Reputation system is the most representative solution, including peer-based and object-based reputation systems - Case study: Credence
CPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University
CPSC / PP Lookup Service Ennan Zhai Computer Science Department Yale University Recall: Lec- Network basics: - OSI model and how Internet works - Socket APIs red PP network (Gnutella, KaZaA, etc.) UseNet
More informationCPSC 426/526. Reputation Systems. Ennan Zhai. Computer Science Department Yale University
CPSC 426/526 Reputation Systems Ennan Zhai Computer Science Department Yale University Recall: Lec-4 P2P search models: - How Chord works - Provable guarantees in Chord - Other DHTs, e.g., CAN and Pastry
More informationContent Overlays. Nick Feamster CS 7260 March 12, 2007
Content Overlays Nick Feamster CS 7260 March 12, 2007 Content Overlays Distributed content storage and retrieval Two primary approaches: Structured overlay Unstructured overlay Today s paper: Chord Not
More informationTelematics Chapter 9: Peer-to-Peer Networks
Telematics Chapter 9: Peer-to-Peer Networks Beispielbild User watching video clip Server with video clips Application Layer Presentation Layer Application Layer Presentation Layer Session Layer Session
More informationPEER-TO-PEER NETWORKS, DHTS, AND CHORD
PEER-TO-PEER NETWORKS, DHTS, AND CHORD George Porter May 25, 2018 ATTRIBUTION These slides are released under an Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) Creative Commons license
More informationC 1. Last Time. CSE 486/586 Distributed Systems Distributed Hash Tables. Today s Question. What We Want. What We Want. What We Don t Want
Last Time Distributed Systems Distributed Hash Tables Evolution of peer-to-peer Central directory (Napster) Query flooding (Gnutella) Hierarchical overlay (Kazaa, modern Gnutella) BitTorrent Focuses on
More informationDistributed Hash Tables: Chord
Distributed Hash Tables: Chord Brad Karp (with many slides contributed by Robert Morris) UCL Computer Science CS M038 / GZ06 12 th February 2016 Today: DHTs, P2P Distributed Hash Tables: a building block
More informationPeer-to-Peer Systems and Distributed Hash Tables
Peer-to-Peer Systems and Distributed Hash Tables CS 240: Computing Systems and Concurrency Lecture 8 Marco Canini Credits: Michael Freedman and Kyle Jamieson developed much of the original material. Selected
More informationDISTRIBUTED SYSTEMS CSCI 4963/ /4/2015
1 DISTRIBUTED SYSTEMS CSCI 4963/6963 12/4/2015 2 Info Quiz 7 on Tuesday. Project 2 submission URL is posted on the web site Submit your source code and project report (PDF!!!) in a single zip file. If
More informationCS555: Distributed Systems [Fall 2017] Dept. Of Computer Science, Colorado State University
CS 555: DISTRIBUTED SYSTEMS [P2P SYSTEMS] Shrideep Pallickara Computer Science Colorado State University Frequently asked questions from the previous class survey Byzantine failures vs malicious nodes
More informationToday. Why might P2P be a win? What is a Peer-to-Peer (P2P) system? Peer-to-Peer Systems and Distributed Hash Tables
Peer-to-Peer Systems and Distributed Hash Tables COS 418: Distributed Systems Lecture 7 Today 1. Peer-to-Peer Systems Napster, Gnutella, BitTorrent, challenges 2. Distributed Hash Tables 3. The Chord Lookup
More informationPeer to Peer I II 1 CS 138. Copyright 2015 Thomas W. Doeppner, Rodrigo Fonseca. All rights reserved.
Peer to Peer I II 1 Roadmap This course will feature key concepts in Distributed Systems, often illustrated by their use in example systems Start with Peer-to-Peer systems, which will be useful for your
More informationDistributed File Systems: An Overview of Peer-to-Peer Architectures. Distributed File Systems
Distributed File Systems: An Overview of Peer-to-Peer Architectures Distributed File Systems Data is distributed among many sources Ex. Distributed database systems Frequently utilize a centralized lookup
More informationUseNet and Gossip Protocol
CPSC 426/526 UseNet and Gossip Protocol Ennan Zhai Computer Science Department Yale University Recall: Lec-1 Understanding: - Distributed systems vs. decentralized systems - Why we need both? red P2P network
More informationCompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4 Xiaowei Yang xwy@cs.duke.edu Overview Problem Evolving solutions IP multicast Proxy caching Content distribution networks
More information*Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen)
Distributed Hash Tables (DHT) Jukka K. Nurminen *Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen) The Architectures of st and nd Gen. PP Client-Server Peer-to-Peer.
More information*Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen)
Distributed Hash Tables (DHT) Jukka K. Nurminen *Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen) The Architectures of st and nd Gen. PP Client-Server Peer-to-Peer.
More informationLast Time. CSE 486/586 Distributed Systems Distributed Hash Tables. What We Want. Today s Question. What We Want. What We Don t Want C 1
Last Time Distributed Systems Distributed Hash Tables Evolution of peer-to-peer Central directory (Napster) Query flooding (Gnutella) Hierarchical overlay (Kazaa, modern Gnutella) BitTorrent Focuses on
More informationPeer-to-Peer (P2P) Systems
Peer-to-Peer (P2P) Systems What Does Peer-to-Peer Mean? A generic name for systems in which peers communicate directly and not through a server Characteristics: decentralized self-organizing distributed
More informationDistributed Hash Tables (DHT)
Distributed Hash Tables (DHT) Jukka K. Nurminen Aalto University *Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen) The Architectures of st and nd Gen. PP Client-Server
More informationIntroduction to P2P Computing
Introduction to P2P Computing Nicola Dragoni Embedded Systems Engineering DTU Compute 1. Introduction A. Peer-to-Peer vs. Client/Server B. Overlay Networks 2. Common Topologies 3. Data Location 4. Gnutella
More informationArchitectures for Distributed Systems
Distributed Systems and Middleware 2013 2: Architectures Architectures for Distributed Systems Components A distributed system consists of components Each component has well-defined interface, can be replaced
More informationScalability In Peer-to-Peer Systems. Presented by Stavros Nikolaou
Scalability In Peer-to-Peer Systems Presented by Stavros Nikolaou Background on Peer-to-Peer Systems Definition: Distributed systems/applications featuring: No centralized control, no hierarchical organization
More informationCS 640 Introduction to Computer Networks. Today s lecture. What is P2P? Lecture30. Peer to peer applications
Introduction to Computer Networks Lecture30 Today s lecture Peer to peer applications Napster Gnutella KaZaA Chord What is P2P? Significant autonomy from central servers Exploits resources at the edges
More informationPage 1. How Did it Start?" Model" Main Challenge" CS162 Operating Systems and Systems Programming Lecture 24. Peer-to-Peer Networks"
How Did it Start?" CS162 Operating Systems and Systems Programming Lecture 24 Peer-to-Peer Networks" A killer application: Napster (1999) Free music over the Internet Key idea: share the storage and bandwidth
More informationDistributed Hash Tables
Distributed Hash Tables CS6450: Distributed Systems Lecture 11 Ryan Stutsman Material taken/derived from Princeton COS-418 materials created by Michael Freedman and Kyle Jamieson at Princeton University.
More informationDistributed Systems. 17. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2016
Distributed Systems 17. Distributed Lookup Paul Krzyzanowski Rutgers University Fall 2016 1 Distributed Lookup Look up (key, value) Cooperating set of nodes Ideally: No central coordinator Some nodes can
More informationLecture 8: Application Layer P2P Applications and DHTs
Lecture 8: Application Layer P2P Applications and DHTs COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016,
More informationCSE 486/586 Distributed Systems
CSE 486/586 Distributed Systems Distributed Hash Tables Slides by Steve Ko Computer Sciences and Engineering University at Buffalo CSE 486/586 Last Time Evolution of peer-to-peer Central directory (Napster)
More informationL3S Research Center, University of Hannover
, University of Hannover Structured Peer-to to-peer Networks Wolf-Tilo Balke and Wolf Siberski 3..6 *Original slides provided by K. Wehrle, S. Götz, S. Rieche (University of Tübingen) Peer-to-Peer Systems
More informationEE 122: Peer-to-Peer Networks
EE 122: Peer-to-Peer Networks Ion Stoica (and Brighten Godfrey) TAs: Lucian Popa, David Zats and Ganesh Ananthanarayanan http://inst.eecs.berkeley.edu/~ee122/ (Materials with thanks to Vern Paxson, Jennifer
More informationCSCI-1680 P2P Rodrigo Fonseca
CSCI-1680 P2P Rodrigo Fonseca Based partly on lecture notes by Ion Stoica, Sco5 Shenker, Joe Hellerstein Today Overlay networks and Peer-to-Peer Motivation Suppose you want to write a routing protocol
More informationPeer to Peer Systems and Probabilistic Protocols
Distributed Systems 600.437 Peer to Peer Systems & Probabilistic Protocols Department of Computer Science The Johns Hopkins University 1 Peer to Peer Systems and Probabilistic Protocols Lecture 11 Good
More informationPeer-to-Peer Internet Applications: A Review
Peer-to-Peer Internet Applications: A Review Davide Quaglia 01/14/10 Introduction Key points Lookup task Outline Centralized (Napster) Query flooding (Gnutella) Distributed Hash Table (Chord) Simulation
More informationBadri Nath Rutgers University
lookup services Badri Nath Rutgers University badri@cs.rutgers.edu 1. CAN: A scalable content addressable network, Sylvia Ratnasamy et.al. SIGCOMM 2001 2. Chord: A scalable peer-to-peer lookup protocol
More informationTelecommunication Services Engineering Lab. Roch H. Glitho
1 Support Infrastructure Support infrastructure for application layer Why? Re-usability across application layer protocols Modularity (i.e. separation between application layer protocol specification /
More informationAdvanced Computer Networks
Advanced Computer Networks P2P Systems Jianping Pan Summer 2007 5/30/07 csc485b/586b/seng480b 1 C/S vs P2P Client-server server is well-known server may become a bottleneck Peer-to-peer everyone is a (potential)
More informationChord: A Scalable Peer-to-peer Lookup Service for Internet Applications
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented by Veranika Liaukevich Jacobs University
More informationFlooded 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
Peer-to-Peer Networks -: Computer Networking L-: PP Typically each member stores/provides access to content Has quickly grown in popularity Bulk of traffic from/to CMU is Kazaa! Basically a replication
More informationScaling Problem Computer Networking. Lecture 23: Peer-Peer Systems. Fall P2P System. Why p2p?
Scaling Problem 15-441 Computer Networking Millions of clients server and network meltdown Lecture 23: Peer-Peer Systems Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 2 P2P System Why p2p?
More informationToday s Objec2ves. Kerberos. Kerberos Peer To Peer Overlay Networks Final Projects
Today s Objec2ves Kerberos Peer To Peer Overlay Networks Final Projects Nov 27, 2017 Sprenkle - CSCI325 1 Kerberos Trusted third party, runs by default on port 88 Security objects: Ø Ticket: token, verifying
More informationOverlay networks. To do. Overlay networks. P2P evolution DHTs in general, Chord and Kademlia. Turtles all the way down. q q q
Overlay networks To do q q q Overlay networks P2P evolution DHTs in general, Chord and Kademlia Turtles all the way down Overlay networks virtual networks Different applications with a wide range of needs
More informationSearching for Shared Resources: DHT in General
1 ELT-53206 Peer-to-Peer Networks Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original
More informationEE 122: Peer-to-Peer (P2P) Networks. Ion Stoica November 27, 2002
EE 122: Peer-to-Peer (P2P) Networks Ion Stoica November 27, 22 How Did it Start? A killer application: Naptser - Free music over the Internet Key idea: share the storage and bandwidth of individual (home)
More informationSearching for Shared Resources: DHT in General
1 ELT-53207 P2P & IoT Systems Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original
More informationLECT-05, S-1 FP2P, Javed I.
A Course on Foundations of Peer-to-Peer Systems & Applications LECT-, S- FPP, javed@kent.edu Javed I. Khan@8 CS /99 Foundation of Peer-to-Peer Applications & Systems Kent State University Dept. of Computer
More informationAdvanced Distributed Systems. Peer to peer systems. Reference. Reference. What is P2P? Unstructured P2P Systems Structured P2P Systems
Advanced Distributed Systems Peer to peer systems Karl M. Göschka Karl.Goeschka@tuwien.ac.at http://www.infosys.tuwien.ac.at/teaching/courses/ AdvancedDistributedSystems/ What is P2P Unstructured P2P Systems
More informationChord : A Scalable Peer-to-Peer Lookup Protocol for Internet Applications
: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashock, Frank Dabek, Hari Balakrishnan March 4, 2013 One slide
More informationDistributed Systems. peer-to-peer Johan Montelius ID2201. Distributed Systems ID2201
Distributed Systems ID2201 peer-to-peer Johan Montelius 1 Idéa use resources in edge of network computing storage communication 2 Computing 3 seti@home central server millions of clients hundred of thousands
More informationP2P Computing. Nobuo Kawaguchi. Graduate School of Engineering Nagoya University. In this lecture series. Wireless Location Technologies
P2P Computing Nobuo Kawaguchi Graduate School of Engineering Nagoya University 1 In this lecture series Wireless Location Technologies Location Information Processing P2P Computing(Today) Plug and Play
More informationDistributed lookup services
Distributed lookup services lookup services Badri Nath Rutgers University badri@cs.rutgers.edu A set of nodes cooperating Peers Run special purpose algorithms/software Doesn t have to be deployed at every
More informationDISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES
DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES Dr. Jack Lange Computer Science Department University of Pittsburgh Fall 2015 Outline System Architectural Design Issues Centralized Architectures Application
More informationScaling Problem Millions of clients! server and network meltdown. Peer-to-Peer. P2P System Why p2p?
Scaling Problem Millions of clients! server and network meltdown Peer-to-Peer 15-441 2 P2P System Why p2p? Leverage the resources of client machines (peers) Computation, storage, bandwidth Scaling: Create
More informationPeer to Peer Networks
Sungkyunkwan University Peer to Peer Networks Prepared by T. Le-Duc and H. Choo Copyright 2000-2018 Networking Laboratory P2P Applications Traditional P2P applications: for file sharing BitTorrent, Emule
More informationDistributed Hash Tables
Distributed Hash Tables Chord Smruti R. Sarangi Department of Computer Science Indian Institute of Technology New Delhi, India Smruti R. Sarangi Chord 1/29 Outline Overview 1 Overview 2 3 Smruti R. Sarangi
More information12/5/16. Peer to Peer Systems. Peer-to-peer - definitions. Client-Server vs. Peer-to-peer. P2P use case file sharing. Topics
// Topics Peer to Peer Systems Introduction Client-server vs peer to peer Peer-to-peer networks Routing Overlays Structured vs unstructured Example PP Systems Skype login server Peer-to-peer - definitions
More informationGoals. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Solution. Overlay Networks: Motivations.
Goals CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University of California, Berkeley
More informationModern Technology of Internet
Modern Technology of Internet Jiří Navrátil, Josef Vojtěch, Jan Furman, Tomáš Košnar, Sven Ubik, Milan Šárek, Jan Růžička, Martin Pustka, Laban Mwansa, Rudolf Blažek Katedra počítačových systémů FIT České
More informationCS 347 Parallel and Distributed Data Processing
CS 347 Parallel and Distributed Data Processing Spring 2016 Notes 9: Peer-to-Peer Systems Previous Topics Data Database design Queries Query processing Localization Operators Optimization Transactions
More information15-744: Computer Networking P2P/DHT
15-744: Computer Networking P2P/DHT Overview P2P Lookup Overview Centralized/Flooded Lookups Routed Lookups Chord Comparison of DHTs 2 Peer-to-Peer Networks Typically each member stores/provides access
More informationCIS 700/005 Networking Meets Databases
Announcements CIS / Networking Meets Databases Boon Thau Loo Spring Lecture Paper summaries due at noon today. Office hours: Wed - pm ( Levine) Project proposal: due Feb. Student presenter: rd Jan: A Scalable
More informationP2P: Distributed Hash Tables
P2P: Distributed Hash Tables Chord + Routing Geometries Nirvan Tyagi CS 6410 Fall16 Peer-to-peer (P2P) Peer-to-peer (P2P) Decentralized! Hard to coordinate with peers joining and leaving Peer-to-peer (P2P)
More information08 Distributed Hash Tables
08 Distributed Hash Tables 2/59 Chord Lookup Algorithm Properties Interface: lookup(key) IP address Efficient: O(log N) messages per lookup N is the total number of servers Scalable: O(log N) state per
More informationCSE 124 Finding objects in distributed systems: Distributed hash tables and consistent hashing. March 8, 2016 Prof. George Porter
CSE 124 Finding objects in distributed systems: Distributed hash tables and consistent hashing March 8, 2016 rof. George orter Outline Today: eer-to-peer networking Distributed hash tables Consistent hashing
More informationP2P Network Structured Networks: Distributed Hash Tables. Pedro García López Universitat Rovira I Virgili
P2P Network Structured Networks: Distributed Hash Tables Pedro García López Universitat Rovira I Virgili Pedro.garcia@urv.net Index Introduction to DHT s Origins of structured overlays Case studies Chord
More informationPeer-to-Peer Systems. Network Science: Introduction. P2P History: P2P History: 1999 today
Network Science: Peer-to-Peer Systems Ozalp Babaoglu Dipartimento di Informatica Scienza e Ingegneria Università di Bologna www.cs.unibo.it/babaoglu/ Introduction Peer-to-peer (PP) systems have become
More informationIntroduction to Peer-to-Peer Systems
Introduction Introduction to Peer-to-Peer Systems Peer-to-peer (PP) systems have become extremely popular and contribute to vast amounts of Internet traffic PP basic definition: A PP system is a distributed
More informationPart 1: Introducing DHTs
Uni Innsbruck Informatik - Peer-to to-peer Systems Structured PP file sharing systems Michael Welzl michael.welzl@uibk.ac.at DPS NSG Team http://dps.uibk.ac.at dps.uibk.ac.at/nsg Institute of Computer
More informationDistributed Information Processing
Distributed Information Processing 14 th Lecture Eom, Hyeonsang ( 엄현상 ) Department of Computer Science & Engineering Seoul National University Copyrights 2016 Eom, Hyeonsang All Rights Reserved Outline
More information416 Distributed Systems. Mar 3, Peer-to-Peer Part 2
416 Distributed Systems Mar 3, Peer-to-Peer Part 2 Scaling Problem Millions of clients server and network meltdown 2 P2P System Leverage the resources of client machines (peers) Traditional: Computation,
More informationScaling Problem Millions of clients! server and network meltdown. Peer-to-Peer. P2P System Why p2p?
Peer-to-Peer Scaling Problem Millions of clients! server and network meltdown 15-441 2 P2P System Why p2p? Leverage the resources of client machines (peers) Computation, storage, bandwidth 3 Scaling: Create
More informationPeer-to-Peer Systems. Chapter General Characteristics
Chapter 2 Peer-to-Peer Systems Abstract In this chapter, a basic overview is given of P2P systems, architectures, and search strategies in P2P systems. More specific concepts that are outlined include
More informationMarch 10, Distributed Hash-based Lookup. for Peer-to-Peer Systems. Sandeep Shelke Shrirang Shirodkar MTech I CSE
for for March 10, 2006 Agenda for Peer-to-Peer Sytems Initial approaches to Their Limitations CAN - Applications of CAN Design Details Benefits for Distributed and a decentralized architecture No centralized
More informationPage 1. P2P Traffic" P2P Traffic" Today, around 18-20% (North America)! Big chunk now is video entertainment (e.g., Netflix, itunes)!
P2P Traffic" CS162 Operating Systems and Systems Programming Lecture 25 Capstone: P2P Systems, Review" 2004: some Internet Service Providers (ISPs) claimed that over 50% of their traffic was peer-to-peer
More informationFinding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems
Finding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems 1 Motivation from the File Systems World The App needs to know the path /home/user/my pictures/ The Filesystem
More informationEECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Overlay Networks: Motivations
EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley
More informationPeer to Peer Networks
Sungkyunkwan University Peer to Peer Networks Prepared by T. Le-Duc and H. Choo Copyright 2000-2017 Networking Laboratory Presentation Outline 2.1 Introduction 2.2 Client-Server Paradigm 2.3 Peer-To-Peer
More informationOpportunistic Application Flows in Sensor-based Pervasive Environments
Opportunistic Application Flows in Sensor-based Pervasive Environments Nanyan Jiang, Cristina Schmidt, Vincent Matossian, and Manish Parashar ICPS 2004 1 Outline Introduction to pervasive sensor-based
More informationBuilding a low-latency, proximity-aware DHT-based P2P network
Building a low-latency, proximity-aware DHT-based P2P network Ngoc Ben DANG, Son Tung VU, Hoai Son NGUYEN Department of Computer network College of Technology, Vietnam National University, Hanoi 144 Xuan
More informationDefinition of a DS A collection of independent computers that appear to its user as a single coherent system.
Definition of a DS A collection of independent computers that appear to its user as a single coherent system. Challenges in DS Transparency, Heterogeneity, Failure Handling, Openness, Scalability and Openness
More informationSpecial Topics: CSci 8980 Edge History
Special Topics: CSci 8980 Edge History Jon B. Weissman (jon@cs.umn.edu) Department of Computer Science University of Minnesota P2P: What is it? No always-on server Nodes are at the network edge; come and
More informationCS 268: DHTs. Page 1. How Did it Start? Model. Main Challenge. Napster. Other Challenges
How Did it Start? CS : DHTs A killer application: Naptser - Free music over the Internet Key idea: share the content, storage and bandwidth of individual (home) users Scott Shenker and Ion Stoica April,
More information: Scalable Lookup
6.824 2006: Scalable Lookup Prior focus has been on traditional distributed systems e.g. NFS, DSM/Hypervisor, Harp Machine room: well maintained, centrally located. Relatively stable population: can be
More informationMaking Gnutella-like P2P Systems Scalable
Making Gnutella-like P2P Systems Scalable Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker Presented by: Herman Li Mar 2, 2005 Outline What are peer-to-peer (P2P) systems? Early P2P systems
More informationStructured P2P. Complexity O(log N)
Structured P2P. Complexity O(log N) Student: Santiago Peña Luque Communication Technologies 1 Year : 2005 INDEX 1. Introduction to P2P systems 2. Complexity 3. Structured Systems:DHT 4. Specific DHT algorithms
More informationPeer-to-Peer (P2P) Architectures
Peer-to-Peer (P2P) Architectures ECE/CS 658 Internet Engineering Dilum Bandara dilumb@engr.colostate.edu Outline Background Unstructured P2P Napster, Gnutella, & BitTorrent Structured P2P Chord & Kademlia
More informationOutline. Peer-to-Peer. P2p file-sharing. Wither p2p? What s out there? The p2p challenge C1: Search(human s goals) -> file
Outline Peer-to-Peer - pp file sharing techniques Downloading: Whole-file vs. chunks Searching Centralized index (Napster, etc.) Flooding (Gnutella, etc.) Smarter flooding (KaZaA, ) Routing (Freenet, etc.)
More informationP2P Network Structured Networks: Distributed Hash Tables. Pedro García López Universitat Rovira I Virgili
P2P Network Structured Networks: Distributed Hash Tables Pedro García López Universitat Rovira I Virgili Pedro.garcia@urv.net Index Description of CHORD s Location and routing mechanisms Symphony: Distributed
More informationPeer-to-Peer Protocols and Systems. TA: David Murray Spring /19/2006
Peer-to-Peer Protocols and Systems TA: David Murray 15-441 Spring 2006 4/19/2006 P2P - Outline What is P2P? P2P System Types 1) File-sharing 2) File distribution 3) Streaming Uses & Challenges 2 Problem:
More informationOverlay Networks: Motivations. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Motivations (cont d) Goals.
Overlay Networks: Motivations CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University
More informationDifferential Privacy
CPSC 426/526 Differential Privacy Ennan Zhai Computer Science Department Yale University Recall: Lec-11 In lec-11, we learned: - Cryptographic basics - Symmetric key cryptography - Public key cryptography
More informationCS514: Intermediate Course in Computer Systems
Distributed Hash Tables (DHT) Overview and Issues Paul Francis CS514: Intermediate Course in Computer Systems Lecture 26: Nov 19, 2003 Distributed Hash Tables (DHT): Overview and Issues What is a Distributed
More informationSimulations of Chord and Freenet Peer-to-Peer Networking Protocols Mid-Term Report
Simulations of Chord and Freenet Peer-to-Peer Networking Protocols Mid-Term Report Computer Communications and Networking (SC 546) Professor D. Starobinksi Brian Mitchell U09-62-9095 James Nunan U38-03-0277
More informationContent Overlays (continued) Nick Feamster CS 7260 March 26, 2007
Content Overlays (continued) Nick Feamster CS 7260 March 26, 2007 Administrivia Quiz date Remaining lectures Interim report PS 3 Out Friday, 1-2 problems 2 Structured vs. Unstructured Overlays Structured
More informationCSCI-1680 Web Performance, Content Distribution P2P Rodrigo Fonseca
CSCI-1680 Web Performance, Content Distribution P2P Rodrigo Fonseca Based partly on lecture notes by Scott Shenker and John Jannotti Last time HTTP and the WWW Today: HTTP Performance Persistent Connections,
More informationDATA. The main challenge in P2P computing is to design and implement LOOKING UP. in P2P Systems
LOOKING UP DATA in P2P Systems By Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica The main challenge in P2P computing is to design and implement a robust and scalable
More informationCryptographic Systems
CPSC 426/526 Cryptographic Systems Ennan Zhai Computer Science Department Yale University Recall: Lec-10 In lec-10, we learned: - Consistency models - Two-phase commit - Consensus - Paxos Lecture Roadmap
More informationDistributed Systems. 16. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2017
Distributed Systems 16. Distributed Lookup Paul Krzyzanowski Rutgers University Fall 2017 1 Distributed Lookup Look up (key, value) Cooperating set of nodes Ideally: No central coordinator Some nodes can
More informationCSCI-1680 Web Performance, Content Distribution P2P John Jannotti
CSCI-1680 Web Performance, Content Distribution P2P John Jannotti Based partly on lecture notes by Sco2 Shenker and Rodrigo Fonseca Last time HTTP and the WWW Today: HTTP Performance Persistent Connections,
More informationCS 43: Computer Networks. 14: DHTs and CDNs October 3, 2018
CS 43: Computer Networks 14: DHTs and CDNs October 3, 2018 If Alice wants to stream Mad Men over a highspeed Internet connection her browser may choose a video rate A. in the range of Mbps. B. in the range
More information