Auction-based Model of BitTorrent Seminar in Distributed Computing 2010 ETH Zurich Yu Li.

Slides:

Advertisements

Similar presentations

P2P Streaming Protocol Pro- incentive Parameters draft-zeng-ppsp-protocol-pro-incentive-para-01 IETF79 Meeting Wenjun (Kevin) Zeng & Yingjie Gu Huawei.

Advertisements

Layered Video for Incentives in P2P Live Streaming

CarTorrent ® : Cars get to have fun too Kevin C. Lee and Ian S. Yap TA: Uichin Lee Prof Mario Gerla.

Cope with selfish and malicious nodes

A Robust and Efficient Reputation System for Active Peer-to-Peer Systems Dominik Grolimund, Luzius Meisser, Stefan Schmid, Roger Wattenhofer Computer Engineering.

Rarest First and Choke Algorithms Are Enough

The BitTorrent Protocol. What is BitTorrent?  Efficient content distribution system using file swarming. Does not perform all the functions of a typical.

Incentives Build Robustness in BitTorrent Author: Bram Cohen Presenter: Brian Liao.

The BitTorrent protocol A peer-to-peer file sharing protocol.

Bit Torrent (Nick Feamster) February 25, BitTorrent Steps for publishing – Peer creates.torrent file and uploads to a web server: contains metadata.

BatTorrent: A Battery-Aware BitTorrent for Mobile Devices Zach King, Jeremy Blackburn, Adriana Iamnitchi Computer Science and Engineering, University of.

Presented by: Su Yingbin. Outline Introduction SocialSwam Design Notations Algorithms Evaluation Conclusion.

End-to-end Publishing Using Bittorrent. Bittorrent Bittorrent is a widely used peer-to- peer network used to distribute files, especially large ones It.

Ln -s /usr/timtimmah /usr/kevinstanonik. TORRENT BASICS  You want to get a file to other people.  BUT you don’t have the bandwidth to have everyone.

Cameron Dale and Jiangchuan LiuA Measurement Study of Piece Population in BitTorrent Introduction BitTorrent Experiment Results Simulation Discussion A.

Seed Scheduling for Peer-to-Peer Networks Flavio Esposito Ibrahim Matta Pietro Michiardi Nobuyuki Mitsutake Damiano Carra.

Modelling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks.

CS 554. Peer-to-Peer Systems Faithfulness in Internet Algorithms Haridimos Kondylakis

Peer to Peer (P2P) Networks and File sharing. By: Ryan Farrell.

CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture XV: Real P2P Systems.

Service Differentiated Peer Selection An Incentive Mechanism for Peer-to-Peer Media Streaming Ahsan Habib, Member, IEEE, and John Chuang, Member, IEEE.

1 A General Auction-Based Architecture for Resource Allocation Weidong Cui, Matthew C. Caesar, and Randy H. Katz EECS, UC Berkeley {wdc, mccaesar,

Basic Computer Networks Configurations (cont.) School of Business Eastern Illinois University © Abdou Illia, Spring 2006 Week 2, Thursday 1/19/2006)

Presented by Stephen Kozy. Presentation Outline Definition and explanation Comparison and Examples Advantages and Disadvantages Illegal and Legal uses.

Do Incentives Build Robustness in BitTorrent? Piatek, Isdal, Anderson, Krishnamurthy, and Venkataramani Piatek, Isdal, Anderson, Krishnamurthy, and Venkataramani.

1 Incentives Build Robustness in BitTorrent? Analysis on Bit Torrent Client performance By Jimmy Wong.

outline Purpose Design Implementation Market Conclusion presentation Outline.

The Bittorrent Protocol

Bit Torrent (Nick Feamster) February 25, BitTorrent Steps for publishing – Peer creates.torrent file and uploads to a web server: contains metadata.

Trusted Computing, Peer-To-Peer Distribution, and the Economics of Pirated Entertainment Peter Scott Based on paper by S. E. Schechter, R. A. Greenstadt,

BitTorrent Presentation by: NANO Surmi Chatterjee Nagakalyani Padakanti Sajitha Iqbal Reetu Sinha Fatemeh Marashi.

BitTorrent Internet Technologies and Applications.

BitTorrent How it applies to networking. What is BitTorrent P2P file sharing protocol Allows users to distribute large amounts of data without placing.

Yitzchak Rosenthal P2P Mechanism Design: Incentives in Peer-to-Peer Systems Paper By: Moshe Babaioff, John Chuang and Michal Feldman.

A P2P file distribution system ——BitTorrent Pegasus Team CMPE 208.

1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.

Do incentives build robustness in BitTorrent? Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani.

Bit Torrent A good or a bad?. Common methods of transferring files in the internet: Client-Server Model Peer-to-Peer Network.

Ivan Osipkov Fighting Freeloaders in Decentralized P2P File Sharing Systems.

A Novel approach to Bind-over Sybil nodes in a swarm Zhang Bhanu Kaushik Deep Kamal Singh Xiang Cui.

Cs286r Victor Chan Scrip Systems Victor Chan. CS286 Victor Chan Agenda  Scrip Systems  Peer to Peer Systems  Scrip Systems for P2P Networks  Adobe.

Application Layer 2-1 Chapter 2 Application Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012.

Architecture Models. Readings r Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edn. 3 m Note: All figures from this book.

Impact of Incentives in BitTorrent By Jenny Liu and Seth Cooper.

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

Mapping Internet Sensor With Probe Response Attacks Authors: John Bethencourt, Jason Franklin, and Mary Vernon. University of Wisconsin, Madison. Usenix.

