Search 250 million research papers

Fedora Project Bittorrent Tracker

Fedora · Bulletin of Miscellaneous Information (Royal Gardens Kew)

Cited by 0

BitTorrent Tracker-Less Peer Monitoring

Vaško, Martin · Brno University of Technology Digital Library (Brno University of Technology) · 2018

Cieľom tejto práce je monitorovanie peerov v rámci siete BitTorrent. Pozornosť sa upiera na distribuované hašovacie tabuľky, konkrétne MLDHT. V poslednej dekáde sa pozornosť zameriava aj na to, ako efektívne dokážeme v tejto sieti monitorovať. Existujúce algoritmy vôbec nezaisťujú aktuálnu efektivitu, a preto sa odporúča zaviesť odhad presnosti pomocou Bernoulliho procesu. Cieľom monitorovania je zaistiť čo najvyššiu úspešnosť vyhľadávania peerov. Práca sa venuje návrhom aplikácie a implementácií metód s modelom Bernoulliho procesu. Z meraní vyplýva, že prehľadávanie do hĺbky (LIFO) je lepšie z krátkodobého hľadiska. Experimenty sa venujú efektivite monitorovania v čase, odhadom chyby prehľadávania a efektivite modelovanej pomocou Bernoulliho procesu. Výsledkom práce je odporúčaná doba monitorovania s vysokou efektivitou.

Cited by 0

Norwegisches Fernsehen setzt auf eigenen Bittorrent-Tracker

Robert A. Gehring · Front Matter · 2009

Nach einem erfolgreichen Pilotprojekt zur Verbreitung von Fernsehsendungen über P2P-Netzwerke hat sich der öffentlich-rechtliche Rundfunk- und Fernsehsender Norwegens, Norsk Rikskringkasting AS (NRK, via Wikipedia), dazu entschlossen, einen eigenen BitTorrent-Tracker in Betrieb zu nehmen.

Cited by 0Open access

Norwegisches Fernsehen setzt auf eigenen Bittorrent-Tracker

Robert A. Gehring · Front Matter · 2009

Nach einem erfolgreichen Pilotprojekt zur Verbreitung von Fernsehsendungen über P2P-Netzwerke hat sich der öffentlich-rechtliche Rundfunk- und Fernsehsender Norwegens, Norsk Rikskringkasting AS (NRK, via Wikipedia), dazu entschlossen, einen eigenen BitTorrent-Tracker in Betrieb zu nehmen.

Cited by 0Open access

A multicast-anycast based protocol for trackerless BitTorrent

C. Taddia, G. Mazzini · 2008

We propose a new decentralized signaling protocol based on multicast and anycast communications, that substitutes the centralized tracker required by classic BitTorrent implementation. The proposed solution allows to fully exploit the decentralized data sharing among BitTorrent peers, by maintaining all its benefits, without the need of the centralized tracker, the main point of failure of the BitTorrent classic architecture.

Cited by 4

Abstract BitTorrent Architecture and Protocol

Ryan Toole, Vinod Vokkarane · 2006

BitTorrent is a new popular application layer network protocol used to distribute files. BitTorrent is efficient at content delivery by maximizing the upload utilization and by preventing unfairness. This paper discusses the BitTorrent architecture and protocol in great detail by discussing the tracker and all the messages sent between the peers and the tracker and also between peers and peers. Also this paper will describe how BitTorrent is efficient by looking at algorithms that decide which peers to upload to and which pieces of the file to download first.

Cited by 0

Really truly trackerless bittorrent

Charles P. Fry, Michael K. Reiter · 2006

BitTorrent is a peer-to-peer protocol used for collaborative downloading. It allows peers to exchange blocks of the file they are downloading with each other, rather then obtaining them from a central server. Despite the decentralized nature of the protocol, BitTorrent has traditionally relied on a centralized tracker, which bootstraps the system by providing new clients with a random set of peers. The tracker has previously been perceived as a critical part of BitTorrent systems, and efforts to make it more fault-tolerant have focused on tracker replication and on tracker implementations using Distributed Hash Tables, which have been entitled “Trackerless BitTorrent”. The tracker’s sole responsibility, whether implemented in a centralized or distributed manner, is to allow peers to randomly select other peers to connect to, in an effort to construct a robust graph. We propose completely removing the tracker and replacing it with a set of distributed protocols based on random walks, accomplishing the work of the tracker without explicitly tracking every peer in the system. We use expansion as a measure by which to compare the quality of the graphs generated by distributed, trackerless algorithms to the graphs generated by a centralized tracker. We also explore the implications of various design decisions related to the random walks which are the key component of our proposal. 1

