MULTI-TORRENT: A PERFORMANCE STUDY Yan Yang, Alix L.H. Chow, Leana Golubchik Internet Multimedia Lab University of Southern California.

Slides:



Advertisements
Similar presentations
Layered Video for Incentives in P2P Live Streaming
Advertisements

BitTorrent or BitCrunch: Evidence of a credit squeeze in BitTorrent?
Optimal Scheduling in Peer-to-Peer Networks Lee Center Workshop 5/19/06 Mortada Mehyar (with Prof. Steven Low, Netlab)
Rarest First and Choke Algorithms Are Enough
Rarest First and Choke Algorithms are Enough Arnaud LEGOUT INRIA, Sophia Antipolis France G. Urvoy-Keller and P. Michiardi Institut Eurecom France.
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.
Will P2P Users Cooperate with ISPs? A Word-of-Mouth Communication Approach Piotr Wydrych (AGH University of Science and Technology, Poland); Piotr Cholda.
On Large-Scale Peer-to-Peer Streaming Systems with Network Coding Chen Feng, Baochun Li Dept. of Electrical and Computer Engineering University of Toronto.
Session 8b, 5 th July 2012 Future Network & MobileSummit 2012 Copyright 2012 Mobile Multimedia Laboratory Realistic Media Streaming over BitTorrent George.
Peer-assisted On-demand Streaming of Stored Media using BitTorrent-like Protocols Authors: Niklas Carlsson & Derek L. Eager Published in: Proc. IFIP/TC6.
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.
Stochastic Analysis of File Swarming Systems The Chinese University of Hong Kong John C.S. Lui Collaborators: D.M. Chiu, M.H. Lin, B. Fan.
Seed Scheduling for Peer-to-Peer Networks Flavio Esposito Ibrahim Matta Pietro Michiardi Nobuyuki Mitsutake Damiano Carra.
The BitTorrent content distribution system CS217 Advanced Topics in Internet Research Guest Lecture Nikitas Liogkas, 5/11/2006.
Clustering and Sharing Incentives in BitTorrent Systems Arnaud Legout 1, Nikitas Liogkas 2, Eddie Kohler 2, Lixia Zhang 2 1 INRIA, Projet Planète, Sophia.
Modelling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks.
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
Exploiting BitTorrent For Fun (But Not Profit) Nikitas Liogkas, Robert Nelson, Eddie Kohler, Lixia Zhang University of California, Los Angeles.
Free-riding in BitTorrent Networks with the Large View Exploit Michael Sirivianos, Jong Han Park, Rex Chen and Xiaowei Yang University of California, Irvine.
CompSci 356: Computer Network Architectures Lecture 21: Content Distribution Chapter 9.4 Xiaowei Yang
CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture XV: Real P2P Systems.
Alex Sherman Jason Nieh Cliff Stein.  Lack of fairness in bandwidth allocation in P2P systems:  Users are not incentivized to contributed bandwidth.
A survey of BitTorrent study Jian Liang EL933 Prof. Yong Liu.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
1 A Framework for Lazy Replication in P2P VoD Bin Cheng 1, Lex Stein 2, Hai Jin 1, Zheng Zhang 2 1 Huazhong University of Science & Technology (HUST) 2.
Peer-Assisted Content Distribution Networks: Techniques and Challenges Pei Cao Stanford University.
Modeling and analysis of BitTorrent-like P2P network Fan Bin Oct,1 st,2004.
Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu.
Modeling and Performance Analysis of Bitorrent-Like Peer-to-Peer Networks Dongyu Qiu and R. Srikant University of Illinois, 2004 Presented by : Ran Zivhon.
1 Incentives Build Robustness in BitTorrent? Analysis on Bit Torrent Client performance By Jimmy Wong.
A P2P file distribution system ——BitTorrent Fan Bin Sep,25,2004.
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.
University of Bologna, Italy How to cheat BitTorrent and why nobody does Simon Patarin and David Hales University of Bologna ECCS 2006,
1 Measurements, Analysis, and Modeling of BitTorrent-like Systems Lei Guo 1, Songqing Chen 2, Zhen Xiao 3, Enhua Tan 1, Xiaoning Ding 1, and Xiaodong Zhang.
BitTorrent Under a Microscope: Towards Static QoS Provision in Dynamic Peer-to-Peer Networks Tom H. Luan*, Xuemin (Sherman) Shen* and Danny H. K. Tsang.
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!
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.
2: Application Layer1 Chapter 2: Application layer r 2.1 Principles of network applications r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail  SMTP,
Do incentives build robustness in BitTorrent? Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani.
Multiclass P2P Networks: Static Resource Allocation for Service Differentiation and Bandwidth Diversity Florence Clévenot-Perronnin, Philippe Nain and.
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.
Othman Othman M.M., Koji Okamura Kyushu University 1.
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.
Impact of Incentives in BitTorrent By Jenny Liu and Seth Cooper.
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
Improving QoS in BitTorrent-like VoD Systems Yan Yang Alix L.H. Chow Leana Golubchik Dannielle Bragg Univ. of Southern California Harvard University InfoCom.
PEAR TO PEAR PROTOCOL. Pure P2P architecture no always-on server arbitrary end systems directly communicate peers are intermittently connected and change.
Peer-to-Peer Networks 10 Fast Download Christian Schindelhauer Technical Faculty Computer-Networks and Telematics University of Freiburg.
Measurements, Analysis, and Modeling of BitTorrent-like Systems
FairTorrent: BrinGing Fairness to Peer-to-Peer Systems
A Fault Tolerance Protocol for Uploads: Design and Evaluation
Introduction to BitTorrent
Designing a new BitTorrent Client
Determining the Peer Resource Contributions in a P2P Contract
Do incentives build robustness in BitTorrent?
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
Simplified Explanation of “Do incentives build robustness in BitTorrent?” By James Hoover.
The BitTorrent Protocol
Challenges with developing a Commercial P2P System
Pure P2P architecture no always-on server
Chapter 2 Application Layer
Presentation transcript:

