Concept

Darknet

Related publications (15)

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.

Extending R2P2 with Congestion Control and Request-Level Scheduling

Konstantinos Prasopoulos

Distributed low-latency datacenter applications must meet strict service-level objectives in the order of microseconds. R2P2 is a novel datacenter transport protocol designed for such services. This work extends R2P2 with congestion control and request-lev ...

2020

Riffle: An Efficient Communication System With Strong Anonymity

Bryan Alexander Ford, David Lazar

Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on ...

2016

Towards Unconditional Tor-Like Anonymity

Christina Fragouli, László Czap, Iris Safaka

We design and evaluate a traffic anonymization protocol for wireless networks, aiming to protect against computationally powerful adversaries. Our protocol builds on recent key-generation techniques, that leverage intrinsic properties of the wireless toget ...

2015

Scalable Video Dissemination with Prioritized Network Coding

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

In this paper, we present a pull-based dissemination protocol for efficient distribution of scalable video content in overlay peer-to-peer networks with mesh structures. The proposed protocol employs prioritized network coding, where the network coded pack ...

2011

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

On Routing in Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm, Sarunas Girdzijauskas

There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allo ...

2007

UniStore: Querying a DHT-based Universal Storage

Manfred Hauswirth, Roman Schmidt, Renault John Lecoultre, Jessica Müller

In recent time, the idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However ...

2006

Self-organizing structured peer-to-peer overlay networks

A peer-to-peer overlay network is a logical network, built on top of a physical network. In contrast to classical client-server distributed architectures, peer-to-peer overlay networks allow location of resources without centralized control. Existing overl ...

EPFL2006

Principles of Query-Adaptive Optimal Replication in DHTs

Karl Aberer, Anwitaman Datta, Wolfgang Nejdl

This paper focuses on replication in DHT based structured overlay networks, and presents a theoretical framework for optimal replication in such networks with respect to query frequency. In particular, we determine the optimal replication factor for query- ...

2004

Bullet: high bandwidth data dissemination using an overlay mesh

Dejan Kostic

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 ...

2003