Decentralized peer discovery performance in swarm-protocols

Slides:



Advertisements
Similar presentations
CAN 1.Distributed Hash Tables a)DHT recap b)Uses c)Example – CAN.
Advertisements

Course on Computer Communication and Networks Lecture 10 Chapter 2; peer-to-peer applications (and network overlays) EDA344/DIT 420, CTH/GU.
Digital Library Service – An overview Introduction System Architecture Components and their functionalities Experimental Results.
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.
Session d2, 22 October 2008 eChallenges e-2008 Raul Jimenez and Björn Knutsson, KTH Copyright notice © 2008 Raul Jimenez - -
Kademlia: A Peer-to-peer Information System Based on the XOR Metric Petar Mayamounkov David Mazières A few slides are taken from the authors’ original.
The BitTorrent content distribution system CS217 Advanced Topics in Internet Research Guest Lecture Nikitas Liogkas, 5/11/2006.
BitTorrent Join the swarm! BY: Joe Petruska. What is BitTorrent? a peer-to-peer file sharing protocol used for distributing large amounts of data.
Peer to Peer (P2P) Networks and File sharing. By: Ryan Farrell.
DDoS Vulnerability Analysis of BitTorrent Protocol CS239 project Spring 2006.
Spotlighting Decentralized P2P File Sharing Archie Kuo and Ethan Le Department of Computer Science San Jose State University.
CSc 461/561 CSc 461/561 Peer-to-Peer Streaming. CSc 461/561 Summary (1) Service Models (2) P2P challenges (3) Service Discovery (4) P2P Streaming (5)
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
SIMULATING A MOBILE PEER-TO-PEER NETWORK Simo Sibakov Department of Communications and Networking (Comnet) Helsinki University of Technology Supervisor:
CSE 461 University of Washington1 Topic Peer-to-peer content delivery – Runs without dedicated infrastructure – BitTorrent as an example Peer.
The Bittorrent Protocol
BitTorrent Presentation by: NANO Surmi Chatterjee Nagakalyani Padakanti Sajitha Iqbal Reetu Sinha Fatemeh Marashi.
By Shobana Padmanabhan Sep 12, 2007 CSE 473 Class #4: P2P Section 2.6 of textbook (some pictures here are from the book)
1 V1-Filename.ppt / yyyy-mm-dd / Initials P2P content distribution T Applications and Services in Internet, Fall 2008 Jukka K. Nurminen.
BitTorrent How it applies to networking. What is BitTorrent P2P file sharing protocol Allows users to distribute large amounts of data without placing.
Distributed Systems Concepts and Design Chapter 10: Peer-to-Peer Systems Bruce Hammer, Steve Wallis, Raymond Ho.
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.
 A P2P IRC Network Built on Top of the Kademlia Distributed Hash Table.
David A. Bryan, PPSP Workshop, Beijing, China, June 17th and 18th 2010 PPSP Protocol Considerations.
11/10/20151 A Standalone Content Sharing Application for Spontaneous Communities of Mobile Handhelds Authors: Amir Krifa –
BitTorrent enabled Ad Hoc Group 1  Garvit Singh( )  Nitin Sharma( )  Aashna Goyal( )  Radhika Medury( )
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
P2P File Sharing in VANET Fenggang Wu Dept. of Comp. Sci. and Eng., SJTU Dec.15 th 2011.
CS 3700 Networks and Distributed Systems Overlay Networks (P2P DHT via KBR FTW) Revised 4/1/2013.
Vincent Matossian September 21st 2001 ECE 579 An Overview of Decentralized Discovery mechanisms.
1 Slides from Richard Yang with minor modification Peer-to-Peer Systems: DHT and Swarming.
Node Lookup in P2P Networks. Node lookup in p2p networks In a p2p network, each node may provide some kind of service for other nodes and also will ask.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
Paper Survey of DHT Distributed Hash Table. Usages Directory service  Very little amount of information, such as URI, metadata, … Storage  Data, such.
Experience Sharing in Mobile Peer Communities EPI Planete, INRIA International Consortium Meeting (Oulou) 10 June, 2009.
Advanced Packet Analysis and Troubleshooting Using Wireshark 23AF
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
Peer-to-Peer Systems: An Overview Hongyu Li. Outline  Introduction  Characteristics of P2P  Algorithms  P2P Applications  Conclusion.
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.
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.
End-to-end Publishing Using Bittorrent. Bittorrent Bittorrent is a widely used peer-to- peer network used to distribute files, especially large ones It.
NGMAST Mobile DHT Energy1 Optimizing Energy Consumption of Mobile Nodes in Heterogeneous Kademlia-based Distributed Hash Tables Imre Kelényi Budapest.
P2P Streaming Protocol (PPSP) Requirements draft-zong-ppsp-reqs-02 Ning Zong Yunfei Zhang Victor Pascual Carl Williams.
Chapter 29 Peer-to-Peer Paradigm Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
An example of peer-to-peer application
The Hidden Locality in Swarms
Review session For DS final exam.
Copyright notice © 2008 Raul Jimenez - -
Introduction to BitTorrent
Decentralized peer discovery performance in swarm-protocols
Torrent-based software distribution
Torrent-based software distribution
Copyright notice © 2008 Raul Jimenez - -
مظفر بگ محمدی دانشگاه ایلام
OneSwarm: Privacy Preserving P2P
Economics and Computation Week 7: The economics of P2P file sharing
A Scalable content-addressable network
SCHOOL OF ELECTRICAL ENGINEERING AND TELECOMMUNICATIONS
Angelo Sapello University of Delaware
The University of Adelaide, School of Computer Science
Swarming Overlay Construction Strategies
The BitTorrent Protocol
P2P: Distributed Hash Tables
Kademlia: A Peer-to-peer Information System Based on the XOR Metric
#02 Peer to Peer Networking
Attacking the Kad Network
Presentation transcript:

