Performance Modeling and Engineering Issues of BT-Like File Sharing Systems M.H. Lin, John C.S. Lui, D.M. Chiu The Chinese University of Hong Kong.

Slides:



Advertisements
Similar presentations
Optimal Scheduling in Peer-to-Peer Networks Lee Center Workshop 5/19/06 Mortada Mehyar (with Prof. Steven Low, Netlab)
Advertisements

Peter R. Pietzuch Peer-to-Peer Computing – or how to make your BitTorrent downloads go faster... Peter Pietzuch Large-Scale Distributed.
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.
The BitTorrent protocol A peer-to-peer file sharing protocol.
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.
Internet Economics: the use of Shapley value for ISP settlement Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
Kangaroo: Video Seeking in P2P Systems Xiaoyuan Yang †, Minas Gjoka ¶, Parminder Chhabra †, Athina Markopoulou ¶, Pablo Rodriguez † † Telefonica Research.
Chapter 2 Application Layer Computer Networking: A Top Down Approach, 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April A note on the use.
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.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
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.
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
CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture XV: Real P2P Systems.
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.
PBS: Periodic Behavioral Spectrum of P2P Applications Tom Z.J. Fu, Yan Hu, Xingang Shi, Dah Ming Chiu and John C.S. Lui The Chinese University of Hong.
Flash Crowds And Denial of Service Attacks: Characterization and Implications for CDNs and Web Sites Aaron Beach Cs395 network security.
A P2P file distribution system ——BitTorrent Fan Bin Sep,25,2004.
Computer Networks Layering and Routing Dina Katabi
Can Internet Video-on-Demand Be Profitable? SIGCOMM 2007 Cheng Huang (Microsoft Research), Jin Li (Microsoft Research), Keith W. Ross (Polytechnic University)
Peer-To-Peer Multimedia Streaming Using BitTorrent Purvi Shah, Jehan-François Pâris University of Houston Houston, TX.
Yang Chen.  More and more people are using online SNS to share their photos, news, …  Large Amount of data from the SNS site to the end users  How.
Can Network Coding Help in P2P Networks? Dah Ming Chiu, Raymond W Yeung, Jiaqing Huang and Bin Fan Chinese University of Hong Kong Presented by Arjumand.
1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.
Trusted Computing, Peer-To-Peer Distribution, and the Economics of Pirated Entertainment Peter Scott Based on paper by S. E. Schechter, R. A. Greenstadt,
Can Internet VoD be Profitable? Cheng Huang (MSR), Jin Li (MSR), Keith W. Ross (NY Polytechnique)
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 Under a Microscope: Towards Static QoS Provision in Dynamic Peer-to-Peer Networks Tom H. Luan*, Xuemin (Sherman) Shen* and Danny H. K. Tsang.
Firewall and Internet Access Mechanism that control (1)Internet access, (2)Handle the problem of screening a particular network or an organization from.
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
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.
1 Insertion of ISP-owned Peer & Locality Awareness in BitTorrent Ioanna Papafili, George D. Stamoulis, Sergios Soursos AUEB EuroNF workshop, Athens October.
MULTI-TORRENT: A PERFORMANCE STUDY Yan Yang, Alix L.H. Chow, Leana Golubchik Internet Multimedia Lab University of Southern California.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
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.
Peer-Assisted Content Distribution Pablo Rodriguez Christos Gkantsidis.
Impact of Incentives in BitTorrent By Jenny Liu and Seth Cooper.
A Simple Model for Analyzing P2P Streaming Protocols Zhou Yipeng Chiu DahMing John, C.S. Lui The Chinese University of Hong Kong.
Flashback: A Peer-to-Peer Web Server for Flash Crowds Presented by Tom Batkiewicz CS 587x Fall ‘07.
2: Application Layer 1 Chapter 2 Application Layer Computer Networking: A Top Down Approach, 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April.
Advanced Network Seminar P2P in VoD Constantin Radchenko.
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
SHADOWSTREAM: PERFORMANCE EVALUATION AS A CAPABILITY IN PRODUCTION INTERNET LIVE STREAM NETWORK ACM SIGCOMM CING-YU CHU.
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
Network and Systems Laboratory nslab.ee.ntu.edu.tw Yipeng Zhou, Dah Ming Chiu, and John C.S. Lui Information Engineering Department The Chinese University.
Bit Torrent Nirav A. Vasa. Topics What is BitTorrent? Related Terms How BitTorrent works Steps involved in the working Advantages and Disadvantages.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
PEAR TO PEAR PROTOCOL. Pure P2P architecture no always-on server arbitrary end systems directly communicate peers are intermittently connected and change.
Traffic Localization with Information Guidance of Pseudo Peer Agent on BT-P2P Network 學生 : 楊宏昌 指導教授 : 曾黎明教授 在 BT 同儕通訊上利用參與者訊息引導對外流量之區域化節約.
P4P: Proactive Provider Assistance for P2P Haiyong Xie Yale University.
An example of peer-to-peer application
Introduction to BitTorrent
Economics and Computation Week 7: The economics of P2P file sharing
Strayer University at Arlington, VA
Managing Inter-domain Traffic in the Presence of BitTorrent File-Sharing Srinivasan Seetharaman and Mostafa Ammar School of Computer Science Objective:
The BitTorrent Protocol
Content Distribution Networks + P2P File Sharing
Challenges with developing a Commercial P2P System
Content Distribution Networks + P2P File Sharing
Presentation transcript:

