Directed graph based span computation and configuration dispatching
AssigneeNicira, Inc.
InventorsDa Wan, Jianjun Shen, Maxim Novikov, Donghai Han, Hua Wang
Life of this patent
Estimating the term…
Loading patent…
AssigneeNicira, Inc.
InventorsDa Wan, Jianjun Shen, Maxim Novikov, Donghai Han, Hua Wang
Estimating the term…
A method of determining the span of logical entities in a network is provided. The method generates a directed graph. Each node of the graph corresponds to a logical network entity. Each edge of the graph has one or two directions. A direction from a first node to a second node identifies the first node as the source of span for the second node. The method determines the span of each node based on the direction of the edges of the directed graph. The method groups each set of nodes that are accessible by all other nodes in the set in a strongly connected group (SCC) sub-graph. The method generates a group node in a directed acyclic graph (DAG) to correspond to each SCC sub-graph in the directed graph. The method assigns the span of each SCC to the corresponding group node of the DAG.
A method of determining spans of logical entities in a network comprising a plurality of logical network entities and a plurality of forwarding elements that implement the logical network entities, wherein the span of each logical network entity comprises a set of forwarding elements that require configuration data for the logical entity, the method comprising:
A method of determining spans of logical entities in a network comprising a plurality of logical network entities and a plurality of forwarding elements that implement the logical network entities, wherein the span of each logical network entity comprises a set of forwarding elements that require configuration data for the logical entity, the method comprising:
A method of determining spans of logical entities in a network comprising a plurality of logical network entities and a plurality of forwarding elements that implement the logical network entities, wherein the span of each logical network entity comprises a set of forwarding elements that require configuration data for the logical entity, the method comprising:
A method of determining spans of logical entities in a network comprising a plurality of logical network entities and a plurality of forwarding elements that implement the logical network entities, wherein the span of each logical network entity comprises a set of forwarding elements that require configuration data for the logical entity, the method comprising:
A non-transitory machine readable medium storing a program which when executed by at least one processing unit determines spans of logical entities in a network comprising a plurality of logical network entities and a plurality of forwarding elements that implement the logical network entities, wherein the span of each logical network entity comprises a set of forwarding elements that require configuration data for the logical entity, the program comprising sets of instructions for:
A non-transitory machine readable medium storing a program which when executed by at least one processing unit determines spans of logical entities in a network comprising a plurality of logical network entities and a plurality of forwarding elements that implement the logical network entities, wherein the span of each logical network entity comprises a set of forwarding elements that require configuration data for the logical entity, the program comprising sets of instructions for:
Dependencies are inferred from the claim text.