An Overview of Peer-to-Peer Sami Rollins

Slides:

Advertisements

Similar presentations

Peer-to-Peer Infrastructure and Applications Andrew Herbert Microsoft Research, Cambridge

Advertisements

2/15/2001O'Reilly P2P Conference Characterizing P2P Infrastructure Wesley Felter Editor, Hack the Planet

Peer-to-peer and agent-based computing P2P Algorithms & Issues.

Peer-to-peer and agent-based computing Peer-to-Peer Computing: Introduction.

Research Issues in Web Services CS 4244 Lecture Zaki Malik Department of Computer Science Virginia Tech

Peter R. Pietzuch Peer-to-Peer Computing – or how to make your BitTorrent downloads go faster... Peter Pietzuch Large-Scale Distributed.

Making P2P Networks Scalable a paper presentation by Derek Tingle.

An Overview of Peer-to-Peer Sami Rollins 11/14/02.

P2P data retrieval DHT (Distributed Hash Tables) Partially based on Hellerstein’s presentation at VLDB2004.

Evaluating scalability Peer-to-Peer File Sharing Networks of Sayantan Mitra Vibhor Goyal.

Peer-to-Peer Systems Chapter 25. What is Peer-to-Peer (P2P)? Napster? Gnutella? Most people think of P2P as music sharing.

Denial-of-Service Resilience in Peer-to-Peer Systems D. Dumitriu, E. Knightly, A. Kuzmanovic, I. Stoica and W. Zwaenepoel Presenter: Yan Gao.

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)

An Overview of Peer-to-Peer. What is Peer-to-Peer (P2P)?

Peer-to-Peer Content Sharing. P2P File Sharing Benefits Why use a P2P model for a file sharing application?

CSc 461/561 CSc 461/561 Peer-to-Peer Streaming. CSc 461/561 Summary (1) Service Models (2) P2P challenges (3) Service Discovery (4) P2P Streaming (5)

Responder Anonymity and Anonymous Peer-to-Peer File Sharing. by Vincent Scarlata, Brian Levine and Clay Shields Presentation by Saravanan.

Distributed Lookup Systems

presented by Hasan SÖZER1 Scalable P2P Search Daniel A. Menascé George Mason University.

Beyond Napster: An Overview of Peer-to-Peer Systems and Applications Sami Rollins.

Object Naming & Content based Object Search 2/3/2003.

Content Addressable Networks. CAN Associate with each node and item a unique id in a d-dimensional space Goals –Scales to hundreds of thousands of nodes.

Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.

1 CS 194: Distributed Systems Distributed Hash Tables Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.

Peer-to-peer: an overview Selo TE P2P is not a new concept P2P is not a new technology P2P is not a new technology Oct : first transmission.

Jay Sheth P2P Basics Jay Sheth CE, UMBC. Jay Sheth P2P Agenda What is P2P Why P2P Components and algorithms Characteristics Different P2P systems Future.

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.

INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.

Freenet. Anonymity  Napster, Gnutella, Kazaa do not provide anonymity  Users know who they are downloading from  Others know who sent a query  Freenet.

Introduction Widespread unstructured P2P network

Cmpe 494 Peer-to-Peer Computing Anıl Gürsel Didem Unat.

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.

CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker.

Peer-to-Peer Networking. Presentation Introduction Characteristics and Challenges of Peer-to-Peer Peer-to-Peer Applications Classification of Peer-to-Peer.

Version 4.0. Objectives Describe how networks impact our daily lives. Describe the role of data networking in the human network. Identify the key components.

Peer To Peer Applications

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.

Colin J. MacDougall.  Class of Systems and Applications  “Employ distributed resources to perform a critical function in a decentralized manner”  Distributed.

Jonathan Walpole CSE515 - Distributed Computing Systems 1 Teaching Assistant for CSE515 Rahul Dubey.

Peer-to-Pee Computing HP Technical Report Chin-Yi Tsai.

BitTorrent enabled Ad Hoc Group 1  Garvit Singh( )  Nitin Sharma( )  Aashna Goyal( )  Radhika Medury( )

Vincent Matossian September 21st 2001 ECE 579 An Overview of Decentralized Discovery mechanisms.

A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.

Copyright © 2002 Intel Corporation. Intel Labs Towards Balanced Computing Weaving Peer-to-Peer Technologies into the Fabric of Computing over the Net Presented.

Peer-to-Peer (P2P) networks and applications. What is P2P? r “the sharing of computer resources and services by direct exchange of information”

Enabling Peer-to-Peer SDP in an Agent Environment University of Maryland Baltimore County USA.

Peer-to-Peer Network Tzu-Wei Kuo. Outline What is Peer-to-Peer(P2P)? P2P Architecture Applications Advantages and Weaknesses Security Controversy.

