activity
20172023
most citedContra: A Programmable System for Performance-aware Routing

32 citations · 105 across the 10 of their papers we have counts for

collaborators

10 papers

cs.NI2023★ 1 cited

What do LLMs need to Synthesize Correct Router Configurations?

Rajdeep Mondal, Alan Tang, Ryan Beckett +2

We investigate whether Large Language Models (e.g., GPT-4) can synthesize correct router configurations with reduced manual effort. We find GPT-4 works very badly by itself, produc…

cs.NI2022

Test Coverage for Network Configurations

Xieyang Xu, Weixin Deng, Ryan Beckett +2

We develop NetCov, the first tool to reveal which network configuration lines are being tested by a suite of network tests. It helps network engineers improve test suites and thus…

cs.NI2022★ 2 cited

FP4: Line-rate Greybox Fuzz Testing for P4 Switches

Nofel Yaseen, Liangcheng Yu, Caleb Stanford +2

Compared to fixed-function switches, the flexibility of programmable switches comes at a cost, as programmer mistakes frequently result in subtle bugs in the network data plane. In…

cs.NI2022★ 1 cited

ACORN: Network Control Plane Abstraction using Route Nondeterminism

Divya Raghunathan, Ryan Beckett, Aarti Gupta +1

Networks are hard to configure correctly, and misconfigurations occur frequently, leading to outages or security breaches. Formal verification techniques have been applied to guara…

cs.LO2022★ 18 cited

Modular Control Plane Verification via Temporal Invariants

Timothy Alberdingk Thijm, Ryan Beckett, Aarti Gupta +1

Monolithic control plane verification cannot scale to hyperscale network architectures with tens of thousands of nodes, heterogeneous network policies and thousands of network chan…

cs.NI2022★ 31 cited

LIGHTYEAR: Using Modularity to Scale BGP Control Plane Verification

Alan Tang, Ryan Beckett, Steven Benaloh +4

Current network control plane verification tools cannot scale to large networks, because of the complexity of jointly reasoning about the behaviors of all nodes in the network. In…

cs.NI2022★ 11 cited

Kirigami, the Verifiable Art of Network Cutting

Tim Alberdingk Thijm, Ryan Beckett, Aarti Gupta +1

We introduce a modular verification approach to network control plane verification, where we cut a network into smaller fragments to improve the scalability of SMT solving. Users p…

cs.NI2019★ 32 cited

Contra: A Programmable System for Performance-aware Routing

Kuo-Feng Hsu, Ryan Beckett, Ang Chen +3

We present Contra, a system for performance-aware routing that can adapt to traffic changes at hardware speeds. While existing work has developed point solutions for performance-aw…

cs.NI2018★ 2 cited

Control Plane Compression

Ryan Beckett, Aarti Gupta, Ratul Mahajan +1

We develop an algorithm capable of compressing large networks into a smaller ones with similar control plane behavior: For every stable routing solution in the large, original netw…

cs.PL2017★ 7 cited

Kleene Algebra Modulo Theories

Michael Greenberg, Ryan Beckett, Eric Campbell

Kleene algebras with tests (KATs) offer sound, complete, and decidable equational reasoning about regularly structured programs. Interest in KATs has increased greatly since NetKAT…