Cited by 0

A Bittorrent-Driven Distributed Denial-Of-Service Attack

Harrington, Jerome, Kuwanoe, Corey, Zou, Cliff C. · Journal of International Crisis and Risk Communication Research · 2007

BitTorrent is a popular peer-to-peer file-sharing protocol that utilizes a central server, known as a "tracker", to coordinate connections between peers in a "swarm", a term used to describe a BitTorrent ad-hoc file sharing network. The tracker of a swarm is specified by the original file distributor and trusted unconditionally by peers in the swarm. This central point of control provides an opportunity for a file distributor to deploy a modified tracker to provide peers in a swarm with malicious coordination data, directing peer connection traffic toward an arbitrary target machine on an arbitrary service port. Although such an attack does not generate huge amount of attack traffic, it would set up many connections with the victim server successfully and hold these connections until time out, which could cause serious denial-of-service by exhausting a server's connection resource. In this paper, we present such an attack that is entirely tracker-based, requiring no modifications to BitTorrent client software and could be deployed by an attacker right now. The results from both simulation and real-world experiments show the applicability of this attack. Due to the skyrocketing popularity of BitTorrent and numerous large-scale swarms existed in the Internet, BitTorrent swarms provide an intriguing platform for launching distributed denial-of-service attacks based on connection exhaustion.

Cited by 0Open access

Peer-to-peer networks and their impact on the development of tne internet and information techologies

Poryev, G. V. · Institutional repository of Ivano-Frankivsk National Technical University of Oil and Gas (Ivano-Frankivsk National Technical University of Oil and Gas) · 2012

The historic conditions for the emergence of peer-to-peer networks are reviewed. The BitTorrent network
\narchitecture is analyzed, including the lifecycle of publication, load balancing techniques and tracker
\noperation specifics. New approach to increase the throughput of BitTorrent network based on the locality
\nclass metric estimation is proposed and experimentally validated

Cited by 0Open access

Distributed Content Dissemination with a Rank Function

Anna Kobusińska, Jerzy Brzeziński, Jakub Aftowicz et al. · 2016

BitTorrent protocol is widely used for file sharing in peer-to-peer systems. Also, many cloud environments utilizethis protocol. Despite many advantages, among which are goodscalability and performance, BitTorrent has also limitations. Toamend them, this paper proposes TManTorrent protocol - adistributed BitTorrent protocol, which replaces a tracker serverwith a gossiping mechanism, and promotes most appropriatenodes to cooperate with, during exchange of a required content. The paper includes results of simulation experiments, which confirm the efficiency of the proposed TManTorrent protocol.

Cited by 1

An Effective Network-Aware Peer Selection Algorithm in BitTorrent

Fenglin Qin, Ju Liu, Lina Zheng et al. · 2009

This paper presents an effective network-aware peer selection algorithm to alleviate the topology mismatch issue in BitTorrent. By utilizing the characteristic of hierarchical network topology, the Tracker in BitTorrent classifies the peers into three clusters: local, intra-ISP and inter-ISP clusters based on peers' traceroute results, and then chooses close peers within the first two clusters. Thus, the closeness among peers in BitTorrent can be enhanced. Experimental results show that, compared with standard BitTorrent, the proposed algorithm can achieve better download performance and greatly reduce both ISP's backbone traffic and the cross-ISP traffic.

Cited by 3

Ein BitTorrent Analyzer für das Bro NIDS

Nadi Sarrar, Bernhard Ager, Anja Feldmann · 2008

