US 2018/0123877 A1Published application

Logical Network Configuration Span

AssigneeNicira, Inc.

InventorsAayush SAXENA, Igor GANICHEV, Da WAN, Pankaj THAKKAR, Yang PING

Life of this patent

Estimating the term…

Loading patent…

Abstract

Certain embodiments described herein are generally directed to determining the spans of logical entities in a logical network using a graph theoretic method. For example, in some embodiments, a configuration of the logical network is represented as a directed graph with labeled edges. The span of any logical entity in the logical network may then be computed based on the directed graph of the logical network. For example, for a given entity represented by a given node, the set of nodes that can be reached from the given node via span-depends-on edges only may be computed and referred to as the span base of the given node. Further, the set of all managed forwarding elements reachable from each node of the span base of the given node via contains edges only is the span for the given entity.

Claims25

Dependent claims

A method for representing a logical network as a directed graph, the method comprising:

defining nodes of the directed graph corresponding to a plurality of logical entities of the logical network;
defining a first set of directed edges of the directed graph between the nodes, wherein a first edge of the first set of directed edges is formed between a first node comprising a source node of the first edge and a second node comprising a sink node of the first edge, wherein the first edge indicates that a first logical entity corresponding to the first node contains a configuration information of a second logical entity corresponding to the second node;
defining a second set of directed edges of the directed graph between the nodes, wherein a second edge of the second set of directed edges is formed between a third node comprising a source node of the second edge and a fourth node comprising a sink node of the second edge, wherein the second edge indicates that a span of a third logical entity corresponding to the third node depends on a span of a fourth logical entity corresponding to the fourth node;
storing the directed graph in a central controller;
and
accessing the stored directed graph for managing a logical entity of the plurality of logical entities.

3 more elements

A computer system, wherein system software for the computer system is programmed to execute a method for representing a logical network as a directed graph, said method comprising:

defining nodes of the directed graph corresponding to a plurality of logical entities of the logical network;
defining a first set of directed edges of the directed graph between the nodes, wherein a first edge of the first set of directed edges is formed between a first node comprising a source node of the first edge and a second node comprising a sink node of the first edge, wherein the first edge indicates that a first logical entity corresponding to the first node contains a configuration information of a second logical entity corresponding to the second node;
defining a second set of directed edges of the directed graph between the nodes, wherein a second edge of the second set of directed edges is formed between a third node comprising a source node of the second edge and a fourth node comprising a sink node of the second edge, wherein the second edge indicates that a span of a third logical entity corresponding to the third node depends on a span of a fourth logical entity corresponding to the fourth node;
storing the directed graph in a central controller;
and
accessing the stored directed graph for managing a logical entity of the plurality of logical entities.

3 more elements

A non-transitory computer readable medium comprising instructions to be executed in a computer system, wherein the instructions when executed in the computer system perform a method for representing a logical network as a directed graph, the method comprising:

defining nodes of the directed graph corresponding to a plurality of logical entities of the logical network;
defining a first set of directed edges of the directed graph between the nodes, wherein a first edge of the first set of directed edges is formed between a first node comprising a source node of the first edge and a second node comprising a sink node of the first edge, wherein the first edge indicates that a first logical entity corresponding to the first node contains a configuration information of a second logical entity corresponding to the second node;
defining a second set of directed edges of the directed graph between the nodes, wherein a second edge of the second set of directed edges is formed between a third node comprising a source node of the second edge and a fourth node comprising a sink node of the second edge, wherein the second edge indicates that a span of a third logical entity corresponding to the third node depends on a span of a fourth logical entity corresponding to the fourth node;
storing the directed graph in a central controller;
and
accessing the stored directed graph for managing a logical entity of the plurality of logical entities.

3 more elements

Dependencies are inferred from the claim text.