Unit

Network Architecture Laboratory

Laboratory

Related publications (54)

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.

Software Dataplane Verification

Mihai Dobrescu

The industry is in the mood for programmable networks, where an operator can dynamically deploy network functions on network devices, akin to how one deploys virtual machines on physical machines in a cloud environment. Such flexibility brings along the th ...

Association for Computing Machinery2015

Network Neutrality Inference

Ovidiu Sebastian Mara, Zhiyong Zhang

When can we reason about the neutrality of a network based on external observations? We prove conditions under which it is possible to (a) detect neutrality violations and (b) localize them to specific links, based on external observations. Our insight is ...

2014

Network Neutrality Inference

Ovidiu Sebastian Mara, Zhiyong Zhang

2014

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

Exchanging Pairwise Secrets Efficiently

Christina Fragouli, Suhas Diggavi, Iris Safaka

We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...

Institute of Electrical and Electronics Engineers Inc.2013

Toward Predictable Performance in Software Packet-Processing Platforms

Mihai Dobrescu

To become a credible alternative to specialized hardware, general-purpose networking needs to offer not only flexibility, but also predictable performance. Recent projects have demonstrated that general-purpose multicore hardware is capable of high-perform ...

2012

Network Coding

Mahdi Jafari Siavoshani

The demand for higher throughput and better efficiency are two important challenges for future communication networks. During the past decades, a lot of research studies have been devoted to investigating and proposing near optimal and efficient schemes an ...

EPFL2012

A NICE Way to Test OpenFlow Applications

Dejan Kostic, Marco Canini, Peter Peresini, Jennifer Rexford

The emergence of OpenFlow-capable switches enables exciting new network functionality, at the risk of programming errors that make communication less reliable. The centralized programming model, where a single controller program manages the network, seems ...

2012

Creating Shared Secrets out of Thin Air

Christina Fragouli, Suhas Diggavi, Iris Safaka

Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind ...

Assoc Computing Machinery2012