BitTorrent or BitCrunch: Evidence of a credit squeeze in BitTorrent? www.triber.org.

Slides:



Advertisements
Similar presentations
QUICK QUIZ 22.1 (end of section 22.1)
Advertisements

Layered Video for Incentives in P2P Live Streaming
1 BigChampagne Online Media Measurement BitTorrent TV 101 June 11, 2007.
Credit Cards 101. Shopping for A Credit Card Comparison shop credit cards Dont take the first offer that comes to you: –Pre-approval Means nothing No.
Introduction Describe what panel data is and the reasons for using it in this format Assess the importance of fixed and random effects Examine the Hausman.
Peer-to-Peer and Social Networks An overview of Gnutella.
Process Flow Thinking 1. Overview Process flow is about how the product or service is made. Some measures we will want to study include: Throughput time,
Im not paying that! Mathematical models for setting air fares.
Credit Buy Now, Pay Later. Credit Someone is willing to loan you money (principal) in exchange for your promise to pay it back, usually with interest.
More on the invisible hand Present value Today: Wrap-up of the invisible hand; present value of payments made in the future.
Background Virtual memory – separation of user logical memory from physical memory. Only part of the program needs to be in memory for execution. Logical.
Macro Week 2 The Money Market
Copyright © Cengage Learning. All rights reserved. OPTIMIZING LOT SIZE AND HARVEST SIZE 3.5.
Optimal Scheduling in Peer-to-Peer Networks Lee Center Workshop 5/19/06 Mortada Mehyar (with Prof. Steven Low, Netlab)
Peter R. Pietzuch Peer-to-Peer Computing – or how to make your BitTorrent downloads go faster... Peter Pietzuch Large-Scale Distributed.
Neighbour selection strategies in BitTorrent- like Peer-to-Peer systems L.G. Alex Sung, Herman Li March 30, 2005 for CS856 Web Data Management University.
SMA 6304/MIT2.853/MIT2.854 Manufacturing Systems Lecture 19-20: Single-part-type, multiple stage systems Lecturer: Stanley B. Gershwin
The Determinants of the Money Supply
Intro to Computer Org. Pipelining, Part 2 – Data hazards + Stalls.
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 Bram Cohen.
Bit Torrent (Nick Feamster) February 25, BitTorrent Steps for publishing – Peer creates.torrent file and uploads to a web server: contains metadata.
Presented by: Su Yingbin. Outline Introduction SocialSwam Design Notations Algorithms Evaluation Conclusion.
Agenda Introduction BT + Multimedia Experimental Conclusion 2.
Cameron Dale and Jiangchuan LiuA Measurement Study of Piece Population in BitTorrent Introduction BitTorrent Experiment Results Simulation Discussion A.
Session 8b, 5 th July 2012 Future Network & MobileSummit 2012 Copyright 2012 Mobile Multimedia Laboratory Realistic Media Streaming over BitTorrent George.
1 Communication Networks Kolja Eger, Prof. Dr. U. Killat 1 From Packet-level to Flow-level Simulations of P2P Networks Kolja Eger, Ulrich Killat Hamburg.
Amir Rasti Reza Rejaie Dept. of Computer Science University of Oregon.
Lecture 10 World Income Inequality: past, present and future. Read Outline to Chapter 11.
Copyright 1998 R.H. Rasche EC 827 Macroeconomic Models III.
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
CompSci 356: Computer Network Architectures Lecture 21: Content Distribution Chapter 9.4 Xiaowei Yang
The Capacity of Wireless Ad Hoc Networks
Chapter 19 Variable Costing and Performance Reporting.
Tirgul 9 Amortized analysis Graph representation.
Issues in monetary and fiscal policy In this lecture we will use our economic models to study some important issues in the use of monetary and fiscal policy.
BitTorrent Background. Common Scenario Millions want to download the same popular huge files (for free) –ISO’s –Media (the real example!) Client-server.
Peer To Peer (P2P) And Torrenting James Jenkinson.
Content Overlays (Nick Feamster) February 25, 2008.
Bit Torrent (Nick Feamster) February 25, BitTorrent Steps for publishing – Peer creates.torrent file and uploads to a web server: contains metadata.
Exploring VoD in P2P Swarming Systems By Siddhartha Annapureddy, Saikat Guha, Christos Gkantsidis, Dinan Gunawardena, Pablo Rodriguez Presented by Svetlana.
University of Bologna, Italy How to cheat BitTorrent and why nobody does Simon Patarin and David Hales University of Bologna ECCS 2006,

