Patent application number | Description | Published |
20140101302 | Techniques for Scalable and Foolproof Virtual Machine Move Handling with Virtual Port Channels - Techniques are provided for managing movements of virtual machines in a network. At a first switch, a virtual machine (VM) is detected. The VM is hosted by a physical server coupled to the first switch. A message is sent to other switches and it indicates that the VM is hosted by the physical server. When the first switch is paired with a second switch as a virtual port channel (vPC) pair, the message includes a switch identifier that identifies the second switch. A receiving switch receives the message from a source switch in the network comprising a route update associated with the VM. A routing table of the receiving switch is evaluated to determine whether the host route is associated with a server facing the physical port. The message is examined to determine it contains the switch identifier. | 04-10-2014 |
20140101336 | SYSTEM AND METHOD FOR IMPLEMENTING A MULTILEVEL DATA CENTER FABRIC IN A NETWORK ENVIRONMENT - A method is provided in one example embodiment and includes determining whether a first network element with which a second network element is attempting to establish an adjacency is a client type element. If the first network element is determined to be a client type element, the method further includes determining whether the first and second network elements are in the same network area. If the first network element is a client type element and the first and second network elements are determined to be in the same network area, the adjacency is established. Subsequent to the establishing, a determination is made whether the first network element includes an inter-area forwarder (IAF). | 04-10-2014 |
20140177640 | Intelligent Host Route Distribution for Low Latency Forwarding and Ubiquitous Virtual Machine Mobility in Interconnected Data Centers - 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. | 06-26-2014 |
20140254590 | SCALABLE MULTICAST ROUTE DISTRIBUTION IN A MULTITENANT DATA CENTER FABRIC IN A NETWORK ENVIRONMENT - 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. | 09-11-2014 |
20140258485 | EFFICIENT HANDLING OF MULTI-DESTINATION TRAFFIC IN AN INTERNET PROTOCOL FABRIC DATA CENTER - A method is provided in one example embodiment and includes establishing at least one fixed topology distribution tree in a network, where the fixed topology distribution tree comprises one root node and a plurality of leaf nodes connected to the root node; maintaining at the root node an indication of multicast group interests advertised by the leaf nodes; and pruning traffic at the root node based on the advertised multicast group interests of the leaf nodes. In one embodiment, the root node is a spine switch and each of the leaf nodes is a leaf switch and each of the leaf nodes is connected to the root node by a single hop. | 09-11-2014 |
20140348166 | OPTIMAL FORWARDING FOR TRILL FINE-GRAINED LABELING AND VXLAN INTERWORKING - 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. | 11-27-2014 |
20140355475 | SYSTEM, DEVICES AND METHODS FOR FACILITATING COEXISTENCE OF VLAN LABELING AND FINE-GRAINED LABELING RBRIDGES - 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. | 12-04-2014 |
20140369345 | METHOD AND APPARATUS FOR SCALING INTERCONNECTED IP FABRIC DATA CENTERS - Techniques which provide scalable techniques for managing multicast traffic in interconnected IP fabric data centers. More specifically, embodiments presented herein disclose an aggregated source technique used to address scalability issues for interconnected IP fabric data centers as well as disclose a secondary rendezvous point technique used to address backbone network (S, G) multicast state scalability. Additionally, embodiments disclosed herein include an approach for border leaf load balancing based on group destination addresses used by VTEPs. | 12-18-2014 |
20150071286 | SYSTEM AND METHOD FOR UTILIZATION OF A SEGMENTATION IDENTIFICATION TO SUPPORT TRANSMISSION OF DATA TO A DESTINATION NODE - 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. | 03-12-2015 |