DOCSLIB.ORG

A Robust and Versatile Measurement Tool for Kademlia-Based DHT Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Robust and Versatile Measurement Tool for Kademlia-Based DHT Networks Rainbow: a Robust and Versatile Measurement Tool for Kademlia-based DHT Networks Xiangtao Liu∗y, Tao Meng∗, Kai Cai∗, and Xueqi Cheng∗ ∗Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China, 100080 yGraduate University, Chinese Academy of Sciences, Beijing, China, 100049 Email: fliuxiangtao, mengtao, [email protected], [email protected] Abstract—In recent years, peer-to-peer (P2P) file sharing Blizzard [5]. However, none of these crawlers can be directly applications have dominated the Internet traffic volumes, and used to measure both BTDHT and KAD at a deep level. This among them, BitTorrent and eMule constitute the majority. is because of the distributed nature of these DHT networks BitTorrent and eMule deploy their distributed networks based on Kademlia, a robust distributed hash table (DHT) protocol, to (i.e., they have no central directory servers), and which makes facilitate the delivery of content. Kademlia-based DHT networks it difficult to obtain the detailed information of peers in the have intrigued researchers in P2P community to measure and networks. analyze them. However, to the best of our knowledge, there is still In this study, we develop Rainbow, a robust and versatile not a well-designed crawler to carry out intensive measurement crawler for Kademlia-based DHT networks. We theoretically and analysis on them. In this paper, we develop Rainbow, a robust and versatile crawler for Kademlia-based DHT networks. For the analyze the convergence (i.e., the crawler can complete its first time, we theoretically analyze its convergence (a main issue task within a limited time, which is also a main issue of of robustness), that is, Rainbow can complete the crawling within robustness) of the P2P crawlers using the same sampling a limited time. Our analysis can also be applied to other P2P nature as Rainbow. Moreover, we demonstrate that Rainbow crawlers with the same sampling nature. Finally, we demonstrate can be applied as a versatile measurement tool to identify that Rainbow can be applied as a versatile measurement tool to identify various characteristics of Kademlia-based DHT networks various characteristics of BTDHT and KAD at a deep level. at a deep level. Our primary contributions are listed below. Index Terms—Peer-to-peer, Kademlia, measurement, Rainbow, • We develop Rainbow, a well-designed crawler for convergence. Kademlia-based DHT networks. Compared with previous P2P crawlers (e.g. Cruiser [4] and Blizzard [5]), it is I. INTRODUCTION rubost and versatile. In today’s Internet, peer-to-peer (P2P) file sharing applica- • For the first time, we analyze the convergence (a main tions become more and more popular [1]. According to the issue of robustness) of Rainbow. Our analysis can also be 2008/2009 Internet traffic report of Ipoque [2], 43% ∼ 70% applied to other P2P crawlers using the same sampling of Internet traffic (e.g. in Northern Africa 43% and Eastern nature. Europe 70%) are from P2P applications and services. Among • We add a new module, the peer information gatherer, to P2P traffic, BitTorrent and eMule constitute the majority. Rainbow. This module makes Rainbow able to measure Specifically, BitTorrent accounts for 30% ∼ 81% (e.g. in south various detailed characteristics. Especially, we find that America 30% and Eastern Europe 81%) and eMule accounts the popularity of the files in KAD fits a power law for up to 47%. distribution f(x) ∼ x−α with α = 0:6732. Kademlia is a robust distributed hash table (DHT) protocol The rest of the paper is organized as follows. Section II designed by Maymounkov and Mazieres` [3]. In this paper, introduces related work. In Section III, we present the frame- Kademlia-based DHT networks refer to the DHT networks work of Rainbow and its crawling algorithm. In Section IV, we which are implemented and deployed by P2P applications theoretically prove the convergence of Rainbow. In Section V based on Kademlia. Both BitTorrent and eMule have deployed we demonstrate how Rainbow can be applied as a versatile their Kademlia-based DHT networks to facilitate the deliv- tool to measure and analyze BTDHT and KAD. Finally, we ery of content. These networks are called as BTDHT and conclude our work in Section VI. KAD in BitTorrent and eMule, respectively. Each peer in BTDHT/KAD has an identifier (or ID), which is randomly II. RELATED WORK generated using a hash function by the client. Usually BTDHT The measurement of P2P network has intrigued many ID is 160 bits in length, and KAD ID is 128 bits in length. researchers such as [4] [5] [6] [7] [8] [9] [10] [11] [12]. The wide-use of Kademlia-based DHT networks has in- The measurement tools (i.e., the P2P crawlers) can work with trigued many researchers in P2P community to measure them. three different modes: k-bit zone crawl, full crawl and random The usual solution is to develop crawlers, which access the on- crawl. Firstly, the k-bit zone crawl, which is often abbreviated line peers in these DHT networks and record their information as the zone crawl, only collects the peers which have the same for statistics. Representative crawlers include Cruiser [4] and k-bit BTDHT/KAD ID prefix. It has the advantage of taking short processing time. For example, Blizzard [5] only takes 2.5 develop Rainbow, a well-designed P2P crawler for the wide- seconds to complete an 8-bit zone crawl. However, it can not used Kademlia-based DHT networks: BTDHT and KAD, obtain a complete snapshot, e.g., the 8-bit zone crawl can only considering that Overnet is unavailable due to legal issues. collect the information of one-256th of all peers. Secondly, the Compared with previous P2P crawlers, Rainbow will be shown full crawl aims at collecting information of all peers, but it has robust and versatile. the disadvantage of needing more time to complete the full In [5], Steiner et al. considered the convergence of their crawl. This disadvantage would distort the trace data, because crawler. They regarded the crawler converged when the UDP peer churn (i.e., the phenomenon that peers joining or leaving query messages had been sent to 99% of currently-collected a network frequently) may lead to the overlapping of peers in peers. This point of view seems reasonable but there really a snapshot, that is, the peers which have left the P2P network needs an accurate estimation of the total peer number N would be mistakenly deemed as online peers in the current in the system. For the first time, we theoretically analyze snapshot. Therefore, some researches (e.g. [4] [5]) prefer to this convergence problem of the P2P crawlers. Note that our use the trace data of the zone crawl rather than that of the analysis is based on Rainbow but it can be applied to other full crawl. Nevertheless, in Section V-A, we try to measure P2P crawlers using the same sampling nature. part of the characteristics of BTDHT and KAD using the full crawl with the consideration that the full crawl may reveal III. RAINBOW some important properties even though the trace data is partly A. The Framework of Rainbow distorted. Thirdly, the random crawl randomly collects a part The framework of Rainbow is shown in Fig. 1. It comprises of all peers. three modules: the peer crawler, the peer information gatherer Kademlia-based DHT networks include Overnet, BTDHT and the writing module. For the peer crawler, it adopts an and KAD. Among them, Overnet has been measured by many iterative crawling method. Specifically, the peer crawler starts researchers such as [6] [7]. Bhagwan et al. [6] measured the the crawl by sending UDP query messages1 to some initial peer availability (i.e., the degree to which a peer is online) peers; after a while, it will acquire a batch of new peers of Overnet. They found that one peer might have multiple IP through parsing UDP response messages2; next it will query addresses at different times, which was called as “IP aliasing”. those newly-acquired peers to obtain the next batch of new They also pointed out that IP aliasing could lead to the peers, and so on. Using this method, the peer crawler will underestimation of peer availability. Kutzner and Fuhrmann [7] collect partial information (e.g. IP and UDP port) of a peer set measured Overnet for two weeks in many aspects, such as S . For the peer information gatherer, it attempts to collect network size, peer availability, peer distribution and message UDP more detailed information (e.g. the client version) of peers in routing delays. S through TCP communication. For the writing module, For BTDHT, much measurement work has been carried out. UDP it writes the information of peers in S into database or For instance, Falkner et al. [8] measured the Azureus DHT, UDP log files. an implementation of Kademlia protocol by a BitTorrent client database table “PeerInfo” or txt format file. named Azureus. They focused on the measurement of session time of peers and the overheads of peers during bootstrapping. Furthermore, Sadafal [9] implemented a BTDHT crawler BTDHT/KAD Network Log files and statistically analyzed their trace data focusing on such Database characteristics as the lifetime of peers and the preference of UDP TCP peers towards special torrents. communication communication For KAD, Stutzbach et al. [10] proposed an analysis frame- work to compute lookup performance. They developed two Peer Peer crawler information Writing module measurement tools, kFetch and kLookup, to collect data for gatherer computing parameters of lookup performance. Stutzbach et Initial peers al. [4] measured the peer churn for three P2P file sharing networks, Gnutella, KAD and BitTorrent, using the modified Fig.
Load more

Recommended publications
  • Looking up Data in P2p Systems
    LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica∗ MIT Laboratory for Computer Science 1. Introduction a good example of how the challenges of designing P2P systems The recent success of some widely deployed peer-to-peer (P2P) can be addressed. file sharing applications has sparked new research in this area. We The recent algorithms developed by several research groups for are interested in the P2P systems that have no centralized control the lookup problem present a simple and general interface, a dis- or hierarchical organization, where the software running at each tributed hash table (DHT). Data items are inserted in a DHT and node is equivalent in functionality. Because these completely de- found by specifying a unique key for that data. To implement a centralized systems have the potential to significantly change the DHT, the underlying algorithm must be able to determine which way large-scale distributed systems are built in the future, it seems node is responsible for storing the data associated with any given timely to review some of this recent research. key. To solve this problem, each node maintains information (e.g., The main challenge in P2P computing is to design and imple- the IP address) of a small number of other nodes (“neighbors”) in ment a robust distributed system composed of inexpensive com- the system, forming an overlay network and routing messages in puters in unrelated administrative domains. The participants in a the overlay to store and retrieve keys. typical P2P system might be home computers with cable modem One might believe from recent news items that P2P systems are or DSL links to the Internet, as well as computers in enterprises.
    [Show full text]
  • The Wealth of Networks How Social Production Transforms Markets and Freedom
    Name /yal05/27282_u00 01/27/06 10:25AM Plate # 0-Composite pg 3 # 3 The Wealth of Networks How Social Production Transforms Markets and Freedom Yochai Benkler Yale University Press Ϫ1 New Haven and London 0 ϩ1 Name /yal05/27282_u00 01/27/06 10:25AM Plate # 0-Composite pg 4 # 4 Copyright ᭧ 2006 by Yochai Benkler. All rights reserved. Subject to the exception immediately following, this book may not be repro- duced, in whole or in part, including illustrations, in any form (beyond that copy- ing permitted by Sections 107 and 108 of the U.S. Copyright Law and except by reviewers for the public press), without written permission from the publishers. The author has made an online version of the book available under a Creative Commons Noncommercial Sharealike license; it can be accessed through the author’s website at http://www.benkler.org. Printed in the United States of America. Library of Congress Cataloging-in-Publication Data Benkler, Yochai. The wealth of networks : how social production transforms markets and freedom / Yochai Benkler. p. cm. Includes bibliographical references and index. ISBN-13: 978-0-300-11056-2 (alk. paper) ISBN-10: 0-300-11056-1 (alk. paper) 1. Information society. 2. Information networks. 3. Computer networks—Social aspects. 4. Computer networks—Economic aspects. I. Title. HM851.B457 2006 303.48'33—dc22 2005028316 A catalogue record for this book is available from the British Library. The paper in this book meets the guidelines for permanence and durability of the Committee on Production Guidelines for Book Longevity of the Council on Library Resources.
    [Show full text]
  • Compsci 514: Computer Networks Lecture 13: Distributed Hash Table
    CompSci 514: Computer Networks Lecture 13: Distributed Hash Table Xiaowei Yang Overview • What problems do DHTs solve? • How are DHTs implemented? Background • A hash table is a data structure that stores (key, object) pairs. • Key is mapped to a table index via a hash function for fast lookup. • Content distribution networks – Given an URL, returns the object Example of a Hash table: a web cache http://www.cnn.com0 Page content http://www.nytimes.com ……. 1 http://www.slashdot.org ….. … 2 … … … • Client requests http://www.cnn.com • Web cache returns the page content located at the 1st entry of the table. DHT: why? • If the number of objects is large, it is impossible for any single node to store it. • Solution: distributed hash tables. – Split one large hash table into smaller tables and distribute them to multiple nodes DHT K V K V K V K V A content distribution network • A single provider that manages multiple replicas. • A client obtains content from a close replica. Basic function of DHT • DHT is a virtual hash table – Input: a key – Output: a data item • Data Items are stored by a network of nodes. • DHT abstraction – Input: a key – Output: the node that stores the key • Applications handle key and data item association. DHT: a visual example K V K V (K1, V1) K V K V K V Insert (K1, V1) DHT: a visual example K V K V (K1, V1) K V K V K V Retrieve K1 Desired properties of DHT • Scalability: each node does not keep much state • Performance: look up latency is small • Load balancing: no node is overloaded with a large amount of state • Dynamic reconfiguration: when nodes join and leave, the amount of state moved from nodes to nodes is small.
    [Show full text]
  • Prebrane Zo Stranky
    Manuál pre začiatočníkov a používateľov Microsoft Windows Galadriel 1.7.4 Manuál je primárne tvorený pre Ubuntu 7.04 Feisty Fawn. Dá sa však použiť aj pre Kubuntu, Xubuntu, Edubuntu, Ubuntu Studio a neoficiálne distribúcie založené na Ubuntu. Pokryté verzie: 7.10, 7.04, 6.10, 6.06 a 5.10 (čiastočne) Vypracoval Stanislav Hoferek (ICQ# 258126362) s komunitou ľudí na stránkach: linuxos.sk kubuntu.sk ubuntu.wz.cz debian.nfo.sk root.cz 1 Začíname! 5 Pracovné prostredie 9 Live CD 1.1 Postup pre začiatočníkov 5.1 Programové vybavenie 9.1 Vysvetlenie 1.2 Zoznámenie s manuálom 5.1.1 Prvé kroky v Ubuntu 9.2 Prístup k internetu 1.3 Zoznámenie s Ubuntu 5.1.2 Základné programy 9.3 Pripojenie pevných diskov 1.3.1 Ubuntu, teší ma! 5.1.3 Prídavné programy 9.4 Výhody a nevýhody Live CD 1.3.2 Čo tu nájdem? 5.2 Nastavenie jazyka 9.5 Live CD v prostredí Windows 1.3.3 Root 5.3 Multimédia 9.6 Ad-Aware pod Live CD 1.4. Užitočné informácie 5.3.1 Audio a Video Strana 48 1.4.1 Odkazy 5.3.2 Úprava fotografii 1.4.2 Slovníček 5.4 Kancelária 10 FAQ 1.4.3 Ako Linux funguje? 5.4.1 OpenOffice.org 10 FAQ 1.4.4 Spúšťanie programov 5.4.2 PDF z obrázku Strana 50 1.5 Licencia 5.4.3 Ostatné Strana 2 5.5 Hry 11 Tipy a triky 5.6 Estetika 11.1 Všeobecné rady 2 Linux a Windows 5.7 Zavádzanie systému 11.2 Pokročilé prispôsobenie systému 2.1 Porovnanie OS 5.7.1 Zavádzač 11.3 Spustenie pri štarte 2.2 Náhrada Windows Programov 5.7.2 Prihlasovacie okno 11.4 ALT+F2 2.3 Formáty 5.7.3 Automatické prihlásenie 11.5 Windows XP plocha 2.4 Rozdiely v ovládaní 5.8 Napaľovanie v Linuxe Strana 55 2.5 Spustenie programov pre Windows 5.9 Klávesové skratky 2.6 Disky 5.10 Gconf-editor 12 Konfigurácia 2.7 Klávesnica Strana 27 12.1 Nástroje na úpravu konfigurákov Strana 12 12.2 Najdôležitejšie konf.
    [Show full text]
  • Cisco SCA BB Protocol Reference Guide
    Cisco Service Control Application for Broadband Protocol Reference Guide Protocol Pack #60 August 02, 2018 Cisco Systems, Inc. www.cisco.com Cisco has more than 200 offices worldwide. Addresses, phone numbers, and fax numbers are listed on the Cisco website at www.cisco.com/go/offices. THE SPECIFICATIONS AND INFORMATION REGARDING THE PRODUCTS IN THIS MANUAL ARE SUBJECT TO CHANGE WITHOUT NOTICE. ALL STATEMENTS, INFORMATION, AND RECOMMENDATIONS IN THIS MANUAL ARE BELIEVED TO BE ACCURATE BUT ARE PRESENTED WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED. USERS MUST TAKE FULL RESPONSIBILITY FOR THEIR APPLICATION OF ANY PRODUCTS. THE SOFTWARE LICENSE AND LIMITED WARRANTY FOR THE ACCOMPANYING PRODUCT ARE SET FORTH IN THE INFORMATION PACKET THAT SHIPPED WITH THE PRODUCT AND ARE INCORPORATED HEREIN BY THIS REFERENCE. IF YOU ARE UNABLE TO LOCATE THE SOFTWARE LICENSE OR LIMITED WARRANTY, CONTACT YOUR CISCO REPRESENTATIVE FOR A COPY. The Cisco implementation of TCP header compression is an adaptation of a program developed by the University of California, Berkeley (UCB) as part of UCB’s public domain version of the UNIX operating system. All rights reserved. Copyright © 1981, Regents of the University of California. NOTWITHSTANDING ANY OTHER WARRANTY HEREIN, ALL DOCUMENT FILES AND SOFTWARE OF THESE SUPPLIERS ARE PROVIDED “AS IS” WITH ALL FAULTS. CISCO AND THE ABOVE-NAMED SUPPLIERS DISCLAIM ALL WARRANTIES, EXPRESSED OR IMPLIED, INCLUDING, WITHOUT LIMITATION, THOSE OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OR ARISING FROM A COURSE OF DEALING, USAGE, OR TRADE PRACTICE. IN NO EVENT SHALL CISCO OR ITS SUPPLIERS BE LIABLE FOR ANY INDIRECT, SPECIAL, CONSEQUENTIAL, OR INCIDENTAL DAMAGES, INCLUDING, WITHOUT LIMITATION, LOST PROFITS OR LOSS OR DAMAGE TO DATA ARISING OUT OF THE USE OR INABILITY TO USE THIS MANUAL, EVEN IF CISCO OR ITS SUPPLIERS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
    [Show full text]
  • Peer-To-Peer Systems
    Peer-to-Peer Systems Winter semester 2014 Jun.-Prof. Dr.-Ing. Kalman Graffi Heinrich Heine University Düsseldorf Peer-to-Peer Systems Unstructured P2P Overlay Networks – Unstructured Heterogeneous Overlays This slide set is based on the lecture "Communication Networks 2" of Prof. Dr.-Ing. Ralf Steinmetz at TU Darmstadt Unstructured Heterogeneous P2P Overlays Unstructured P2P Structured P2P Centralized P2P Homogeneous P2P Heterogeneous P2P DHT-Based Heterogeneous P2P 1. All features of 1. All features of 1. All features of 1. All features of 1. All features of Peer-to-Peer Peer-to-Peer Peer-to-Peer Peer-to-Peer Peer-to-Peer included included included included included 2. Central entity is 2. Any terminal 2. Any terminal 2. Any terminal 2. Peers are necessary to entity can be entity can be entity can be organized in a provide the removed without removed without removed hierarchical service loss of loss of without loss of manner 3. Central entity is functionality functionality functionality 3. Any terminal some kind of 3. ! no central 3. ! dynamic central 3. ! No central entity can be index/group entities entities entities removed without database 4. Connections in loss of functionality the overlay are Examples: “fixed” Examples: Examples: § Gnutella 0.6 Examples: Examples: § Napster § Gnutella 0.4 § Fasttrack § Chord • AH-Chord § Freenet § eDonkey § CAN • Globase.KOM § Kademlia from R.Schollmeier and J.Eberspächer, TU München HHU – Technology of Social Networks – JProf. Dr. Kalman Graffi – Peer-to-Peer Systems – http://tsn.hhu.de/teaching/lectures/2014ws/p2p.html
    [Show full text]
  • A Fog Storage Software Architecture for the Internet of Things Bastien Confais, Adrien Lebre, Benoît Parrein
    A Fog storage software architecture for the Internet of Things Bastien Confais, Adrien Lebre, Benoît Parrein To cite this version: Bastien Confais, Adrien Lebre, Benoît Parrein. A Fog storage software architecture for the Internet of Things. Advances in Edge Computing: Massive Parallel Processing and Applications, IOS Press, pp.61-105, 2020, Advances in Parallel Computing, 978-1-64368-062-0. 10.3233/APC200004. hal- 02496105 HAL Id: hal-02496105 https://hal.archives-ouvertes.fr/hal-02496105 Submitted on 2 Mar 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. November 2019 A Fog storage software architecture for the Internet of Things Bastien CONFAIS a Adrien LEBRE b and Benoˆıt PARREIN c;1 a CNRS, LS2N, Polytech Nantes, rue Christian Pauc, Nantes, France b Institut Mines Telecom Atlantique, LS2N/Inria, 4 Rue Alfred Kastler, Nantes, France c Universite´ de Nantes, LS2N, Polytech Nantes, Nantes, France Abstract. The last prevision of the european Think Tank IDATE Digiworld esti- mates to 35 billion of connected devices in 2030 over the world just for the con- sumer market. This deep wave will be accompanied by a deluge of data, applica- tions and services.
    [Show full text]
  • Digital Fountain Erasure-Recovery in Bittorrent
    UNIVERSITÀ DEGLI STUDI DI BERGAMO Facoltà di Ingegneria Corso di Laurea Specialistica in Ingegneria Informatica Classe n. 35/S – Sistemi Informatici Digital Fountain Erasure Recovery in BitTorrent: integration and security issues Relatore: Chiar.mo Prof. Stefano Paraboschi Correlatore: Chiar.mo Prof. Andrea Lorenzo Vitali Tesi di Laurea Specialistica Michele BOLOGNA Matricola n. 56108 ANNO ACCADEMICO 2007 / 2008 This thesis has been written, typeset and prepared using LATEX 2". Printed on December 5, 2008. Alla mia famiglia “Would you tell me, please, which way I ought to go from here?” “That depends a good deal on where you want to get to,” said the Cat. “I don’t much care where —” said Alice. “Then it doesn’t matter which way you go,” said the Cat. “— so long as I get somewhere,” Alice added as an explanation. “Oh, you’re sure to do that,” said the Cat, “if you only walk enough.” Lewis Carroll Alice in Wonderland Acknowledgments (in Italian) Ci sono molte persone che mi hanno aiutato durante lo svolgimento di questo lavoro. Il primo ringraziamento va ai proff. Stefano Paraboschi e Andrea Vitali per la disponibilità, la competenza, i consigli, la pazienza e l’aiuto tecnico che mi hanno saputo dare. Grazie di avermi dato la maggior parte delle idee che sono poi confluite nella mia tesi. Un sentito ringraziamento anche a Andrea Rota e Ruben Villa per l’aiuto e i chiarimenti che mi hanno gentilmente fornito. Vorrei ringraziare STMicroelectronics, ed in particolare il gruppo Advanced System Technology, per avermi offerto le infrastrutture, gli spa- zi e tutto il necessario per svolgere al meglio il mio periodo di tirocinio.
    [Show full text]
  • Software to Download from File Sharing Sites 10 Best File Sharing Software for Peer to Peer File Sharing
    software to download from file sharing sites 10 Best File Sharing Software for Peer to Peer File Sharing. Sharing files online isn’t that much easy as it should be, especially, if you have large files with size in GBs. Thankfully, we can use P2P (peer-to- peer) file sharing software to easily share files with anyone online of no matter what size. You can easily upload or download TBs of data without any restrictions. P2P file sharing software can be quite handy, but at the same time, they also have some negative points. These p2p file sharing software also host illegal downloads so that it may lead to any action against you. Furthermore, these peer to peer file sharing software are also known to spread viruses and malware; you will have to be careful about downloading too. Top 10 Best File Sharing Software for Peer to Peer File Sharing. There are dozens of P2P file sharing software to choose from, but it is essential to choose the best P2P file sharing software that is safe and features rich. To help you find the best file sharing software for your needs, we have compiled a list of best file sharing software. You can just select the one that seems right for your needs. 1. uTorrent. Even after being acquired by BitTorrent.inc and becoming closed-sourced with ads, uTorrent is still the leader when it comes to P2P file sharing software. Although you need to subscribe for a premium membership to take full advantage of the client, even its free version offers all the required features to upload and download files without limitations.
    [Show full text]
  • Conducting and Optimizing Eclipse Attacks in the Kad Peer-To-Peer Network
    Conducting and Optimizing Eclipse Attacks in the Kad Peer-to-Peer Network Michael Kohnen, Mike Leske, and Erwin P. Rathgeb University of Duisburg-Essen, Institute for Experimental Mathematics, Ellernstr. 29, 45326 Essen [email protected], [email protected], [email protected] Abstract. The Kad network is a structured P2P network used for file sharing. Research has proved that Sybil and Eclipse attacks have been possible in it until recently. However, the past attacks are prohibited by newly implemented secu- rity measures in the client applications. We present a new attack concept which overcomes the countermeasures and prove its practicability. Furthermore, we analyze the efficiency of our concept and identify the minimally required re- sources. Keywords: P2P security, Sybil attack, Eclipse attack, Kad. 1 Introduction and Related Work P2P networks form an overlay on top of the internet infrastructure. Nodes in a P2P network interact directly with each other, i.e., no central entity is required (at least in case of structured P2P networks). P2P networks have become increasingly popular mainly because file sharing networks use P2P technology. Several studies have shown that P2P traffic is responsible for a large share of the total internet traffic [1, 2]. While file sharing probably accounts for the largest part of the P2P traffic share, also other P2P applications exist which are widely used, e.g., Skype [3] for VoIP or Joost [4] for IPTV. The P2P paradigm is becoming more and more accepted also for professional and commercial applications (e.g., Microsoft Groove [5]), and therefore, P2P technology is one of the key components of the next generation internet.
    [Show full text]
  • Diapositiva 1
    TRANSFERENCIA O DISTRIBUCIÓN DE ARCHIVOS ENTRE IGUALES (peer-to-peer) Características, Protocolos, Software, Luis Villalta Márquez Configuración Peer-to-peer Una red peer-to-peer, red de pares, red entre iguales, red entre pares o red punto a punto (P2P, por sus siglas en inglés) es una red de computadoras en la que todos o algunos aspectos funcionan sin clientes ni servidores fijos, sino una serie de nodos que se comportan como iguales entre sí. Es decir, actúan simultáneamente como clientes y servidores respecto a los demás nodos de la red. Las redes P2P permiten el intercambio directo de información, en cualquier formato, entre los ordenadores interconectados. Peer-to-peer Normalmente este tipo de redes se implementan como redes superpuestas construidas en la capa de aplicación de redes públicas como Internet. El hecho de que sirvan para compartir e intercambiar información de forma directa entre dos o más usuarios ha propiciado que parte de los usuarios lo utilicen para intercambiar archivos cuyo contenido está sujeto a las leyes de copyright, lo que ha generado una gran polémica entre defensores y detractores de estos sistemas. Las redes peer-to-peer aprovechan, administran y optimizan el uso del ancho de banda de los demás usuarios de la red por medio de la conectividad entre los mismos, y obtienen así más rendimiento en las conexiones y transferencias que con algunos métodos centralizados convencionales, donde una cantidad relativamente pequeña de servidores provee el total del ancho de banda y recursos compartidos para un servicio o aplicación. Peer-to-peer Dichas redes son útiles para diversos propósitos.
    [Show full text]
  • Hartkad: a Hard Real-Time Kademlia Approach
    HaRTKad: A Hard Real-Time Kademlia Approach Jan Skodzik, Peter Danielis, Vlado Altmann, Dirk Timmermann University of Rostock Institute of Applied Microelectronics and Computer Engineering 18051 Rostock, Germany, Tel./Fax: +49 381 498-7284 / -1187251 Email: [email protected] Abstract—The Internet of Things is becoming more and time behavior. Additionally, many solutions leak flexibility and more relevant in industrial environments. As the industry itself need a dedicated instance for administrative tasks. These issues has different requirements like (hard) real-time behavior for will becomes more relevant in the future. As mentioned in many scenarios, different solutions are needed to fulfill future challenges. Common Industrial Ethernet solution often leak [3], the future for the industry will be more intelligent devices, scalability, flexibility, and robustness. Most realizations also which can act more dynamically. Facilities as one main area require special hardware to guarantee a hard real-time behavior. of application will consist of more devices still requiring real- Therefore, an approach is presented to realize a hard real- time or even hard real-time behavior. So we think, the existing time network for automation scenarios using Peer-to-Peer (P2P) solutions will not fulfill the future challenges in terms of technology. Kad as implementation variant of the structured decentralized P2P protocol Kademlia has been chosen as base scalability, flexibility, and robustness. for the realization. As Kad is not suitable for hard real-time Peer-to-Peer (P2P) networks instead offer an innovative applications per se, changes of the protocol are necessary. Thus, alternative to the typical Client-Server or Master-Slave concepts Kad is extended by a TDMA-based mechanism.
    [Show full text]