Abstract:
A method is provided in one example embodiment and includes acquiring at a local network element information regarding a remote network element via a control protocol distribution method and refraining from instantiating the remote VTEP for the remote network element on the local network element until unicast traffic from the local network element to the remote network element via an overlay network has begun. The method may further include detecting unicast traffic from the local network element to the remote network element and subsequent to the detecting, instantiating the remote VTEP for the remote network element on the local network element. Some embodiments may include detecting cessation of the unicast traffic from the local network element to the remote network element and subsequent to the detecting cessation, uninstantiating the remote VTEP for the remote network element from the local network element.
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:
Techniques are presented for distributing host route information of virtual machines to routing bridges (RBridges). A first RBridge receives a routing message that is associated with a virtual machine and is sent by a second RBridge. The routing message comprises of mobility attribute information associated with a mobility characteristic of the virtual machine obtained from an egress RBridge that distributes the routing message. The first RBridge adds a forwarding table attribute to the routing message that indicates whether or not the first RBridge has host route information associated with the virtual machine in a forwarding table of the first RBridge. The first RBridge also distributes the routing message including the mobility attribute information and the forwarding table attribute, to one or more RBridges in the network.
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.