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.

Slides:



Advertisements
Similar presentations
Scalable Content-Addressable Network Lintao Liu
Advertisements

Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
Chord: A scalable peer-to- peer lookup service for Internet applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashock, Hari Balakrishnan.
Efficient Search - Overview Improving Search In Peer-to-Peer Systems Presented By Jon Hess cs294-4 Fall 2003.
Improving Search in Peer-to-Peer Networks Beverly Yang Hector Garcia-Molina Presented by Shreeram Sahasrabudhe
Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.
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)
Open Problems in Data- Sharing Peer-to-Peer Systems Neil Daswani, Hector Garcia-Molina, Beverly Yang.
P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems March 29, 2005.
Peer-to-peer archival data trading Brian Cooper Joint work with Hector Garcia-Molina (and others) Stanford University.
A Trust Based Assess Control Framework for P2P File-Sharing System Speaker : Jia-Hui Huang Adviser : Kai-Wei Ke Date : 2004 / 3 / 15.
P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.
Data Management in Peer-to- Peer Systems Qi Sun Beverly Yang.
Object Naming & Content based Object Search 2/3/2003.
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.
1 Seminar: Information Management in the Web Gnutella, Freenet and more: an overview of file sharing architectures Thomas Zahn.
Efficient Search in Peer to Peer Networks By: Beverly Yang Hector Garcia-Molina Presented By: Anshumaan Rajshiva Date: May 20,2002.
Searching in Unstructured Networks Joining Theory with P-P2P.
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.
INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.
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
Peer-to-Peer Overlay Networks. Outline Overview of P2P overlay networks Applications of overlay networks Classification of overlay networks – Structured.
09/07/2004Peer-to-Peer Systems in Mobile Ad-hoc Networks 1 Lookup Service for Peer-to-Peer Systems in Mobile Ad-hoc Networks M. Tech Project Presentation.
Searching In Peer-To-Peer Networks Chunlin Yang. What’s P2P - Unofficial Definition All of the computers in the network are equal Each computer functions.
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 Overlays (Nick Feamster). 2 Content Overlays Distributed content storage and retrieval Two primary approaches: –Structured overlay –Unstructured.
Introduction of P2P systems
Peer-to-Peer Networks University of Jordan. Server/Client Model What?
 A P2P IRC Network Built on Top of the Kademlia Distributed Hash Table.
Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
Routing Indices For P-to-P Systems ICDCS Introduction Search in a P2P system –Mechanisms without an index –Mechanisms with specialized index nodes.
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
Security Michael Foukarakis – 13/12/2004 A Survey of Peer-to-Peer Security Issues Dan S. Wallach Rice University,
Structuring P2P networks for efficient searching Rishi Kant and Abderrahim Laabid Abderrahim Laabid.
Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.
Peer-to-Peer Network Tzu-Wei Kuo. Outline What is Peer-to-Peer(P2P)? P2P Architecture Applications Advantages and Weaknesses Security Controversy.
03/19/02Scalab Seminar Series1 Routing in Peer-to-Peer Systems Ramaswamy N.Vadivelu Scalab, ASU.
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
A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside
1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.
Computer Networking P2P. Why P2P? Scaling: system scales with number of clients, by definition Eliminate centralization: Eliminate single point.
Evaluation GUESS and Non-Forwarding Peer-to-Peer search ICDCS paper Beverly Yang Patrick Vinograd Hector Garcia-Molina Computer Science Department, Stanford.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
Peer-to-Peer Systems: An Overview Hongyu Li. Outline  Introduction  Characteristics of P2P  Algorithms  P2P Applications  Conclusion.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
CS 347Notes081 CS 347: Parallel and Distributed Data Management Notes 08: P2P Systems.
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.
09/13/04 CDA 6506 Network Architecture and Client/Server Computing Peer-to-Peer Computing and Content Distribution Networks by Zornitza Genova Prodanoff.
P2P Content Search: Give the Web Back to the People Matthias Bender Sebastin Michel Peter Triantafillou Gerhard Weikum Christian Zimmer Mariam John CSE.
Large Scale Sharing Marco F. Duarte COMP 520: Distributed Systems September 19, 2004.
Malugo – a scalable peer-to-peer storage system..
1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,
Composing Web Services and P2P Infrastructure. PRESENTATION FLOW Related Works Paper Idea Our Project Infrastructure.
Advanced Computer Networks: Part 1
Peer-to-Peer Data Management
CHAPTER 3 Architectures for Distributed Systems
Early Measurements of a Cluster-based Architecture for P2P Systems
EE 122: Peer-to-Peer (P2P) Networks
Mobile P2P Data Retrieval and Caching
Peer-To-Peer Data Management
Presentation transcript:

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 an extremely resource-rich system by aggregating the resources of large number of nodes (peers).

