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

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

Alex Sherman, Jason Nieh, Cliff Stein Columbia University.
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.
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 Author: Bram Cohen Presenter: Brian Liao.
The BitTorrent protocol A peer-to-peer file sharing protocol.
Incentives Build Robustness in BitTorrent Bram Cohen.
Cameron Dale and Jiangchuan LiuA Measurement Study of Piece Population in BitTorrent Introduction BitTorrent Experiment Results Simulation Discussion A.
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.
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.
CompSci 356: Computer Network Architectures Lecture 21: Content Distribution Chapter 9.4 Xiaowei Yang
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Improving ISP Locality in BitTorrent Traffic via Biased Neighbor Selection Ruchir Bindal, Pei Cao, William Chan Stanford University Jan Medved, George.
Peer-Assisted Content Distribution Networks: Techniques and Challenges Pei Cao Stanford University.
1 Incentives Build Robustness in BitTorrent? Analysis on Bit Torrent Client performance By Jimmy Wong.
Incentives Build Robustness in BitTorrent 1st Workshop on Economics of Peer-to-Peer Systems 2003 Bram Cohen
Peer-To-Peer Multimedia Streaming Using BitTorrent Purvi Shah, Jehan-François Pâris University of Houston Houston, TX.
BitTorrent Presentation by: NANO Surmi Chatterjee Nagakalyani Padakanti Sajitha Iqbal Reetu Sinha Fatemeh Marashi.
University of Bologna, Italy How to cheat BitTorrent and why nobody does Simon Patarin and David Hales University of Bologna ECCS 2006,
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.
1 BitTorrent System Efrat Oune Bar-Ilan What is BitTorrent? BitTorrent is a peer-to-peer file distribution system (built for intensive daily use.
On the Interaction between Dynamic Routing in the Native and Overlay Layers INFOCOM 2006 Srinivasan Seetharaman Mostafa Ammar College of Computing Georgia.
BitTorrent Dr. Yingwu Zhu. Bittorrent A popular P2P application for file exchange!
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.
MULTI-TORRENT: A PERFORMANCE STUDY Yan Yang, Alix L.H. Chow, Leana Golubchik Internet Multimedia Lab University of Southern California.
Presented by Rajan Includes slides presented by Andrew Sprouse, Northeastern University CISC 856 TCP/IP and Upper Layer Protocols Date:May 03, 2011.
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.
2: Application Layer1 Chapter 2: Application layer r 2.1 Principles of network applications  app architectures  app requirements r 2.2 Web and HTTP r.
Impact of Incentives in BitTorrent By Jenny Liu and Seth Cooper.
2: Application Layer1 Chapter 2 Application Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012.
ICNP 2006 Inter­domain Policy Violations in Overlay Routes Srinivasan Seetharaman, Mostafa Ammar Networking and Telecommunications Group College of Computing.
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
Bit Torrent Nirav A. Vasa. Topics What is BitTorrent? Related Terms How BitTorrent works Steps involved in the working Advantages and Disadvantages.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
PEAR TO PEAR PROTOCOL. Pure P2P architecture no always-on server arbitrary end systems directly communicate peers are intermittently connected and change.
GLOBECOM 2007 Exit Policy Violations in Multi-hop Overlay Routes Srinivasan Seetharaman, Mostafa Ammar Networking and Telecommunications Group College.
1 On the Interaction between Dynamic Routing in the Native and Overlay Layers Infocom2006 Srinivasan Seetharaman and Mostafa Ammar College of Computing.
Lecture XV: Real P2P Systems
FairTorrent: BrinGing Fairness to Peer-to-Peer Systems
Introduction to BitTorrent
Analyzing Cross-layer Interaction in Overlay Networks
Designing a new BitTorrent Client
Determining the Peer Resource Contributions in a P2P Contract
Economics and Computation Week 7: The economics of P2P file sharing
Multi-hop Coflow Routing and Scheduling in Data Centers
Routing in Multiple Layers: Opportunities and Challenges
Part 4: Peer to Peer - P2P Applications
Small Is Not Always Beautiful
Do incentives build robustness in BitTorrent?
Swarming Overlay Construction Strategies
Simplified Explanation of “Do incentives build robustness in BitTorrent?” By James Hoover.
The BitTorrent Protocol
Content Distribution Networks + P2P File Sharing
PEER-TO-PEER SYSTEMS.
Pure P2P architecture no always-on server
Srinivasan Seetharaman - College of Computing, Georgia Tech
Chapter 2 Application Layer
Content Distribution Networks + P2P File Sharing
Presentation transcript:

Managing Inter-domain Traffic in the Presence of BitTorrent File-Sharing Srinivasan Seetharaman and Mostafa Ammar School of Computer Science Objective: i) Analyze impact of BitTorrent file-sharing on the load balance across inter-domain access links, ii) Investigate existing Traffic management schemes, and iii) Propose strategies for better coexistence Typically in BitTorrent swarms… Main characteristics Centralized tracker regulating neighborhood, with no knowledge of peer location or piece distribution Dynamically swap peers by choke/unchoke protocol, every 30 seconds! Tit-for-tat incentive for uploading decisions Leecher: Unchoke the fastest uploaders Seed: Unchoke the fastest downloaders Popular strategy to improve performance Optimistic unchoke: Periodically look for faster peers Objective: Minimize (Download finish time) Similarity to Overlay Routing Selfish protocol, with no concern for native layer preferences Peer and piece selection is similar to picking multi-hop overlay path Simulating BitTorrent swarms Pick 100 ASes with 60% being non-stub ASes. Generate 1-50 peers per AS. Each associates with 1-3 torrents Torrent birth time is uniformly distributed between [-6 hrs, 18 hrs] L1 Data2 Each torrent has between [100, 10000] pieces with each piece being 256KB Data1 D B F F Arrival rate decreases exponentially: (t) = 0 e-t/ 0 = initial arrival rate  = attentuation factor 0 is uniformly distributed between 1-10 and  is set at 5000 for all torrents B1 B2 C A3 A2 A A1 E L2 BY 50 peers randomly assigned by tracker AX Observations We tried the following changes to the BitTorrent protocol, neither of reduced impact satisfactorily Make peer selection random Make piece selection random Reduce duration of optimistic unchoking Freeze list of unchoked peers after 10 mins Tune the unchoking timers Native layer Traffic Management  Inter-domain Traffic Engg  Rate Throttling at the border  Locality-based traffic management strategies Summary: They are effective. But, incur drop in user experience or infrastructure costs Friendly BitTorrent Strategies …to resolve cross-layer conflict Observation 1: Several peers simultaneously unchoke same peer, causing large # of parallel downloads Strategy 1: Limit number of parallel downloads Observation 2: Often, two peers in the same AS contact the same peer outside the AS Strategy 2: Stop this synchronization by avoiding common neighbors (Requires bilateral exchange of neighbor info.) Summary: Reduces maximum utilization effecitvely, without incurring inflation of client finish times Aggressive and performance-aware causing high max. util Applying TE does not make much difference Disproportionate load on inter-domain access links