Swarming Overlay Construction Strategies

Slides:



Advertisements
Similar presentations
1 / 18 Network Characteristics of Video Streaming Traffic Ashwin Rao, Yeon-sup Lim *, Chadi Barakat, Arnaud Legout, Don Towsley *, and Walid Dabbous INRIA.
Advertisements

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.
1 / 21 Network Characteristics of Video Streaming Traffic Ashwin Rao †, Yeon-sup Lim *, Chadi Barakat †, Arnaud Legout †, Don Towsley *, and Walid Dabbous.
Cameron Dale and Jiangchuan LiuA Measurement Study of Piece Population in BitTorrent Introduction BitTorrent Experiment Results Simulation Discussion A.
1 Nazanin Magharei, Reza Rejaie University of Oregon INFOCOM 2007 PRIME: P2P Receiver-drIven MEsh based Streaming.
Network Coding in Peer-to-Peer Networks Presented by Chu Chun Ngai
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.
Amir Rasti Reza Rejaie Dept. of Computer Science University of Oregon.
Understanding the Performance Gap between Pull-based Mesh Streaming Protocols and Fundamental Limits Chen Feng, Baochun Li and Bo Li Presented by Zhiming.
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
1 / 8 Network Characteristics of Video Streaming Traffic Ashwin Rao, Yeon-sup Lim, Chadi Barakat, Arnaud Legout, Don Towsley, and Walid Dabbous INRIA Project.
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.
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 Denial-of-Service Resilience in P2P File Sharing Systems Dan Dumitriu (EPFL) Ed Knightly (Rice) Aleksandar Kuzmanovic (Northwestern) Ion Stoica (Berkeley)
An Alliance based PeeringScheme for P2P Live Media Streaming An Alliance based Peering Scheme for P2P Live Media Streaming Darshan Purandare Ratan Guha.
Understanding Mesh-based Peer-to-Peer Streaming Nazanin Magharei Reza Rejaie.
6/28/2015Reza Rejaie INFOCOM 07 1 Nazanin Magharei, Reza Rejaie University of Oregon PRIME: P2P Receiver-drIven MEsh based.
1 V1-Filename.ppt / yyyy-mm-dd / Initials P2P content distribution T Applications and Services in Internet, Fall 2008 Jukka K. Nurminen.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
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.
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
Multiclass P2P Networks: Static Resource Allocation for Service Differentiation and Bandwidth Diversity Florence Clévenot-Perronnin, Philippe Nain and.
11/10/20151 A Standalone Content Sharing Application for Spontaneous Communities of Mobile Handhelds Authors: Amir Krifa –
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
MULTI-TORRENT: A PERFORMANCE STUDY Yan Yang, Alix L.H. Chow, Leana Golubchik Internet Multimedia Lab University of Southern California.
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.
PRIME: P2P Receiver-drIven MEsh based Streaming Nazanin Magharei, Reza Rejaie University of Oregon Presenter Jungsik Yoon.
A New Hybrid Wireless Sensor Network Localization System Ahmed A. Ahmed, Hongchi Shi, and Yi Shang Department of Computer Science University of Missouri-Columbia.
Impact of Incentives in BitTorrent By Jenny Liu and Seth Cooper.
A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.
Experience Sharing in Mobile Peer Communities EPI Planete, INRIA International Consortium Meeting (Oulou) 10 June, 2009.
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.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
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.
2-Hop TorrentSmell A distributed tracking algorithm name:Raynor Vliegendhart date:July 10, 2009 event:Tribler Dev Meeting.
1 Gnutella. 2 Overview r P2P search mechanism r Simple and straightforward r Completely decentralized r Creates overlay network r Different applications.
An example of peer-to-peer application
The Hidden Locality in Swarms
Copyright notice © 2008 Raul Jimenez - -
Introduction to BitTorrent
Nuno Salta Supervisor: Manuel Ricardo Supervisor: Ricardo Morla
Decentralized peer discovery performance in swarm-protocols
Decentralized peer discovery performance in swarm-protocols
I know what you are Sharing
A standalone content sharing application for spontaneous
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Copyright notice © 2008 Raul Jimenez - -
Designing a new BitTorrent Client
SCHOOL OF ELECTRICAL ENGINEERING AND TELECOMMUNICATIONS
Paraskevi Raftopoulou, Euripides G.M. Petrakis
Managing Inter-domain Traffic in the Presence of BitTorrent File-Sharing Srinivasan Seetharaman and Mostafa Ammar School of Computer Science Objective:
Joydeep Chandra, Santosh Shaw and Niloy Ganguly
Small Is Not Always Beautiful
The BitTorrent Protocol
Challenges with developing a Commercial P2P System
Pure P2P architecture no always-on server
Distributed architectures
Chapter 2 Application Layer
Presentation transcript:

Swarming Overlay Construction Strategies Anwar Al Hamra1, Nikitas Liogkas2, Arnaud Legout3, Chadi Barakat3 1Hariri Canadian University, Damour, Lebanon 2Knight Equity Markets, L.P., Jersey City, NJ, USA 3 INRIA, Projet Planète, Sophia Antipolis, France

Get a .torrent file that contains the address of the tracker BitTorrent Overview Peer set (neighbor set) as defined in mainline 4.0.2 Maximum 80 connections in total Maximum 40 outgoing connections Results in a well connected graph Recent peers get a chance to be connected to old peers Web server Get a .torrent file that contains the address of the tracker random peer set Tracker

Peer Bootstrap Strategies Three strategies Tracker Default method, used by all clients DHT Distributed tracker Leads to the same overlay as the tracker strategy PEX (Peer EXchange) Implemented in most popular clients

Peer Bootstrap: Current Practice Current clients use a mix of tracker + DHT + PEX We focus on the tracker only strategy Classical bootstrap strategy Can be used in another context Fundamental to understand its properties

BitTorrent Overlay Structure Common wisdom is that BT builds random graphs with the tracker strategy Robust to churn Low diameter D Important for piece selection Does BT build a random graph?

Tracker Connectivity Matrix 1000 peers 40 maximum number of outgoing connections Not a random graph Still well connected 2000 connections between the first 80 peers and the rest of the torrent 610 192 Peers ordered by arriving time

Preemption Modification of When maximum peer set size reached Tracker strategy Just requires client support Backward compatible When maximum peer set size reached Always allows incoming connections from peers redirected by the tracker

OK Preemption Tracker only Preemption New peer Accept me in your peer set Tracker only Preemption Preemption enables rewiring of the graph

Connectivity Matrices Omax=40 Tracker Preemption

Focus of the Presentation Impact of Omax during the flash crowd phase Churn might improve overlay structure But, flash crowd is the most critical phase Single seed Overlay structure dictates pieces propagation Impact of Omax during flash crowd on the overlay structure obtained with Tracker Preemption

Outline Background Impact of Omax on BitTorrent overlay properties Connectivity matrices Metrics

Methodology Simulations with 1000 peers Flash crowd phase Validated with experiments Omax: 5 to 80 Max peer set size: 80 Tracker returns 50 peers Flash crowd phase Before the first peer leaves the torrent

Connectivity Matrices Omax=20 Preemption Tracker

Connectivity Matrices Omax=40 Tracker Preemption

Connectivity Matrices Omax=60 Tracker Preemption

Connectivity Matrices Omax=80 Tracker Preemption Partition

Outline Background Impact of Omax on BitTorrent overlay properties Connectivity matrices Metrics

Metrics Bottleneck index Ratio of the number of connections between the first 80 peers and the rest of the peers, to the maximum possible number of such connections (80 ¤ 80 = 6400 connections) Indication of the presence of a bottleneck between the initial seed peer set and the rest of the torrent

Metrics Average peer set size Diameter Average number of neighbors for all peers Diameter Longest shortest path between any two peers

Results Averages over 10 runs. Errorbars represent the min and max

Results partition

Which Omax? Tracker strategy Preemption 20 to 40 gives a good tradeoff 40 to 80 is used in current clients Preemption 80 is optimal for the three metrics With preemption no more the need to define a constraint on Omax

Conclusion The BitTorrent overlay is not random with tracker only strategy Specific structure Omax is an important parameter Preemption strategy improves overlay structure No more need to set Omax Outperforms tracker strategy for all 3 metrics

Advertisement: If you are interested in P2P locality, have a look at Stevens Le Blond, Arnaud Legout, Walid Dabbous. Pushing BitTorrent Locality to the Limit. Technical Report (inria-00343822, version 2 - 12 May 2009), INRIA, Sophia Antipolis, May 2009. http://hal.inria.fr/inria-00343822/en/ Thank you! Questions? Simulator available at: http://planete.inria.fr/software/BitSim/