BitTorrent ist ein populares Peer-to-Peer-Protokoll zum Austausch von Dateien. Es ermoglicht eine breite Verteilung von grosen Datenmengen, wobei weder eine hohe Bandbreite noch kostenintensives Serverhosting notwendig sind. Diese Arbeit erklart die Funktionsweise von BitTorrent im Detail. BitTorrent besteht aus zwei Protokollen, einem fur Peer-to-Peer-Verbindungen und einem zur Kommunikation zwischen Peer und Tracker. Fur beide Protokolle haben wir Analyzer fur das Bro NIDS entwickelt, mit welchem wir zwei Mitschnitte des Munchner Hochschulnetzes, einem von 2005 und einem von 2007, analysiert haben. Die Ergebnisse dieser Analysen zeigen Ahnlichkeiten sowie Unterschiede.

Cited by 0

Unraveling the BitTorrent Ecosystem

Chao Zhang, Prithula Dhungel, Di Wu et al. · IEEE Transactions on Parallel and Distributed Systems · 2010

BitTorrent is the most successful open Internet application for content distribution. Despite its importance, both in terms of its footprint in the Internet and the influence it has on emerging P2P applications, the BitTorrent Ecosystem is only partially understood. We seek to provide a nearly complete picture of the entire public BitTorrent Ecosystem. To this end, we crawl five of the most popular torrent-discovery sites over a ine-month period, identifying all of 4.6 million and 38,996 trackers that the sites reference. We also develop a high-performance tracker crawler, and over a narrow window of 12 hours, crawl essentially all of the public Ecosystem's trackers, obtaining peer lists for all referenced torrents. Complementing the torrent-discovery site and tracker crawling, we further crawl Azureus and Mainline DHTs for a random sample of torrents. Our resulting measurement data are more than an order of magnitude larger (in terms of number of torrents, trackers, or peers) than any earlier study. Using this extensive data set, we study in-depth the Ecosystem's torrent-discovery, tracker, peer, user behavior, and content landscapes. For peer statistics, the analysis is based on one typical snapshot obtained over 12 hours. We further analyze the fragility of the Ecosystem upon the removal of its most important tracker service.

Cited by 138

BitTorious: global controlled genomics data publication, research and archiving via BitTorrent extensions

Preston Lee, Valentin Dinu · BMC Bioinformatics · 2014

The authorization-based extension of Bittorrent and accompanying BitTorious reference tracker and user management web portal provide a free, standards-based, general purpose and extensible data distribution system for large 'omics collaborations.

Cited by 4Open access

Understanding BitTorrent Through Real Measurements

Wojciech Mazurczyk, Paweł Kopiczko · arXiv (Cornell University) · 2011

In this paper the results of the BitTorrent measurement study are presented. Two sources of BitTorrent data were utilized: meta-data files that describe the content of resources shared by BitTorrent users and the logs of one of the currently most popular BitTorrent clients - μTorrent. μTorrent is founded upon a rather newly released UDP-based μTP protocol that is claimed to be more efficient than TCP-based clients. Experimental data have been collected for fifteen days from the popular torrent-discovery site thepiratebay.org (more than 30,000 torrents were captured and analyzed). During this period the activity and logs of an unmodified version of μTorrent client downloading sessions have been also captured. The obtained experimental results are swarm-oriented (not tracker-oriented as has been previously researched), which has allowed us to look at BitTorrent and its users from an exchanged resources perspective. Moreover, comparative analysis of the clients' connections with and without μTP protocol is carried out to verify to what extent μTP improves BitTorrent transmissions. To the authors' best knowledge, none of the previous studies have addressed these issues.

Cited by 0Open access

Distributed Algorithms for Improving BitTorrent Performance

György Dán, Viktória Fodor · 2010