Characteristics of P2P Each peer asks for resources while providing resources as reward for the system. Peers may join and leave the system at any time. Distributed resources contained in each nodes. Decentralized system.

Advantages Sharing storage spaces with whole system. Thus peers without large disk space would be able to access huge amount of data. Peers can freely join or leave at any time. One or more powerful, expensive servers will not be necessary.

Challenges The scale of the network and the autonomy of nodes make it difficult to identify and distribute the resources that are available. Some peers may be malicious. Queries and topologies Resource management Security

Queries and topologies Implementing efficient techniques for search and retrieval of data will be the key challenge. Best search techniques depend on the needs of the application. For those focused on availability like archival system and web caches, DHTs will be well-suited.

Structured systems Better search efficiency. Better accuracy Tightly control the data placement and topology Often constructed with DHTs (distributed hash tables)

chord

SETS: search enhanced by Topic Segmentation Key idea is to arrange participants in a topic- segmented topology Queries probe only a small subset of sites where most of the matching documents reside Topic centroid: a succinct description of topic segment Short distance link and long distance link

YAPPERS A search protocol that can be viewed as a hybrid of structured and unstructured systems Keyspace of all the keys that need to be stored is partitioned into a small number of buckets The “coloring” issue Immediate neighborhood within h hops Extended neighborhood within 2h+1 hops

Unstructured system More flexible applications with rich queries Meant for a wide range of users from autonomous organizations.

Unstructured system The search techniques should be simple and practical enough to be easily incorporated into existing systems Effective search techniques need to make provisions for the unreliable nature of peers. All techniques should tune itself according to the current state of the system.

Designing issues Possible design choices Neighbor selection Query routing Query evaluation Content replication

Current message routing protocols Routing protocols used in practice like Gnutella are based on flooding. Flooding depends on The availability of the data that can satisfy the query The position of the peer in the overlay The overlay structure

Current message routing protocols Gnutella BFS with depth limit D Waste bandwidth and processing resources Freenet DFS with depth limit D Poor response time

Improvements of existing systems Iterative deepening Under policy P= { a, b, c} ;waiting time W Directed BFS A node maintains simple statistics on its neighbors Node sends queries to the subset of neighbors with more possibility satisfy the query. Local indices Nodes maintain an index over the data within r hops All nodes at depths not listed in the policy simply forward the query

The routing indices Compact summaries of the content that can be reached via a link.

Role differentiation Super-peer networks differentiate between “super-peers” and “clients” Super-peers act as mini-index servers to number of clients

The GUESS protocol An under-construction specification Goal: peers directly probe each other rather than relying on other peers to forward queries In what order should peers be probed How to detect and prevent selfish behavior since it’s much easier now for peers to abuse the system for personal gain.

Resource management Aggregating and allocating P2P resources Economic incentive to construct a resource marketplace Data trading: both sites can make remote copies of their collections

PeerDB

Security P2P systems are highly susceptible to many forms of malicious attacks Availability: the DoS (denial-of-service) attack Authenticity and trust: provide inauthentic files or bogus content

Conclusion P2P system has recently become a very popular topic This report is attempting to give an overview of ongoing research and developing techniques on currently P2P systems