Efficient, self-contained handling of identity in Peer-to-Peer systems
Publications associées (72)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participants. Key to this approach is ensuring that membership in the subset changes per ...
This thesis describes the Peer-to-Peer Application Gridella. The decentralized architecture of P2P systems enables each peer to fulfill search requests solely by local interactions. The system described in this thesis scales to high numbers of peers and da ...
In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes self-organize with the goal of forming an efficient overlay tree, one that meets pe ...
In this thesis we study two routing problems related to mobility. The first problem concerns scalable multicast routing when there is a large number of multicast groups with a small number of receivers. Existing dense and sparse mode routing protocols have ...
This paper describes our Gnutella compatible P2P system Gridella which is based on the P-Grid approach. P-Grid has several advantages over the standard Gnutella infrastructure, for example, that probabilistic estimates can be given for successful search re ...
In this paper we study the problem of updates in truly decentralised and self-organising systems such as pure P2P systems. We assume low online probabilities of the peers (
Leveraged by the success of applications aiming at the ``free'' sharing of data in the Internet, the paradigm of peer-to-peer (P2P) computing has been devoted substantial consideration recently. This paper presents an abstraction for remote object interact ...
The literature contains propositions for the use of overlay networks to supplement the normal IP routing functions with higher-level information in order to improve aspects of network behavior. We consider the use of such an overlay to optimize the end-to- ...
The P-Grid approach enables distributed search and replication. Gridella, a P2P system based on P-Grid, improves on Gnutella’s search performance while reducing bandwidth requirements. Fu ...
This paper provides a quantative comparison of the efficiency of the self-organized construction processes of the P-Grid and FreeNet peer-to-peer systems. Starting from a defined, realistic network topology we simulate the construction of their access stru ...