I am a PhD candidate in Computer Science. I am advised by Scott
Shenker and work in the NetSys
Lab. I am also affiliated with the AMPLab.
My research interest lie in finding lightweight mechanisms for achieving correctness in systems (broadly defined). My
dissertation looks at how to implement and execute network functions; and how to verify correctness for
NFV (network function virtualization) deployments. A complete list of my publications can be found
Before Berkeley, I worked on the Midori kernel at
Microsoft. Before that, I received a Sc.B. in Math-CS with honors from Brown. My honors thesis was on
symmetry breaking in constraint satisfaction problems.
For 2012-13, I was supported by a Qualcomm Innovation Fellowship.
Networks -- including the one you used to access this page -- now need to do a lot more than routing packets to a
destination. This includes ensuring security -- through firewalls and IDSes -- providing caching, implementing proxies
for video conferencing etc. How should NFs be built and deployed on shared servers? NetBricks provides a set of
high-level abstractions that allow NFs to be expressed in a safe language, without sacrificing performance. Processes
and VMs cannot meet the I/O requirement of NFs, and NetBricks instead uses software isolation techniques for
OSDI'16 Paper | OSDI'16
Slides | Website.
Verification for Network with Network Functions
While network functions are essential for adding functionality to networks, they also affect network correctness. For
example a misconfigured cache might allow access to unauthorized data. Current network verification techniques cannot
account for network functions, or any stateful network components. However, since NFs are general applications,
verification on the actual semantics is often undecidable and is infeasible for large networks. In a series of network verification
papers we have proposed the use of models, and different techniques -- including compositional verification -- for
networks with network functions.
NSDI'17 Paper | SNAPL'15 Paper | arXiv Paper | TACAS'16
paper on complexity | SNAPL'15 Slides |
Consistency Requirements for SDN
Software defined networks increasingly rely on distributed control planes. In many cases the control plane can be
partitioned while the data plane is connected. What limits does this place on network policies? We investigated this in
CAP for networks. Next, in SCL we investigated the consistency requirement of SDN control planes, and found that this
depended on the policy being implemented. Further we showed that eventual consistency is sufficient for implementing
many common policies.
NSDI'17 Paper | HotSDN'13 Paper
Perfect Routing Resilience
Can a routing algorithm provide perfect resilience and ensure that paths are available as long as the network remains
connected? The answer is no when packet sizes are bounded and changes to the forwarding table are disallowed. DDC
achieves perfect resilience while using only 2-extra bits in the packet header. In subsequent work we have also explored
the limits of resilience achievable with fixed forwarding tables.
NSDI'13 Paper | NSDI'13
Slides | NSDI'13 Video | PODC'12 Paper
| INFOCOM'16 Paper.
Routing traffic on the internet requires traversing several independent autonomous systems (ASes). Since ASes do not
always trust each other, the set of available paths is decided through contract negotiations between these ASes, and
this limits flexibility on the internet. We proposed a new inter-domain routing system, Route Bazaar, that uses
cryptocurrency block-chains (which provide a tamper proof log) and automated agents to provide greater routing
- Verification in the Age of Microservices. Aurojit Panda, Mooly Sagiv, Scott Shenker. To appear HotOS 2017.
- System Programming in Rust: Beyond Safety. Abhiram Balasubramnian, Marek S. Baranowski, Anton Burtsev, Aurojit Panda, Zvonimir Rakamaric, Leonid Ryzhyk. To appear HotOS 2017.
- SCL: Simplfying Distributed SDN Control Planes. Aurojit Panda, Wenting Zheng, Xiaohe Hu, Arvind
Krishnamurthy, Scott Shenker. NSDI 2017.
- Verifying Reachability in Networks with Mutable Datapaths. Aurojit Panda, Ori Lahav, Katerina Argyraki,
Mooly Sagiv, Scott Shenker. NSDI 2017.
- NetBricks: Taking the V out of NFV. Aurojit Panda, Sangjin Han, Keon Jang, Melvin Walls, Sylvia Ratnasamy, Scott
Shenker. OSDI 2016 Project Page Slides
- Ivy: Interactive Verification of Parameterized Systems via Effectively Propositional Reasoning. Oded Padon, Kenneth
McMillan, Aurojit Panda, Mooly Sagiv, Sharon Shoham. PLDI 2016
- The Quest for Resilient (Static) Forwarding Tables. Marco Chiesa, Ilya Nikolavskiy, Slobodan Mirtovic, Aurojit Panda, Andrei Gurtov, Aleksander Madry, Michael Schapira, Scott Shenker. INFOCOMM 2016
- Minimizing Faulty Executions of Distributed Systems. Colin Scott, Aurojit Panda,
Vjekoslav Brajkovic, George Necula, Arvind Krishnamurthy, Scott Shenker. NSDI 2016
- Some Complexity Results for Stateful Network Verification. Yaron Velner, Kalev
Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham. TACAS 2016
- Open Network Interfaces for Carrier Networks. Aurojit Panda, James McCauley, Amin
Tootoonchian, Justine Sherry, Teemu Koponen, Sylvia Ratnasamy, Scott Shenker. SIGCOMM CCR Jan. 2016
- E2: A Framework for NFV Applications. Shoumik Palkar, Chang Lan, Sangjin Han, Keon Jang,
Aurojit Panda, Sylvia Ratnasamy, Luigi Rizzo, Scott Shenker. SOSP 2015
- Rollback-Recovery for Middleboxes. Justine Sherry, Peter Xiang Gao, Soumya Basu,
Aurojit Panda, Arvind Krishnamurthy, Christian Maciocco, Maziar Manesh, João Martins, Sylvia Ratnasamy,
Luigi Rizzo, Scott Shenker. SIGCOMM 2015 (Best Student Paper)
- Route Bazaar: Automatic Interdomain Contract Negotiation. Ignacio Castro, Aurojit Panda,
Barath Raghavan, Scott Shenker, Sergey Gorinsky. HotOS 2015
- New Directions for Network Verification. Aurojit Panda, Katerina Argyraki, Mooly Sagiv,
Michael Schapira, Scott Shenker. SNAPL 2015 Slides: [pdf]
- PRAN: Programmable Radio Access Networks. Wenfei Wu, Li Erran Li, Aurojit
Panda, Scott Shenker. HotNets 2014
- The Power of Choice in Data-Aware Cluster Scheduling. Shivaram Venkatraman, Aurojit
Panda, Ganesh Ananthanarayanan, Michael Franklin, Ion Stoica. OSDI 2014
- Troubleshooting Blackbox SDN Control Software with Minimal Causal Sequences. Colin Scott,
Andreas Wundsam, Barath Raghavan, Aurojit Panda, Andrew Or, Jefferson Lai, Eugene Huang, Zhi Liu, Ahmed
El-Hassany, Sam Whitlock, H.B. Acharya, Kyriakos Zarifis, Scott Shenker. SIGCOMM 2014
- Network Support for Resource Disaggregation in Next-Generation Data Centers. Sangjin
Han, Nobert Egi, Aurojit Panda, Sylvia Ratnasamy, Guangyu Shi, Scott Shenker. HotNets 2013
- CAP for Networks. Aurojit Panda, Colin Scott, Ali Ghodsi, Teemu Koponen, Scott
Shenker. HotSDN 2013 Slides: [pdf]
- The Case for Tiny Tasks in Compute Clusters. Kay Ousterhout, Aurojit Panda, Josh Rosen, Shivaram Venkatraman,
Reynold Xin, Sylvia Ratnasamy, Scott Shenker, Ion Stoica. HotOS 2013
- HW Databases, Where art Thou?. Sangjin Han, Aurojit Panda, Sylvia Ratnasamy.
- BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data. Sameer Agarwal, Barzan
Mozafari, Aurojit Panda, Henry Milner, Samuel Madden, Ion Stoica. EuroSys 2013 (Best Paper)
- Ensuring Connectivity via Data Plane Mechanisms. Junda Liu, Aurojit Panda, Ankit Singla, P. Brighten Godfrey,
Michael Schapira, Scott Shenker. NSDI 2013 Slides: [pdf]
- A New Approach to Interdomain Routing Based on Secure Multi-Party Computation.
Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Sagev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford, Scott
Shenker. HotNets 2012
- On the Resilience of Routing Tables. Joan Feigenbaum, P. Brighten Godfrey, Aurojit
Panda, Michael Schapira, Scott Shenker, Ankit Singla. PODC 2012