© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Self-Organized Construction of Distributed Access Structures: A Comparative.

Slides:

Advertisements

Similar presentations

P2PR-tree: An R-tree-based Spatial Index for P2P Environments ANIRBAN MONDAL YI LIFU MASARU KITSUREGAWA University of Tokyo.

Advertisements

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.

Scalable Content-Addressable Network Lintao Liu

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

Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.

LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

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

Common approach 1. Define space: assign random ID (160-bit) to each node and key 2. Define a metric topology in this space,  that is, the space of keys.

Expediting Searching Processes via Long Paths in P2P Systems 05/30 IDEA Lab.

P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems March 29, 2005.

Evaluation of Ad hoc Routing Protocols under a Peer-to-Peer Application Authors: Leonardo Barbosa Isabela Siqueira Antonio A. Loureiro Federal University.

Peer to Peer File Sharing Huseyin Ozgur TAN. What is Peer-to-Peer?  Every node is designed to(but may not by user choice) provide some service that helps.

Storage Management and Caching in PAST, a large-scale, persistent peer- to-peer storage utility Authors: Antony Rowstorn (Microsoft Research) Peter Druschel.

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

P2P Systems - 1 ©2005, Karl Aberer, EPFL-IC, Laboratoire de systèmes d'informations répartis Information Systems: A Short Overview of Peer-2-Peer Systems.

Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.

Exploiting Content Localities for Efficient Search in P2P Systems Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang 1 1 College of William and Mary,

LSDS-IR’08, October 30, Peer-to-Peer Similarity Search over Widely Distributed Document Collections Christos Doulkeridis 1, Kjetil Nørvåg 2, Michalis.

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

©2004, Zoran Despotovic, Karl Aberer, EPFL-I&C, Laboratoire de systèmes d'informations répartis Maximum Likelihood Estimation of Peers’ Trustworthiness.

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

Searching in Unstructured Networks Joining Theory with P-P2P.

EPFL-I&C-LSIR [P-Grid.org] Workshop on Distributed Data and Structures ’04 NCCR-MICS [IP5] presented by Anwitaman Datta Joint work with Karl Aberer and.

Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.

Peer-to-Peer Networks Slides largely adopted from Ion Stoica’s lecture at UCB.

P-Grid Presentation by Thierry Lopez P-Grid: A Self-organizing Structured P2P System Karl Aberer, Philippe Cudré-Mauroux, Anwitaman Datta, Zoran Despotovic,

Ecole Polytechnique Fédérale de Lausanne, Switzerland Efficient processing of XPath queries with structured overlay networks Gleb Skobeltsyn, Manfred Hauswirth,

Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.

1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.

Storage management and caching in PAST PRESENTED BY BASKAR RETHINASABAPATHI 1.

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.

Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.

Effizientes Routing in P2P Netzwerken Chord: A Scalable Peer-to- peer Lookup Protocol for Internet Applications Dennis Schade.

A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004.

PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.

Indexing data-oriented overlay networks September 1 st, 2005 Indexing data-oriented overlay networks Presented by: Anwitaman Datta Joint work with Karl.

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.

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

Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.

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

A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.

An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.

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

SIGCOMM 2001 Lecture slides by Dr. Yingwu Zhu Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.

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

Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.

Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park

Efficient P2P Search by Exploiting Localities in Peer Community and Individual Peers A DISC’04 paper Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang.

LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

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

Peer to Peer Network Design Discovery and Routing algorithms

Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks

LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.

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.

P2P Search COP6731 Advanced Database Systems. P2P Computing  Powerful personal computer Share computing resources P2P Computing  Advantages: Shared.

School of Electrical Engineering &Telecommunications UNSW Cost-effective Broadcast for Fully Decentralized Peer-to-peer Networks Marius Portmann & Aruna.

Large Scale Sharing Marco F. Duarte COMP 520: Distributed Systems September 19, 2004.

P2P Networking: Freenet Adriane Lau November 9, 2004 MIE456F.

Composing Web Services and P2P Infrastructure. PRESENTATION FLOW Related Works Paper Idea Our Project Infrastructure.

Peer-to-Peer Information Systems Week 12: Naming

A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004.

CS 268: Lecture 22 (Peer-to-Peer Networks)

Controlling the Cost of Reliability in Peer-to-Peer Overlays

EE 122: Peer-to-Peer (P2P) Networks

A Scalable content-addressable network

Joydeep Chandra, Santosh Shaw and Niloy Ganguly

Peer-to-Peer Information Systems Week 12: Naming

