Academic
Publications
Connectivity Properties of Mainline BitTorrent DHT Nodes

Connectivity Properties of Mainline BitTorrent DHT Nodes,10.1109/P2P.2009.5284530,Raúl Jiménez,Flutra Osmani,Björn Knutsson

Connectivity Properties of Mainline BitTorrent DHT Nodes   (Citations: 7)
BibTex | RIS | RefWorks Download
The birth and evolution of peer-to-peer (P2P) protocols have, for the most part, been about peer discovery. Napster, one of the first P2P protocols, was basically FTP/HTTP plus a way of finding hosts willing to send you the file. Since then, both the transfer and peer discovery mechanisms have improved, but only recently have we seen a real push to completely decentralized peer discovery to increase scalability and resilience. Most such efforts are based on distributed hash tables (DHTs), with Kademlia being a popular choice of DHT implementation. While sound in theory, and performing well in simulators and testbeds, the real-world performance often falls short of expectations. Our hypothesis is that the connectivity artifacts caused by guarded hosts (i.e., hosts behind firewalls and NATs) are the major cause for such poor performance. In this paper, the first steps towards testing this hypothesis are developed. First, we present a taxonomy of connectivity properties which will become the language used to accurately describe connectivity artifacts. Second, based on experiments "in the wild", we analyze the connectivity properties of over 3 million hosts. Finally, we match those properties to guarded host behavior and identify the potential effects on the DHT.
Conference: Peer-to-Peer Computing - P2P , pp. 262-270, 2009
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...In particular, we implement the quarantine mechanism we previously proposed [16] where nodes are only added to the routing table after a 3 minute period...
    • ...In previous work [16], we characterized these connectivity artifacts and proposed mechanisms to identify and filter out nodes with connectivity issues...

    Raul Jimenezet al. Sub-second lookups on a large-scale Kademlia-based overlay

    • ...However, while most other studies focus on analyzing a single aspect such as churn [24], [28], peer connectivity [10], [27], or lookup performance [7], [12], [25], we aim at giving a consistent view on multiple aspects relevant to the use case of a basic DHT service...
    • ...In [10], the connectivity properties of peers within the Bit-...
    • ...For measuring the number of guarded hosts we used a similar experiment design as described in [10]: our measurement engine had access to 3 different UDP sockets A1, A2 and B, where A1 and A2 were bound to the same IP address, but different ports...
    • ...The found amount of peers behind NAT gateways (IP and IP AND PORT category) matches very well the observations made in [10]...
    • ...In [10] some more recommendations for dealing with guarded hosts are given...

    Konrad Junemannet al. Towards a Basic DHT Service: Analyzing Network Characteristics of a Wi...

    • ...[13] crawled in the DHT of the mainline bittorrent, and focus on the connectivity among the DHT nodes...

    Mo Zhouet al. Overlay networks measurement for resource indexing under different rou...

    • ...Detailed information of Mainline can be found in [2]...

    Jie Yuet al. Toward an Accurate Snapshot of DHT Networks

    • ...It is shown that the more peers behind NATs, the more unfair the system is. According to [5], another result related to BitTorrent is that NAT devices are responsible for the poor performance of DHTs as “DNS” for torrents...

    John Ardeliuset al. Modeling the Performance of Ring Based DHTs in the Presence of Network...

Sort by: