Publication

Software Dataplane Verification

Related publications (20)

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.

Network Tomography on Correlated Links

Patrick Thiran, Denisa Gabriela Ghita

Network tomography establishes linear relationships between the characteristics of individual links and those of end-to-end paths. It has been proved that these relationships can be used to infer the characteristics of links from end-to-end measurements, p ...

2010

Castor: Scalable Secure Routing for Ad Hoc Networks

Karl Aberer, Panagiotis Papadimitratos, Marcin Poturalski, Wojciech Galuba, Zoran Despotovic

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that ad ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

More on Castor: the Scalable Secure Routing for Ad-hoc Networks

Karl Aberer, Panagiotis Papadimitratos, Marcin Poturalski, Wojciech Galuba, Zoran Despotovic

2009

Optimizing network performance in virtual machines

Aravind Menon

In recent years, there has been a rapid growth in the adoption of virtual machine technology in data centers and cluster environments. This trend towards server virtualization is driven by two main factors: the savings in hardware cost that can be achieved ...

EPFL2009

Multi-hop Broadcast from Theory to Reality: Practical Design for Ad Hoc Networks

Jean-Yves Le Boudec, Alaeddine El Fawal

We propose a complete design for a scope limited, multi-hop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networks such as a crowd in a city, or car passengers in a busy highway system. We ...

2007

MAC layer functions for SLEF

Alaeddine El Fawal, Lorenzo Keller

We develop three functions around the MAC layer: (1) Pseudo broadcast is a technique used to improve throughput of broadcast transmissions in case of congested networks. The mechanism consists in sending a packet in unicast to a station using RTS/CTS. Othe ...

2006

Packet Combining in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

This paper presents the Simple Packet Combining (SPaC) error-correction scheme for wireless sensor networks. Nodes buffer corrupt packets, and when two or more corrupt versions of a packet have been received, a packet combining procedure attempts to recove ...

2005

Poster: Contention-based distance-vector routing for mobile ad-hoc networks

Jörg Widmer

Position-based routing protocols forward packets in a greedy manner from source to destination without having to maintain routes through the network. Contention-based routing strategies improve upon position-based routing in that they do not even require t ...

2004

Scalable routing protocols with applications to mobility

Ljubica Blazevic

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

EPFL2002

Asymmetric Best Effort Service for Packet Networks

Jean-Yves Le Boudec, Patrick Thiran, Ljubica Blazevic

We present Asymmetric Best-Effort, a novel service to provide a throughput versus delay jitter differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-t ...

1998