University of Bologna, Italy How to cheat BitTorrent and why nobody does Simon Patarin and David Hales University of Bologna ECCS 2006,

Slides:



Advertisements
Similar presentations
Rarest First and Choke Algorithms Are Enough
Advertisements

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
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 Presented by Venkatesh Samprati.
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.
Presented by: Su Yingbin. Outline Introduction SocialSwam Design Notations Algorithms Evaluation Conclusion.
Cameron Dale and Jiangchuan LiuA Measurement Study of Piece Population in BitTorrent Introduction BitTorrent Experiment Results Simulation Discussion A.
Project in Computer Security Integrating TOR’s attacks into the I2P darknet Chen Avnery Amihay Vinter.
Free-riding in BitTorrent Networks with the Large View Exploit Michael Sirivianos, Jong Han Park, Rex Chen and Xiaowei Yang University of California, Irvine.
CS 554. Peer-to-Peer Systems Faithfulness in Internet Algorithms Haridimos Kondylakis
CompSci 356: Computer Network Architectures Lecture 21: Content Distribution Chapter 9.4 Xiaowei Yang
Peer to Peer (P2P) Networks and File sharing. By: Ryan Farrell.
CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture XV: Real P2P Systems.
Paul Solomine Security of P2P Systems. P2P Systems Used to download copyrighted files illegally. The RIAA is watching you… Spyware! General users become.
Presented by Stephen Kozy. Presentation Outline Definition and explanation Comparison and Examples Advantages and Disadvantages Illegal and Legal uses.
Do Incentives Build Robustness in BitTorrent? Piatek, Isdal, Anderson, Krishnamurthy, and Venkataramani Piatek, Isdal, Anderson, Krishnamurthy, and Venkataramani.
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.
Virtual communities, Peer-to-Peer Networks Basic introduction to the (sociology and) economics of file-sharing in BitTorrent systems name:David Hales date:Jan.
Leveraging Social Networks for Increased BitTorrent Robustness Wojciech Galuba, Karl Aberer EPFL, Switzerland Zoran Despotovic, Wolfgang Kellerer Docomo.
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.
BitTorrent Presentation by: NANO Surmi Chatterjee Nagakalyani Padakanti Sajitha Iqbal Reetu Sinha Fatemeh Marashi.
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.
GPS: A General Peer-to-Peer Simulator and its Use for Modeling BitTorrent Weishuai Yang Nael Abu-Ghazaleh
BitTorrent Dr. Yingwu Zhu. Bittorrent A popular P2P application for file exchange!
A P2P file distribution system ——BitTorrent Pegasus Team CMPE 208.
Do incentives build robustness in BitTorrent? Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani.
Bit Torrent A good or a bad?. Common methods of transferring files in the internet: Client-Server Model Peer-to-Peer Network.
Project funded by the Future and Emerging Technologies arm of the IST Programme Cooperation with Strangers David Hales Department of.
Example Department of Computer Science University of Bologna Italy ( Decentralised, Evolving, Large-scale Information Systems (DELIS)
SLAC and SLACER: Simple copy & rewire algorithms for trust and cooperation in P2P David Hales, Stefano Arteconi, Ozalp Babaoglu University of Bologna,
MULTI-TORRENT: A PERFORMANCE STUDY Yan Yang, Alix L.H. Chow, Leana Golubchik Internet Multimedia Lab University of Southern California.
Project funded by the Future and Emerging Technologies arm of the IST Programme Socially Inspired Approaches to Evolving Cooperation David Hales
P2P Interaction in Socially Intelligent ICT David Hales Delft University of Technology (Currently visiting University of Szeged, Hungary)
You are all social scientists: you just don’t know it yet David Hales (University of Bologna, Italy) SASO 2007, Cambridge. Mass.
David Hales (University of Bologna) University of Bologna, Italywww.davidhales.com WARNING! Superficial sociological interpretation followed by simplistic.
Emergent Group-Like Selection in a Peer-to-Peer Network ECCS Conference Paris, Nov. 16 th, 2005 David Hales University of Bologna, Italy
B IT T ORRENT T ECHNOLOGY Anthony Pervetich. H ISTORY Bram Cohen Designed the BitTorrent protocol in April 2001 Released July 2, 2001 Concept Late 90’s.
Impact of Incentives in BitTorrent By Jenny Liu and Seth Cooper.
Evolving cooperation in one-time interactions with strangers Tags produce cooperation in the single round prisoner’s dilemma and it’s.
Project funded by the Future and Emerging Technologies arm of the IST Programme From Selfish Nodes to Cooperative Networks – Emergent Link-based Incentives.
The Evolution of Specialisation in Groups – Tags (again!) David Hales Centre for Policy Modelling, Manchester Metropolitan University, UK.
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.
Evolving P2P overlay networks with Tags, SLAC and SLACER for Cooperation and possibly other things… Saarbrücken SP6 workshop July 19-20th 2005 Presented.
Bit Torrent Nirav A. Vasa. Topics What is BitTorrent? Related Terms How BitTorrent works Steps involved in the working Advantages and Disadvantages.
Project funded by the Future and Emerging Technologies arm of the IST Programme Altruism “for free” using Tags David Hales Department.
End-to-end Publishing Using Bittorrent. Bittorrent Bittorrent is a widely used peer-to- peer network used to distribute files, especially large ones It.
Simple Rewire Protocols for Cooperation in Dynamic Networks David Hales, Stefano Arteconi, Ozalp Babaoglu University of Bologna, Italy Bio-Inspired Workshop,
Social Simulation for Self-* Systems: An idea whose time has come? David Hales University of Bologna, Italy In collaboration with: Stefano.
Evolving Specialisation, Altruism & Group-Level Optimisation Using Tags – The emergence of a group identity? David Hales Centre for Policy Modelling, Manchester.
Evolving Specialisation, Altruism & Group-Level Optimisation Using Tags David Hales Centre for Policy Modelling, Manchester Metropolitan University, UK.
Novel Models of Group Selection in Social Structures and Networks David Hales University of Bologna, Italy In collaboration with: Stefano.
November 19, 2016 Guide:- Mrs. Kale J. S. Presented By:- Hamand Amol Sambhaji. Hamand Amol Sambhaji. Pardeshi Dhananjay Rajendra. Pardeshi Dhananjay Rajendra.
Lecture XV: Real P2P Systems
An example of peer-to-peer application
Introduction to BitTorrent
Economics and Computation Week 7: The economics of P2P file sharing
Evolution for Cooperation
Socially Inspired Approaches to Evolving Cooperation
Managing Inter-domain Traffic in the Presence of BitTorrent File-Sharing Srinivasan Seetharaman and Mostafa Ammar School of Computer Science Objective:
Group Selection Design Pattern
Do incentives build robustness in BitTorrent?
The BitTorrent Protocol
Evolution for Cooperation
Altruism “for free” using Tags
Presentation transcript:

University of Bologna, Italy How to cheat BitTorrent and why nobody does Simon Patarin and David Hales University of Bologna ECCS 2006, Oxford, UK

University of Bologna, Italy BitTorrent Works! BitTorrent is a peer-to-peer (P2P) file sharing system Widely used (10’s of millions of users) Relies on client programs running on user machines to cooperate to spread files fast Clients cooperate by uploading pieces of a file to others as well as download from them

University of Bologna, Italy Why Does it Work? But why do clients cooperate when their are incentives to act selfishly? It is widely assumed that BT maintains cooperation via its tit-for-tat (TFT) method This means that clients only upload to others who download TFT has been demonstrated to produce cooperation in abstract games such as the Prisoner’s Dilemma (PD)

University of Bologna, Italy But is this true? But the BT protocol can be easily exploited We propose another possible explanation for cooperation Based on new ideas from computational sociology - group selection mechanism If this hypothesis is true it could have implications for future protocol design

University of Bologna, Italy Talk Plan Outline of BitTorrent Protocol –How it works –How to cheat Possible mechanisms other than tit-for-tat that prevent cheating Outline of group-selection hypthosis Conclusions / Future work

University of Bologna, Italy BitTorrent Terminology Torrent file: meta-data about the data shared –Data is split in smaller pieces called chunks Tracker: centralized manager –Keep track of all peers in the swarm –Keep track of the status (up/down ratio) of each peer Peers: clients –Seeder: holds a full copy of the data –Leecher: holds only a part of the data (initially nothing)

University of Bologna, Italy BitTorrent Protocol Get a list of other peers in the swarm from the tracker Ask peers their list of chunks and tell them what is yours

University of Bologna, Italy Cooperation in BitTorrent  Limited number of peers you can interact with simultaneously Tit-for-tat: upload data to the peers that let you download most (choking) and stop cooperating with peers that don’t upload to you (anti- snubbing) Also cooperate with peers picked at random (optimistic unchoking) –Newcomers get 3x more chance to be picked in this phase Seeder mode: upload to those that download the fastest (spread the data faster)

University of Bologna, Italy Faking Identity in BT Identifiers dynamically generated by the client Identifier provided in each communication with the tracker Identity controlled when connecting to a peer (as given by the tracker in the peer list) –No control possible when receiving a connection (the whole swarm is not known) Easy to create fake identities –Keep a ‘public’ identity when communicating with the tracker and receiving connections –Create new identities when connecting to other peers

University of Bologna, Italy Why not more cheating? Hacked clients exist but BT still works well enough to be widely used, why? –BT community have a niceness “norm” –Uploading cost is low due to flat-rate cost of most internet connections –“Closed trackers” which use IP for “persistent identity” and “ratio” accounting –A novel form of “group selection” based on clients “moving between” swarms

University of Bologna, Italy “Group selection” Recent evolutionary “tag” models of altruism (Holland, Riolo, Hales) –Structure population into dynamic groups –Individuals move between groups to maximise their payoffs –Groups containing cheaters tend to die out –Groups containing altruists grow –Even when individuals can behave selfishly

University of Bologna, Italy Group Dynamics Group Movement between groups Change of strategy Game Interactions = altruist = cheater

University of Bologna, Italy Could this happen in BT? If the groups are seen as BT swarms Clients move from swarms offering bad performance to those offering good Then, swarms containing cheaters will tend to “die out” as altruist move away A swarm containing all cheaters is useless even to cheaters!

University of Bologna, Italy Conclusions Are such dynamics driving BT altruism? We currently don’t know Potentially experiments measuring what BT clients do could be performed Implication if true: P2P protocols can rely on unconditional altruism so long as a healthy “group ecology” is maintained We have already modelled such protocols

University of Bologna, Italy References Hales, D. & Patarin, S. (2005) How to cheat BitTorrent and why nobody does. University of Bologna, Dept. of Computer Science, May 2005, Technical Report UBLCS Hales, D. (2000) Cooperation without Space or Memory: Tags, Groups and the Prisoner's Dilemma. In Moss, S., Davidsson, P. (Eds.) Multi-Agent-Based Simulation. Springer-Verlag. Hales, D. & Arteconi, S. (2006) SLACER: A Self-Organizing Protocol for Coordination in P2P Networks, IEEE Int. Sys. 21(2): Riolo, R., Cohen, M. D. & Axelrod, R. (2001) Cooperation without reciprocity. Nature, 414:441–443. see: