I am an Assistant Professor in Department of Computer Science at Cornell University.
My research interests are in systems and networking. I am also interested in theoretical problems arising out of building practical systems. My research thus spans (and integrates) systems, networks, and theory.
|Anurag Khandelwal (Postdoc, 2019, with Tom Ristenpart)   → Assistant Professor, Yale University
- Networks that never drop packets: One of the core problems of current network fabrics is packet drops, that directly or indirectly lead to inefficiency and complexity (e.g., high CPU utilization, high latency, complex network stacks). We are designing and building network fabrics and stacks that guarantee that packets will never be dropped.
- Resource Disaggregation: Shared-nothing architectures provide good data locality and cross-job isolation. However, for modern workloads where peak resource demands can be much higher than the average, shared-nothing architectures beget extreme resource underutilization, high cost and inflexibility. Disaggregating compute from storage has the potential to overcome these limitations! To realize this goal, we are working along several directions:
$3M award from NSF, Google faculty research award, Open-sourced, Deployed in the real world.
- Near-Perfect Datacenter Transport Design: We are designing and building datacenter transport designs that provide provable worst-case guarantees. Some of the projects include:
SIGCOMM'18 Best Student Paper Award.
- Sincronia [SIGCOMM'18] for Coflows;
- Universal Packet Scheduling [NSDI'16] for flexible packet scheduling;
- PathDump, an end-to-end system for datacenter network monitoring and debugging using end-hosts.
- PathDump [OSDI'16] for end-hosts based monitoring and debugging;
- SwitchPointer [NSDI'18] for enabling in-network visibility;
- Confluo [NSDI'19] for efficient end-host stacks for low-overhead monitoring and debugging.
Few Past Projects
Here are some of the projects that I have worked on in the past:
- Succinct, a distributed storage system that enables queries directly on compressed data.
Open-sourced and deployed in the real-world.
- Succinct [NSDI'15] for random access, substring search, and even regular expression matches directly on semi-structured data;
- BlowFish [NSDI'16] that enables a smooth performance-storage tradeoff;
- ZipG [SIGMOD'17] for graph queries directly on compressed graphs.
- Anteater, one of the first systems that proposed the idea of network data plane debugging [SIGCOMM'11]. Laid the foundation for research on network debugging at the data plane.
- Approximate Distance Oracles and Compact Routing, that introduced new data structures, algorithms and techniques for approximate distance queries on graphs.
This project led to the first improvement over several classical decade-old theory results.
|CCC Workshop on Wide-Area Analytics
|SIGMETRICS Tutorials Chair
|NSDI Poster Chair
|HotOS General Chair
- Program Committee