Department of Computer Science, 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.
ragarwal at cs cornell edu (please read this before sending me an email)
CV | SynergyLab | Open-source | Advice | Google scholar | Github | Short Bio
- Honored to receive the James and Mary Tien Teaching Award!
- The highest award for teaching in Cornell College of Engineering.
- Citation: for sustained excellence and innovation in engineering education.
- My teaching assistants over the years deserve the accolades, especially Saksham Agarwal, Midhul Vuppalapati, and Shubham Chaudhary.
- Understanding Host Network Stack Overheads accepted to SIGCOMM'21!
- blk-switch accepted to OSDI'21!
- CodedBulk accepted to NSDI'21!
- Honored to receive the Sloan Research Fellowship! (Thanks to my students and collaborators)
- NSF CAREER award!
- Google Research Scholar award!
- $1M NSF award for work on Pancake (with Anurag Khandelwal and Tom Ristenpart)!
|Katie Gioioso (MS, 2021)   → PhD student, CMU
|Ali Munir (Postdoc, 2020)   → Researcher, Huawei Canada Research Lab
|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.
NSF CAREER Award.
- 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, Usenix Security'20 distinguished paper award, Open-sourced, Deployed in the real world.
- Near-optimal 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, Google research scholar award.
- CodedBulk [NSDI'21] for Inter-datacenter bulk transfers;
- Sincronia [SIGCOMM'18] for Coflows;
- Universal Packet Scheduling [NSDI'16] for flexible packet scheduling;
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 and PathDump, systems for datacenter network data plane monitoring and debugging.
Laid the foundation for research on network monitoring and debugging at the data plane. Open-sourced.
- Anteater [SIGCOMM'11], one of the first systems that proposed network debugging at the data plane.
- 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.
- 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