Among the peer-to-peer systems, BitTorrent has attracted significant attention in research community because of its efficiency, scalability and robustness. BitTorrent utilizes peer contribution to distribute content by splitting the content into many pieces which can be transferred among peers. Unfortunately BitTorrent depends on trackers in order to let peers interested in same content discover each other. Trackers can be considered as a single point of failure and a bottleneck in terms of system scalability. The scalability and availability of the tracker can be improved by introducing multiple trackers, an extension that allows the co-existence of multiple swarms sharing the same content. Existence of multiple swarms that are not aware of each other may cause efficiency to degrade due to piece and bandwidth unavailability in small swarms. Swarm management algorithms therefore aim to increase the swarm sizes virtually at a low cost, consequently increasing piece availability and peer contribution for performance improvement. In this thesis we developed a framework for measuring the performance of swarm management algorithms in an experimental testbed. The testbed offers the opportunity to perform controlled experiments in different scenarios. An improved PEX protocol was also developed that takes swarm membership information of peers into account to utilize mixing among swarms. We modified an existing BitTorrent client to implement two swarm management algorithms, Random Peer Migration (RPM) and Random Multi Tracking (RMT) that introduce peers in different swarms to each other by leveraging the Peer Exchange (PEX) protocol. RPM achieves mixing through peers migrating between swarms. RMT allows some fraction of peers to associate with more than one tracker and mix peer information between swarms. We evaluated the performance of the two swarm management algorithms in torrents in which all swarms are in the steady state and have a publisher always available. The algorithms are estimated to improve the protocol performance around 5% in most scenarios whereas gain around 40% can be observed for small torrents. The algorithms are shown to improve BitTorrent performance without sacrificing the robustness and load balancing properties of the multi-tracker extension.

Cited by 0

The Lost Dream

A famous studios production · Bulletin of Miscellaneous Information (Royal Gardens Kew) · 1947

Little Audrey (1947) Animation, short Color USA Director: Bill Tytla Little Audrey is discovered reading by moonlight when she should be sleeping. She gets admonished that this will bring bad dreams. Want to share public domain movies?? Please visit my new bittorrent tracker called, VintageTorrents.com Thank you.. yogirajj@vintagetorrents.com

Cited by 0Open access

Asynchronous Covert Communication Using BitTorrent Trackers

Mathieu Cunche, Mohamed Ali Kâafar, Roksana Boreli · HAL (Le Centre pour la Communication Scientifique Directe) · 2014

Covert channels enable communicating parties to exchange messages without being detected by an external observer. In this paper we propose a novel covert channel mechanism based on BitTorrent trackers. The proposed mechanism uses common HTTP commands, thus having the appearance of genuine web traffic and consists of communications that are both indirect and asynchronous: no messages are directly exchanged between the sender and the receiver (of covert communications) and there is a potentially considerable delay between the sender's message to the relaying party and the receiver collecting this message. We present details of the proposed scheme in which a centralized BitTorrent tracker is used for storing covert messages and evaluate its performance based on the implemented prototype. We analyze the detectability of covert communications by an adversary and show that, while the common nature of the BitTorrent traffic and the large number of clients make the detection unlikely, the low temporal correlation between the writer and the reader (the two communicating parties) further increases the detection difficulty. Finally we discuss a variant of our scheme that uses a decentralized tracker (based on distributed hash tables), increasing the scalability and enabling a larger number of parallel covert communication channels.

Cited by 1Open access

Parallel Downloading Algorithm for Large-volume File Distribution

Haitao Chen, Zhenghu Gong, Zunguo Huang · 2005

BitTorrent is a popular, open-source content distribution system that is conducive for distribution of large-volume files. In this paper, we first model the parallel downloading problem as directed graph and discuss possible improving directions. Then a smart connection management algorithm is proposed, which introduces the notion of content group and sub-tracker, and decentralizes the decision process performed at the tracker for transfer coordination. Simulations show that by increasing content availability to the clients from their immediate neighbors, it can significantly improve the efficiency of distribution.

Cited by 3

The BitTorrent Peer Collector Problem

Andri Lareida, Tobias Hoßfeld, Burkhard Stiller · 2017

Peer-to-Peer (P2P) systems measurements are still a relevant research topic, since insights in large swarm sizes and churn are not yet available for the BitTorrent network. To improve existing measurement methodology, this work here tackles the aspect of swarm size estimation and complete collection in the BitTorrent network. For this purpose the Coupon Collector Problem is modified and formulated as the BitTorrent Peer Collector (BTPC) Problem. Thus, (a) simulations are used to test simple and maximum likelihood estimation for hidden swarm sizes, (b) an analytical solution to the BTPC problem is presented, and (c) measurements are used to evaluate estimators of the BTPC model. Obtained results show that this estimation works well for classical trackers and that churn constantly influences measurements. Those results show that more peers use the Main-line DHT than a single tracker, however, client implementations challenge those models working well for trackers.

Cited by 8