Presentation transcript:

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Self-Organized Construction of Distributed Access Structures: A Comparative Evaluation of P-Grid and FreeNet Karl Aberer, Manfred Hauswirth and Magdalena Punceva

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis P2P approach Goal of a P2P system: to support a global search functionality without using central directories. Two fundamental approaches exist: Unstructured P2P systems -> Gnutella Structured P2P systems -> FreeNet, Chord, CAN, Pastry, Tapestry, P-Grid

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Unstructured P2P Systems Search Broadcasting mechanism Advantages Peers are free to choose data they store Search predicates are not limitedProblems High search cost in terms of excessive bandwidth consumption-> do not scale well! High search cost in terms of excessive bandwidth consumption-> do not scale well! No guarantees on search success No guarantees on search success

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Structured P2P Systems Search Distributed scalable access structure-> efficient Coordination is required to establish a distributed access structure. Two fundamentally different approaches on how coordination can be achieved:  global identification scheme to decide which part of the search space a peer is associated with  the part of the search space is determined by bilateral interactions among peers (P-Grid and FreeNet)

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis P-Grid

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Random Walk-> P-Grid

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Random Walk-> P-Grid : 2 1: 7 K=1 K=0

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Random Walk-> P-Grid : 2 1: 7 K=1 K=0

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Random Walk-> P-Grid : 2 1: 7 K=1 K=0 0: 4 1: 8 K=1 K=0

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Random Walk-> P-Grid : 2 1: 7 K=1 K=0 0: 4 1: 8 K=1 K=0

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Random Walk-> P-Grid : 2 K=1 K=01 0: 4 K=1 K=00 1: 8 01: 2 1: 7 00: 4

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis FreeNet 000: 2 101: 3 Query=

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis FreeNet 000: 2 101: 3 001: 4 111: 5 011:6 110:1 Failed

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis FreeNet 000: 2 101: 3 001: 4 111: 1 011:6 110: : 2 001: 5 011:7 001: 2 001: 6

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis FreeNet 000: 2 101: 3 001: 4 111: 1 011:6 110:5 101: 2 001: 5 011:7 001: 2 001:

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis FreeNet 000: 2 101: 3 001: 4 111: 1 011:6 110:5 101: 2 001: 5 011:7 000: 7 001: 2 001: 6 QueryReply

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Simulations Goal Common framework for FreeNet and P-Grid in order to test them under comparable and varying conditions. Common parameters:  Population of n peers. Each peer is identified with a unique ID number  Initial topology for communication  Each peer has a routing table where peers keep information about the adresses of other peers together with information relevant for routing  d data objects are stored in the system and peers have a data store of size s. A necessary condition is r*d<s*n where r is the replication factor.

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Simulations: Experiment 1 Settings: total number of peers is 1000 each peer has at least 3 and at most 6 initial neighbors total number of inserted data objects 5000 replication factor is 20 maximal size of routing tables: 250 for FreeNet and only 35 for P-Grid total number of queries

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Experiment 1 FreeNet: Averaged number of messages per query over 100 trialsP-Grid: Averaged number of messages per query over 100 trials Results Two phases: bootstrapping phase stable phase: average number of messages per query is 4.58 for FreeNet and 4.54 for P-Grid

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Simulations: Experiment 2 Changing the population‘s size total number of peers is 500 each peer has at least 3 and at most 6 initial neighbors total number of inserted data objects 2500 replication factor is 20 maximal size of routing tables: 125 for FreeNet and only 30 for P-Grid total number of queries

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Experiment 2 P-Grid: Averaged number of messages per query over 100 trialsFreeNet: Averaged number of messages per query over 100 trials Results Two phases: stable phase: average number of messages per query is 4.63 for FreeNet and 4.04 for P-Grid

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Simulations: Experiment 3 Impact of changing the routing table sizes in FreeNet a)total number of peers is 1000 maximal size of routing tables is 35 total number of queries b)total number of peers is 500 maximal size of routing tables is 30 total number of queries All other parameters are as in Experiment 1 and 2

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Experiment 3 FreeNet: 500 peersFreeNet: 1000 peers Results 1000 peers: average number of messages per query is 154 and the success rate is 70% 500 peers: average number of messages per query is 109 and the success rate is 80%

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Simulations: Experiment 4 Impact of changing the replication factor for both total number of peers is 500 replication factor is 10 maximal sizes of routing tables are 125 for FreeNet and 35 for P-Grid total number of queries is 75000

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Experiment 4 P-GridFreeNet Results Average number of messages is 5.91 for FreeNet and 4.62 for P-Grid

© 2002, Magdalena Punceva, EPFL-IC, Laboratoire de systèmes d'informations répartis Conclusions Similar performance in terms of messages per query, however P-Grid requires much less resources in terms of size of routing tables FreeNet‘s performances deteriorates significantly if sizes of routing tables are relatively small compared to the total population Changing the routing tables sizes and replication factor affect FreeNet performance while P-Grid retains more stable behavior