Google Inc.

Joon Suan Ong

Amin Vahdat

Vinay K Bannai

Steven Gribble

Andrew DeBock Ferguson

Muhammad Mukarram Tariq

Horia Vlad Balan

Alexander Jinhon Lin

Anvesh Komuravelli

Alvaro Martinez Echevarria

Zengbin Zhang

Junlan Zhou

Amit Gupta

Arjun Singh

Subhasree Mandal

Leon Poutievski

Subbaiah Venkata

Lorenzo Vicisano

Rajiv Ramanathan

Victor Lin

James Wanderer

Fei Ye

Jiangbo Li

Min Zhu

Michael John Wakerly

Jun Chen

Shidong Zhang

Jason Marc Simmons

Jahangir Hasan

Charles Robert Barker, Jr

Subbaiah Naidu Kotla Venkata

Mickey Ju

Hongyi Zeng

Rajababru Thatikunta

James M Wanderer

Andrew Debock Ferguson

Vinay Kumar Bannai

Subhasree Madal

Methods, systems, and apparatus, for automatically changing a network system. A method includes receiving a set of first intents that describe a state of a first switch fabric; receiving a set of second intents that describe a state of a second switch fabric; computing a set of network operations to perform on the first switch fabric to achieve the second switch fabric, the set of operations also defining an order in which the operations are to be executed, and the set of operations determined based on the set of first intents, the set of second intents, and migration logic that defines a ruleset for selecting the operations based on the set of first intents and the second intents; and executing the set of network operations according to the order, to apply changes to elements within the first switch fabric to achieve the state of the second switch fabric.

Automated network change system

This disclosure provides systems, methods and apparatus for providing a network verification system (NVS) to analyze and detect anomalies and errors within a network. The NVS requests forwarding tables from each of the switches within the network being analyzed, and generates directed forwarding graphs for each subnet within the network. Certain graph properties of the directed forwarding graphs are analyzed to detect anomalies or errors in the subnets represented by the directed forwarding graphs. In some implementations, the NVS can execute the generation of the directed forwarding graphs in parallel. In some implementations, the NVS can be implemented on a MapReduce system.

Scalable network route analysis

Aspects and implementations of the present disclosure are directed to methods and systems for a network tolerant to a network device that is temporarily absent from the control plane. In one aspect, in general, the system includes an event manager configured to send, to a controller configured to exchange control messages with a network device, a first request to temporarily withdraw the network device from control plane interactions. The event manager then triggers an event at the network device during which the network device is non-responsive to control plane interactions. After determining that the event has completed, the event manager sends the controller a second request to restore the network device. The controller is configured to request, responsive to the first request, a network application to transition to a tolerant state; and to request, responsive to the second request, the network application to transition to a sensitive state.

Systems and methods for controlling network device temporarily absent from control panel

Systems and methods for managing a large number of multi-stage switches in a data center are provided. In one aspect, a plurality of first stage switches in a switch cluster may be configured to function as a proxy switch for a given number of second stage switches in the switch cluster. Each of the first stage switches may thus receive, via a first set of networking links, inbound control plane management traffic destined for respective ones of the given number of second stage switches. The first stage switches may then route the control plane management traffic to the appropriate second stage switches via a second set of bidirectional links. In addition, each of the second stage switches may be further configured to route outbound data traffic originating from the second stage switches using all available uplinks in the second set of bidirectional links.

Inband management in a multi-stage CLOS network

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for semi-centralized routing. In one aspect, a computer-implemented method receives a network protocol packet at a router adapted for routing data packets to one or more additional routers. The network protocol packet conforms to a routing protocol that provides distributed routing computation. The method also sends the network protocol packet, through a controller, to a selected one of a plurality of route control servers. The method also processes the network control packet at the selected route control server to generate a routing computation result that conforms to the routing protocol. The method also generates routing information based on the routing computation. The routing information conforms to a control protocol that provides centralized routing computation. The method also sends the routing information to the router for routing of data packets based on the control protocol.

Semi-centralized routing

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for semi-centralized routing. One of the methods includes receiving one or more routes and determining that a received route identifies a new set of paths different from each routing path group in a maintained set of routing path groups. A new routing path group is created that corresponds to the new set of paths. The new routing path group is assigned an identifier of the routing path group. The new routing path group is converted to a corresponding new flow path group. A flow path group that was converted from the routing path group is replaced on a network device with the converted new flow path group.

Semi-centralized multiple path routing

An initial rule set in a table, such as a packet forwarding table, including a plurality of rules each having a key, an action, and a priority, may be reduced to a reduced rule set. Such reduction may include identifying relationships among the plurality of rules in the initial rule set, reassigning priority to each rule in the initial rule set based on its action and the identified relationships, duplicating all rules from each priority into each lower priority to produce an expanded rule set, and for each priority, replacing one or more of the rules with fewer inclusive rules, thereby producing a reduced rule set. Reduction may further include determining whether to perform additional rule processing on the reduced rule set, removing any redundant rules from the reduced rule set, converting any of the rules meeting a predetermined condition into don't care rules, and for each priority, replacing one or more of the rules in the reduced rule set with fewer inclusive rules.

System and method for reducing flow rules in forwarding tables

One embodiment of the present invention provides a system that identifies network switches along a path. During operation, the system receives an address of a source node and an address of a destination node. The system maintains a set of topology information for a network. The system further simulates a data packet originated at the source node and destined for the destination node. During the simulation, the system determines whether a current-hop node performs layer-3, layer-2, or sub-layer-2 switching. The system sends a query to the current-hop node over a separate control channel to determine the status of the current-hop node and discover a next-hop node. The system then receives a reply. The system determines the next-hop node based on the reply and sets the next-hop node as the current-hop node.

Method and system for discovering network paths

Growing community of inventors

Mountain View, CA, United States of America

Joon Suan Ong