Concept

I2P

Related publications (105)

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

di-jest: Autonomic neighbour management for worm resilience in p2p systems

Micaël Paquier

Internet worms pose a serious and ongoing threat to system security, often resulting in significant service downtime and disruption. In recent years peer-to-peer (p2p) networks have become a target for the deployment of worms as their high connectivity all ...

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

Extending Peer-to-Peer Networks for Approximate Search

Ion Constantinescu, Michael Ignaz Schumacher, Roman Schmidt, Alain Mowat

Peer-to-Peer (P2P) networks are used worldwide for many applications such as file sharing or news servers. There are many different implementations available, each with its pros and cons. In this paper, we propose a way to enable approximate queries in a P ...

2008

A Hybrid Peer-to-Peer and Grid Job Scheduling System for Teaming Up Desktop Resources with Computer Clusters to Perform Turbulence Simulations

Tobias Schneider

Simulating turbulence in fluids is a fascinating part of physics which requires a high amount of computational power. Since for transitional Reynolds numbers each simulation run can be performed on a single contemporary CPU, turbulence studies are ideally ...

IEEE2008

Towards ACPeer: an Access Control aware P2P System

P2P data management systems provide a scalable alternative to centralized architectures. Their adoption, however, is limited by the lack of possibility to control the access on the resources stored in the system. We address the problem of access control fo ...

2008

How robust are gossip-based communication protocols?

Rachid Guerraoui

Gossip-based communication protocols are often touted as being robust. Not surprisingly, such a claim relies on assumptions under which gossip protocols are supposed to operate. In this paper, we discuss and in some cases expose some of these assumptions a ...

2007

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Christina Fragouli, Suhas Diggavi

The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic id ...

2007

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

2007

Message Passing in Semantic Peer-to-Peer Overlay Networks

Karl Aberer, Philippe Cudré-Mauroux

Peer-to-Peer (P2P) systems rely on machine-to-machine ad-hoc communications to offer services to a community. Contrary to the classical client-server architecture, P2P systems consider all peers, i.e., all nodes participating in the network, as being equal ...

2007

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.