Section: New Results
Peer-to-peer systems conception
It was recently observed that the user interests in P2P systems possess clustering properties that can be used to reduce the amount of traffic of flooding-based search strategies. Another observation shows that scale-free properties that can be used for the design of routing-based search strategies. In these papers, we show that the combination of these two properties enables the design of an efficient and simple fully decentralized search strategy. This search strategy is simple because it does not require maintaining any structured overlay network topology connecting the peers. It is efficient because that simulations processed on real-world traces show that the expected number of steps of the lookups is logarithmic in function of the size of the network.
Rechercher parmi ses pairs ou quand le hasard ne fait pas si bien les choses, tutoriel
This tutorial focus on data-search in large-scale distributed systems. We present the peer-to-peer systems and the search algorithms they use. These systems have several common properties with interaction networks, which are studied in a lot of disciplines. We show that these properties are linked to the application. We then see how to use them to design efficient peer-to-peer systems.
D2B: a de Bruijn Based Content-Addressable Network
D2B is a peer-to-peer system based on a Distributed Hash Table (DHT). DHTs allow to design large-scale distributed systems for which properties like degree and diameter can be proved. D2B uses the De Bruijn topology to route in a logarithmic number of steps in function of the number of users in the peer-to-peer system. The degree of D2B is constant in average and it is logarithmic with high probability.