Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Best effort (réseau)

Publications associées (20)

Verification of Software Network Functions with No Verification Expertise

Arseniy Zaostrovnykh

Software network functions (NFs), such as a network address translator, load balancer, or proxy, promise to bring flexibility and rapid innovation to computer networks and to reduce operational costs. However, continuous updates and flexibility typically c ...

EPFL2020

Mitigating Load Imbalance in Distributed Data Serving with Rack-Scale Memory Pooling

Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic, Dmitrii Ustiugov

To provide low-latency and high-throughput guarantees, most large key-value stores keep the data in the memory of many servers. Despite the natural parallelism across lookups, the load imbalance, introduced by heavy skew in the popularity distribution of k ...

2019

Improved Utility-based Congestion Control for Low-Delay Communication

Pascal Frossard, Laura Toni, Sergio Mena, Stefano D'Aronco

Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to prope ...

Ieee-Inst Electrical Electronics Engineers Inc2017

iPRP - the Parallel Redundancy Protocol for IP Networks: Protocol Design and Operation

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Maaz Mashood Mohiuddin, Miroslav Popovic

Reliable packet delivery within stringent delay-constraints is of paramount importance to mission-critical computer applications with hard real-time constraints. Because retransmission and coding techniques counteract the delay requirements, reliability ma ...

Institute of Electrical and Electronics Engineers2016

The Case for RackOut: Scalable Data Serving Using Rack-Scale Systems

Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic

To provide low latency and high throughput guarantees, most large key-value stores keep the data in the memory of many servers. Despite the natural parallelism across lookups, the load imbalance, introduced by heavy skew in the popularity distribution of k ...

2016

Measuring, Modeling and Enhancing Power-Line Communications

Christina Vlachou

Power-line communication (PLC) is a technology that has become very popular, as it offers easy and high-throughput connectivity in local networks. Although it is widely adopted in hybrid PLC/WiFi networks and commercially successful, PLC has received littl ...

EPFL2016

Redundancy in Communication Networks for Smart Grids

Miroslav Popovic

Traditional electric power grids are currently undergoing fundamental changes: Representative examples are the increase in the penetration of volatile and decentralized renewable-energy sources and the emerging distributed energy-storage systems. These cha ...

EPFL2016

iPRP: Parallel Redundancy Protocol for IP Networks

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Maaz Mashood Mohiuddin, Miroslav Popovic

Reliable packet delivery within stringent delay constraints is of primal importance to industrial processes with hard real-time constraints, such as electrical grid monitoring. Because retransmission and coding techniques counteract the delay requirements, ...

2015

Adaptive Prioritized Random Linear Coding and Scheduling for Layered Data Delivery from Multiple Servers

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

In this paper, we deal with the problem of jointly determining the optimal coding strategy and the scheduling decisions when receivers obtain layered data from multiple servers. The layered data is encoded by means of prioritized random linear coding (PRLC ...

Ieee-Inst Electrical Electronics Engineers Inc2015

On the impact of link faults on Byzantine agreement

Martin Biely

Agreement problems and their solutions are essential to fault-tolerant distributed computing. Over the years, different assumptions on failures have been considered, but most of these assumptions were focusing on either processes or links. In contrast, we ...

Academic Press Inc Elsevier Science2014

Field effect modulated nanofluidic diode membrane based on Al2O3/W heterogeneous nanopore arrays

Jürgen Brugger, Philippe Renaud, Arnaud Bertsch, Songmei Wu, Fabien Patrick Wildhaber

We developed Al2O3/W heterogeneous nanopore arrays for field effect modulated nanofluidic diodes. They are fabricated by transferring self-organized nanopores of anodic aluminium oxide into a W thin film. The nanopores are ∼20 nm in diameter and 400 nm in ...

American Institute of Physics2013

Multi-Graph Regularization For Efficient Delivery Of User Generated Content In Online Social Networks

We present a methodology for enhancing the delivery of user-generated content in online social networks. To this end, we first regularize the social graph via node capacity and link cost information associated with the underlying data network. We then desi ...

2011

Network coding node placement for delay minimization in streaming overlays

Pascal Frossard, Nikolaos Thomos

Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and e ...

2010

Mobility-Centric Geocasting For Mobile Partitioned Networks

We describe our design of a geocast service for mobile partitioned networks (MPNs). We focus mainly on minimizing the delivery latency. Our approach exploits the time-stability of the collective mobility pattern. In MPNs, in contrast to MANETs, the end-to- ...

IEEE2008

Balanced multiple description coding in image communications

Ivana Radulovic

Latest developments in video coding technology on one side, and a continuous growth in size and bandwidth in lossy networks on the other side, have undoubtedly created a whole new world of multimedia communications. However, nowadays networks, which are be ...

EPFL2008

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...

2007

The Perfectly-Synchronized Round-based Model of Distributed Computing

Rachid Guerraoui, Bastian Pochon

The perfectly-synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy.We describe a technique to automatically transform ...

2007

Diversity-Multiplexing-Delay Tradeoff in Half-Duplex ARQ Relay Channels

Sanket Dusad, Tarik Tabet

In this paper, we present an efficient protocol for the delay-limited fading ARQ single relay half duplex channel. The source is using an ARQ retransmission protocol to send data to the relay and the destination. When the relay is able to decode, both the ...

2007

Packet Media Streaming with Imprecise Rate Estimation

Pascal Frossard, Dan Jurca

We address the problem of delay-constrained streaming of multimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, acc ...

2007

Achievable Diversity-Multiplexing-Delay Tradeoff in Half-Duplex ARQ Relay Channels

Sanket Dusad, Tarik Tabet

In this paper, we present an efficient protocol for the delay-limited fading Automatic Retransmission reQuest single relay channel. The source is using an ARQ retransmission protocol to send data to the relay and the destination. When the relay is able to ...

2005