Publication

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.

Connectez-vous pour utiliser Chat avec Graph Search

Self-organized fault-tolerant routing in peer-to-peer overlays

Karl Aberer, Wojciech Galuba, Zoran Despotovic

In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and d ...

IEEE2009

Game Theory Video Streaming

Mahdad Hosseini Kamal

We consider the problem of peer selection for multimedia trans- mission over a peer-to-peer (P2P) network to find a strategy model for peer selection for each lost packet. Our problem consists of two parts one related to the P2P network that is a peer sele ...

2009

CrystalBall: Predicting and Preventing Inconsistencies in Deployed Distributed Systems

Viktor Kuncak, Dejan Kostic, Maysam Yabandeh, Nikola Knezevic

We propose a new approach for developing and deploying distributed systems, in which nodes predict distributed consequences of their actions, and use this information to detect and avoid errors. Each node continuously runs a state exploration algorithm on ...

2009

Optimal Filtering of Source Address Prefixes: Models and Algorithms

How can we protect the network infrastructure from malicious traffic, such as scanning, malicious code propagation, and distributed denial-of-service (DDoS) attacks? One mechanism for blocking malicious traffic is filtering: access control lists (ACLs) can ...

2009

Fuzzynet: Zero-maintenance Ringless Overlay

Karl Aberer, Anwitaman Datta, Wojciech Galuba, Sarunas Girdzijauskas

Many structured overlay networks rely on a ring invariant as a core network connectivity element. The responsibility ranges of the participating peers and navigability principles (greedy routing) heavily depend on the ring structure. For correctness guaran ...

2008

Sharing of probabilistically correlated data in peer-to-peer networks

Roman Schmidt

The impact of Peer-to-Peer (P2P) networks on the Internet landscape is undisputed. It has led to a series of new applications, e.g., as part of the so-called Web 2.0. The shift from the classical client-server based paradigm of the Internet, with a clear d ...

EPFL2008

User-level Internet tomography and overlay routing

Xuan Hung Nguyen

In this thesis, we study methods to detect, localize and overcome performance problems experienced by end-users in communication networks. These problems are extremely difficult to solve when the only available information are end-to-end data. We first con ...

EPFL2008

AlvisP2P: Scalable Peer-to-Peer Text Retrieval in a Structured P2P Network

Karl Aberer, Martin Rajman, Vinh Toan Luu, Ivana Podnar, Fabius Klemm, Gleb Skobeltsyn

In this paper we present the AlvisP2P IR engine, which enables efficient retrieval with multi-keyword queries from a global document collection available in a P2P network. In such a network, each peer publishes its local index and invests a part of its loc ...

2008

Distributed optimization of media flows in peer-to-peer overlay networks

We consider the problem of rate-distortion (RD) optimized media streaming in unstructured peer-to-peer (P2P) overlay networks. We formulate the aforementioned problem as a distributed rate allocation problem. To solve the problem for all the participating ...

2008

Hybrid DHT Design for Mobile Environments

Simon Schubert, Zoran Despotovic

In this paper we present a hybrid design concept for Distributed Hash Tables (DHTs), in order to increase the performance of DHTs in scenarios with mobile participants. By defining two classes of nodes (static and temporary) and assigning critical overlay ...

Springer-Verlag2008