Presentation by Theodore Mao CS294-4: Peer-to-peer Systems

Slides:



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

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.
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
Denial-of-Service Resilience in Peer-to-Peer Systems D. Dumitriu, E. Knightly, A. Kuzmanovic, I. Stoica and W. Zwaenepoel Presenter: Yan Gao.
Freenet A Distributed Anonymous Information Storage and Retrieval System Ian Clarke Oskar Sandberg Brandon Wiley Theodore W.Hong.
Open Problems in Data- Sharing Peer-to-Peer Systems Neil Daswani, Hector Garcia-Molina, Beverly Yang.
FreeNet: A Distributed Anonymous Information Storage and Retrieval System Ian Clark, Oskar Sandberg, Brandon Wiley and Theodore Hong.
P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.
1 Unstructured Routing : Gnutella and Freenet Presented By Matthew, Nicolai, Paul.
Protecting Free Expression Online with Freenet Presented by Ho Tsz Kin I. Clarke, T. W. Hong, S. G. Miller, O. Sandberg, and B. Wiley 14/08/2003.
Gnutella, Freenet and Peer to Peer Networks By Norman Eng Steven Hnatko George Papadopoulos.
presented by Hasan SÖZER1 Scalable P2P Search Daniel A. Menascé George Mason University.
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.
Wide-area cooperative storage with CFS
Peer-to-Peer Networks Slides largely adopted from Ion Stoica’s lecture at UCB.
1 Freenet  Addition goals to file location: -Provide publisher anonymity, security -Resistant to attacks – a third party shouldn’t be able to deny the.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Hashing it Out in Public Common Failure Modes of DHT-based Anonymity Schemes Andrew Tran, Nicholas Hopper, Yongdae Kim Presenter: Josh Colvin, Fall 2011.
Freenet: A Distributed Anonymous Information Storage and Retrieval System Presentation by Theodore Mao CS294-4: Peer-to-peer Systems August 27, 2003.
F REENET UDAYA S PISIPATI 02/26/08. C ONTENTS  Introduction  Design goals  Architecture  Basic model  Keys in searching  Retrieving data  Storing.
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.
Peer-to-Peer Computing CS587x Lecture Department of Computer Science Iowa State University.
1 Grid vs. Peer-to-Peer Yin Chen 25 June 2003.
1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.
Privacy in P2P based Data Sharing Muhammad Nazmus Sakib CSCE 824 April 17, 2013.
Survey of Peer to Peer Technologies Authors: Bratislav Milić, Jelena Krunić, Veljko Milutinović,
Distributed Systems Concepts and Design Chapter 10: Peer-to-Peer Systems Bruce Hammer, Steve Wallis, Raymond Ho.
Content Overlays (Nick Feamster). 2 Content Overlays Distributed content storage and retrieval Two primary approaches: –Structured overlay –Unstructured.
1 1.Freenet Architecture a)Goals b)Properties 2.Searching a network a)Searching/Routing algorithm b)Adaptive behaviour c)Differences with other algorithms.
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.
Freenet: A Distributed Anonymous Information Storage and Retrieval System Presenter: Chris Grier ECE 598nb Spring 2006.
Freenet: A Distributed Anonymous Information Storage and Retrieval System Ian Clarke, Oskar Sandberg, Brandon Wiley,Theodore W. Hong Presented by Zhengxiang.
Freenet File sharing for a political world. Freenet: A Distributed Anonymous Information Storage and Retrieval System I. Clarke, O. Sandberg, B. Wiley,
Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.
Freenet: A Distributed Anonymous Information Storage and Retrieval System Josh Colvin CIS 590, Fall 2011.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)
P2PComputing/Scalab 1 Gnutella and Freenet Ramaswamy N.Vadivelu Scalab.
Automated P2P Backup Group 1 Anderson, Bowers, Johnson, Walker.
Freenet “…an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity.
Freenet Ubiquitous Computing - Assignment Guided By: Prof. Niloy Ganguly Department of Computer Science and Engineering Submitted By: o Parin Deepak Cheda.
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
Freenet: Anonymous Storage and Retrieval of Information
Company LOGO Freenet By Yogesh Kalyani. OUTLINE  Introducing P2P  Overview of Freenet  Key’s  Protocol  Security Analysis  Improvement  Strength.
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.
Large Scale Sharing Marco F. Duarte COMP 520: Distributed Systems September 19, 2004.
Freenet A Distributed Anonymous Information System and Retrieval System I. Clarke, O. Sandberg, B. Wiley, W. Hong ECE 6102 Presented By: Kaushik Chowdhury.
P2P Networking: Freenet Adriane Lau November 9, 2004 MIE456F.
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.
CASCADE: AN ATTACK-RESISTANT DHT WITH MINIMAL HARD STATE
CS 268: Lecture 22 (Peer-to-Peer Networks)
CHAPTER 3 Architectures for Distributed Systems
Plethora: Infrastructure and System Design
EE 122: Peer-to-Peer (P2P) Networks
CS 268: Peer-to-Peer Networks and Distributed Hash Tables
A Scalable content-addressable network
Unstructured Routing : Gnutella and Freenet
Freenet.
Peer-to-Peer Storage Systems
Chord and CFS Philip Skov Knudsen
Peer-to-Peer Information Systems Week 12: Naming
Presentation transcript:

