BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium: Designing Provably Performant Networked Systems
DTSTART:20230320T123000
DTEND:20230320T133000
DTSTAMP:20260408T071304Z
UID:f8830b6d24831b2de3ebd5008bbe1390c17b4974eba8a0dba86f6493
CATEGORIES:Conferences - Seminars
DESCRIPTION:By: Venkat Arun - MIT\nIC Faculty candidate\n\nAbstract\nAs ne
 tworked systems become critical infrastructure\, their design must reflect
  their new societal role. Today\, we build systems with hundreds of heuris
 tics but often do not understand their inherent and emergent behaviors. I 
 will present a set of tools and techniques to prove performance properties
  of heuristics running in real-world conditions. Rigorous proofs can not o
 nly inspire confidence in our designs\, but also give counter-intuitive in
 sights about their performance.\nA key theme in our approach is to model u
 ncertainty in systems using non-random\, non-deterministic objects that co
 ver a wide range of possible behaviors under a single abstraction. Such mo
 dels allow us to analyze complex system behaviors using automated reasonin
 g techniques. I will present automated tools to analyze congestion control
  and process scheduling algorithms. These tools prove performance properti
 es and find counter-examples where widely deployed heuristics fail. I will
  also show that current end-to-end congestion control algorithms that boun
 d delay cannot avoid starvation and present a method to beamform wireless 
 signals using thousands of antennas.\n\nBio\nVenkat Arun is a PhD candidat
 e at MIT working with Hari Balakrishnan and Mohammad Alizadeh. His work sp
 ans internet congestion control\, video streaming\, privacy-preserving com
 putation\, wireless networks\, and mobile systems. Across these areas\, a 
 unifying theme of his work is to bridge between heuristics that systems us
 e in practice and proofs of how well they work. He believes that rigorous 
 proof combined with automated reasoning will enable us to make networked s
 ystems more robust and performant. He has won two ACM SIGCOMM best paper a
 wards and the president of India gold medal.\n\nMore information
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420 https://epfl.zoom.us/
 j/64015813580
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR
