Kimia Noorbakhsh

Kimia Noorbakhsh

Auto-generated profile, based on publicly available information

Kimia Noorbakhsh

MIT CSAIL, Cambridge, MA, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 August 2024
Verified
Conference Paper
Open access
CLChenning Li
Chenning Li
ANArash Nasr-Esfahany
Arash Nasr-Esfahany
KZKevin Zhao
Kevin Zhao
KNKimia Noorbakhsh
Kimia Noorbakhsh
PGPrateesh Goyal
Prateesh Goyal
TAThomas E. Anderson
Thomas E. Anderson
Data center network operators often need accurate estimates of aggregate network performance. Unfortunately, existing methods for estimating aggregate network statistics are either inaccurate or too slow to be practical at the data center scale. In this paper, we develop and evaluate a scale-free, fast, and accurate model for estimating data center network tail latency performance for a given workload, topology, and network configuration. First, we show that path-level simulations---simulations of traffic that intersects a given path---produce almost the same aggregate statistics as full network-wide packet-level simulations. We use a simple and fast flow-level fluid simulation in a novel way to capture and summarize essential elements of the path workload, including the effect of cross-traffic on flows on that path. We use this coarse simulation as input to a machine-learning model to predict path-level behavior, and run it on a sample of paths to produce accurate network-wide estimates. Our model generalizes over the choice of congestion control (CC) protocol, CC protocol parameters, and routing. Relative to Parsimon, a state-of-the-art system for rapidly estimating aggregate network tail latency, our approach is significantly faster (5.7×), more accurate (45.9% less error), and more robust.

26 May 2026
Verified
Conference Paper
Open access
PHPouya Hamadanian
Pouya Hamadanian
PKPantea Karimi
Pantea Karimi
ANArash Nasr-Esfahany
Arash Nasr-Esfahany
KNKimia Noorbakhsh
Kimia Noorbakhsh
JCJoseph Chandler
Joseph Chandler
HBHari Balakrishnan
Hari Balakrishnan
Can AI autonomously design mechanisms for computer systems on par with the creativity and reasoning of human experts? We present Glia, an AI architecture for networked systems design that uses large language models (LLMs) in a human-inspired multi-agent workflow. Each agent specializes in reasoning, experimentation, and analysis, collaborating through an evaluation framework that grounds abstract reasoning in empirical feedback. Unlike prior ML-for-systems methods that optimize black-box policies, Glia generates interpretable designs and exposes its reasoning. When applied to a distributed GPU cluster for LLM inference, it produces new algorithms for request routing, scheduling, and auto-scaling that perform at human-expert levels in significantly less time, while yielding novel insights into workload behavior. Our results suggest that by combining reasoning LLMs with structured experimentation, an AI can produce creative and understandable designs for complex systems problems.

26 May 2026
Verified
Conference Paper
Open access
PKPantea Karimi
Pantea Karimi
KNKimia Noorbakhsh
Kimia Noorbakhsh
MAMohammad Alizadeh
Mohammad Alizadeh
HBHari Balakrishnan
Hari Balakrishnan