Decentralized peer discovery performance in swarm-protocols Raul Jimenez KTH, Sweden rauljc@kth.se tslab.ssvl.kth.se/raul

Overview BitTorrent Content Discovery Data Exchange Peer Discovery Centralized Tracker Decentralized Tracker (DHT) Gossiping (PEX) DHT Issues Experiments

BitTorrent Content discovery Metadata (.torrent file) Peer discovery List of peers Data exchange Content

Metadata (.torrent file) Product: SuperGadget 3000 Code: 1234-ABC98 Specifications: ..... Updated list of shops: www.supergadget3000.com/shops Name: info_hash: c70bcf4657cac1253d12acda95b04d1e4dcd23f4 Hash for every piece: Tracker (updated list of peers): http://tracker001.legaltorrents.com:7070/announce Elephants Dream HD .....

Peer Discovery Centralized Tracker Modified HTTP server Decentralized PEX (Peer Exchange) DHT (Distributed Hash Table)

Centralized Tracker 1 2 3 tracker.kth.se 4 5 6 1 7 8

Centralized Tracker 1 2 3 tracker.kth.se 4 5 6 1 4 7 8

Centralized Tracker 1 2 3 tracker.kth.se 4 5 6 1 4 7 7 8

Peer Discovery Centralized Tracker Modified HTTP server Decentralized PEX (Peer Exchange) DHT (Distributed Hash Table)

Peer Exchange (PEX) Gossiping protocol Messages between peers in the same swarm Need external bootstrap

Distributed Hash Table (DHT) Simple demo 4-bits identifiers (24 = 16 identifiers) 1 node per bucket 10 nodes

DHT: Routing Table Routing table Level 0 Level 1 Level 2 Level 3 MyNode 1001

DHT: Routing Table 1xxx 0xxx Routing table Level 0 0010 Level 1 MyNode 1001

DHT: Routing Table 11xx 00xx Routing table 10xx 01xx Level 0 0010 1111 Level 2 Level 3 MyNode 1001

DHT: Routing Table 111x 000x 110x 001x 101x 010x Routing table Level 0 0010 Level 1 1111 100x 011x Level 2 1011 Level 3 MyNode 1001

DHT: Routing Table 111x 000x 110x 001x 101x 010x Routing table Level 0 0010 Level 1 1111 1001 011x Level 2 1011 1000 Level 3 ------ MyNode 1001

DHT: Find Peers 1xxx 0xxx Level 0 0010 0101 torrentID Level 1 1111 1011 Level 3 MyNode 1001

DHT: Find Peers Level 0 1001 Level 1 0110 Level 2 0000 11xx 00xx 0011 10xx 01xx 0101 torrentID MyNode 1001

DHT: Find Peers 111x 000x 110x 001x 101x 010x 0101 torrentID 100x 011x Level 0 1101 Level 1 0000 MyNode 1001 Level 2 0100 Level 3

DHT: Find Peers 111x 000x 110x 001x Level 0 1100 101x 010x Level 1 0011 Level 2 0110 Level 3 0101 0101 torrentID 100x 011x MyNode 1001

Distributed Hash Table (DHT) Kademlia Iterative routing algorithm 160-bit identifiers 8 nodes per bucket 1 million nodes ?

DHT Issues