Publications associées à Best effort (réseau)

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

Near-optimal Deployment of Dataflow Applications on Many-core Platforms with Real-time Guarantees

Alena Simalatsar, Stefanos Skalistis

Safe and optimal deployment of data-streaming applications on many-core platforms requires the realistic estimation of task Worst-Case Execution Time (WCET). On the other hand, task WCET depends on the deployment solution, due to the varying number of inte ...

IEEE2017

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

Jean-Yves Le Boudec, Dan-Cristian Tomozei, 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

iPRP: Parallel Redundancy Protocol for IP Networks

Jean-Yves Le Boudec, Dan-Cristian Tomozei, 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

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Best effort (réseau)

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

Timely Updates over an Erasure Channel

Improved Utility-based Congestion Control for Low-Delay Communication

Near-optimal Deployment of Dataflow Applications on Many-core Platforms with Real-time Guarantees

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

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

Measuring, Modeling and Enhancing Power-Line Communications

iPRP: Parallel Redundancy Protocol for IP Networks

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

On the impact of link faults on Byzantine agreement

Graph Chatbot

Chattez avec Graph Search

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

Measuring, Modeling and Enhancing Power-Line Communications

iPRP: Parallel Redundancy Protocol for IP Networks

Improved Utility-based Congestion Control for Low-Delay Communication

Near-optimal Deployment of Dataflow Applications on Many-core Platforms with Real-time Guarantees

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

On the impact of link faults on Byzantine agreement

Timely Updates over an Erasure Channel

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

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