Toward Reliable and Scalable Network Algorithms

The past decade has seen exponential growth in the size and complexity of cloud computing. A key design choice during this expansion has been the widespread reliance on heuristics—fast, empirically effective methods that scale well. However, heuristics can have unknown corner cases where their performance can be arbitrarily bad. This unpredictability increases the risk of unavailability and performance loss, especially at scale, where extreme cases are more likely to occur.
In this talk, I will discuss two research directions to limit these risks and enhance the performance and availability at scale. In the first part, I will focus on developing scalable algorithms with formal guarantees, which eliminate the need for heuristics and the associated risks. However, there are times when developing such methods is not possible, and we have to rely on heuristics to scale. In the second part, I will introduce general methods to quantify the risks of using heuristics and to deploy workarounds.
I will conclude by highlighting new research directions that my work opens up, ranging from the performance analysis of learning-enabled systems to online heuristic analysis and heuristic synthesis using foundation models.