Aditya Akella
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Aditya Akella has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Divyanshu Saxena
The University of Texas at Austin, Austin, USA
9 shared publications - Tao Ji
The University of Texas at Austin, Austin, TX, USA
5 shared publications - Jiaxin Lin
The University of Texas at Austin, Austin, TX, USA
4 shared publications Ashok Anand
Instart Logic
3 shared publications- Daehyeok Kim
The University of Texas at Austin, Austin, Texas, USA
3 shared publications - Hokeun Cha
University of Wisconsin Madison, Madison, WI, USA
3 shared publications
Latest Publications
- Open Access
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 18-26
T ier S izer : Counterfactual Reasoning for DRAM Sizing in Tiered Memory Systems
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 18-26
Open AccessT ier S izer : Counterfactual Reasoning for DRAM Sizing in Tiered Memory Systems
- Open Access
- 8 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (PLDI) , 754-777
MatchBox: A Semantic Foundation for Data Plane Portability
Match-action tables are the core abstraction underlying network packet-processing systems, from fixed-function switches to eBPF-based software dataplanes. However, their concrete syntax and semantics vary widely across programming environments, reflecting differences in hardware generations, engineering practices, and vendor design choices. This syntactic and semantic variation renders portability of match-action tables across environments a persistent challenge. This paper presents MatchBox, a system for translating match-action tables across heterogeneous environments. At its core is the Match Algebra , a compositional formalism for concisely and declaratively expressing transformations on match-action tables. To ensure unambiguous semantics, MatchBox introduces a static type system based on guarded functional dependencies (GFDs) that guarantees that every well-typed Match Algebra expression denotes a well-defined function. From such specifications, the MatchBox compiler efficiently computes compact target tables that are semantically faithful. Across case studies in programmable switches, multi-cloud firewalls, and eBPF systems, MatchBox enables concise, declarative portability specifications and realizes them as compact target tables.
- 8 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (PLDI) , 754-777
Open AccessMatchBox: A Semantic Foundation for Data Plane Portability
Match-action tables are the core abstraction underlying network packet-processing systems, from fixed-function switches to eBPF-based software dataplanes. However, their concrete syntax and semantics vary widely across programming environments, reflecting differences in hardware generations, engineering practices, and vendor design choices. This syntactic and semantic variation renders portability of match-action tables across environments a persistent challenge. This paper presents MatchBox, a system for translating match-action tables across heterogeneous environments. At its core is the Match Algebra , a compositional formalism for concisely and declaratively expressing transformations on match-action tables. To ensure unambiguous semantics, MatchBox introduces a static type system based on guarded functional dependencies (GFDs) that guarantees that every well-typed Match Algebra expression denotes a well-defined function. From such specifications, the MatchBox compiler efficiently computes compact target tables that are semantically faithful. Across case studies in programmable switches, multi-cloud firewalls, and eBPF systems, MatchBox enables concise, declarative portability specifications and realizes them as compact target tables.
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1658-1673
Canopy: Property-Driven Learning for Congestion Control
Learning-based congestion controllers offer better adaptability compared to traditional heuristics. However, the unreliability of learning techniques can cause learning-based controllers to behave poorly, creating a need for formal guarantees. While methods for formally verifying learned congestion controllers exist, these methods offer binary feedback that cannot optimize the controller toward better behavior. We improve this state-of-the-art via Canopy, a new property-driven framework that integrates learning with formal reasoning in the learning loop. Canopy uses novel quantitative certification with an abstract interpreter to guide the training process, rewarding models, and evaluating robust and safe model performance on worst-case inputs. Our evaluation demonstrates that unlike state-of-the-art learned controllers, Canopy-trained controllers provide both adaptability and worst-case reliability across a range of network conditions.
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1658-1673
Open AccessCanopy: Property-Driven Learning for Congestion Control
Learning-based congestion controllers offer better adaptability compared to traditional heuristics. However, the unreliability of learning techniques can cause learning-based controllers to behave poorly, creating a need for formal guarantees. While methods for formally verifying learned congestion controllers exist, these methods offer binary feedback that cannot optimize the controller toward better behavior. We improve this state-of-the-art via Canopy, a new property-driven framework that integrates learning with formal reasoning in the learning loop. Canopy uses novel quantitative certification with an abstract interpreter to guide the training process, rewarding models, and evaluating robust and safe model performance on worst-case inputs. Our evaluation demonstrates that unlike state-of-the-art learned controllers, Canopy-trained controllers provide both adaptability and worst-case reliability across a range of network conditions.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Continuous Benchmark Generation for Evaluating Enterprise-scale LLM Agents
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessContinuous Benchmark Generation for Evaluating Enterprise-scale LLM Agents
- Open Access
- 17 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 51-60
Man-Made Heuristics Are Dead. Long Live Code Generators!
- 17 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 51-60
Open AccessMan-Made Heuristics Are Dead. Long Live Code Generators!
- Open Access
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 31-36
OQueue: Observable Communication in Learning Directed Operating Systems
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 31-36
Open AccessOQueue: Observable Communication in Learning Directed Operating Systems
- Open Access
- 14 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-7
How I learned to stop worrying and love learned OS policies
- 14 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessHow I learned to stop worrying and love learned OS policies
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 233-248
Copper and Wire: Bridging Expressiveness and Performance for Service Mesh Policies
Distributed microservice applications require a convenient means of controlling L7 communication between services. Service meshes have emerged as a popular approach to achieving this. However, current service mesh frameworks are difficult to use -- they burden developers in realizing even simple communication policies, lack compatibility with diverse dataplanes, and introduce performance and resource overheads. We identify the root causes of these drawbacks and propose a ground-up new mesh architecture that overcomes them. We develop novel abstractions for mesh communication, a new mesh policy language centered on these abstractions to enable expressive policies, and a novel control plane that enables using minimal dataplane resources for policy enforcement. We develop the precise semantics of our language abstractions and demonstrate how our control plane can use them to execute policies correctly and optimally. We build and evaluate a prototype on realistic workloads and policies and open-source production traces. Our results show that complex policies can be specified in up to 6.75× fewer lines, enforced with up to 2.6× smaller tail latencies and up to 39% fewer CPU resources than today.
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 233-248
Open AccessCopper and Wire: Bridging Expressiveness and Performance for Service Mesh Policies
Distributed microservice applications require a convenient means of controlling L7 communication between services. Service meshes have emerged as a popular approach to achieving this. However, current service mesh frameworks are difficult to use -- they burden developers in realizing even simple communication policies, lack compatibility with diverse dataplanes, and introduce performance and resource overheads. We identify the root causes of these drawbacks and propose a ground-up new mesh architecture that overcomes them. We develop novel abstractions for mesh communication, a new mesh policy language centered on these abstractions to enable expressive policies, and a novel control plane that enables using minimal dataplane resources for policy enforcement. We develop the precise semantics of our language abstractions and demonstrate how our control plane can use them to execute policies correctly and optimally. We build and evaluate a prototype on realistic workloads and policies and open-source production traces. Our results show that complex policies can be specified in up to 6.75× fewer lines, enforced with up to 2.6× smaller tail latencies and up to 39% fewer CPU resources than today.
- Open Access
- 8 December 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (4) , 1-27
ChainedFilter: Combining Membership Filters by Chain Rule
Membership (membership query/membership testing) is a fundamental problem across databases, networks and security. However, previous research has primarily focused on either approximate solutions, such as Bloom Filters, or exact methods, like perfect hashing and dictionaries, without attempting to develop an integral theory. In this paper, we propose a unified and complete theory, namely chain rule, for general membership problems, which encompasses both approximate and exact membership as extreme cases. Building upon the chain rule, we introduce a straightforward yet versatile algorithm framework, namely ChainedFilter, to combine different elementary filters without losing information. Our evaluation results demonstrate that ChainedFilter improves performance of many applications including static dictionary, lossless data compression, Cuckoo Hashing, LSM-Tree and Learned Filters.
- 8 December 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (4) , 1-27
Open AccessChainedFilter: Combining Membership Filters by Chain Rule
Membership (membership query/membership testing) is a fundamental problem across databases, networks and security. However, previous research has primarily focused on either approximate solutions, such as Bloom Filters, or exact methods, like perfect hashing and dictionaries, without attempting to develop an integral theory. In this paper, we propose a unified and complete theory, namely chain rule, for general membership problems, which encompasses both approximate and exact membership as extreme cases. Building upon the chain rule, we introduce a straightforward yet versatile algorithm framework, namely ChainedFilter, to combine different elementary filters without losing information. Our evaluation results demonstrate that ChainedFilter improves performance of many applications including static dictionary, lossless data compression, Cuckoo Hashing, LSM-Tree and Learned Filters.