Bit Torrent Nirav A. Vasa. Topics What is BitTorrent? Related Terms How BitTorrent works Steps involved in the working Advantages and Disadvantages.

2-Hop TorrentSmell A distributed tracking algorithm name:Raynor Vliegendhart date:July 10, 2009 event:Tribler Dev Meeting.

Second Price Auctions A Case Study of Secure Distributed Computing Bart De Decker Gregory Neven Frank Piessens Erik Van Hoeymissen.

Expediting Peer-to-Peer Simulation using GPU Di Niu, Zhengjun Feng Apr. 14 th, 2009.

Advanced Block Cipher Characteristic. Introduction Published by NIST in 2001 Developed to overcome bottleneck of 3DES Block length is of 128 bits Key.

THE BITTORRENT PROTOCOL OVERVIEW BY ANATOLY RABINOVICH AND VLADIMIR OSTROVSKY Peer-to-Peer File Sharing.

Performance of P2P implementations

Lecture XV: Real P2P Systems

An example of peer-to-peer application

FairTorrent: BrinGing Fairness to Peer-to-Peer Systems

EECS 498 Introduction to Distributed Systems Fall 2017

Designing a new BitTorrent Client

Assignment #7 – Solutions

PEER TO PEER BitTorrent.

Lab Usage Data Impact Approach Problem

Managing Inter-domain Traffic in the Presence of BitTorrent File-Sharing Srinivasan Seetharaman and Mostafa Ammar School of Computer Science Objective:

Small Is Not Always Beautiful

Do incentives build robustness in BitTorrent?

The BitTorrent Protocol

Content Distribution Networks + P2P File Sharing

PEER-TO-PEER SYSTEMS.

Client/Server and Peer to Peer

Content Distribution Networks + P2P File Sharing

Byzantine-fault-tolerant distributed logging

Presentation transcript:

Auction-based Model of BitTorrent Seminar in Distributed Computing 2010 ETH Zurich Yu Li

What is BitTorrent

How to download using BitTorrent STEP 1: Select Torrent File STEP 2: Download Torrent

How to download using BitTorrent STEP 3: Configuration STEP 4: Download File

Downloading procedure Individuals View –Seed –Leecher

Downloading procedure System View –I upload and download at the same time … Me

Auction-based Model [D. Levin, K. LaCurts, 2008] "BitTorrent is an Auction: Analyzing and Improving BitTorrent’s Incentives" (Q1) Do I upload to everyone? … Me … Me

Auction-based Model (Q2) Do I treat every peer equally? … Me (6Mbps) … Me (6Mbps)

Auction-based Model (Q3) Do I ignore others? … Me (6Mbps) … Me (6Mbps)

Auction-based Model Bids are uploads of round n-1 Auction clearing Me (Bandwidth W) Round n-1 Round n 18 Me (Bandwidth W) W/S Highest S-1 1 random peer W/S Select S peers (S=4) W/S

Sybil Attack Normal Bidder Mbps Auctioneer (Me) provides 72Mbps bandwidth in total “Red” bidder gets 18Mbps n-1 round n round

Sybil Attack Selfish Bidder “Red” bidder sybil gets 2×18Mbps n-1 round n round 18Mbps Auctioneer (Me) provides 72Mbps bandwidth in total

Review of Question 2 (Q2) Do I treat every peer equally? … Me (6Mbps) … Me (6Mbps)

Countermeasure: Proportional share auction Proportional share Mbps24Mbps 6 42 n-1 round n round “Red” bidder gets 24Mbps

Countermeasure: Proportional share auction Sybil attack resilient 36Mbps 8Mbps 6 42 n-1 round n round Mbps “Red” bidder sybil gets 3×8=24Mbps

Comparison of Auction-based &Propshare Normal client Selfish client (using sybil) Standard Bittorrent 18 Mbps2×18 Mbps Propshare24 Mbps Propshare is Sybil proof

Which one is better for me? Under-reporting Me A X Y B X Y X Y A XY B XYXY A X Y B X Y X Y A X Y B X Y X Y A X Y B X Y X Y X X Under- reporting

Under-reporting algorithm –Run algr. when peer is about to lose interest. –Determine the most common piece among available X Y Z X YZ X Y Z XY Z Tom Peer 1 Peer 2 Peer 3 X YZ Alice X Y Z X Y Z X Y Z Peer 1 Peer 2 Peer 3 X Y Z Tom X YZ Alice

Under-reporting

Countermeasure: Gossiping Me X Y Z Z X Y Z Costs overhead B A

Countermeasure: TrInc [D.Levin, J.R. Douceur 2009] "TrInc: Small Trusted Hardware for Large Distributed Systems" TrInc (Trusted Incrementer) –Prevents lying –Decreases overhead TPM (Trusted Platform Module) by Intel

Countermeasure: TrInc System equipped with TrInc

Countermeasure: TrInc Individual equipped with TrInc

Countermeasure: TrInc How does TrInc work? Old Counter Value New Counter Value Encryption BitField BitField + New Counter Value + Old Counter Value

Countermeasure: TrInc Input –New Counter Value –BitField Output –Attestation Sample Output A B C … DYZ A B C … DYZ  A B C DEF G 3434

Countermeasure Me X Y Z Z X Y Z B A

Countermeasure: TrInc X 2  3 YZT X 1  2 YZT X 0  1 YZT X Y Z X YZT X 1  2 YZT X 2  3 YZT Bitfield Request Piece Providing Nonce X 2  3 YZT 3  3 Nonce 3  3 Nonce Me A B C D

Countermeasure: TrInc Individual equipped with TrInc

Auction-based Model TrInc Q & A