Freenet: A Distributed Anonymous Information Storage and Retrieval System Presentation by Theodore Mao <tmao@uclink.berkeley.edu> CS294-4: Peer-to-peer Systems August 27, 2003

Topics Overview Architecture Planned Improvements Related Work GUID Keys Routing Network Evolution Storage Performance Planned Improvements Related Work Conclusion/Questions

Overview (1/2) What is Freenet? Who is behind Freenet? Freenet is a P2P application designed to ensure true freedom of communication over the Internet. It allows anybody to publish and read information with complete anonymity. Who is behind Freenet? Originally, Ian Clarke while a student at the University of Edinburgh, Scotland. Still supervised by Ian Clarke, though many other people contribute to the project. How recent is Freenet? Original paper appeared in 1999. According to CiteSeer, it has been cited 195 times.

Overview (2/2) Purpose: Goals: Prevent information censorship Maintain personal privacy Goals: Privacy for information producers, consumers, and holders Resistance to information censorship High availability and reliability through decentralization Efficient, scalable, and adaptive storage and routing

Architecture Peer-to-peer network Participants share bandwidth and storage space Each file in network given a globally-unique identifier (GUID) Queries routed through steepest-ascent hill-climbing search

GUID Keys Calculated with an SHA-1 hash Two main types of keys Content-hash keys Used primarily for data storage Generated by hashing the content Signed-subspace keys (SSK) Intended for higher-level human use Generated with a public key and (usually) text description, signed with private key Can be used as a sort of private namespace Description e.g. politics/us/pentagon-papers

SSK Generation and Query Example Generate SSK: Need: public/private keys, chosen text description Sign file with private key Query for SSK: Need: public key, text description Verify file signature with public key

Routing (1/2) Every node maintains a routing table that lists the addresses of other nodes and the GUID keys it thinks they hold. Steepest-ascent hill-climbing search TTL ensures that queries are not propagated infinitely Nodes will occasionally alter queries to hide originator

Routing (2/2) Requesting Files: Inserting Files: Nodes forward requests to the neighbor node with the closest key to the one requested Copies of the requested file may be cached along the request path for scalability and robustness Inserting Files: If the same GUID already exists, reject insert – also propagate previous file along request path Previous-file propagation prevents attempts to supplant file already in network.

Network Evolution Adding nodes: Route training: Announce public key and physical address (e.g. IP) to an existing node Announcement is recursively forwarded to random nodes Nodes in the chain then collectively assign the new node a random GUID Route training: As more requests are processed, nodes should specialize in handling a few parts of the key space

Storage LRU file elimination when out of disk space Possibly encrypted data (by content publisher), so that data holders can claim to be ignorant of the content they store (plausible deniability)

Performance Some real-world and simulated data available, but generally hard to test Hard to tell the size of the network Nodes are all anonymous

Planned Improvements Next-Generation Routing (NGR) Make Freenet nodes much smarter about deciding where to route information Collect statistical information for each node in its routing table, e.g. response times, successful responses, etc. Use this information to improve routing decisions

Related Work File-sharing: Gnutella, FastTrack, Overnet Consumer Anonymity: Anonymizer, SafeWeb/Triangle Boy Producer Anonymity: Rewebber, TAZ, Publius Shared-storage: OceanStore, Cooperative File System, PAST

Conclusion (1/3) Primary Points Prevention of censorship and protection of privacy is an important and active field of research. Freenet is a (successful?) implementation of a system that resists information censorship Freenet is an ongoing project that still has plenty of flaws There may be a tradeoff between network efficiency and anonymity, robustness.

Conclusion (2/3) What’s wrong with Freenet? Not well tested in the wild – scalability, resilience. Insertion flooding is one way to take out the network. Anonymity guarantees not that strong – “Most non-trivial attacks would probably be successful in identifying someone making requests on Freenet.” No search mechanism – a standard search would allow attacks to take out specific content holders Suffers from problems of establishing initial network connection.

Conclusion (3/3) More information at http://freenetproject.org/ Questions? Comments?