I2P

Résumé

I2P (« Invisible Internet Project ») est un réseau anonyme, offrant une simple couche réseau logicielle de type réseau overlay, que les applications peuvent employer pour envoyer de façon anonyme et sécurisée des informations entre elles. La communication est chiffrée de bout en bout. Au total, quatre couches de chiffrement sont utilisées pour envoyer un message. L'anonymat est assuré par le concept de « mix network » qui consiste à supprimer les connexions directes entre les pairs qui souhaitent échanger de l'information. À la place le trafic passe par une série d'autres pairs de façon qu'un observateur ne puisse déterminer qui est l'expéditeur initial et qui est le destinataire final de l'information. Chaque pair peut, à sa décharge, dire que les données ne lui étaient pas destinées. Sur Internet, on identifie un destinataire avec une adresse IP et un port. Cette adresse IP correspond à une interface physique (modem ou routeur, serveur, etc.). Mais, sur I2P, on identifie un destina

Source officielle

https://fr.wikipedia.org/wiki/I2P

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (19)

Publications associées

Chargement

Personnes associées (3)

, ,

Personnes associées

Chargement

Unités associées (2)

Unités associées

Chargement

Concepts associés (24)

Concepts associés

Chargement

Cours associés (2)

Cours associés

Chargement

Séances de cours associées (2)

Séances de cours associées

Chargement

Sampling Cluster Endurance for Peer-to-Peer based Content Distribution Networks

Several types of Content Distribution Networks are being deployed over the Internet today, based on different architectures to meet their requirements (e.g., scalability, efficiency and resiliency). Peer-to-peer (P2P) based Content Distribution Networks are promising approaches that have several advantages. Structured P2P networks, for instance, take a proactive approach and provide efficient routing mechanisms. Nevertheless, their maintenance can increase considerably in highly dynamic P2P environments. In order to address this issue, a two-tier architecture called Omicron that combines a structured overlay network with a clustering mechanism is suggested in a hybrid scheme. In this paper, we examine several sampling algorithms utilized in the aforementioned hybrid network that collect local information in order to apply a selective join procedure. Additionally, we apply the sampling algorithms on Chord in order to evaluate sampling as a general information gathering mechanism. The algorithms are based mostly on random walks inside the overlay networks. The aim of the selective join procedure is to provide a well balanced and stable overlay infrastructure that can easily overcome the unreliable behavior of the autonomous peers that constitute the network. The sampling algorithms are evaluated using simulation experiments as well as probabilistic analysis where several properties related to the graph structure are revealed.

2007

Chargement

Peer-to-Peer Applications Beyond File Sharing: Overlay Network Requirements and Solutions

In this paper we analyze the functional and non-functional requirements of peer-to-peer (P2P) systems that go beyond the needs of the well explored file-sharing P2P systems. Four basic subcategories are suggested to classify the non-functional requirements: adaptability, efficiency, validity and trust. Similarly, the functional requirements are divided into user-triggered and system-triggered functions. Then, we present and discuss several existing solutions following different design approaches in order to reveal their suitability for different types of P2P applications. More particularly, we capture the characteristics of structured and unstructured overlay networks. For the structured solutions, we investigate distributed hash tables and lexicographic graph based solutions. For the unstructured approaches, we discuss both hierarchical and non-hierarchical overlay networks and emphasize on small-world and power-law networks. Finally, we provide a set of demanding application classes such as voice over IP and massive multiplayer online games that may be benefited by utilizing the P2P technology.

2006

Chargement

Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Internet. The key idea is to divide the file into many equally-sized parts and then let users download each part (or, for network coding based systems such as Avalanche, linear combinations of the parts) either from the server or from another user who has already downloaded it. However, their performance evaluation has typically been limited to comparing one system relative to another and typically been realized by means of simulation and measurements. By contrast, we provide an analytic performance analysis that is based on a new uplink-sharing version of the well-known broadcasting problem. Assuming equal upload capacities, we show that the minimal time to disseminate the file is the same as for the simultaneous send/receive version of the broadcasting problem. For general upload capacities, we provide a mixed integer linear program (MILP) solution and a complementary fluid limit solution. We thus provide a lower bound which can be used as a performance benchmark for any P2P file dissemination system. We also investigate the performance of a decentralized strategy, providing evidence that the performance of necessarily decentralized P2P file dissemination systems should be close to this bound and therefore that it is useful in practice.

2007

Chargement