MULTI-TORRENT: A PERFORMANCE STUDY Yan Yang, Alix L.H. Chow, Leana Golubchik Internet Multimedia Lab University of Southern California

Internet Multimedia Lab OUTLINE Background and Introduction Proposed Approach Simulation Study Related Work and Conclusion 2

Internet Multimedia Lab BIT-TORRENT (BT) OVERVIEW An extremely popular P2P file sharing application. Nodes downloading same file (torrent) form an overlay network. File is divided into pieces (chunks) with fixed size. Default size is 256KB. Upload while downloading Nodes download chunks from their neighbors. Each node upload file chunks to a number of neighbors. Local scheduling file exchange. 3

Internet Multimedia Lab HOW BT WORKS? Node Seed Leecher Unchoking Tit-For-Tat (TFT) Leecher: 4TFT + 1 optimistic Seeds: 5 random 4 seed leeche r 4TFT + 1 optimistic 5 random seed

Internet Multimedia Lab TORRENT IN REAL LIFE Downloading multiple torrents simultaneously is common Previous study shows ~85% peers participate in multiple torrents. [Guo et al. IMC 2005] Overlap in downloading torrents: common interests do exist in real life! Many torrents are related to each other. Different episodes of a TV show. Movies/music form the same genre, etc. Start-up information are obtained from a similar source. Similar web site, online forum, etc. 5

Internet Multimedia Lab MULTI-TORRENT APPROACH Current BT: single-torrent approach Torrents are independent Doesn’t take advantages of comment interest How about multi-torrent approach ? Relating torrents together. A natural idea but is significantly overlooked. Encourages seeding. (Key to system performance) Advantages of multi-torrent Help newly joined nodes ramp up faster. Help nodes nearing end of their downloads find the last few file chunks faster. (end-game behavior) Keep a torrent “alive”. 6

Internet Multimedia Lab CONTRIBUTIONS A multi-torrent BT system Small modification to the current BT protocol. Completely decentralized, all local decisions. A “cross-torrent” TFT (CTFT) Simple modification to current BT TFT. Extensive simulation-based study shows: Multi-torrent approach improves system performance. CTFT provides incentives for nodes to stay as seeds. 7

Internet Multimedia Lab OUTLINE Background and Introduction Proposed Approach Simulation Study Related Work and Conclusion 8

Internet Multimedia Lab MOTIVATIONAL EXAMPLE 9 Slow: +21% Fast: +17% Staying nodes are better! SettingValue Node classFast nodes (5000/512kbps) (0.6), Slow nodes (1500/128 kbps) (0.4). File selectionFixed selection 2 torrents out of 10 (200MB each). No StayNode leaves torrent as soon as it finishes. StayNode leaves torrent until all participating torrents finishes.

Internet Multimedia Lab PROPOSED APPROACH Current BT uses download rate for nodes to decide unchoke. Such unchoking for each torrent is independent. Cross-Torrent TFT (CTFT) Aggregate download rate on each torrent in peer’s all participating torrents. Aggregation is done in a weighted manner. Higher weight (> 1) given to the downloading rate from seeding torrents. Normal weight (=1) given to the downloading rate from leecher torrents. Total contribution of a peer N y to node N x is: 10 Download rate on torrent i of node N x from node N y

Internet Multimedia Lab OUTLINE Background and Introduction Motivation and Proposed Approach Simulation Study Related Work and Conclusion 11

Internet Multimedia Lab SIMULATION SETUP Parameters Value File size200MB Simulation time12 hours (+3 hours warm-up) Average node inter- arrival time 45 sec Peer set size40 #Leccher unchoking4 TFT + 1 optimistic #Seed unchoking5 Original seed1 per torrent CTFT weight4 12 Simulator Event based in [Bharambe et al. INFOCOM 2006] Extension for multi-torrent and latest BT protocol.

Internet Multimedia Lab STAY IMPROVEMENT: # OF TORRENT 13 Have nodes staying helps both metrics. SettingValue Node ClassFast nodes (5000kbps / 512kbps) File selection1.Fixed selection out of Random selection out of 10.

Internet Multimedia Lab STAY IMPROVEMENT: INTER- ARRIVAL TIME 14 More improvement for longer inter- arrival time. More obvious # nodes change for longer inter- arrival time. SettingValue Node classFast nodes (5000kbps / 512kbps) File selectionFixed selection 3 torrents out of 10.

Internet Multimedia Lab APPLICATION: GAME PATCH SYSTEM MB: -77% 256MB: +84% 80MB:+92% 492MB: -77% 256MB: +84% 80MB:+92% SettingValue Node classFast nodes (5000kbps / 512kbps) File size492MB, 256MB, 80MB (WoW major patch 2.0, 2.1, 2.2) File selectionFixed selection of all 3 torrents

Internet Multimedia Lab APPLICATION: GAME PATCH SYSTEM Dynamic seeding (DS) Each node does a local estimation of the ratio of seeds to leechers. Only participate as seed in those torrents where seed to leecher ratio is below R. This local estimation re-evaluated every S time units MB: +2% 256MB: +47% 80MB: +69% 492MB: +2% 256MB: +47% 80MB: +69%

Internet Multimedia Lab OUTLINE Background and Introduction Motivation and Proposed Approach Simulation Study Related Work and Conclusion 17

Internet Multimedia Lab RELATED WORK Explore multi-torrent Multi-torrent system using tracker overlay. [Guo et al. IMC 2005] Our focus is on performance. Our CTFT provides incentives to stay as seeds. Our design requires only local client modification. Explore BT incentives in single torrent A market based incentives. [Freedman et al. IPTPS 2008] Reputation based incentives. [Lian et al. IPTPS 2006] Our CTFT-DS matches seeding capacity demand and supply with local knowledge. Investigating other incentive approaches are part of our future work. 18

Internet Multimedia Lab CONCLUSION Performance gains are possible through multi- torrent. Nodes staying as seeds improve performance. CTFT provides incentive for nodes to stay as seed. CTFT-DS makes seeding efficient. Multi-torrent is a promising research area with remaining future directions. Malicious users. More exploration on system parameters. R, S, CTFT weight, etc. Real word implementations. 19

Internet Multimedia Lab Q & A 20 Thank You!

Internet Multimedia Lab STAY IMPROVEMENT: CTFT WEIGHT 21 Staying nodes perform better in both class. SettingValue Node classFast nodes (0.6), Slow nodes (0.4) File selectionRandom selection of 3 out of 10 torrents Stay probability0.5

Internet Multimedia Lab STAY IMPROVEMENT: FRACTION OF STAY 22 No Incentives Incentives! SettingValue Node classFast nodes (0.6), Slow nodes (0.4) File selectionRandom selection of 3 out of 10 torrents

Internet Multimedia Lab DISCUSSION (BACKUP) Performance in the real world We expect even bigger improvement. System parameters Exploration of various system and proposed schemes’ parameters is our on-going effort. Malicious behavior A malicious node can take advantage of the weight of CTFT, how to detect malicious node is one of our future works. How malicious behavior affects the system performance is one of our future works. 23