BitTorrent How it applies to networking. What is BitTorrent P2P file sharing protocol Allows users to distribute large amounts of data without placing.
1 BitTorrent System Efrat Oune Bar-Ilan What is BitTorrent? BitTorrent is a peer-to-peer file distribution system (built for intensive daily use.
BitTorrent Dr. Yingwu Zhu. Bittorrent A popular P2P application for file exchange!
Do incentives build robustness in BitTorrent? Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani.
Lecture 2 Process Concepts, Performance Measures and Evaluation Techniques.
6.5 Logistic Growth Model Years Bears Greg Kelly, Hanford High School, Richland, Washington.
BitTorrent Nathan Marz Raylene Yung. BitTorrent BitTorrent consists of two protocols – Tracker HTTP protocol (THP) How an agent joins a swarm How an agent.
MULTI-TORRENT: A PERFORMANCE STUDY Yan Yang, Alix L.H. Chow, Leana Golubchik Internet Multimedia Lab University of Southern California.
The maximum non-expansion work available from a reversible spontaneous process ( < 0) at constant T and p is equal to, that is 1441.
BitTorrent – from swarms to collectives Some on-going research in the tribler team at TU Delft name:David Hales date:Sept. 21, 2009 event:ECCS 2009.
1 Message to the user... The most effective way to use a PowerPoint slide show is to go to “SLIDE SHOW” on the top of the toolbar, and choose “VIEW SHOW”
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
P2P storage trading system (A preliminary idea) Presenter: Lin Wing Kai (Kai)
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Modeling Poverty Martin Ravallion Development Research Group, World Bank.
Public and private BitTorrent communities: A measurement study M. Meulpolder, L. D’Acunto, M. Capotă, M. Wojciechowski, J.A. Pouwelse, D.H.J. Epema, H.J.
An example of peer-to-peer application
FairTorrent: BrinGing Fairness to Peer-to-Peer Systems
Introduction to BitTorrent
How will execution time grow with SIZE?
Determining the Peer Resource Contributions in a P2P Contract
A Measurement Study of Napster and Gnutella
Managing Inter-domain Traffic in the Presence of BitTorrent File-Sharing Srinivasan Seetharaman and Mostafa Ammar School of Computer Science Objective:
Simplified Explanation of “Do incentives build robustness in BitTorrent?” By James Hoover.
The BitTorrent Protocol
Challenges with developing a Commercial P2P System
B-Trees.
Presentation transcript:

BitTorrent or BitCrunch: Evidence of a credit squeeze in BitTorrent?

Public Trackers BitTorrent uses Trackers to index swarms Public trackers let anyone join a swarm Sharing is incentivised via a form of tit-for-tat However there is no incentive for: – Seeding (uploading after file is downloaded) – Capping (creating and injecting a new file)

Private Trackers Private Trackers have emerged more recently Only allow registered users to join swarms Track upload / download of each user Keep centralised accounts for each user When users download much more than upload they may be kicked out Different schemes: ratio, credits, points etc

Private Trackers - Credit Consider a scheme based on credits – Uploading 1MB earns one credit – Downloading 1MB costs one credit – A user with no credits cant download Users must be given some initial credit In fixed size pop. total credit remains constant Similar to a fixed supply of money in an economy (loose analogy!)

Private Trackers - Credit How much credit should be put into the system? How would it effect the efficiency of the system? When do credit squeezes occur? How can they be avoided? We define a credit squeeze as a situation in which, due to lack of credit, the efficiency of the system is significantly reduced.

BitCrunch Model Highly abstract and simplified model – All nodes have equal upload / download – Equally interested in all swarms on the tracker – Always uploading to one swarm (seeding) – Always downloading from another swarm (leeching) – No modelling of tit-for-tat or free-riding – Always online, fixed population – If run out of credit (broke) must wait until earns some via upload before being allowed to download – Swarms assumed to share upload perfectly

BitCrunch Model – baseline runs Parameters: – 500 peers, 100 swarms – Peer upload and download capacity = 1 unit – Each file shared in each swarm = 10 units size – One simulation cycle = each swarm processes one unit of time – Run for 20,000 cycles (x10 runs) – For initial credit per peer of 1, 10 and 100 units

Typical basline simulation run Initial Credit = 100

Baseline simulation results C = initial credit T = total throughput = total number of units uploaded as proportion of maximum possible (infinite credit) B = proportion of nodes that are broke (zero credit) G = Gini measure (simple measure of inequality of credit) Phi = turnover of top 10% of peers ranked by credit (credit mobility)

Unequal capacities runs To determine what happens when some nodes of different upload capacities Parameters (same as baseline runs but): – All peers download capacity = 10 units – 10% of peers upload capacity = 10 units – 90% of peers upload capacity = 1 unit – Examined a (1.5 credit) seeding bonus approach to dynamically introduce more credit into the system

Typical unequal capacities run Initial Credit = 100

Unequal capacities simulation results C = initial credit T = total throughput = total number of units uploaded as proportion of maximum possible (infinite credit) B = proportion of nodes that are broke (zero credit) G = Gini measure (simple measure of inequality of credit) Phi = turnover of top 10% of peers ranked by credit (credit mobility) indicates initial credit of 100 with 1.5 credit seeding bonus

Observations Even in a trivial model where all peers have the same capacities and user behaviour, all swarms have equal popularity and all peers start with equal credits, the performance of the system may be inhibited by credit shortages

Observations Adding extra capacity to the system, in the form of upload and download, can actually reduce the performance. This is highly counter intuitive and something that should be avoided because it implies lack of scalability.

Observations By injecting new credit into the system in the form of a ``seeding bonus a credit squeeze can be ameliorated when peer capacities are unbalanced.

Statistics from a Private Tracker Approx. 50,000 peers per day, 10,000 swarms, access to credit balances of top 10% T = throughput in TB over all swarms Delta = total credit increase that day in the entire system Delta0 = total credit increase for top 10% of peers Delta = minimum fraction of credit increase that goes to top 10% of peers S/L = seeder to leecher ratio over all swarms

Statistics from a Private Tracker Indicates rich getting richer since top 10% are getting a lot of the new credit High Seeder / Leecher ratio suggestive that a credit squeeze is happening for many But need more information to verify this Would be interesting to see what happened to throughput if there was a free day or seeding bonus was increased

Conclusions Private trackers using ratio enforcement policies appear to be ad-hoc and various But can have dramatic effects on efficiency Too much credit could encourage free-riding Too little creates squeezes = lower efficiency These are just initial investigations Much more work needs to be done!

Advert / plug / shameless promotion! Download tribler 5.1 at: Comments / discussion and suggestions on: forum.tribler.org