When KAD Meets BitTorrent - Building a Stronger P2P Network

Timpanaro, Juan Pablo; Cholez, Thibault; Chrisment, Isabelle; Festor, Olivier

doi:10.1109/ipdps.2011.318

Cited by 4 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our previous work [9] we show that eMule/aMule clients stay connected for longer periods of time, on the contrary to BitTorrent users. This behaviour is not seen in this case, most likely due to the fact that for I2PSnark or IMule applications to run, an I2P user needs to have a running I2P router.…”

Section: Correlation Between File-sharing Applicationsmentioning

confidence: 79%

A Bird’s Eye View on the I2P Anonymous File-Sharing Environment

Timpanaro

Chrisment

Festor

2012

Network and System Security

Self Cite

View full text Add to dashboard Cite

Abstract. Anonymous communications have been gaining more and more interest from Internet users as privacy and anonymity problems have emerged. Among anonymous enabled services, anonymous file-sharing is one of the most active one and is increasingly growing. Large scale monitoring on these systems allows us to grasp how they behave, which type of data is shared among users, the overall behaviour in the system. But does large scale monitoring jeopardize the system anonymity? In this work we present the first large scale monitoring architecture and experiments on the I2P network, a low-latency message-oriented anonymous network. We characterize the file-sharing environment within I2P, and evaluate if this monitoring affects the anonymity provided by the network. We show that most activities within the network are file-sharing oriented, along with anonymous web-hosting. We assess the wide geographical location of nodes and network popularity. We also demonstrate that group-based profiling is feasible on this particular network.

show abstract

Section: Correlation Between File-sharing Applicationsmentioning

confidence: 79%

A Bird’s Eye View on the I2P Anonymous File-Sharing Environment

Timpanaro

Chrisment

Festor

2012

Network and System Security

Self Cite

View full text Add to dashboard Cite

show abstract

“…KAD does not suffer from this problem because its population is well balanced between Europe and China. However, we present in Figure 14 the results of a previous experiment [TCCF11] measuring the size of two DHTs during a few days and they show that the population of BitTorrent's Mainline DHT can be divided by two during a day. A periodic computation of the detection window would improve the accuracy of our detection.…”

Section: Feedback On Implementationsmentioning

confidence: 94%

Detection and mitigation of localized attacks in a widely deployed P2P network

Cholez

Chrisment

Festor

et al. 2012

Peer-to-Peer Netw. Appl.

Self Cite

View full text Add to dashboard Cite

Several large scale P2P networks operating on the Internet are based on a Distributed Hash Table. These networks offer valuable services, but they all suffer from a critical issue allowing malicious nodes to be inserted in specific places on the DHT for undesirable purposes (monitoring, distributed denial of service, pollution, etc.). While several attacks and attack scenarios have been documented, few studies have measured the actual deployment of such attacks and none of the documented countermeasures have been tested for compatibility with an already deployed network. In this article, we focus on the KAD network. Based on large scale monitoring campaigns, we show that the world-wide deployed KAD network suffers large number of suspicious insertions around shared contents and we quantify them. To cope with these peers, we propose a new efficient protection algorithm based on analyzing the distribution of the peers' ID found around an entry after a DHT lookup. We evaluate our solution and show that it detects the most efficient configurations of inserted peers with a very small false-negative rate, and that the countermeasures successfully filter almost all the suspicious peers. We demonstrate the direct applicability of our approach by implementing and testing our solution in real P2P networks.The final publication is available at http://link.springer.com/article/10. 1007%2Fs12083-012-0137-7.

show abstract

“…The researchers used DHT Pastry to provide the current sensor data; however, their PAST also can access historical sensor values. The applications of distributed systems using DHT include vehicular ad hoc network [10], peer-to-peer data sharing networks [11], web caching [12], instant messaging, and many others.…”

Section: Literature Overviewmentioning

confidence: 99%

Decentralization of a Multi Data Source Distributed Processing System Using a Distributed Hash Table

Chmaj

Latifi

2013

IJCNS

View full text Add to dashboard Cite

A distributed processing system (DPS) contains many autonomous nodes, which contribute their own computing power. DPS is considered a unified logical structure, operating in a distributed manner; the processing tasks are divided into fragments and assigned to various nodes for processing. That type of operation requires and involves a great deal of communication. We propose to use the decentralized approach, based on a distributed hash table, to reduce the communication overhead and remove the server unit, thus avoiding having a single point of failure in the system. This paper proposes a mathematical model and algorithms that are implemented in a dedicated experimental system. Using the decentralized approach, this study demonstrates the efficient operation of a decentralized system which results in a reduced energy emission.

show abstract

When KAD Meets BitTorrent - Building a Stronger P2P Network

Cited by 4 publications

References 18 publications

A Bird’s Eye View on the I2P Anonymous File-Sharing Environment

A Bird’s Eye View on the I2P Anonymous File-Sharing Environment

Detection and mitigation of localized attacks in a widely deployed P2P network

Decentralization of a Multi Data Source Distributed Processing System Using a Distributed Hash Table

Contact Info

Product

Resources

About