Publication

A Bayesian Bandit Approach to Adaptive Delay-based Congestion Control

Publications associées (63)

Operating System and Network Co-Design for Latency-Critical Datacenter Applications

Datacenters are the heart of our digital lives. Online applications, such as social-networking and e-commerce, run inside datacenters under strict Service Level Objectives for their tail latency. Tight latency SLOs are necessary for such services to remain ...

EPFL2020

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

R2P2: Making RPCs first-class datacenter citizens

Edouard Bugnion, Evangelos Marios Kogias, Adrien Ghosn, Georgios Prekas, Jonas Fietz

Remote Procedure Calls are widely used to connect datacenter applications with strict tail-latency service level objectives in the scale of µs. Existing solutions utilize streaming or datagram-based transport protocols for RPCs that impose overheads and li ...

USENIX ASSOC2019

Copper-catalyzed remote C(sp3)–H azidation and oxidative trifluoromethylation of benzohydrazides

Qian Wang, Jieping Zhu, Xu Bao

The Hofmann-Löffler-Freytag (HLF) reaction is a prototypical example of radical-based remote functionalization of unactivated C(sp3)–H bond. While 1,5-hydrogen atom transfer (1,5-HAT) of the amidyl radical is thermodynamically favorable and is well-establi ...

Springer2019

A Bayesian Bandit Approach to Adaptive Delay-based Congestion Control

Pascal Frossard, Stefano D'Aronco

Adapting the transmission rate of video telephony Internet applications in order to guarantee the maximal communication quality is still an open and extremely challenging problem. The congestion control algorithm, which is the algorithm responsible for adj ...

ASSOC COMPUTING MACHINERY2018

Network utility maximization for delay-sensitive applications in unknown communication settings

Stefano D'Aronco

In the last decades the Internet traffic has greatly evolved. The advent of new Internet services and applications has, in fact, led to a significant growth of the amount of data transmitted, as well as to a transformation of the data type. As a matter of ...

EPFL2018

Flow control for Latency-Critical RPCs

Edouard Bugnion, Evangelos Marios Kogias

In today’s modern datacenters, the waiting time spent within a server’s queue is a major contributor of the end-to-end tail latency of μs-scale remote procedure calls. In traditional TCP, congestion control handles in-network congestion, while flow control ...

2018

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

Switching Between Loss-Based and Delay-Based Mode for Real-Time Media Congestion Controllers

Sergio Mena, Stefano D'Aronco

Congestion control may be provided. A set of rules may allow a congestion control process to switch from delay-mode to loss-mode (e.g., in the presence of loss-based flows) and back to delay-mode (e.g., when loss-based flows stop). Fairness properties of t ...

2017

How CSMA/CA With Deferral Affects Performance and Dynamics in Power-Line Communications

Patrick Thiran, Julien Pierre Sacha Herzen, Christina Vlachou

Power-line communications (PLC) are becoming a key component in home networking, because they provide easy and high-throughput connectivity. The dominant MAC protocol for high data-rate PLC, the IEEE 1901, employs a CSMA/CA mechanism similar to the backoff ...

Ieee-Inst Electrical Electronics Engineers Inc2017

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search