Performance Modeling and Engineering Issues of BT-Like File Sharing Systems M.H. Lin, John C.S. Lui, D.M. Chiu The Chinese University of Hong Kong

P2P Systems Many interesting and important services: – File sharing (e.g., BT, Gnutella,..etc) – P2P live streaming (e.g., PPLive, PPStream,…etc) – P2P-VoD streaming A scalable and robust paradigm ISPs call it a “distributive technology” – Users have control about routing – Mess up the underlying traffic engineering Qiu[Sigcomm’04], Bin[ICNP’06] Massoulie[Sigmetrics’05] Lin[Performance’07] Huang[Sigcomm’08]

P2P Traffic Trends (by CacheLogic Inc.) * Over 66% of P2P users traffic and …. growing

Reasons for growth: economics Volume-based Charging Flat-rate charging

Reasons for growth: economics CPs reduce their operating cost Users have good service & performance

Overview of BitTorrent Protocol Find the file you want to download Contact tracker, which returns a subset of peers The file is divided into chunks – Exchange chunk with different peers – Chunk selection: rarest first – Incentive mechanism: tit-for-tat Since peers are selected randomly, it causes a lot of inter-ISP traffic

ISP’s problem Increase in traffic implies increase in operating cost – Need to increase their capacity – Need to pay for the cross-ISP traffic P2P traffic affects other applications More traffic, but can’t get any profit. ISPs don’t want to “kill” or “filter” P2P What ISPs want: – More money, of course – Reduce operating cost

Potential Solutions ISPs shape P2P traffic by blocking known port – But P2P uses dynamic port ISPs use high performance router to inspect packets – But P2P encrypts the payload ISPs use ``behavioral” to detect – Still under study, can it be counter by P2P? ISPs cache the traffic – Copyright and legal issues

Previous approach ISPs guide peers when choosing neighbors – Proposal by Bindal (ICDCS’06) and Aggrawal (CCR’07) – P4P (Sigcomm 2008) – Use CDN (Sigcomm 2008) Peers and ISPs have to trust each other It relies on the services of others, e.g., CDN Security concerns.

To Exploit Locality … “Exploit-the-Locality Principle” (ELP): Never download information from peers in other ISPs if there exist at least one copy of the information among peers in the same ISP. ELP aims to establish a happy/tolerant relationship between P2P users and ISPs. Users will be happy to use P2P applications and they do not cost too much to ISPs.

