Abstract:
A method is provided in one example embodiment and includes determining a route target (“RT”) membership for a network element; determining at least one attribute for the RT membership; and advertising the RT membership with the at least one attribute to other network elements. The at least one attribute may include an RT membership type attribute for indicating whether the RT membership is due to a local virtual network connection, transit support, or both. Additionally or alternatively, the at least one attribute may include a distribution tree binding attribute for indicating a distribution tree for the RT membership.
Abstract:
Systems and methods for triggering service activation include starting a vCPE instance in response to a request for a service, instantiating a service container for the requested service and starting the service in the service container, installing a fast path entry for the service container in a local bridge table, detecting an idle timeout of the service and labeling the local bridge table entry for the corresponding service container as inactive, notifying a cloud services manager that the service container is inactive, and removing the service container.
Abstract:
A leaf switch of a switch fabric includes multiple ports to connect with respective ones of multiple servers. Virtual local area networks (VLANs) are configured on the leaf switch. Dynamic creation of virtual ports is enabled on the leaf switch for at least one of the VLANs on an as needed basis. The leaf switch receives from a particular server connected to a corresponding one of the ports a notification message that a virtual machine is hosted on the particular server. Responsive to the notification message, the leaf switch dynamically creates a virtual port that associates the corresponding one of the ports with the at least one of the VLANs.
Abstract:
An example method for calculating a constrained distribution tree in a TRILL network including a plurality of VL and FGL RBridges can include learning an FGL multi-destination frame filtering capability of at least one of the FGL RBridges in the TRILL network, constructing a sub-graph including the FGL RBridges and associated links and calculating at least one sub-tree based on the sub-graph. The method can also include constructing a graph including VL RBridges, the FGL RBridges and associated links by adding links between the VL RBridges and the FGL RBridges. The FGL RBridge to which the VL RBridge is linked can have sufficient FGL multi-destination frame filtering capability. Further, the method can include calculating a constrained distribution tree based on the graph by treating the sub-tree as a logical node.
Abstract:
A method is provided in one example and includes receiving, at a receiving node, a packet that comprises information indicative of an internet protocol address and a segmentation identification, selecting a virtual routing and forwarding table corresponding with the segmentation identification, identifying a destination node based, at least in part, on the internet protocol address and the virtual routing and forwarding table, and transmitting the packet to the destination node.
Abstract:
An example method for calculating a constrained distribution tree in a TRILL network including a plurality of VL and FGL RBridges can include learning an FGL multi-destination frame filtering capability of at least one of the FGL RBridges in the TRILL network, constructing a sub-graph including the FGL RBridges and associated links and calculating at least one sub-tree based on the sub-graph. The method can also include constructing a graph including VL RBridges, the FGL RBridges and associated links by adding links between the VL RBridges and the FGL RBridges. The FGL RBridge to which the VL RBridge is linked can have sufficient FGL multi-destination frame filtering capability. Further, the method can include calculating a constrained distribution tree based on the graph by treating the sub-tree as a logical node.
Abstract:
An example method for determining an optimal forwarding path across a network having VxLAN gateways configured to implement both FGL networking and VxLAN capabilities can include learning RBridge nicknames associated with the VxLAN gateways in the network. Additionally, the method can include determining a path cost over the FGL network between each of the VxLAN gateways and a source node and a path cost over the VxLAN between each of the VxLAN gateways and a destination node. Further, the method can include determining an encapsulation overhead metric associated with the VxLAN and selecting one of the VxLAN gateways as an optimal VxLAN gateway. The selection can be based on the computed path costs over the FGL network and the VxLAN and the encapsulation overhead metric.
Abstract:
In one embodiment, a method includes detecting a change in network topology and broadcasting a transient unconditional unpruning message to multiple nodes in the network. The message is configured to instruct each of the nodes receiving the message to start a phase timer in response to the broadcast message; unprune its operational ports; and, upon expiration of the phase timer, prune its ports in accordance with the results of a pruning protocol.
Abstract:
Methods and apparatuses for rapid TRILL convergence are disclosed herein. The methods can be implemented in a network including a plurality of RBridges or in a cloud network environment including a plurality of cloud switch domains. An example method for rapid TRILL convergence can include: Executing a spanning tree protocol (STP) for network topology in a network; and executing a Hello protocol for control and forwarding at the RBridge. The Hello protocol can be configured to elect a designated RBridge and assign an appointed forwarder. The method can also include assigning a transient appointed forwarder during a period of time between convergence of the STP and convergence of the Hello protocol. The transient appointed forwarder can be configured to forward frames in the network during the period of time between convergence of the STP and convergence of the Hello protocol.