Divyanshu Saxena
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Divyanshu Saxena has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Aditya Akella
The University of Texas at Austin, Austin, TX, USA
9 shared publications - Rohit Dwivedula
UT Austin, Austin, USA
3 shared publications - Eric Hayden Campbell
University of Texas at Austin, Austin, USA
2 shared publications - Isil Dillig
University of Texas at Austin, Austin, USA
2 shared publications - Sujay Yadalam
The University of Texas at Austin, Austin, USA
2 shared publications - Swarat Chaudhuri
University of Texas at Austin
2 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
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 679-696
Enabling Fast Networking in the Public Cloud
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 679-696
Open AccessEnabling Fast Networking in the Public Cloud
- 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
- 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
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 572-587
Yama
The sharing of clusters with various on-NIC offloads by high-level entities (users, containers, etc.) has become increasingly common. Performance isolation across these entities is desired because the offloads can become bottlenecks due to the limited capacity of hardware. However, the existing works that provide scheduling and resource management to NIC offloads all require customization of the NIC or offloads, while commodity off-the-shelf NICs and offloads with proprietary implementation have been widely deployed in datacenters. This paper presents Yama, the first solution to enable per-entity isolation in the sharing of such black-box NIC offloads. Yama provides a generic framework that captures a common abstraction to the operation of most offloads, which allows operators to incorporate existing offloads. The framework proactively probes for the performance of the offloads with auxiliary workload and enforces isolation at the initiator side. Yama also accommodates chained offloads. Our evaluation shows that 1) Yama achieves per-entity max-min fairness for various types of offloads and in complicated offload chaining scenarios; 2) Yama quickly converges to changes in equilibrium and 3) Yama adds negligible overhead to application workload.
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 572-587
Open AccessYama
The sharing of clusters with various on-NIC offloads by high-level entities (users, containers, etc.) has become increasingly common. Performance isolation across these entities is desired because the offloads can become bottlenecks due to the limited capacity of hardware. However, the existing works that provide scheduling and resource management to NIC offloads all require customization of the NIC or offloads, while commodity off-the-shelf NICs and offloads with proprietary implementation have been widely deployed in datacenters. This paper presents Yama, the first solution to enable per-entity isolation in the sharing of such black-box NIC offloads. Yama provides a generic framework that captures a common abstraction to the operation of most offloads, which allows operators to incorporate existing offloads. The framework proactively probes for the performance of the offloads with auxiliary workload and enforces isolation at the initiator side. Yama also accommodates chained offloads. Our evaluation shows that 1) Yama achieves per-entity max-min fairness for various types of offloads and in complicated offload chaining scenarios; 2) Yama quickly converges to changes in equilibrium and 3) Yama adds negligible overhead to application workload.
- Open Access
- 19 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Invited Paper: Towards Efficient Microservice Communication
Distributed applications on the cloud are being developed and deployed as microservices as opposed to the monolithic architecture. Service Meshes have emerged as a way of specifying communication policies between microservices. Service Meshes have the potential to abstract the networking requirements of distributed applications from the application logic. However, current service mesh frameworks introduce significant performance and resource overheads. We study the overheads of service meshes and make a case for redesigning both the control plane and data plane for service meshes. First, we propose the notion of Application Defined Middleboxes, which makes it possible for the mesh control planes to reduce the overheads by optimizing where to implement application policies. Second, we demonstrate preliminary ideas on accelerating the data plane to further reduce the overheads.
- 19 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessInvited Paper: Towards Efficient Microservice Communication
Distributed applications on the cloud are being developed and deployed as microservices as opposed to the monolithic architecture. Service Meshes have emerged as a way of specifying communication policies between microservices. Service Meshes have the potential to abstract the networking requirements of distributed applications from the application logic. However, current service mesh frameworks introduce significant performance and resource overheads. We study the overheads of service meshes and make a case for redesigning both the control plane and data plane for service meshes. First, we propose the notion of Application Defined Middleboxes, which makes it possible for the mesh control planes to reduce the overheads by optimizing where to implement application policies. Second, we demonstrate preliminary ideas on accelerating the data plane to further reduce the overheads.