How Large is the Cross-ISP Traffic ? It depends on the specific implementation. Let us consider the bounds. The remaining question is how to uncondition the number of peers and their downloading progress for a given ISP.

Scenario I: Regular Arrival Assumptions  Peers arrive according to a Poisson process.  Peers are all persistent in the sense that they will not abort before they finish the file download.  Peers depart immediately when finish downloading.  There exist some “seeders” to ensure file availability.  Downloading rate for a given peer is independent of its downloading progress. (ignoring the last piece problem) Then we can use M/G/∞ model to uncondition the number of peers and their downloading progress.

Scenario I: Regular Arrival

Scenario II: Flash Crowd  Based on the same assumptions in the regular arrival analysis, except that peers arrival process is no longer Poisson.  At time t = 0, n peers arrive and there is no more peer arrival after t > 0. Let τ min ( τ max ) be the shortest (longest) downloading time of these peers. Theorem 4: The average amount of incoming cross-ISP traffic caused by each peer under flash crowd, denoted by E(d), is bounded by (Proof omitted, the basic idea is to classify peers based on downloading rate.)

Designing ISP-friendly Protocol  One design requirement of our protocol is that it has to be “compatible” with the current BitTorrent. This feature is important since ISPs may want to have an incremental deployment of this new service.  There are many details in our protocol, but the basic idea is quite simple: A peer will not download a chunk from external neighbors if he finds that this chunk is held by some internal neighbors.

Some Details of the Protocol

Experiments on PlanetLab  Clients:  Official BT: BitTorrent  ISP-friendly BT: Modified BitTorrent  Using default settings for bandwidth limits.  Each university as one “ISP”. We have six “ISPs”:  Berkeley (16 nodes), Princeton (11 nodes), MIT (7 nodes), Cornell (6 nodes), Columbia (3 nodes), OTHER (32 nodes)  Four sets of experiments:  (official BT, ISP-friendly BT) × (regular arrival, flash crowd)

Official BT, Regular Arrival F= 1-n/N

ISP-friendly BT, Regular Arrival

Official BT, Flash Crowd

ISP-friendly BT, Flash Crowd

Observations  Cross-ISP traffic of the official BT is similar to that of the completely random neighbor selection.  ISP-friendly protocol can significantly reduce cross- ISPs traffic.  Download time of the ISP-friendly BT is slightly larger than that of the official BT.  Seeder may remain idle.  Locality policy may reduce performance (e.g., download time)  the impact will be reduced if there are more peers within an ISP.  Experiment curves may exceed the upper bound:  Each peer may not be connected to all internal peers.  The piece availability information cannot be updated instantaneously.

Black Hole Security Attack  Consider a free-rider who advertise it has a lot of chunks but it refuses to provide any upload service to other peers.  This type of free-riders do exist in BitTorrent. They download slowly via the “optimistic unchoked”.  But to the ISP-friendly protocol, they prevent other internal peers to obtain information from external peers.  They may halt the whole file download process within the ISP.  We call this the “black hole attack”

Black Hole Security Attack  We need to provide some mechanism to filter out the attackers or peers with very low uploading rate.  Our approach:  Each peer picks a subset of its internal peers and considers them as its “active co-agents”.  A peer will not download a chunk from external neighbors if it finds that this chunk is held by its “active co-agents”.  How to pick “active co-agents”? The internal peers who upload to you recently. Random selection !!

Enhanced ISP-friendly Protocol under Regular Arrival

Summary  We use a simple and effective idea: exploit the content locality to reduce the traffic.  We analytical show the significant cross-ISP traffic reduction when one uses ELP.  We design and implement such mechanism on a BT software, carry out extensive experiments and measurements on the PlanetLab to demonstrate its effectiveness.  Lastly, we illustrate the black hole security attack and how one can modify the proposed protocol to address this problem.