Akshay Narayan
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
Research Subjects
Akshay Narayan has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Arvind Krishnamurthy
University of Washington, Seattle, USA
2 shared publications - Justine Sherry
Carnegie Mellon University, Pittsburgh, USA
2 shared publications - Lloyd Brown
UC Berkeley, Berkeley, USA
2 shared publications - Malte Schwarzkopf
Brown University, Providence, Rhode Island, USA
2 shared publications - Scott Shenker
ICSI and UC Berkeley, Berkeley, USA
2 shared publications - Yash Kothari
Carnegie Mellon University, Pittsburgh, Pennsylvania, USA
2 shared publications
Latest Publications
- Open Access
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 50-59
We Need to Talk About the Actual Guarantees of Rust-based Systems
Over the past decade, systems research has leveraged Rust to build systems that enforce valuable security and isolation guarantees over user-provided code in extensions. This paper identifies a common weakness in these Rust-based systems: extensions, even those that may be considered “safe,” may fail to uphold the language properties on which these systems rely. We present case studies where this mismatch breaks system guarantees and “safe” extensions corrupt kernel state in RedLeaf [35] and leak private data in Sesame [13]. As a path forward, we propose tooling to detect possible violations of system invariants in extension code. An early prototype static analysis tool suggests that this approach detects guarantee-breaking code with low false-positive rates.
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 50-59
Open AccessWe Need to Talk About the Actual Guarantees of Rust-based Systems
Over the past decade, systems research has leveraged Rust to build systems that enforce valuable security and isolation guarantees over user-provided code in extensions. This paper identifies a common weakness in these Rust-based systems: extensions, even those that may be considered “safe,” may fail to uphold the language properties on which these systems rely. We present case studies where this mismatch breaks system guarantees and “safe” extensions corrupt kernel state in RedLeaf [35] and leak private data in Sesame [13]. As a path forward, we propose tooling to detect possible violations of system invariants in extension code. An early prototype static analysis tool suggests that this approach detects guarantee-breaking code with low false-positive rates.
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 55-62
Kernel Extension DSLs Should Be Verifier-Safe!
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 55-62
Open AccessKernel Extension DSLs Should Be Verifier-Safe!
- Open Access
- 18 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 237-245
Lightweight Automated Reasoning for Network Architectures
Architecting a modern data center network is increasingly complicated. Seeking the highest performance and support for emerging workloads, network architects planning a buildout must choose from a large selection of switching components, NICs, network stacks, congestion control algorithms, routing schemes, measurement systems, virtualization software, centralized bandwidth allocators and security mechanisms, all from various vendors. Today, manual planning by human experts is time-consuming at best, and can easily result in overlooked design choices or missed complex inter-dependencies. We propose a radical departure from typical whiteboard-and-spreadsheet planning, and ask: is it possible to reason automatically about possible network architectural designs? Such an approach is nontrivial since formal reasoning about even a single component (like routing systems) is difficult, and we seek to understand how a variety of functional components fit together. We explore the challenge through examples and propose an automated lightweight reasoning framework that models architectural complexities at a broad, but shallow, level of abstraction. Such a framework could serve as a useful design tool for network architects, for careful cross-team planning, and even to help vendors plan product features and requirements.
- 18 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 237-245
Open AccessLightweight Automated Reasoning for Network Architectures
Architecting a modern data center network is increasingly complicated. Seeking the highest performance and support for emerging workloads, network architects planning a buildout must choose from a large selection of switching components, NICs, network stacks, congestion control algorithms, routing schemes, measurement systems, virtualization software, centralized bandwidth allocators and security mechanisms, all from various vendors. Today, manual planning by human experts is time-consuming at best, and can easily result in overlooked design choices or missed complex inter-dependencies. We propose a radical departure from typical whiteboard-and-spreadsheet planning, and ask: is it possible to reason automatically about possible network architectural designs? Such an approach is nontrivial since formal reasoning about even a single component (like routing systems) is difficult, and we seek to understand how a variety of functional components fit together. We explore the challenge through examples and propose an automated lightweight reasoning framework that models architectural complexities at a broad, but shallow, level of abstraction. Such a framework could serve as a useful design tool for network architects, for careful cross-team planning, and even to help vendors plan product features and requirements.
- Open Access
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 401-414
Reverse-Engineering Congestion Control Algorithm Behavior
The rise of proprietary and novel congestion control algorithms (CCAs) opens questions about the future of Internet utilization, latency, and fairness. However, fully analyzing how novel CCAs impact these properties requires understanding the inner workings of these algorithms. We thus aim to reverse-engineer deployed CCAs' behavior from collected packet traces to facilitate analyzing them. We present Abagnale, a program synthesis pipeline that helps users automate the reverse-engineering task. Using Abagnale, we discover simple expressions capturing the behavior of 9 of the 16 CCAs distributed with the Linux kernel and analyze 7 CCAs from a graduate networking course.
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 401-414
Open AccessReverse-Engineering Congestion Control Algorithm Behavior
The rise of proprietary and novel congestion control algorithms (CCAs) opens questions about the future of Internet utilization, latency, and fairness. However, fully analyzing how novel CCAs impact these properties requires understanding the inner workings of these algorithms. We thus aim to reverse-engineer deployed CCAs' behavior from collected packet traces to facilitate analyzing them. We present Abagnale, a program synthesis pipeline that helps users automate the reverse-engineering task. Using Abagnale, we discover simple expressions capturing the behavior of 9 of the 16 CCAs distributed with the Linux kernel and analyze 7 CCAs from a graduate networking course.
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 166-180
Principles for Internet Congestion Management
Given the technical flaws with---and the increasing non-observance of---the TCP-friendliness paradigm, we must rethink how the Internet should manage bandwidth allocation. We explore this question from first principles, but remain within the constraints of the Internet's current architecture and commercial arrangements. We propose a new framework, Recursive Congestion Shares (RCS), that provides bandwidth allocations independent of which congestion control algorithms flows use but consistent with the Internet's economics. We show that RCS achieves this goal using game-theoretic calculations and simulations as well as network emulation.
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 166-180
Open AccessPrinciples for Internet Congestion Management
Given the technical flaws with---and the increasing non-observance of---the TCP-friendliness paradigm, we must rethink how the Internet should manage bandwidth allocation. We explore this question from first principles, but remain within the constraints of the Internet's current architecture and commercial arrangements. We propose a new framework, Recursive Congestion Shares (RCS), that provides bandwidth allocations independent of which congestion control algorithms flows use but consistent with the Internet's economics. We show that RCS achieves this goal using game-theoretic calculations and simulations as well as network emulation.
- Open Access
- 28 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 229-237
How I Learned to Stop Worrying About CCA Contention
This paper asks whether inter-flow contention between congestion control algorithms (CCAs) is a dominant factor in determining a flow's bandwidth allocation in today's Internet. We hypothesize that CCA contention typically does not determine a flow's bandwidth allocation, present an initial analysis in support of this hypothesis, propose a measurement technique and study to settle this question, and discuss the implications should the hypothesis prove true.
- 28 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 229-237
Open AccessHow I Learned to Stop Worrying About CCA Contention
This paper asks whether inter-flow contention between congestion control algorithms (CCAs) is a dominant factor in determining a flow's bandwidth allocation in today's Internet. We hypothesize that CCA contention typically does not determine a flow's bandwidth allocation, present an initial analysis in support of this hypothesis, propose a measurement technique and study to settle this question, and discuss the implications should the hypothesis prove true.