Peer-to-Peer Computing Mrs. Tugba Taskaya-Temizel 13/February/2006.

Content Addressable Networks CAN is a distributed infrastructure, that provides hash table-like functionality on Internet-like scales. Keys hashed into.

1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.

Computer Networking P2P. Why P2P? Scaling: system scales with number of clients, by definition Eliminate centralization: Eliminate single point.

ADVANCED COMPUTER NETWORKS Peer-Peer (P2P) Networks 1.

Peer to Peer Network Design Discovery and Routing algorithms

Peer to Peer Computing. What is Peer-to-Peer? A model of communication where every node in the network acts alike. As opposed to the Client-Server model,

Peer-to-Peer Systems: An Overview Hongyu Li. Outline  Introduction  Characteristics of P2P  Algorithms  P2P Applications  Conclusion.

1 A Measurement Study of Peer-to-Peer File Sharing Systems by Stefan Saroiu P. Krishna Gummadi Steven D. Gribble Presentation by Nanda Kishore Lella

Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.

P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.

09/13/04 CDA 6506 Network Architecture and Client/Server Computing Peer-to-Peer Computing and Content Distribution Networks by Zornitza Genova Prodanoff.

SOSIMPLE: A Serverless, Standards- based, P2P SIP Communication System David A. Bryan and Bruce B. Lowekamp College of William and Mary Cullen Jennings.

Peer-to-Peer Data Management

CHAPTER 3 Architectures for Distributed Systems

Overlay Networking Overview.

A Scalable content-addressable network

An Overview of Peer-to-Peer

InfoShare A Distributed P2P Information Storage & Retrieval System

MIT LCS Proceedings of the 2001 ACM SIGCOMM Conference

Presentation transcript:

An Overview of Peer-to-Peer Sami Rollins

Outline What is P2P? Scope of P2P Applications File Sharing Applications System Design Challenges Approaches to P2P System Design Concluding Discussion

What is Peer-to-Peer (P2P)?

What is a peer? …an entity with capabilities similar to other entities in the system.

The Web Model Contact a server and download a web page. Server has all the resources and capabilities.

The P2P Model A peers resources are similar to the resources of the other participants P2P – peers communicating directly with other peers and sharing resources

P2P Application Taxonomy P2P Systems Distributed Computing File Sharing Gnutella Collaboration Jabber Platforms JXTA

Distributed Computing

Collaboration sendMessagereceiveMessagesendMessagereceiveMessage

Collaboration sendMessagereceiveMessagesendMessagereceiveMessage

Platforms Find Peers…Send Messages GnutellaInstant Messaging

P2P File Sharing Content exchange –Gnutella File systems –Oceanstore Filtering/mining –Opencola

Challenges Peer discovery and group management Data location and placement Reliable and efficient file delivery Security/privacy/anonymity/trust

Design Concerns Per-node state Bandwidth usage Search time Fault tolerance/resiliency

Approaches Centralized Flooding Document Routing

Centralized BobAlice JaneJud y

Centralized Benefits: –Efficient search –Limited bandwidth usage –No per-node state Drawbacks: –Central point of failure –Limited scale

Flooding Bob Alice Jane Judy Carl

Flooding Benefits: –No central point of failure –Limited per-node state Drawbacks: –Slow searches –Bandwidth intensive

Document Routing ?

Document Routing Benefits: –More efficient searching –Limited per-node state Drawbacks: –Limited fault-tolerance vs redundancy

Points of Discussion Do P2P applications/systems have common research questions? What are the killer apps for P2P systems? What are the benefits of choosing P2P?

An Overview of Peer-to-Peer Sami Rollins Mills College – 2/25/03

Modified version of slide from another presentation CAN: simple example n1

Modified version of slide from another presentation CAN: simple example 12

Modified version of slide from another presentation CAN: simple example 1 2 3

Modified version of slide from another presentation CAN: simple example

Modified version of slide from another presentation CAN: simple example

Modified version of slide from another presentation CAN: routing table

Modified version of slide from another presentation CAN: routing (a,b) (x,y)

Modified version of slide from another presentation CAN: node insertion Bootstrap node 1) Discover some node I already in CAN new node

Modified version of slide from another presentation CAN: node insertion I new node 1) discover some node I already in CAN

Modified version of slide from another presentation CAN: node insertion 2) pick random point in space I (p,q) new node

Modified version of slide from another presentation CAN: node insertion (p,q) 3) I routes to (p,q), discovers node J I J new node

Modified version of slide from another presentation CAN: node insertion new J 4) split Js zone in half… new owns one half

Remaining Problems?

Hard to handle highly dynamic environments Methods dont consider peer characteristics Usable services

P2P Goals/Benefits Cost sharing Resource aggregation Improved scalability/reliability Increased autonomy Anonymity/privacy Dynamism Ad-hoc communication