Abstract:
Example implementations disclosed herein can be used to generate composite network policy graphs based on multiple network policy graphs input by network users that may have different goals for the network. The resulting composite network policy graph can be used to program a network so that it meets the requirements necessary to achieve the goals of at least some of the network users. In one example implementation, a method can include receiving multiple network policy graphs, generating composite endpoint groups based on relationships between endpoint groups and policy graph sources, generating composite paths based on the relationships between the endpoints and the network policy graphs, generating a composite network policy graph based on the composite endpoint groups and the composite paths, and analyzing the composite network policy graph to determine conflicts or errors.
Abstract:
Example embodiments relate to providing efficient routing in software defined networks. In example embodiments, an indirect group table includes a first group entry that is associated with a first route tree in a software defined network, wherein the indirect group table affects a plurality of forwarding table entries associated with the first group entry. A failure is detected in the first route tree during a data transmission, and a notification of the failure is sent to a remote controller device, where the remote controller device identifies a second route tree that does not include the failure. After the remote controller device updates the first group entry to be associated with the second route tree, the data transmission is performed using the second route tree.
Abstract:
Example embodiments relate to providing efficient routing in software defined networks. In example embodiments, an indirect group table includes a first group entry that is associated with a first route tree in a software defined network. A failure is detected in the first route tree during a data transmission, and a notification of the failure is sent to a remote controller device, where the remote controller device identifies a second route tree that does not include the failure. After the remote controller device updates the first group entry to be associated with the second route tree, the data transmission is performed using the second route tree.
Abstract:
Each network policy of network policies specifies at least one characteristic of communications allowed between endpoint groups, each endpoint group of the endpoint groups including at least one endpoint. The network policies are merged according to composition constraints included in the network policies.
Abstract:
Examples relate to fast failover recovery in software defined networks. In some examples, a failure in a first primary tree is detected during data transmission of a data packet, where the primary tree is associated with a first group entry that is configured to direct each of the data packets to one of a first set of destination devices. A notification of the failure is sent to a remote controller device, where the remote controller device identifies backup trees of the route trees that does not include the failure. After the remote controller device updates the first group entry to be associated with a first backup tree that minimizes congestion, each of the data packets are sent to one of a second set of destination devices that are associated with the first backup tree.
Abstract:
Examples relate to dynamic allocation of flow table capacity. In some examples, packet-in events of a networking device are monitored and processed to create active flow entries in a flow table. After detecting that the packet-in events at the networking device exceed an overload threshold, the active allocation of the flow table is increased. At this stage, a backup flow is removed from the flow table based on the active allocation.
Abstract:
Identifying a component within an application executed in a network includes obtaining a traffic matrix, the traffic matrix defining a rate for which packets of data are exchanged between VMs corresponding to an application, analyzing the traffic matrix to identify VMs within a component, modifying the traffic matrix to create a modified traffic matrix, and defining, for the application, a tenant application graph (TAG) model based on the modified traffic matrix.
Abstract:
In some examples, input network policies are combined to form a composite network policy, each input network policy of the input network policies specifying at least one characteristic of communications allowed between endpoint groups in a network. Metadata associated with the composite network policy is added, the metadata including information regarding a reason for disallowance of a communication between endpoint groups.
Abstract:
Example implementations disclosed herein can be used to allocate network resources in a software defined network (SDN). In one example implementation, a method can include receiving a plurality of resource allocation proposals from a plurality of controller modules, instructing the controller modules to generate votes for the plurality of resource allocation proposals, and selecting one of the plurality of resource allocation proposals based on the votes to instantiate the selected resource allocation proposal in the SDN.
Abstract:
Example embodiments relate to providing efficient routing in software defined networks. In example embodiments, an indirect group table includes a first group entry that is associated with a first route tree in a software defined network. A failure is detected in the first route tree during a data transmission, and a notification of the failure is sent to a remote controller device, where the remote controller device identifies a second route tree that does not include the failure. After the remote controller device updates the first group entry to be associated with the second route tree, the data transmission is performed using the second route tree.