Google Inc.

Barefoot Networks, Inc.

Steffen Julif Smolka

Jeongkeun Lee

Hui Liu

Han Wang

Gargi Adhav

Shishir Kumar Agrawal

John Nathan Foster

Hongkun Yang

Robert Soule

Cole Nathan Schlesinger

Tianqiong Luo

William Hallahan

Mon Jed Liu

Leslie Choong

Raj Yavatkar

A method for providing cloud network reachability analysis includes receiving a reachability query requesting a reachability status of a target including a packet header associated with a data packet. The packet header includes a source IP address and a destination IP address. The method also includes generating one or more simulated forwarding paths for the data packet based on the packet header using a data plane model. Each simulated forwarding path includes corresponding network configuration information. The method includes determining the reachability status of the target based on the one or more simulated forwarding paths and providing the determined reachability status and the one or more simulated forwarding paths to a user device associated with the reachability query which causes the user device to present the network configuration information for each simulated forwarding path.

Cloud network reachability analysis for virtual private clouds

A method for verifying data plane programs is provided in some embodiments. Because the behavior of a data plane program (e.g., a program written in the P4 language) is determined in part by the control plane populating match-action tables with specific forwarding rules, in some embodiments, programmers are provided with a way to document assumptions about the control plane using annotations (e.g., in the form of 'assertions' or 'assumptions' about the state based on the unknown control plane contribution). In some embodiments, annotations are added automatically to verify common properties, including checking that every header read or written is valid, that every expression has a well-defined value, and that all standard metadata is manipulated correctly. The method in some embodiments translates programs from a first language (e.g., P4) to a second language (e.g., Guarded Command Language (GCL)) for verification by a satisfiability modulo theory (SMT) solver.

Data plane program verification

Growing community of inventors

Ithaca, NY, United States of America

Steffen Julif Smolka