Machine Communication at Resato

Total Page:16

File Type:pdf, Size:1020Kb

Machine Communication at Resato University of Groningen Integration Project Machine communication at Resato Supervisors: Author: 1st supervisor: Dr. ir. A.A. Geertsema Sanne van Kasteel 2nd supervisor: Dr. A.J. Bosch Company supervisor: R.J. Boer Bachelor Thesis Industrial Engineering & Management July 2, 2018 UNIVERSITY OF GRONINGEN Abstract Faculty of Science and Engineering Industrial Engineering & Management Machine communication at Resato by Sanne van Kasteel With the modern technology, many companies use data to predict and anticipate on events. This data has to be transported from one point to another in order to use it. Everything can be connected through the Internet of Things, but the connection is not always easily made due to security in compa- nies, such as a firewall. In order to let the connection run smoothly, methods are developed to bypass the firewall constructions and securely transport the data from one company to another. Resato International BV is a company that develops high pressure and waterjet technology. Resato has machines at customers all over the world but has problems with connecting to those machines. Methods for bypassing the firewall are necessary to allow for an easier connection to these machines. In this research, several methods are evaluated and ranked according to the requirements of Resato. One of the methods is tested to gain insight into the method and provide an example of implementa- tion. This method, STUN, provides the client with an open port and its IP address. From the tests, STUN is capable of communication in most situations. For the cases that STUN is inadequate, the advice for combining methods is given. iii Contents Abstract iii Terminology vi 1 Introduction 3 1.1 Resato.............................................3 1.2 Innovation Cluster Drachten.................................3 1.3 Project Motivation......................................4 1.4 Trade-offs...........................................5 1.4.1 Ethical limit.....................................5 1.4.2 Technical limit....................................5 1.5 Digitalisation at Resato...................................6 1.5.1 The OSI model....................................6 1.5.2 The TCP/IP model.................................7 1.5.3 TCP and UDP....................................9 1.5.4 NATs.........................................9 1.6 Use of TCP or UDP..................................... 11 1.7 PTC ThingWorx....................................... 12 1.8 Problem holder and stakeholders.............................. 12 1.8.1 Problem holder analysis............................... 13 1.8.2 Stakeholder analysis................................. 13 1.9 System description...................................... 14 1.10 Risk analysis......................................... 14 1.11 Planning............................................ 15 2 Research Design 17 2.1 Research Topic........................................ 17 2.2 Design goal and scope.................................... 17 2.2.1 The design goal.................................... 17 2.2.2 Scope......................................... 18 2.3 Research problem....................................... 18 2.4 Design steps.......................................... 18 2.5 Needed Resources....................................... 21 2.5.1 Literature resources................................. 21 2.5.2 Test design...................................... 22 3 Requirements 23 4 Methods 25 4.1 Introduction.......................................... 25 4.2 STUN............................................. 26 4.3 TURN............................................. 27 v 4.4 ICE.............................................. 28 4.5 PS-STUN........................................... 31 4.6 3G/4G/LTE.......................................... 31 4.7 SWEET............................................ 32 4.8 WANTS............................................ 33 4.9 CAN.............................................. 34 4.10 CODO............................................. 34 4.11 NSLP............................................. 35 4.12 Tunnelling........................................... 36 4.13 UPnP............................................. 38 4.14 Hole Punching........................................ 39 4.14.1 UDP hole punching................................. 39 4.14.2 TCP hole punching.................................. 40 4.14.3 Well behaved NAT.................................. 40 4.15 ALG.............................................. 41 4.16 Comparison Traversal Methods............................... 42 5 Test Design of Traversal Method 45 5.1 Setup............................................. 45 5.1.1 First setup...................................... 45 5.1.2 Second setup..................................... 46 5.2 Test Program......................................... 46 5.3 Results Tests......................................... 49 5.3.1 Test 1......................................... 49 5.3.2 Test 2......................................... 49 5.3.3 Test 3......................................... 49 5.3.4 Validation....................................... 49 6 Discussion 51 6.1 Results............................................. 51 6.2 Discussion........................................... 51 7 Conclusion and recommendations 53 7.1 Conclusion.......................................... 53 7.2 Recommendations...................................... 53 A Program Code 55 B Wireshark Screenshots 65 Bibliography 69 vi Terminology Auto IP is a method that automatically distributes IP addresses to devices without a router or server. In a Client-server network devices send information to one another through a centralised server. DCR is a direct connection rate. DHCP (Dynamic Host Configuration Protocol) is a protocol that can automatically assign IP addresses to devices in a network. DNS (Domain Name System) is a decentralised naming system for devices that are connected to a private network or the internet. It is used to translate names of devices to IP addresses and vice versa. Expedited data is urgent data. HIP (Host Identity Protocol) is a protocol that allows for forming and maintaining IP addresses as both \locators" and \identifiers”. [1] HTTP (Hypertext Transfer Protocol) is a protocol in place for communication between a client and server. ICE (Interactive Connectivity Establishment) is a method for direct communication between devices. IGD (Internet Gateway Device) is a protocol for port control in NATs. IoT (Internet of Things) is a system that allows devices with different IP addresses to connect. IP (Internet Protocol) is the main protocol for communication in the internet protocol suite. IP address is the numerical code given to a device in a network that uses the IP for communication. IPsec (Internet Protocol security) is a network protocol suite that encrypts and authenticates packets. Kernel is the core of an operating system. A log file is a record of every data activity that takes place in a system. Middlebox is a device that can manipulate data before traversing. Multihoming is a mechanism that allows to connect to more than one network or IP address. NAT (Network Address Translation) is a method where IP addresses are appointed and trans- lated. A Node is a device, structure or peer. NTT stands for NAT Traversal Technologies. Octet equals 8 bytes. Overhead is the network overload. Payload is the actual message sent in a network, the information without the data to make the transportation possible. In a Peer to Peer network devices (peers) send information directly to each other. Polling is a regular check for incoming data or changes. Protocol suite is a collection of communication protocols. Relaying is passing on data. SIP (Session Initiation Protocol) is a protocol for communication of multimedia. SOAP (Simple Object Access Protocol) is a messaging protocol that uses a XML format. SSH (Secure Shell) is the protocol that allows for a secure channel over an unsecured network. SSPR (Self-Service Password Reset) is the technology that one uses when, for example, one has to reset their password because of forgetting it. 1 2 STUN (Session Traversal Utilities for NAT) is a collection of methods for transport across NATs. Throughput is the absolute performance of a process. Tunnel is a manner to transport data while encapsulated. TURN (Traversal Using Relays around NAT) is a protocol for relaying packages of data from one IP address to another. VoIP (Voice over IP) is a method where the internet protocol is used to make telephone calls. XML (Extensible Markup Language) is a simple text format that uses code and is readable to both humans and machines. Chapter 1 Introduction Modern systems communicate in different networks and there are different techniques to do so. Re- sato and more organisations encounter problems with this communication, while at other organisations such as WhatsApp, it does work. The problems arise from the security surrounding the machines be- cause the machines are located at Resato's customers. These customers use firewalls to protect their network and prevent unwanted communication. Different techniques for communication need to be found and evaluated. In this chapter, the problem context is discussed, such that one can understand the background of Resato and its problem. Resato is part of a subsidised project where they are to provide knowledge on the subject of trans- portation and storage. Resato works together with a group of companies from Innovation Cluster Drachten. These companies
Recommended publications
  • Distributed Deep Learning in Open Collaborations
    Distributed Deep Learning In Open Collaborations Michael Diskin∗y~ Alexey Bukhtiyarov∗| Max Ryabinin∗y~ Lucile Saulnierz Quentin Lhoestz Anton Sinitsiny~ Dmitry Popovy~ Dmitry Pyrkin~ Maxim Kashirin~ Alexander Borzunovy~ Albert Villanova del Moralz Denis Mazur| Ilia Kobelevy| Yacine Jernitez Thomas Wolfz Gennady Pekhimenko♦♠ y Yandex, Russia z Hugging Face, USA ~ HSE University, Russia | Moscow Institute of Physics and Technology, Russia } University of Toronto, Canada ♠ Vector Institute, Canada Abstract Modern deep learning applications require increasingly more compute to train state-of-the-art models. To address this demand, large corporations and institutions use dedicated High-Performance Computing clusters, whose construction and maintenance are both environmentally costly and well beyond the budget of most organizations. As a result, some research directions become the exclusive domain of a few large industrial and even fewer academic actors. To alleviate this disparity, smaller groups may pool their computational resources and run collaborative experiments that benefit all participants. This paradigm, known as grid- or volunteer computing, has seen successful applications in numerous scientific areas. However, using this approach for machine learning is difficult due to high latency, asymmetric bandwidth, and several challenges unique to volunteer computing. In this work, we carefully analyze these constraints and propose a novel algorithmic framework designed specifically for collaborative training. We demonstrate the effectiveness of our approach for SwAV and ALBERT pretraining in realistic conditions and achieve performance comparable to traditional setups at a fraction of the cost. arXiv:2106.10207v1 [cs.LG] 18 Jun 2021 Finally, we provide a detailed report of successful collaborative language model pretraining with 40 participants. 1 Introduction The deep learning community is becoming increasingly more reliant on transfer learning.
    [Show full text]
  • Developing P2P Protocols Across NAT Girish Venkatachalam
    Developing P2P Protocols across NAT Girish Venkatachalam Abstract Hole punching is a possible solution to solving the NAT problem for P2P protocols. Network address translators (NATs) are something every software engineer has heard of, not to mention networking professionals. NAT has become as ubiquitous as the Cisco router in networking terms. Fundamentally, a NAT device allows multiple machines to communicate with the Internet using a single globally unique IP address, effectively solving the scarce IPv4 address space problem. Though not a long-term solution, as originally envisaged in 1994, for better or worse, NAT technology is here to stay, even when IPv6 addresses become common. This is partly because IPv6 has to coexist with IPv4, and one of the ways to achieve that is by using NAT technology. This article is not so much a description of how a NAT works. There already is an excellent article on this subject by Geoff Huston (see the on-line Resources). It is quite comprehensive, though plenty of other resources are available on the Internet as well. This article discusses a possible solution to solving the NAT problem for P2P protocols. What Is Wrong with NAT? NAT breaks the Internet more than it makes it. I may sound harsh here, but ask any peer-to-peer application developer, especially the VoIP folks, and they will tell you why. For instance, you never can do Web hosting behind a NAT device. At least, not without sufficient tweaking. Not only that, you cannot run any service such as FTP or rsync or any public service through a NAT device.
    [Show full text]
  • Traversing NAT: a Problem
    Dakota State University Beadle Scholar Masters Theses & Doctoral Dissertations Spring 3-2021 Traversing NAT: A Problem Tyler Flaagan Dakota State University Follow this and additional works at: https://scholar.dsu.edu/theses Part of the Information Security Commons, OS and Networks Commons, and the Systems Architecture Commons Recommended Citation Flaagan, Tyler, "Traversing NAT: A Problem" (2021). Masters Theses & Doctoral Dissertations. 365. https://scholar.dsu.edu/theses/365 This Dissertation is brought to you for free and open access by Beadle Scholar. It has been accepted for inclusion in Masters Theses & Doctoral Dissertations by an authorized administrator of Beadle Scholar. For more information, please contact [email protected]. Traversing NAT: A Problem A dissertation submitted to Dakota State University in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Cyber Operations March 2021 By Tyler Flaagan Dissertation Committee: Dr. Kyle L. Cronin Dr. Michael J. Ham Dr. Mark L. Hawkes DocuSign Envelope ID: 8BDB3DA0-604E-4AB7-9BFE-F25909CF4FC0 DISSERTATION APPROVAL FORM This dissertation is approved as a credible and independent investigation by a candidate for the Doctor of Philosophy degree and is acceptable for meeting the dissertation requirements for this degree. Acceptance of this dissertation does not imply that the conclusions reached by the candidate are necessarily the conclusions of the major department or university. Student Name: Tyler Flaagan Dissertation Title: Traversing NAT: A Problem
    [Show full text]
  • Technology Stack for Decentralized Mobile Services
    Technology Stack for Decentralized Mobile Services Matouš Skála Technology Stack for Decentralized Mobile Services by Matouš Skála to obtain the degree of Master of Science at the Delft University of Technology, to be defended publicly on Monday August 31, 2020 at 3:00 PM. Student number: 4893964 Project duration: November 15, 2019 – August 31, 2020 Thesis committee: Dr.ir. J.A. Pouwelse, TU Delft, supervisor Dr. J.S. Rellermeyer, TU Delft Dr. N. Yorke-Smith, TU Delft An electronic version of this thesis is available at http://repository.tudelft.nl/. Preface When I was choosing my thesis topic, I originally came up with an idea of designing a decen- tralized social network. After realizing how ambitious that goal was, I later decided to focus on more fundamental issues first and create a library that would allow for building any de- centralized applications, running purely on an overlay network consisting of smartphones. Rather than reinventing the wheel, I took inspiration from an existing networking library de- veloped at TU Delft over the last decade and created its wire-compatible implementation in Kotlin. Interestingly, in the end, I have even implemented a trivial social network to demon- strate the usage of the library, returning back to the original idea. I would like to thank my supervisor Johan Pouwelse for an endless stream of fresh ideas and valuable feedback, and to PhD students of the Delft Blockchain Lab for numerous coffee meetings and for serving me as a walking documentation of the existing codebase. Matouš Skála Prague,
    [Show full text]
  • Technical Report Sce-12-04 Nat Traversal in Peer-To
    TECHNICAL REPORT SCE-12-04 DEPARTMENT OF SYSTEMS AND COMPUTER ENGINEERING CARLETON UNIVERSITY NAT TRAVERSAL IN PEER -TO -PEER ARCHITECTURE Marc-André Poulin¹, Lucas Rioux Maldague¹, Alexandre Daigle¹, François Gagnon² 1 Cégep de Sainte-Foy, Canada [email protected] , [email protected] , [email protected] 2 Carleton University, Canada [email protected] Abstract. Peer-to-peer networks are well known for file sharing between multiple computers. They establish virtual tunnels between computers to transfer data, but NATs makes it harder. A NAT, Network Address Translation , is a process which transforms private IP addresses, such as 192.168.2.1, into public addresses, such as 203.0.113.40. The idea is that multiple private addresses can hide behind a single public address and thus virtually enlarge the number of allocable public IP addresses. When an application in the local network establishes a connection to Internet, the packet passes through the NAT which adjusts the IP header and maps an external port to the computer which sent the request. When packets are received from the Internet by the NAT, they are forwarded to the internal host which is mapped to the port on which the packet was received, or dropped if no mapping exists. In this paper, we will introduce you to NAT and P2P, we will discuss the numerous ways NATs use to translate private IP addresses into public ones, we will discuss known techniques used to fix the problem and we will also present how popular peer-to-peer programs bypass NATs. This paper is written so anybody with a reasonable knowledge of networking would grasp the essentials.
    [Show full text]
  • A Framework for Multi- Channel Telecommunication Applied to Telecare Application
    Master Thesis A Framework for Multi- Channel Telecommunication Applied to TeleCare Application Author: Yifan Ruan Supervisor: Danny Weyns Examiner: Danny Weyns Date: 2015-6-4 Course Code: 5DV00E, 30 credits Subject: Software Technology Level: Master Department of Computer Science Abstract This thesis is deriving from a telemedicine project "TeleCare" of constructing soft- ware for remote medical diagnosis between the doctor and the patient. The software has to fix the problem of managing local and remote media information. This thesis presents a telecommunication framework for synchronizing multiple media chan- nels, following research methodology, from problem description, iterative and incre- mental development to prototype finalization. For the framework, I have described the framework requirements and corresponding architecture design and implemen- tation. From the evaluation result of "TeleCare" software developed above it, I can conclude the framework has reached the problem. Keywords: framework, communication, synchronization, channel Preface Nowadays, the population of elderly people is growing fast around the world. So It is a nice idea to provide better social care with assistive technologies, such as "TeleCare" soft- ware. With "TeleCare", the patient and the doctor can communicate with each other like face-to-face meeting. In addition, with some state-of-the-art device, touchscreen monitor, they can express themselves through drawing on the screen. For example, the doctor can draw an arrow representing the patient should raise his arm to a certain height, and the patient can follow the instruction when seeing it on his screen. Image a scenario that if an elderly person lives far away from the hospital, one day he broke his leg, it was inconve- nient for him to go to hospital for reexamination again and again.
    [Show full text]
  • Cablelabs® Ipv6 Roadmap Requirements Document CM-GL
    CableLabs® IPv6 Roadmap Requirements Document CM-GL-IPv6-REQ-V01-120831 ISSUED Notice This CableLabs Requirements document is the result of a cooperative effort undertaken at the direction of Cable Television Laboratories, Inc. for the benefit of the cable industry and its customers. This document may contain references to other documents not owned or controlled by CableLabs. Use and understanding of this document may require access to such other documents. Designing, manufacturing, distributing, using, selling, or servicing products, or providing services, based on this document may require intellectual property licenses from third parties for technology referenced in this document. Neither CableLabs, nor any other entity participating in the creation of this document, is responsible for any liability of any nature whatsoever resulting from or arising out of use or reliance upon this document by any party. This document is furnished on an AS-IS basis and neither CableLabs, nor other participating entity, provides any representation or warranty, express or implied, regarding its accuracy, completeness, or fitness for a particular purpose. Distribution of this document is restricted pursuant to the terms of separate access agreements negotiated with each of the parties to whom this document has been furnished. Cable Television Laboratories, Inc., 2012 Confidential CM-GL-IPv6-REQ-V01-120831 CableLabs® CAUTION This document contains proprietary, confidential information that is the exclusive property of CableLabs®. If you do not have a valid agreement with CableLabs for the use of this document, or have not signed a non-disclosure agreement with CableLabs, then you received this document in an unauthorized manner and are not legally entitled to possess or read it.
    [Show full text]
  • Project-Team GRAND-LARGE
    IN PARTNERSHIP WITH: CNRS Université Paris-Sud (Paris 11) Université des sciences et technologies de Lille (Lille 1) Activity Report 2011 Project-Team GRAND-LARGE Global parallel and distributed computing IN COLLABORATION WITH: Laboratoire d’informatique fondamentale de Lille (LIFL), Laboratoire de recherche en informatique (LRI) RESEARCH CENTER Saclay - Île-de-France THEME Distributed and High Performance Computing Table of contents 1. Members :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 1 2. Overall Objectives :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 1 2.1. Grand-Large General Objectives1 2.2. Highlights 2 3. Scientific Foundations :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::2 3.1. Large Scale Distributed Systems (LSDS)2 3.1.1. Computing on Large Scale Global Computing systems3 3.1.2. Building a Large Scale Distributed System4 3.1.2.1. The resource discovery engine4 3.1.2.2. Fault Tolerant MPI4 3.2. Volatility and Reliability Processing5 3.3. Parallel Programming on Peer-to-Peer Platforms (P5)6 3.3.1. Large Scale Computational Sciences and Engineering7 3.3.2. Experimentations and Evaluations7 3.3.3. Languages, Tools and Interface8 3.4. Methodology for Large Scale Distributed Systems8 3.4.1. Observation tools8 3.4.2. Tool for scalability evaluations9 3.4.3. Real life testbeds: extreme realism9 3.5. High Performance Scientific Computing9 3.5.1. Communication avoiding algorithms for numerical linear algebra 10 3.5.2. Preconditioning techniques 10 3.5.3. Fast linear algebra solvers based on randomization 10 3.5.4. Sensitivity analysis of linear algebra problems 11 4. Application Domains :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::11 4.1. Building a Large Scale Distributed System for Computing 11 4.2. Security and Reliability of Network Control Protocols 11 4.3.
    [Show full text]
  • CS 3700 Networks and Distributed Systems
    CS 3700 Networks and Distributed Systems Lecture 18: Peer-to-Peer Systems Revised 3/23/13 2 Outline ❑ Peer-to-Peer Overview ❑ Example: Bittorrent ❑ µTP: Micro Transport Protocol ❑ Cheating on BitTorrent Traditional Internet Services Model 3 Client-server ! Many clients, 1 (or more) server(s) ! Web servers, DNS, file downloads, video streaming Problems ! Scalability: how many users can a server support? ■ What happens when user traffic overload servers? ■ Limited resources (bandwidth, CPU, storage) ! Reliability: if # of servers is small, what happens when they break, fail, get disconnected, are mismanaged by humans? ! Efficiency: if your users are spread across the entire globe, how do you make sure you answer their requests quickly? The Alternative: Peer-to-Peer 4 A simple idea ! Users bring their own resources to the table ! A cooperative model: clients = peers = servers The benefits ! Scalability: # of “servers” grows with users ■ BYOR: bring your own resources (storage, CPU, B/W) ! Reliability: load spread across many peers ■ Probability of them all failing is very low… ! Efficiency: peers are distributed ■ Peers can try and get service from nearby peers The Peer-to-Peer Challenge 5 What are the key components for leveraging P2P? ! Communication: how do peers talk to each other ! Service/data location: how do peers know who to talk to New reliability challenges ! Network reachability, i.e. dealing with NATs ! Dealing with churn, i.e. short peer uptimes What about security? ! Malicious peers and cheating ! The Sybil attack Centralized
    [Show full text]
  • Peer-To-Peer Communication Across Network Address Translators
    Peer-to-Peer Communication Across Network Address Translators Bryan Ford Pyda Srisuresh Massachusetts Institute of Technology Caymas Systems, Inc. [email protected] [email protected] Dan Kegel [email protected] J'fais des trous, des petits trous: : : toujours des petits trous - S. Gainsbourg Abstract Network Address Translation (NAT) causes well-known difficulties for peer-to-peer (P2P) communication, since the peers involved may not be reachable at any globally valid IP address. Several NAT traversal techniques are known, but their documentation is slim, and data about their robustness or relative merits is slimmer. This paper documents and analyzes one of the simplest but most ro- bust and practical NAT traversal techniques, commonly known as “hole punching.” Hole punching is moderately well-understood for UDP communication, but we show how it can be reliably used to set up peer-to-peer TCP streams as well. After gathering data on the reliability of this technique on a wide variety of deployed NATs, we find that about 82% of the NATs tested support hole punching for UDP, and about 64% support hole punching for TCP streams. As NAT vendors become increasingly Figure 1: Public and private IP address domains conscious of the needs of important P2P applications such as Voice over IP and online gaming protocols, support for hole punching is likely to increase in the future. can be easily contacted from anywhere in the network, because only they have unique, globally routable IP ad- 1 Introduction dresses. Nodes on private networks can connect to other The combined pressures of tremendous growth and mas- nodes on the same private network, and they can usually sive security challenges have forced the Internet to evolve open TCP or UDP connections to “well-known” nodes in ways that make life difficult for many applications.
    [Show full text]
  • ICMP Hole Punching, TCP Hole Punching, UDP Hole Punching
    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 07 Issue: 04 | Apr 2020 www.irjet.net p-ISSN: 2395-0072 Overview of Hole Punching: ICMP Hole Punching, TCP Hole Punching, UDP Hole Punching Ms. Pooja Pemare ---------------------------------------------------------------------***---------------------------------------------------------------------- Abstract— Hole punching (or in some cases punch-through) two customers shows the culmination of an opening is a strategy in PC organizing for setting up an immediate punching strategy. association between two gatherings in which one or both are behind firewalls or behind switches that utilization of Examples of Hole punching: network address translation (NAT). To punch an opening, every customer associate with an unlimited outsider server VoIP products, online gaming applications, and P2P that incidentally stores outer and inner location and port networking software all use hole punching. data for every customer. The server at that point transfers every customer's data to the next, and utilizing that data Telephony programming Skype utilizes every customer attempt to build up direct association; opening punching to permit clients to because of the associations utilizing legitimate port speak with at least one clients discernibly. numbers, prohibitive firewalls or switches acknowledge and Fast-paced online multi-player games may forward the approaching parcels on each side. utilize an opening punching method or Hole punching does not require any learning of the system or expect clients to make a lasting firewall network topology to work. ICMP hole punching, UDP hole pinhole so as to diminish arrange idleness. punching and TCP hole punching separately use Internet VPN application Hamachi or Zerotier uses Control Message, User Datagram and Transmission Control gap punching to permit clients to associate Protocols.
    [Show full text]
  • Summary of the Bittorrent Protocol
    Summary of the BitTorrent Protocol Guest lecturer: Petri Savolainen Discussion on modelling and BitTorrent BitTorrent BitTorrent is based on the notion of a torrent, which is a smallish file that contains metadata about a host, the tracker, that coordinates the file distribution and files that are shared A peer that wishes to make data available must first find a tracker for the data, create a torrent, and then distribute the torrent file. Other peers can then using information contained in the torrent file assist each other in downloading the file The download is coordinated by the tracker. In BitTorrent terminology, peers that provide a complete file with all of its pieces are called seeders BitTorrent: Downloading Files Torrent server 1. Upload torrent file Search 2. Provide first seed Seeder Tracker engine Torrent file 4. Contact tracker Torrent file points to List of peers tracker 3. Post search request and 5. Contact seeder for pieces retrieve link to torrent file Peer 6. Trade pieces with peers Peer Difference to HTTP A BitTorrent file download differs from an HTTP request in the following ways: – BitTorrent uses multiple parallel connections to improve download rates, whereas Web browsers typically use a single TCP Socket to transfer HTTP requests and responses – BitTorrent is peer-assisted whereas HTTP request is strictly client-server – BitTorrent uses the random or rarest-first mechanisms to ensure data availability, whereas HTTP is incremental Characteristics of the BitTorrent protocol I/II • Peer selection is about selecting peers who are willing to share files back to the current peer – Tit for tat in peer selection based on download-speed.
    [Show full text]