YoVDO

Towards Provably Performant Congestion Control

Offered By: USENIX via YouTube

Tags

Congestion Control Courses Algorithm Design Courses Formal Methods Courses Cellular Networks Courses Network Protocols Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 17-minute conference talk from NSDI '24 that delves into the development of provably performant congestion control algorithms (CCAs). Learn about a framework designed to simplify the creation of CCAs capable of functioning effectively across diverse network scenarios, including cellular links, policers, token bucket filters, and operating system jitter. Discover the necessary actions required for any high-performing CCA and the sufficient information needed to determine sending rates. Gain insights into how this framework, combined with formal methods techniques, enables the synthesis of CCAs with proven performance across various network conditions. Understand the fundamental impossibility results uncovered through this research methodology, presented by experts from Carnegie Mellon University and the University of Texas at Austin.

Syllabus

NSDI '24 - Towards provably performant congestion control


Taught by

USENIX

Related Courses

Natural Language Processing
Columbia University via Coursera
Intro to Algorithms
Udacity
Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera
Paradigms of Computer Programming
Université catholique de Louvain via edX
Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX