Lecture

Designing Provably Performant Networked Systems

Description

This lecture by the instructor focuses on the design of networked systems with robust performance, emphasizing the need for real-time applications and parallel computation. The presentation covers the challenges of heuristics in network design, the importance of proving system properties before deployment, and the use of formal verification to gain insights into system performance. Case studies on congestion control algorithms like Copa and BBR are discussed, along with the exploration of delay jitter issues and the complexity of real-world network behaviors. The lecture concludes with a look at future research directions, including modularizing proofs and automatically synthesizing performant system designs.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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.