Multicast traffic load balancing over virtual link aggregation

Information

  • Patent Grant
  • 9548926
  • Patent Number
    9,548,926
  • Date Filed
    Friday, January 10, 2014
    10 years ago
  • Date Issued
    Tuesday, January 17, 2017
    7 years ago
Abstract
One embodiment of the present invention provides a switch. The switch comprises one or more ports, a link management module and a load balancing module. The link management module operates a port of the one or more ports of the switch in conjunction with a remote switch to form a virtual link aggregation. The load balancing module generates an index of a weight distribution vector based on address information of a multicast group associated with the virtual link aggregation. A slot of the weight distribution vector corresponds to a respective switch participating in the virtual link aggregation. In response to the index indicating a slot corresponding to the switch, the load balancing module designates the switch as primary switch for the multicast group, which is responsible for forwarding multicast data of the multicast group via the virtual link aggregation.
Description
BACKGROUND

Field


The present disclosure relates to network management. More specifically, the present disclosure relates to a method and system for efficiently balancing multicast traffic over virtual link aggregations (VLAGs).


Related Art


The exponential growth of the Internet has made it a popular delivery medium for multimedia applications, such as video on demand and television. Such applications have brought with them an increasing demand for bandwidth. As a result, equipment vendors race to build larger and faster switches with versatile capabilities, such as multicasting, to move more traffic efficiently. However, the size of a switch cannot grow infinitely. It is limited by physical space, power consumption, and design complexity, to name a few factors. Furthermore, switches with higher capability are usually more complex and expensive. More importantly, because an overly large and complex system often does not provide economy of scale, simply increasing the size and capability of a switch may prove economically unviable due to the increased per-port cost.


As more time-critical applications are being implemented in data communication networks, high-availability operation is becoming progressively more important as a value proposition for network architects. It is often desirable to aggregate links to multiple switches to operate as a single logical link (referred to as a virtual link aggregation or a multi-chassis trunk) to facilitate load balancing among the multiple switches while providing redundancy to ensure that a device failure or link failure would not affect the data flow. A switch participating in a virtual link aggregation can be referred to as a partner switch of the virtual link aggregation.


Currently, such virtual link aggregations in a network have not been able to take advantage of the multicast functionalities available in a typical switch. Individual switches in a network are equipped to manage multicast traffic but are constrained while operating in conjunction with each other as partner switches of a virtual link aggregation. Consequently, an end device coupled to multiple partner switches via a virtual link aggregation typically exchanges all the multicast data with only one of the links (referred to as a primary link) in the virtual link aggregation. Even when the traffic is for different multicast groups, that multicast traffic to/from the end device only uses the primary link. As a result, multicast traffic to/from the end device becomes bottlenecked at the primary link and fails to utilize the bandwidth offered by the other links in the virtual link aggregation.


While virtual link aggregation brings many desirable features to networks, some issues remain unsolved in multicast traffic forwarding.


SUMMARY

One embodiment of the present invention provides a switch. The switch comprises one or more ports, a link management module and a load balancing module. The link management module operates a port of the one or more ports of the switch in conjunction with a remote switch to form a virtual link aggregation. The load balancing module generates an index of a weight distribution vector based on address information of a multicast group associated with the virtual link aggregation. A slot of the weight distribution vector corresponds to a respective switch participating in the virtual link aggregation. In response to the index indicating a slot corresponding to the switch, the load balancing module designates the switch as primary switch for the multicast group, which is responsible for forwarding multicast data of the multicast group via the virtual link aggregation.


In a variation on this embodiment, the number of slots of the weight distribution vector represents the bandwidth ratio or number of links in the virtual link aggregation.


In a variation on this embodiment, the slots of the weight distribution vector are ordered based on switch identifiers of switches participating in the virtual link aggregation.


In a variation on this embodiment, the load balancing module generates the index based on a hash value and the number of slots of the weight distribution vector. The load balancing module generates the hash value based on the address information of a multicast group associated with the virtual link aggregation.


In a variation on this embodiment, the load balancing module rebalances multicast groups among the switches participating in the virtual link aggregation in response to receiving an instruction indicating a change event from a remote synchronizing node.


In a further variation, the rebalancing of multicast groups is based on one or more of: a no-rebalancing mode, a partial-rebalancing mode, and a full-rebalancing mode.


In a further variation, the load balancing module initiates switching over to a new topology resulting from the change event based on the rebalancing in response to receiving an instruction indicating a switching over event from the synchronizing node.


In a variation on this embodiment, the switch and the remote switch are members of an Ethernet fabric switch. The switch and the remote switch are associated with an identifier of the Ethernet fabric switch.


One embodiment of the present invention provides a computing system. The computing system comprises a state management module and a synchronizing module. The state management module detects a change event associated with a virtual link aggregation. The synchronization module generates a first instruction indicating the change event for a switch participating in the virtual link aggregation.


In a variation on this embodiment, the synchronization module generates a second instruction for switching over to a new topology resulting from the change event for a switch participating in the virtual link aggregation in response to receiving acknowledgement for the first instruction from a respective switch participating in the virtual link aggregation.


In a further variation, the synchronization module precludes the computing system from generating an instruction indicating a second change event until receiving acknowledgement for the second instruction from a respective switch participating in the virtual link aggregation.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1A illustrates exemplary virtual link aggregations with multicast load balancing support, in accordance with an embodiment of the present invention.



FIG. 1B illustrates exemplary weight distribution vectors based on number of links, in accordance with an embodiment of the present invention.



FIG. 1C illustrates exemplary weight distribution vectors based on bandwidth ratio, in accordance with an embodiment of the present invention.



FIG. 2A presents a flowchart illustrating the process of a partner switch of a virtual link aggregation generating a weight distribution vector, in accordance with an embodiment of the present invention.



FIG. 2B presents a flowchart illustrating the process of a partner switch of a virtual link aggregation determining a primary link based on multicast load balancing, in accordance with an embodiment of the present invention.



FIG. 3A illustrates an exemplary change to a virtual link aggregation with multicast load balancing support, in accordance with an embodiment of the present invention.



FIG. 3B illustrates an exemplary primary switch association of multicast groups associated with a virtual link aggregation based on no rebalancing mode, in accordance with an embodiment of the present invention.



FIG. 3C illustrates an exemplary primary switch association of multicast groups associated with a virtual link aggregation based on partial or full rebalancing mode, in accordance with an embodiment of the present invention.



FIG. 4A illustrates an exemplary state diagram of a synchronizing node coordinating multicast load rebalancing in a virtual link aggregation, in accordance with an embodiment of the present invention.



FIG. 4B illustrates an exemplary state diagram of a partner switch of a virtual link aggregation rebalancing multicast load in coordination with a synchronizing node, in accordance with an embodiment of the present invention.



FIG. 5A presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a join event based on no rebalancing, in accordance with an embodiment of the present invention.



FIG. 5B presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a join event based on partial rebalancing, in accordance with an embodiment of the present invention.



FIG. 5C presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a join event based on full rebalancing, in accordance with an embodiment of the present invention.



FIG. 5D presents a flowchart illustrating the switching over process of a partner switch of a virtual link aggregation for a join event, in accordance with an embodiment of the present invention.



FIG. 6A presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a leave event based on no or partial rebalancing, in accordance with an embodiment of the present invention.



FIG. 6B presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a leave event based on full rebalancing, in accordance with an embodiment of the present invention.



FIG. 6C presents a flowchart illustrating the switching over process of a partner switch of a virtual link aggregation for a leave event, in accordance with an embodiment of the present invention.



FIG. 7 illustrates an exemplary architecture of a switch and a computing system capable of providing multicast load balancing support to a virtual link aggregation, in accordance with an embodiment of the present invention.





In the figures, like reference numerals refer to the same figure elements.


DETAILED DESCRIPTION

The following description is presented to enable any person skilled in the art to make and use the invention, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present invention. Thus, the present invention is not limited to the embodiments shown, but is to be accorded the widest scope consistent with the claims.


Overview


In embodiments of the present invention, the problem of multicast load balancing in a virtual link aggregation is solved by fairly load balancing multicast groups across the partner switches of the virtual link aggregation. A virtual link aggregation typically dedicates one of its links (i.e., one of the ports participating in the virtual link aggregation) for forwarding multicast traffic. This link is referred to as the primary link and the switch coupled to the primary link is referred to as a primary switch. A link in a virtual link aggregation can be identified by a port associated with that link. In this disclosure, the terms “link” and “port” are used interchangeably to indicate participation in a virtual link aggregation.


With existing technologies, the virtual link aggregation dedicates the same primary link for a respective multicast group. For example, if an end device is coupled to a plurality of switches via a virtual link aggregation, the end device forwards multicast traffic belonging to a respective multicast group via the same primary link. This results in poor bandwidth utilization for virtual link aggregation and creates a congestion point for the multicast traffic on that primary link.


To solve this problem, multicast groups are distributed across the partner switches of the virtual link aggregation to provide load balancing of multicast traffic. The switches participating in a virtual link aggregation, in conjunction with each other, specify which partner switch is the primary switch for a respective multicast group. The partner switch then can further load balance across its local links in the virtual link aggregation (i.e., the partner switch's links which are in the virtual link aggregation). In some embodiments, a weight distribution vector is used to represent the bandwidth ratio of a respective link in the virtual link aggregation and determine the primary switch. As a result, the multicast load is fairly shared among the switches based on available bandwidth. In some embodiments, the weight distribution vector can also represent the number of links participating in the virtual link aggregation.


Furthermore, during any change event, when a switch or link joins or leaves the virtual link aggregation, a synchronizing node synchronizes the change. This synchronizing node can be any device capable of communicating with the switches (e.g., capable of sending/receiving messages to/from the switches) participating in the virtual link aggregation. Examples of a synchronizing node include, but are not limited to, a switch participating in the virtual link aggregation, and a physical or virtual switch, or physical or virtual computing device coupled to a respective partner switch of the virtual link aggregation via one or more links. Such synchronization avoids out-of-order packet delivery and frame duplication while providing traffic rebalancing (e.g., full, partial, or no rebalancing) during the change.


In some embodiments, the partner switches are member switches of a fabric switch. An end device can be coupled to the fabric switch via a virtual link aggregation. A fabric switch in the network can be an Ethernet fabric switch or a virtual cluster switch (VCS). In an Ethernet fabric switch, any number of switches coupled in an arbitrary topology may logically operate as a single switch. Any new switch may join or leave the fabric switch in “plug-and-play” mode without any manual configuration. In some embodiments, a respective switch in the Ethernet fabric switch is a Transparent Interconnection of Lots of Links (TRILL) routing bridge (RBridge). A fabric switch appears as a single logical switch to the end device.


A fabric switch runs a control plane with automatic configuration capabilities (such as the Fibre Channel control plane) over a conventional transport protocol, thereby allowing a number of switches to be inter-connected to form a single, scalable logical switch without requiring burdensome manual configuration. As a result, one can form a large-scale logical switch using a number of smaller physical switches. The automatic configuration capability provided by the control plane running on each physical switch allows any number of switches to be connected in an arbitrary topology without requiring tedious manual configuration of the ports and links. This feature makes it possible to use many smaller, inexpensive switches to construct a large fabric switch, which can be viewed and operated as a single switch (e.g., as a single Ethernet switch).


It should be noted that a fabric switch is not the same as conventional switch stacking. In switch stacking, multiple switches are interconnected at a common location (often within the same rack), based on a particular topology, and manually configured in a particular way. These stacked switches typically share a common address, e.g., IP address, so they can be addressed as a single switch externally. Furthermore, switch stacking requires a significant amount of manual configuration of the ports and inter-switch links. The need for manual configuration prohibits switch stacking from being a viable option in building a large-scale switching system. The topology restriction imposed by switch stacking also limits the number of switches that can be stacked. This is because it is very difficult, if not impossible, to design a stack topology that allows the overall switch bandwidth to scale adequately with the number of switch units.


In contrast, a fabric switch can include an arbitrary number of switches with individual addresses, can be based on an arbitrary topology, and does not require extensive manual configuration. The switches can reside in the same location, or be distributed over different locations. These features overcome the inherent limitations of switch stacking and make it possible to build a large “switch farm” which can be treated as a single, logical switch. Due to the automatic configuration capabilities of the fabric switch, an individual physical switch can dynamically join or leave the fabric switch without disrupting services to the rest of the network.


Furthermore, the automatic and dynamic configurability of fabric switch allows a network operator to build its switching system in a distributed and “pay-as-you-grow” fashion without sacrificing scalability. The fabric switch's ability to respond to changing network conditions makes it an ideal solution in a virtual computing environment, where network loads often change with time.


Although the present disclosure is presented using examples based on the layer-3 multicast routing protocol, embodiments of the present invention are not limited to layer-3 networks. Embodiments of the present invention are relevant to any networking protocol which distributes multicast traffic. In this disclosure, the term “layer-3 network” is used in a generic sense, and can refer to any networking layer, sub-layer, or a combination of networking layers.


The term “RBridge” refers to routing bridges, which are bridges implementing the TRILL protocol as described in Internet Engineering Task Force (IETF) Request for Comments (RFC) “Routing Bridges (RBridges): Base Protocol Specification,” available at http://tools.ietf.org/html/rfc6325, which is incorporated by reference herein. Embodiments of the present invention are not limited to application among RBridges. Other types of switches, routers, and forwarders can also be used.


In this disclosure, the term “end device” can refer to a host machine, a conventional switch, or any other type of network device. Additionally, an end device can be coupled to other switches or hosts further away from a network. An end device can also be an aggregation point for a number of switches to enter the network.


The term “switch identifier” refers to a group of bits that can be used to identify a switch. In a layer-2 communication, the switch identifier can be a media access control (MAC) address. If a switch is an RBridge, the switch identifier can be referred to as an “RBridge identifier.” Note that the TRILL standard uses “RBridge ID” to denote a 48-bit intermediate-system-to-intermediate-system (IS-IS) System ID assigned to an RBridge, and “RBridge nickname” to denote a 16-bit value that serves as an abbreviation for the “RBridge ID.” In this disclosure, “switch identifier” is used as a generic term and is not limited to any bit format, and can refer to any format that can identify a switch. The term “RBridge identifier” is also used in a generic sense and is not limited to any bit format, and can refer to “RBridge ID” or “RBridge nickname” or any other format that can identify an RBridge.


The term “frame” refers to a group of bits that can be transported together across a network. “Frame” should not be interpreted as limiting embodiments of the present invention to layer-2 networks. “Frame” can be replaced by other terminologies referring to a group of bits, such as “packet,” “cell,” or “datagram.”


The term “switch” is used in a generic sense, and can refer to any standalone switch or switching fabric operating in any network layer. “Switch” should not be interpreted as limiting embodiments of the present invention to layer-2 networks. Any physical or virtual device (e.g., a virtual machine/switch operating on a computing device) that can forward traffic to an end device can be referred to as a “switch.” Examples of a “switch” include, but are not limited to, a layer-2 switch, a layer-3 router, or a TRILL RBridge.


Network Architecture



FIG. 1A illustrates exemplary virtual link aggregations with multicast load balancing support, in accordance with an embodiment of the present invention. As illustrated in FIG. 1A, switches 102 and 104 in network 100 are coupled to end devices 112 and 114 via virtual link aggregations 120 and 130, respectively. Here, switches 102 and 104 are partner switches of virtual link aggregations 120 and 130. In some embodiments, network 100 is a fabric switch, and switches 102, 104, and 106 are member switches of the fabric switch. Virtual link aggregation 120 includes link aggregation 122, which includes three links, and link aggregation 124, which includes two links. Virtual link aggregation 130 includes link 132 and link aggregation 134, which includes three links. Hence, a virtual link aggregation can be formed based on link aggregations and individual links. Note that link aggregations 122, 124, and 134 can operate as trunked links between two devices.


Switches 102 and 104 maintain a number of parameters associated with virtual link aggregations 120 and 130. Such parameters include, but are not limited to, the number of switches in a virtual link aggregation, number of ports of a respective switch participating in the virtual link aggregation, and a weight distribution vector. During operation, end device 112 sends a join request for a multicast group using a multicast management protocol (e.g., an Internet Group Management Protocol (IGMP) or Multicast Listener Discovery (MLD) join) via one of the links of virtual link aggregation 120.


Suppose that end device 112 sends the join request to switch 102. In some embodiments, switch 102 shares the join request with partner switch 104. Switches 102 and 104 individually calculate a weight distribution vector. The slots (i.e., entries) of the vector represent the bandwidth ratio of a respective link (or number of links) participating in virtual link aggregation 120. Based on the vector, switches 102 and 104 determine which switch is the primary switch for the multicast group. This weight distribution vector thus allows partner switches 102 and 104 to distribute multicast groups across themselves. As a result, the traffic of different multicast groups to/from the same end device 112 can flow via different partner switches, thereby providing multicast load balancing across virtual link aggregation 120. Furthermore, for the same multicast group, different virtual link aggregations can select a different primary switch. For example, even though virtual link aggregations 120 and 130 have the same partner switches 102 and 104, for the same multicast group, switch 102 can be the primary switch in virtual link aggregations 120 while switch 104 can be the primary switch in virtual link aggregations 130.



FIG. 1B illustrates exemplary weight distribution vectors based on number of links, in accordance with an embodiment of the present invention. In this example, weight distribution vector 152 represents the number of links in virtual link aggregation 120 and weight distribution vector 154 represents the number of links in virtual link aggregation 130. In the example in FIG. 1A, switches 102 and 104 have three and two links in virtual link aggregation 120, respectively. As a result, weight distribution vector 152 has three slots for switch 102 and two slots for switch 104. Similarly, switches 102 and 104 have one and three links in virtual link aggregation 130, respectively. As a result, weight distribution vector 154 has one slot for switch 102 and three slots for switch 104.


A slot can include a switch identifier (e.g., a MAC address) of the switch it is associated with. For example, slot 1 of weight distribution vector 152 can include the switch identifier of switch 102. In some embodiments, the switch identifiers of switches 102 and 104 determine the order of their corresponding slots in weight distribution vector 152. Suppose that the switch identifier of switch 102 has a smaller magnitude (or value) than the switch identifier of switch 104. As a result, the slots for switch 102 are the slots with lower indices in weight distribution vector 152 compared to the slots for switch 104. Similarly, the slots for switch 102 are the slots with lower indices in weight distribution vector 154 compared to the slots for switch 104.


When a switch receives a join request for a multicast group via a virtual link aggregation, the switch generates an index (e.g., an integer number) of the weight distribution vector of the virtual link aggregation for the multicast group. The index can be generated based on the group address of the multicast group. The group address can include the destination Internet Protocol (IP) address and/or the destination MAC address for the multicast group. In some embodiments, the switch generates the index based on the following calculation: hash(destination IP address, destination MAC address) % N, wherein “hash” indicates a hash function and N indicates the number of slots in the weight distribution vector.


For example, if switch 104 receives a join request for a multicast group via virtual link aggregation 130, switch 104 generates an index value for weight distribution vector 154. If the index corresponds to a slot associated with switch 104, switch 104 becomes the primary switch for the multicast group. In some embodiments, switch 104 generates the index based on the following calculation: hash(destination IP address, destination MAC address) % 4. Here, 4 indicates the number of slots in weight distribution vector 154.



FIG. 1C illustrates exemplary weight distribution vectors based on bandwidth ratio, in accordance with an embodiment of the present invention. In this example, weight distribution vector 162 represents the bandwidth ratio of links in virtual link aggregation 120 and weight distribution vector 164 represents the bandwidth ratio of links in virtual link aggregation 130. Suppose that, in the example in FIG. 1A, links coupled to switch 102 have double the bandwidth than the links coupled to switch 104. Then the bandwidth ratio for the links which are in virtual link aggregation 120 and coupled to switches 102 and 104, respectively, is 3:1. As a result, weight distribution vector 162 has three slots for switch 102 and one slot for switch 104. Similarly, the bandwidth ratio for the links which are in virtual link aggregation 130 and coupled to switches 102 and 104, respectively, is 2:3. As a result, weight distribution vector 164 has two slots for switch 102 and three slots for switch 104.


Distributed Multicast Group Balancing


The weight distribution vector generation process is independently done at a respective a partner switch of a virtual link aggregation. This allows a respective partner switch to generate the weight distribution vector in a distributed way, without requiring a central controller. As a result, the same weight distribution vector can be independently generated at a respective partner switch. Furthermore, a respective partner switch uses the same hash function for a multicast group, thereby independently generating the same index of the weight distribution vector for that multicast group. Hence, the same primary switch is selected at a respective partner switch for the multicast group.



FIG. 2A presents a flowchart illustrating the process of a partner switch of a virtual link aggregation generating a weight distribution vector, in accordance with an embodiment of the present invention. During operation, the switch obtains a respective partner switch's bandwidth associated with the virtual link aggregation (operation 202). The switch then calculates the bandwidth ratio of links in virtual link aggregation for a respective partner switch (operation 204), as described in conjunction with FIG. 1C. Note that the calculation can be based on the number of ports (or links) in the virtual link aggregation, as described in conjunction with FIG. 1B. The switch creates a weight distribution vector based on the calculated bandwidth ratio (operation 206) and determines the number of slot(s) in the weight distribution vector for a respective partner switch based on the calculated bandwidth ratio (operation 208). The switch then determines the slot order of the weight distribution vector for a respective partner switch based on the switch identifiers of the switch partner switches (operation 210) and associates a respective slot of the weight distribution vector with a corresponding partner switch (operation 212).



FIG. 2B presents a flowchart illustrating the process of a partner switch of a virtual link aggregation determining a primary link based on multicast load balancing, in accordance with an embodiment of the present invention. During operation, the switch receives a request for joining a multicast group from an end device via a virtual link aggregation (operation 252) and generates an index based on the group address of the multicast group (operation 254). In some embodiments, the group address includes the destination IP address and destination MAC address; and the switch generates the index based on the following calculation: hash(destination IP address, destination MAC address) % N, wherein N indicates the number of slots in the weight distribution vector.


The switch then obtains a slot from the weight distribution vector based on the generated index (operation 256) and checks whether the obtained slot associated with the local switch (operation 258). In the example in FIG. 1B, if switch 102 generates an index of 3, then the slot corresponding to 3 is associated with switch 102. If the obtained slot is associated with the local switch, the switch assigns the local switch as the primary switch for forwarding traffic associated with the multicast group (operation 262) and performs load balancing among local links in the virtual link aggregation (operation 264). In the example in FIG. 1A, if switch 102 is the primary switch for a join request from end device 112, switch 102 performs a load balancing among the three links in link aggregation 122. The switch then determines the primary link for forwarding traffic associated with the multicast group based on the load balancing (operation 266). If the obtained slot does not correspond to the local switch, the switch precludes the local switch from forwarding traffic associated with the multicast group (operation 260).


Rebalancing Events


Network scenarios often change, requiring multicast traffic via a virtual link aggregation to be rebalanced among the links (and switches) participating in the virtual link aggregation. Such rebalancing is achieved by rebalancing the primary switch assignment based on the updated virtual link aggregation (i.e., the updated topology of the virtual link aggregation) for the corresponding multicast groups. Rebalancing of a virtual link aggregation, which can be referred to as a rebalancing event, can be triggered by a configuration event or a change event. A configuration event may occur when a static multicast group is created or deleted for the virtual link aggregation, or a request for joining or leaving a multicast group arrives at a partner switch via the virtual link aggregation. A change event may occur when a port (or a link) is added to or removed from the virtual link aggregation with existing multicast groups (e.g., is currently forwarding multicast traffic), a port participating in the virtual link aggregation becomes unavailable (e.g., due to a failure) or available (e.g., as a result of a failure recovery), and a new switch is added to the virtual link aggregation. Though the trigger sources for these change events are different, the fundamental reason of a respective change event is the same—a change event occurs when a port actively participating in a virtual link aggregation is added or removed from the existing virtual link aggregation.



FIG. 3A illustrates an exemplary change to a virtual link aggregation with multicast load balancing support, in accordance with an embodiment of the present invention. During operation, a new switch 302 joins virtual link aggregation 120 in network 100 and becomes coupled to end device 112. Switch 302 thus becomes a partner switch of switches 102 and 104 for virtual link aggregation 120. Virtual link aggregation 120 then further includes link aggregation 322 (denoted by dashed lines), which includes two links. Switch 302 maintains a number of parameters associated with virtual link aggregation 120. Such parameters include, but are not limited to, the number of switches in a virtual link aggregation, number of ports of a respective switch participating in the virtual link aggregation, and a weight distribution vector. Switch 302 can obtain these parameters from partner switches 102 and 104. These parameters can also be provided to switch 302 when switch 302 is configured to join virtual link aggregation 120.


Switch 302 joining virtual link aggregation 120 triggers a change event for virtual link aggregation 120. This change event can be considered as a network exception. The change event in virtual link aggregation 120 can change the forwarding path of existing multicast traffic to/from end device 112 via virtual link aggregation 120. As a result, the multicast groups associated with virtual link aggregation 120 (i.e., the multicast groups for which virtual link aggregation 120 carries traffic) can require rebalancing. Such rebalancing is achieved by rebalancing the primary switch assignment based on the updated topology of virtual link aggregation 120.


Any inconsistency during this change event can lead to frame loss, out-of-ordered delivery, or duplicate frames. Hence, while rebalancing the multicast traffic based on the new topology of virtual link aggregation 120, coordination with new switch 302 (and/or the new ports of switch 302 participating in link aggregation 322) is required. This coordination provides a consistent view of the primary switch assignment of the multicast groups associated with virtual link aggregation 120 to switches 102, 104, and 302, both before and after the topology changes.


In some embodiments, to provide a consistent view of virtual link aggregation 120, rebalancing of multicast groups is coordinated by a synchronizing entity, which can be referred to as a synchronizing node. A synchronizing node can be any physical or virtual device that can communicate with (e.g., send/receive messages to/from) switches 102, 104, and 302. In some embodiments, one of the switches in network 100 operates as the synchronizing node. Suppose that switch 106 operates as the synchronizing node in network 100. Upon joining network 100, switch 302 then sends a series of balancing requests to switch 106 for a respecting ports joining virtual link aggregation 120.


In some embodiments, network 100 can support three rebalancing modes: no rebalancing, partial rebalancing, and full rebalancing. The synchronizing node can select the mode based on the underlying network applications and operations. The mode can also be configured by a network administrator. The no rebalancing mode does not affect the primary switch assignment of existing multicast groups. The partial rebalancing mode affects only the primary switch assignment of existing multicast groups that should be associated with newly joined switch 302. The full rebalancing mode rebalances the primary switch assignment of all multicast groups.



FIG. 3B illustrates an exemplary primary switch association of multicast groups associated with a virtual link aggregation based on no rebalancing mode, in accordance with an embodiment of the present invention. Suppose that end device 112 has joined multicast groups 332, 334, 336, 342, 344, and 346. During operation, switch 102 is selected as the primary switch for multicast groups 332, 334, and 336, and switch 104 is selected as the primary switch for multicast groups 342, 344, and 346. If network 100 operates in no rebalancing mode, when switch 302 joins virtual link aggregation 120, the primary switch assignment of these multicast groups do not change. However, in no rebalancing mode, when a link/switch leaves virtual link aggregation 120, the weight distribution vector changes, and a new primary link among the available links is assigned to a respective multicast group associated with the left link/switch.



FIG. 3C illustrates an exemplary primary switch association of multicast groups associated with a virtual link aggregation based on partial or full rebalancing mode, in accordance with an embodiment of the present invention. If network 100 operates in partial or full rebalancing mode, when switch 302 joins virtual link aggregation 120, switches 102, 104, and 302 re-determines primary switch assignment considering newly joined switch 302. In some embodiments, this re-determination is done based on a weight distribution vector, as described in conjunction with FIGS. 1B and 1C.


Suppose that, during the redetermination, switch 102 is determined to be the primary switch for multicast groups 332 and 344, switch 104 is determined to be the primary switch for multicast groups 334 and 346, and switch 302 is determined to be the primary switch for multicast groups 336 and 342. In partial rebalancing mode, only the multicast groups that now have switch 302 as the primary switch are rebalanced and assigned a new primary switch; other multicast groups are not changed. For example, multicast groups 336 and 342 are rebalanced from switches 102 and 104, respectively, to switch 302. However, even though multicast groups 344 and 334 should have switches 102 and 104, respectively, as the primary switches based on the re-determination, switches 104 and 102, respectively, remain as the primary switch for multicast groups 344 and 334. However, in partial rebalancing mode, when a link/switch leaves virtual link aggregation 120, the weight distribution vector changes, and a new primary link among the available links is assigned to a respective multicast group associated with the left link/switch.


On the other hand, in partial rebalancing mode, all multicast groups are assigned a primary switch based on the re-determination. As a result, multicast groups 336 and 342 are rebalanced from switches 102 and 104, respectively, to switch 302, multicast group 344 is rebalanced from switch 104 to switch 102, and multicast group 334 is rebalanced from switch 102 to switch 104. Full rebalancing mode gives the most efficient distribution ratio among the links/switches virtual link aggregation 120, but at the expense of more traffic disruption. In the same way, in no rebalancing mode, when a link/switch leaves virtual link aggregation 120, all multicast groups are assigned a primary switch based on the re-determination as well. In some embodiments, switches 102, 104, and 302 maintain a respective multicast group database comprising the primary switch assignment, as described in conjunction with FIGS. 3B and 3C.


Synchronized Rebalancing


When a switch or link joins or leaves a virtual link aggregation, the rebalancing of the multicast groups is triggered. In some embodiments, if the partner switches are member switches of a fabric switch, when a switch joins or leaves the fabric switch, the rebalancing of the multicast groups is triggered as well. Since these change events can occur concurrently (e.g., multiple switches can leave or join a fabric switch or virtual link aggregation at the same time), the synchronizing node serializes the processing of these events. This serialization ensures that only one event is processed at a time and the processing of the event (e.g., a switch joining the fabric switch) is complete before the next event can start (e.g., a switch leaving the fabric switch). In addition to serializing, synchronizing node coordinates the rebalancing of multicast groups among the partner switches of a virtual link aggregation. In some embodiments, a respective virtual link aggregation can have a different synchronizing node.



FIG. 4A illustrates an exemplary state diagram of a synchronizing node coordinating multicast load rebalancing in a virtual link aggregation, in accordance with an embodiment of the present invention. The synchronizing node is initially in a VLAG_EXCEPTION_WAIT state (state 402). In VLAG_EXCEPTION_WAIT state, the synchronizing node waits for a change event. Upon receiving a change event (operation 410), the synchronizing node enters into a BALANCE_ACK_WAIT state (state 404). In the BALANCE_ACK_WAIT state, the synchronizing node notifies a respective switch in the network regarding the change event by sending a BALANCE_START event notification (operation 412). This BALANCE_START event requests a respective switch to synchronize its multicast group databases and the data plane (e.g., the traffic forwarding states associated with the corresponding multicast group). The synchronizing node then waits for BALANCE_ACK event notification, which indicates completion of the rebalancing, from a respective switch.


When a switch receives the BALANCE_START event notification, the switch stops processing new local join or leave requests. However, the switch completes processing of a respective join or leave request message received from other switches of the network. These messages are transient and generated before the originating switch receives the BALANCE_START event from the synchronizing node. This ensures that a respective switch has the same view of primary switch assignment for a respective multicast group. The switch then removes from local multicast group database a respective multicast group for which the switch is no longer a primary switch under the new topology (i.e., the topology created due to the change event). The switch disables forwarding of multicast data belonging to that multicast group. The switch also identifies the new primary switch. The switch can continue to forward multicast traffic without disruption for the multicast groups for which the switch remains the primary switch under the new topology.


When the synchronizing node receives a BALANCE_ACK event notification from a respective switch (operation 414), the synchronizing node enters into a SWITCH_OVER_ACK_WAIT state (state 406). In the SWITCH_OVER_ACK_WAIT state, the synchronizing node determines that primary switch assignment has converged among the switches, and accordingly, data forwarding can be enabled. Hence, the synchronizing node notifies a respective switch in the network to switch over (or cut over) to the new topology by sending a SWITCH_OVER_START event notification (operation 416). The synchronizing node then waits for SWITCH_OVER_ACK event notification from a respective switch, indicating that the corresponding switch is ready for processing the next change event. When the synchronizing node receives a SWITCH_OVER_ACK event notification from a respective switch (operation 418), the synchronizing node again enters into the VLAG_EXCEPTION_WAIT state, and is ready for processing the next change event. In this way, the synchronizing node processes the next change event only when the current change event is complete, thereby serializing the processing of the change events.



FIG. 4B illustrates an exemplary state diagram of a partner switch of a virtual link aggregation rebalancing multicast load in coordination with a synchronizing node, in accordance with an embodiment of the present invention. The switch is initially in a BALANCE_EVENT_WAIT state (state 452). In the BALANCE_EVENT_WAIT state, the switch waits for a BALANCE_START event notification from the synchronizing node. Upon receiving a BALANCE_START event notification from the synchronizing node (operation 462), the switch enters into a BALANCE_EVENT_STARTED state (state 454). In the BALANCE_EVENT_STARTED state, the switch executes rebalancing operations based on the rebalancing mode (operation 464). The switch also updates the primary switch assignment (operation 466) for any pending request message (e.g., a request for joining or leaving a multicast group) and postpones processing any local request message.


In some embodiments, in the BALANCE_EVENT_STARTED state, the switch co-ordinates with other partner switches, if needed, to determine whether the processing (operation 464 and 466) is complete by a respective switch. When the processing is complete by a respective switch (operation 468), the switch sends a BALANCE_ACK event notification to the synchronizing node (operation 470) and enters into a SWITCH_OVER_EVENT_WAIT state (state 456). In the SWITCH_OVER_EVENT_WAIT state, the partner switch waits for a SWITCH_OVER_START event notification, which indicates an approval for switching over to the new topology, from the synchronizing node.


When the partner switch receives a SWITCH_OVER_START event notification from the synchronizing node (operation 472), the partner switch enters into a SWITCH_OVER_EVENT_STARTED state (state 458). In the SWITCH_OVER_EVENT_STARTED state, the partner switch resumes processing of local request messages and enables forwarding for multicast groups for which the partner switch is a newly assigned primary switch (operation 474). Note that the partner switch can perform local rebalancing of multicast groups based on the post-switching-over topology of the virtual link aggregation to determine whether the switch is a newly assigned primary switch for a multicast group. In the example of FIG. 3A, the post-switching-over topology for virtual link aggregation 120 includes switches 102, 104, and 302, and the pre-switching-over topology for virtual link aggregation 120 includes switches 102 and 104.


The partner switch then sends a SWITCH_OVER_ACK event notification to the synchronizing node (operation 476). SWITCH_OVER_ACK event indicates that the member has completed switching over to the post-switching-over topology for the corresponding virtual link aggregation. Upon sending the SWITCH_OVER_ACK event notification to the synchronizing node, the partner switch enables the data plane of newly assigned primary links (operation 478) and again enters into the BALANCE_EVENT_WAIT state, and is ready for processing the next change. In this way, the synchronizing node coordinates rebalancing among the switches, thereby facilitating a distributed, serialized, and synchronized rebalancing process in response to change events.


Rebalancing for a Join Event


When a switch or link joins a virtual link aggregation, the rebalancing of the multicast groups is triggered. The rebalancing process of a partner switch of a virtual link aggregation for a join event based on a rebalancing mode occurs in the BALANCE_EVENT_STARTED state of the partner switch. After the rebalancing, the switching over process of the partner switch occurs in the SWITCH_OVER_EVENT_STARTED state of the partner switch.



FIG. 5A presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a join event based on no rebalancing, in accordance with an embodiment of the present invention. During operation, the switch postpones processing local requests (i.e., requests for joining or leaving a multicast group locally received via an edge port) for any multicast group (operation 502). An edge port sends/receives data frames to/from an end device. However, the switch continues to process the pending local requests based on pre-switching-over topology of the virtual link aggregation (operation 504). The switch then generates a marker indicating a demarcation point for the post-switching-over topology with the newly joined member (e.g., a partner switch/link) of the virtual link aggregation (operation 506). In some embodiments, the marker is a timestamp indicating that the primary switch assignment for any join request received after this timestamp should be done based on the post-switching-over topology of the virtual link aggregation.


The switch sends a message comprising the marker to a respective switch (operation 508). In some embodiments, the switch sends the marker to itself as well, ensuring the correct marker is used as the demarcation. The switch processes any request notification (e.g., a request for joining or leaving) from other switches for any multicast group (operation 510). The switch then checks whether a primary link has already been assigned for the multicast group (operation 512). If not, the switch checks whether the request notification is a post-marker notification (i.e., whether the request notification has been received after the demarcation point indicated by the marker) (operation 514).


If the request notification is a post-marker notification, the switch determines a primary link for the multicast group based on the post-switching-over topology without enabling forwarding (operation 516), as described in conjunction with FIG. 2B. If the request notification is a not post-marker notification, the switch determines a primary link for the multicast group based on the pre-switching-over topology without enabling forwarding (operation 518). If a primary link has not been assigned for the multicast group (operation 512) or the switch has determined a primary link (operation 516 or 518), the switch checks whether all other markers have been received (operation 522). Receiving all other markers from all other switches indicates that the rebalancing process of all other switches have been complete. If the switch has not received all other markers, the switch continues to process request notifications from other switches for any multicast group (operation 510). Otherwise, the switch sends a BALANCE_ACK event notification to the corresponding synchronizing node (operation 524), as described in conjunction with FIG. 4B.



FIG. 5B presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a join event based on partial rebalancing, in accordance with an embodiment of the present invention. During operation, the switch postpones processing local requests for any multicast group (operation 532) and processes the pending local requests based on pre-switching-over topology of the virtual link aggregation (operation 534). The switch then generates a marker indicating a demarcation point for the post-switching-over topology with the newly joined member (e.g., a partner switch/link) of the virtual link aggregation (operation 536). The switch sends a message comprising the marker to a respective switch (operation 538). In some embodiments, the switch sends the marker to itself as well.


The switch processes any request notification from other switches for any multicast group (operation 540). The switch then checks whether a primary link has already been assigned for the multicast group (operation 542). If not, the switch determines a primary link for the multicast group based on the post-switching-over topology (operation 544). If a primary link has been assigned for the multicast group, the switch checks whether the request notification is a post-marker notification (operation 544). If the request notification is a post-marker notification, the switch determines a primary link for the multicast group based on the post-switching-over topology, as described in conjunction with FIG. 2B, without enabling forwarding and updates the multicast group database (operation 548).


The switch then disables forwarding via the old primary link for the multicast group (operation 550). In some embodiments the multicast group database comprises the multicast groups for which the switch is a primary link. If the switch has determined a primary link(operation 544) or the switch has disabled forwarding via the old primary link (operation 550), the switch checks whether all other markers have been received (operation 552). If the switch has not received all other markers, the switch continues to process request notifications from other switches for any multicast group (operation 540). Otherwise, the switch sends a BALANCE_ACK event notification to the corresponding synchronizing node (operation 554), as described in conjunction with FIG. 4B.



FIG. 5C presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a join event based on full rebalancing, in accordance with an embodiment of the present invention. During operation, the switch postpones processing local requests for any multicast group (operation 562) and continues to process the pending local requests based on post-switching-over topology with the newly joined member (e.g., a partner switch/link) of the virtual link aggregation (operation 564). The switch sends a message comprising a generic marker to a respective switch (operation 566). In some embodiments, the switch sends the marker to itself as well. Since the primary switch is determined for all multicast groups based on post-switching-over topology in full rebalancing mode, the marker is not used to determine whether the pre- or post-switching-over topology should be used for determining the primary switch and link. Here, the marker is generated to make the rebalancing process generic for all rebalancing modes.


The switch processes any request notification from other switches for any multicast group (operation 568), and determines a primary link for the multicast group based on the post-switching-over topology, as described in conjunction with FIG. 2B, and updates the multicast group database (operation 570). The switch then checks whether the determined primary link is via a new primary switch (operation 572). If the determined primary link is via a new primary switch, the switch disables forwarding via the new primary link (operation 574) and the old primary link (operation 576) for the multicast group. If determined primary link is not via a new primary switch (operation 572) or the forwarding via the old primary link has been disabled (operation 576), the switch checks whether all other markers have been received (operation 578). If the switch has not received all other markers, the switch continues to process request notifications from other switches for any multicast group (operation 568). Otherwise, the switch sends a BALANCE_ACK event notification to the corresponding synchronizing node (operation 580), as described in conjunction with FIG. 4B.



FIG. 5D presents a flowchart illustrating the switching over process of a partner switch of a virtual link aggregation for a join event, in accordance with an embodiment of the present invention. During operation, the switch resumes processing of locally received requests (e.g., requests received via edge ports) and request notification from other switches for any multicast group (operation 592). The switch enables forwarding via newly assigned primary links, which can have a disabled forwarding during the rebalancing process, for the corresponding multicast group(s) (operation 594). The switch then sends a SWITCH_OVER_ACK event notification to the synchronizing node (operation 596), as described in conjunction with FIG. 4B.


Rebalancing for a Leave Event


When a switch or link leaves a virtual link aggregation, the rebalancing of the multicast groups is triggered. The rebalancing process of a partner switch of a virtual link aggregation for a leave event based on a rebalancing mode occurs in the BALANCE_EVENT_STARTED state of the partner switch. This rebalancing process is the same for no and partial rebalancing mode. After the rebalancing, the switching over process of the partner switch occurs in the SWITCH_OVER_EVENT_STARTED state of the partner switch.



FIG. 6A presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a leave event based on no or partial rebalancing, in accordance with an embodiment of the present invention. During operation, the switch postpones processing local requests for any multicast group (operation 602) and processes the pending local requests based on pre-switching-over topology of the virtual link aggregation (operation 604). The switch then generates a marker indicating a demarcation point for the post-switching-over topology with the newly left member (e.g., a partner switch/link) of the virtual link aggregation (operation 606). The switch sends a message comprising the marker to a respective switch (operation 608). In some embodiments, the switch sends the marker to itself as well. The switch processes any request notification (e.g., a request for joining or leaving) from other switches for any multicast group (operation 610).


The switch then checks whether the request notification is a post-marker notification (operation 612). If the request notification is a post-marker notification, the switch determines a primary link for the multicast group based on the post-switching-over topology without enabling forwarding (operation 614), as described in conjunction with FIG. 2B. If the request notification is a not post-marker notification, the switch determines a primary link for the multicast group based on the pre-switching-over topology without enabling forwarding (operation 616). After determining a primary link (operation 614 or 616), the switch identifies the multicast group(s) having the virtual link aggregation member which has been left as the primary switch/link (operation 618).


The switch then determines a primary link for the identified multicast group(s) based on the post-switching-over topology without enabling forwarding (operation 620). The switch checks whether all other markers have been received (operation 622). Receiving all other markers from all other switches indicates that the rebalancing process of all other switches have been complete. If the switch has not received all other markers, the switch continues to process request notifications from other switches for any multicast group (operation 610). Otherwise, the switch sends a BALANCE_ACK event notification to the corresponding synchronizing node (operation 624), as described in conjunction with FIG. 4B.



FIG. 6B presents a flowchart illustrating the rebalancing process of a partner switch of a virtual link aggregation for a leave event based on full rebalancing, in accordance with an embodiment of the present invention. During operation, the switch postpones processing local requests for any multicast group (operation 632) and processes the pending local requests based on post-switching-over topology with the newly left member (e.g., a partner switch/link) of the virtual link aggregation (operation 634). The switch sends a message comprising a generic marker to a respective switch (operation 636). In some embodiments, the switch sends the marker to itself as well. Since the primary switch is determined for all multicast groups based on post-switching-over topology in full rebalancing mode, the marker is not used to determine whether the pre- or post-switching-over topology should be used for determining the primary switch and link. Here, the marker is generated to make the rebalancing process generic for all rebalancing modes.


The switch processes any request notification from other switches for any multicast group (operation 638), and determines a primary link for the multicast group based on the post-switching-over topology, as described in conjunction with FIG. 2B, and updates the multicast group database (operation 640). The switch then checks whether the determined primary link is via a new primary switch (operation 642). If the determined primary link is via a new primary switch, the switch disables forwarding via the new primary link (operation 644) and the old primary link (operation 646) for the multicast group. If determined primary link is not via a new primary switch (operation 642) or the forwarding via the old primary link has been disabled (operation 646), the switch checks whether all other markers have been received (operation 648). If the switch has not received all other markers, the switch continues to process any request notification from other switches for any multicast group (operation 638). Otherwise, the switch sends a BALANCE_ACK event notification to the corresponding synchronizing node (operation 650), as described in conjunction with FIG. 4B.



FIG. 6C presents a flowchart illustrating the switching over process of a partner switch of a virtual link aggregation for a leave event, in accordance with an embodiment of the present invention. During operation, the switch resumes processing of locally received requests (e.g., requests received via edge ports) and request notification from other switches for any multicast group (operation 652). The switch enables forwarding via newly assigned primary links, which can have a disabled forwarding during the rebalancing process, for the corresponding multicast group(s) (operation 654). The switch then sends a SWITCH_OVER_ACK event notification to the synchronizing node (operation 656), as described in conjunction with FIG. 4B.


Exemplary Systems



FIG. 7 illustrates an exemplary architecture of a switch and a computing system capable of providing multicast load balancing support to a virtual link aggregation, in accordance with an embodiment of the present invention. In this example, a switch 700 includes a number of communication ports 702, a load balancing module 730, a packet processor 710, a link management module 740, and a storage device 750. Packet processor 710 extracts and processes header information from the received frames.


In some embodiments, switch 700 may maintain a membership in a fabric switch, wherein switch 700 also includes a fabric switch management module 760. Fabric switch management module 760 maintains a configuration database in storage device 750 that maintains the configuration state of every switch within the fabric switch. Fabric switch management module 760 maintains the state of the fabric switch, which is used to join other switches. In some embodiments, switch 700 can be configured to operate in conjunction with a remote switch as a logical Ethernet switch. Under such a scenario, communication ports 702 can include inter-switch communication channels for communication within a fabric switch. This inter-switch communication channel can be implemented via a regular communication port and based on any open or proprietary format. Communication ports 702 can include one or more TRILL ports capable of receiving frames encapsulated in a TRILL header. Packet processor 710 can process these frames.


Link management module 740 operates at least one of communication ports 702 in conjunction with a remote switch to form a virtual link aggregation. During operation, load balancing module 730 generates an index of a weight distribution vector, which can be stored in storage device 750, based on address information of a multicast group associated with the virtual link aggregation. If the index indicates a slot corresponding to switch 700, load balancing module 730 allocates switch 700 as primary switch for the multicast group. In some embodiments, load balancing module 730 generates the index based on a hash value and number of slots of the weight distribution vector. The load balancing module generates the hash value based on the address information of a multicast group associated with the virtual link aggregation.


If switch 700 receives an instruction indicating a change event from a remote synchronizing node, load balancing module 730 rebalances multicast groups among the switches participating in the virtual link aggregation. Similarly, if switch 700 receives an instruction indicating a switching over event from the synchronizing node, load balancing module 730 initiates switching over to a new topology resulting from the change event based on the rebalancing.


In some embodiments, a computing system 770 is coupled to switch 700 via one or more physical/wireless links. Computing system 770 can operate as the synchronizing node. Computing system 770 includes a general purpose processor 774, a memory 776, a number of communication ports 772, a messaging module 790, a synchronizing module 782, and a state management module 784. Processor 704 executes instructions stored in memory 706 to provide instructions switch 700 for coordinating and serializing change events. Messaging module 790 incorporates the instructions in a message and sends the instructions to switch 700 via one or more of the communication ports 772.


During operation, state management module 784 detects a change event associated with the virtual link aggregation. Synchronization module 782 generates a first instruction indicating the change event for switch 700, which participates in the virtual link aggregation. When computing system 770 receives acknowledgement for the first instruction from a respective switch participating in the virtual link aggregation, synchronization module 782 generates a second instruction for switching over to a new topology resulting from the change event for switch 700. Synchronization module 782 precludes computing system 770 from generating an instruction indicating a second change event until receiving acknowledgement for the second instruction from a respective switch participating in the virtual link aggregation.


Note that the above-mentioned modules can be implemented in hardware as well as in software. In one embodiment, these modules can be embodied in computer-executable instructions stored in a memory which is coupled to one or more processors in switch 700 and computing system 770. When executed, these instructions cause the processor(s) to perform the aforementioned functions.


In summary, embodiments of the present invention provide a switch, a method and a system for multicast load balancing in a virtual link aggregation. In one embodiment, the switch comprises one or more ports, a link management module and a load balancing module. The link management module operates a port of the one or more ports of the switch in conjunction with a remote switch to form a virtual link aggregation. The load balancing module generates an index of a weight distribution vector based on address information of a multicast group associated with the virtual link aggregation. A slot of the weight distribution vector corresponds to a respective switch participating in the virtual link aggregation. In response to the index indicating a slot corresponding to the switch, the load balancing module designates the switch as primary switch for the multicast group, which is responsible for forwarding multicast data of the multicast group via the virtual link aggregation.


The methods and processes described herein can be embodied as code and/or data, which can be stored in a computer-readable non-transitory storage medium. When a computer system reads and executes the code and/or data stored on the computer-readable non-transitory storage medium, the computer system performs the methods and processes embodied as data structures and code and stored within the medium.


The methods and processes described herein can be executed by and/or included in hardware modules or apparatus. These modules or apparatus may include, but are not limited to, an application-specific integrated circuit (ASIC) chip, a field-programmable gate array (FPGA), a dedicated or shared processor that executes a particular software module or a piece of code at a particular time, and/or other programmable-logic devices now known or later developed. When the hardware modules or apparatus are activated, they perform the methods and processes included within them.


The foregoing descriptions of embodiments of the present invention have been presented only for purposes of illustration and description. They are not intended to be exhaustive or to limit this disclosure. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art. The scope of the present invention is defined by the appended claims.

Claims
  • 1. A switch, comprising: one or more ports;link management circuitry configured to operate a port of the one or more ports of the switch in conjunction with a remote switch to form a virtual link aggregation; andload balancing circuitry configured to: generate an index of a data structure based on address information of a multicast group associated with the virtual link aggregation, wherein the data structure comprises a plurality of elements and indicates bandwidth distribution among links participating in the virtual link aggregation,wherein a respective element of the data structure corresponds to a switch participating in the virtual link aggregation; and wherein a number of elements in the data structure indicates a bandwidth distribution or a number of links in the virtual link aggregation;in response to the index indicating that an element of the data structure corresponds to the switch,designate the switch as a primary switch for the multicast group, wherein the primary switch is responsible for forwarding multicast data of the multicast group via the virtual link aggregation.
  • 2. The switch of claim 1, wherein slots of the weight distribution vector are ordered based on switch identifiers of switches participating in the virtual link aggregation.
  • 3. The switch of claim 1, wherein the load balancing circuitry is further configured to generate the index based on a hash value and a length of the weight distribution vector, wherein the hash value is based on the address information of a multicast group associated with the virtual link aggregation.
  • 4. The switch of claim 1, wherein the load balancing circuitry is further configured to rebalance primary switches for multicast groups among switches participating in the virtual link aggregation in response to receiving an instruction indicating a change event from a remote synchronizing node.
  • 5. The switch of claim 4, wherein the rebalancing of primary switches for multicast groups is based on one or more of: a no-rebalancing mode;a partial-rebalancing mode; anda full-rebalancing mode.
  • 6. The switch of claim 4, wherein the load balancing circuitry is further configured to initiate switching over to a new topology resulting from the change event based on the rebalancing in response to receiving an instruction indicating a switching over event from the synchronizing node.
  • 7. The switch of claim 1, wherein the switch and the remote switch are members of a network of interconnected switches; and wherein the switch and the remote switch are associated with an identifier identifying the network of interconnected switches.
  • 8. A method, comprising: operating a port of a switch in conjunction with a remote switch to form a virtual link aggregation;generating an index of a data structure based on address information of a multicast group associated with the virtual link aggregation,wherein the data structure comprises a plurality of elements and indicates bandwidth distribution among links participating in the virtual link aggregation, and wherein a respective element of the data structure corresponds to a switch participating in the virtual link aggregation; andwherein a number of elements in the data structure indicates a bandwidth distribution or a number of links in the virtual link aggregation; andin response to the index indicating that an element of the data structure corresponds to the switch, designating the switch as a primary switch for the multicast group, wherein primary switch is responsible for forwarding multicast data of the multicast group via the virtual link aggregation.
  • 9. The method of claim 8, further comprising ordering slots of the weight distribution vector based on switch identifiers of switches participating in the virtual link aggregation.
  • 10. The method of claim 8, further comprising generating the index based on a hash value and a length of the weight distribution vector, wherein the hash value is based on the address information of a multicast group associated with the virtual link aggregation.
  • 11. The method of claim 8, further comprising rebalancing primary switches for multicast groups among switches participating in 3 the virtual link aggregation in response to receiving an instruction indicating a change event from a remote synchronizing node.
  • 12. The method of claim 11, wherein the rebalancing of primary switches for multicast groups is based on one or more of: a no-rebalancing mode;a partial-rebalancing mode; anda full-rebalancing mode.
  • 13. The method of claim 11, further comprising initiating switching over to a new topology resulting from the change event based on the rebalancing in response to receiving an instruction indicating a switching over event from the synchronizing node.
  • 14. The method of claim 8, wherein the switch and the remote switch are members of a network of interconnected switches; and wherein the switch and the remote switch are associated with an identifier identifying the network of interconnected switches.
RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 61/751,798, titled “Multicast Traffic Load Balancing Over Virtual LAG,” by inventors Mythilikanth Raman, Chi Lung Chong, and Vardarajan Venkatesh, filed 11 Jan. 2013, the disclosure of which is incorporated by reference herein. The present disclosure is related to U.S. patent application Ser. No. 13/087,239, titled “Virtual Cluster Switching,” by inventors Suresh Vobbilisetty and Dilip Chatwani, filed 14 Apr. 2011, and U.S. patent application Ser. No. 12/725,249, titled “Redundant Host Connection in a Routed Network,” by inventors Somesh Gupta, Anoop Ghanwani, Phanidhar Koganti, and Shunjia Yu, filed 16 Mar. 2010, the disclosures of which are incorporated by reference herein.

US Referenced Citations (422)
Number Name Date Kind
829529 Keathley Aug 1906 A
5390173 Spinney Feb 1995 A
5802278 Isfeld Sep 1998 A
5878232 Marimuthu Mar 1999 A
5959968 Chin Sep 1999 A
5973278 Wehrill, III Oct 1999 A
5983278 Chong Nov 1999 A
6041042 Bussiere Mar 2000 A
6085238 Yuasa Jul 2000 A
6104696 Kadambi Aug 2000 A
6185214 Schwartz Feb 2001 B1
6185241 Sun Feb 2001 B1
6331983 Haggerty Dec 2001 B1
6438106 Pillar Aug 2002 B1
6498781 Bass Dec 2002 B1
6542266 Philips Apr 2003 B1
6633761 Singhal Oct 2003 B1
6771610 Seaman Aug 2004 B1
6873602 Ambe Mar 2005 B1
6937576 DiBenedetto Aug 2005 B1
6956824 Mark Oct 2005 B2
6957269 Williams Oct 2005 B2
6975581 Medina Dec 2005 B1
6975864 Singhal Dec 2005 B2
7016352 Chow Mar 2006 B1
7061877 Gummalla Jun 2006 B1
7173934 Lapuh Feb 2007 B2
7197308 Singhal Mar 2007 B2
7206288 Cometto Apr 2007 B2
7310664 Merchant Dec 2007 B1
7313637 Tanaka Dec 2007 B2
7315545 Chowdhury et al. Jan 2008 B1
7316031 Griffith Jan 2008 B2
7330897 Baldwin Feb 2008 B2
7380025 Riggins May 2008 B1
7397794 Lacroute Jul 2008 B1
7430164 Bare Sep 2008 B2
7453888 Zabihi Nov 2008 B2
7477894 Sinha Jan 2009 B1
7480258 Shuen Jan 2009 B1
7508757 Ge Mar 2009 B2
7558195 Kuo Jul 2009 B1
7558273 Grosser, Jr. Jul 2009 B1
7571447 Ally Aug 2009 B2
7599901 Mital Oct 2009 B2
7688736 Walsh Mar 2010 B1
7688960 Aubuchon Mar 2010 B1
7690040 Frattura Mar 2010 B2
7706255 Kondrat et al. Apr 2010 B1
7716370 Devarapalli May 2010 B1
7720076 Dobbins May 2010 B2
7729296 Choudhary Jun 2010 B1
7787480 Mehta Aug 2010 B1
7792920 Istvan Sep 2010 B2
7796593 Ghosh Sep 2010 B1
7808992 Homchaudhuri Oct 2010 B2
7836332 Hara Nov 2010 B2
7843906 Chidambaram et al. Nov 2010 B1
7843907 Abou-Emara Nov 2010 B1
7860097 Lovett Dec 2010 B1
7898959 Arad Mar 2011 B1
7912091 Krishnan Mar 2011 B1
7924837 Shabtay Apr 2011 B1
7937756 Kay May 2011 B2
7945941 Sinha May 2011 B2
7949638 Goodson May 2011 B1
7957386 Aggarwal Jun 2011 B1
8018938 Fromm Sep 2011 B1
8027354 Portolani Sep 2011 B1
8054832 Shukla Nov 2011 B1
8068442 Kompella Nov 2011 B1
8078704 Lee Dec 2011 B2
8102781 Smith Jan 2012 B2
8102791 Tang Jan 2012 B2
8116307 Thesayi Feb 2012 B1
8125928 Mehta Feb 2012 B2
8134922 Elangovan Mar 2012 B2
8155150 Chung Apr 2012 B1
8160063 Maltz Apr 2012 B2
8160080 Arad Apr 2012 B1
8170038 Belanger May 2012 B2
8175107 Yalagandula May 2012 B1
8194674 Pagel Jun 2012 B1
8195774 Lambeth Jun 2012 B2
8204061 Sane Jun 2012 B1
8213313 Doiron Jul 2012 B1
8213336 Smith Jul 2012 B2
8230069 Korupolu Jul 2012 B2
8239960 Frattura Aug 2012 B2
8249069 Raman Aug 2012 B2
8270401 Barnes Sep 2012 B1
8295291 Ramanathan Oct 2012 B1
8295921 Wang Oct 2012 B2
8301686 Appajodu Oct 2012 B1
8339994 Gnanasekaran Dec 2012 B2
8351352 Eastlake, III Jan 2013 B1
8369335 Jha Feb 2013 B2
8369347 Xiong Feb 2013 B2
8392496 Linden Mar 2013 B2
8462774 Page Jun 2013 B2
8467375 Blair Jun 2013 B2
8520595 Yadav Aug 2013 B2
8599850 Jha Dec 2013 B2
8599864 Chung Dec 2013 B2
8615008 Natarajan Dec 2013 B2
8706905 McGlaughlin Apr 2014 B1
8724456 Hong May 2014 B1
8806031 Kondur Aug 2014 B1
8826385 Congdon Sep 2014 B2
8918631 Kumar Dec 2014 B1
8937865 Kumar Jan 2015 B1
8995272 Agarwal Mar 2015 B2
20010005527 Vaeth Jun 2001 A1
20010055274 Hegge Dec 2001 A1
20020019904 Katz Feb 2002 A1
20020021701 Lavian Feb 2002 A1
20020039350 Wang Apr 2002 A1
20020054593 Morohashi May 2002 A1
20020091795 Yip Jul 2002 A1
20030026290 Umayabashi Feb 2003 A1
20030041085 Sato Feb 2003 A1
20030123393 Feuerstraeter Jul 2003 A1
20030147385 Montalvo Aug 2003 A1
20030174706 Shankar Sep 2003 A1
20030189905 Lee Oct 2003 A1
20030208616 Laing Nov 2003 A1
20030216143 Roese Nov 2003 A1
20030223428 Blanquer Gonzalez Dec 2003 A1
20040001433 Gram Jan 2004 A1
20040003094 See Jan 2004 A1
20040010600 Baldwin Jan 2004 A1
20040049699 Griffith Mar 2004 A1
20040057430 Paavolainen Mar 2004 A1
20040081171 Finn Apr 2004 A1
20040088668 Hamlin May 2004 A1
20040117508 Shimizu Jun 2004 A1
20040120326 Yoon Jun 2004 A1
20040156313 Hofmeister et al. Aug 2004 A1
20040165595 Holmgren Aug 2004 A1
20040165596 Garcia Aug 2004 A1
20040205234 Barrack Oct 2004 A1
20040213232 Regan Oct 2004 A1
20050007951 Lapuh Jan 2005 A1
20050044199 Shiga Feb 2005 A1
20050074001 Mattes Apr 2005 A1
20050094568 Judd May 2005 A1
20050094630 Valdevit May 2005 A1
20050122979 Gross Jun 2005 A1
20050157645 Rabie et al. Jul 2005 A1
20050157751 Rabie Jul 2005 A1
20050169188 Cometto Aug 2005 A1
20050195813 Ambe Sep 2005 A1
20050207423 Herbst Sep 2005 A1
20050213561 Yao Sep 2005 A1
20050220096 Friskney Oct 2005 A1
20050259586 Hafid Nov 2005 A1
20050265356 Kawarai Dec 2005 A1
20050278565 Frattura Dec 2005 A1
20060007869 Hirota Jan 2006 A1
20060018302 Ivaldi Jan 2006 A1
20060023707 Makishima et al. Feb 2006 A1
20060029055 Perera Feb 2006 A1
20060034292 Wakayama Feb 2006 A1
20060036765 Weyman Feb 2006 A1
20060059163 Frattura Mar 2006 A1
20060062187 Rune Mar 2006 A1
20060072550 Davis Apr 2006 A1
20060083254 Ge Apr 2006 A1
20060098589 Kreeger May 2006 A1
20060140130 Kalkunte Jun 2006 A1
20060168109 Warmenhoven Jul 2006 A1
20060184937 Abels Aug 2006 A1
20060221960 Borgione Oct 2006 A1
20060227776 Chandrasekaran Oct 2006 A1
20060235995 Bhatia Oct 2006 A1
20060242311 Mai Oct 2006 A1
20060245439 Sajassi Nov 2006 A1
20060251067 DeSanti Nov 2006 A1
20060256767 Suzuki Nov 2006 A1
20060265515 Shiga Nov 2006 A1
20060285499 Tzeng Dec 2006 A1
20060291388 Amdahl Dec 2006 A1
20060291480 Cho Dec 2006 A1
20070036178 Hares Feb 2007 A1
20070053294 Ho Mar 2007 A1
20070083625 Chamdani Apr 2007 A1
20070086362 Kato Apr 2007 A1
20070094464 Sharma Apr 2007 A1
20070097968 Du May 2007 A1
20070098006 Parry May 2007 A1
20070116224 Burke May 2007 A1
20070116422 Reynolds May 2007 A1
20070156659 Lim Jul 2007 A1
20070177525 Wijnands Aug 2007 A1
20070177597 Ju Aug 2007 A1
20070183313 Narayanan Aug 2007 A1
20070211712 Fitch Sep 2007 A1
20070258449 Bennett Nov 2007 A1
20070274234 Kubota Nov 2007 A1
20070289017 Copeland, III Dec 2007 A1
20080052487 Akahane Feb 2008 A1
20080056135 Lee Mar 2008 A1
20080065760 Damm Mar 2008 A1
20080080517 Roy Apr 2008 A1
20080095160 Yadav Apr 2008 A1
20080101386 Gray May 2008 A1
20080112400 Dunbar et al. May 2008 A1
20080133760 Berkvens Jun 2008 A1
20080159277 Vobbilisetty Jul 2008 A1
20080172492 Raghunath Jul 2008 A1
20080181196 Regan Jul 2008 A1
20080181243 Vobbilisetty Jul 2008 A1
20080186981 Seto Aug 2008 A1
20080205377 Chao Aug 2008 A1
20080219172 Mohan Sep 2008 A1
20080225852 Raszuk Sep 2008 A1
20080225853 Melman Sep 2008 A1
20080228897 Ko Sep 2008 A1
20080240129 Elmeleegy Oct 2008 A1
20080267179 LaVigne Oct 2008 A1
20080285458 Lysne Nov 2008 A1
20080285555 Ogasahara Nov 2008 A1
20080298248 Roeck Dec 2008 A1
20080304498 Jorgensen Dec 2008 A1
20080310342 Kruys Dec 2008 A1
20090022069 Khan Jan 2009 A1
20090037607 Farinacci Feb 2009 A1
20090042270 Dolly Feb 2009 A1
20090044270 Shelly Feb 2009 A1
20090067422 Poppe Mar 2009 A1
20090067442 Killian Mar 2009 A1
20090079560 Fries Mar 2009 A1
20090080345 Gray Mar 2009 A1
20090083445 Ganga Mar 2009 A1
20090092042 Yuhara Apr 2009 A1
20090092043 Lapuh Apr 2009 A1
20090106405 Mazarick Apr 2009 A1
20090116381 Kanda May 2009 A1
20090122700 Aboba May 2009 A1
20090129384 Regan May 2009 A1
20090138577 Casado May 2009 A1
20090138752 Graham May 2009 A1
20090161584 Guan Jun 2009 A1
20090161670 Shepherd Jun 2009 A1
20090168647 Holness Jul 2009 A1
20090199177 Edwards Aug 2009 A1
20090204965 Tanaka Aug 2009 A1
20090213783 Moreton Aug 2009 A1
20090222879 Kostal Sep 2009 A1
20090232031 Vasseur Sep 2009 A1
20090245112 Okazaki Oct 2009 A1
20090245137 Hares Oct 2009 A1
20090245242 Carlson Oct 2009 A1
20090246137 Hadida Ruah et al. Oct 2009 A1
20090252049 Ludwig Oct 2009 A1
20090252061 Small Oct 2009 A1
20090260083 Szeto Oct 2009 A1
20090279558 Davis Nov 2009 A1
20090292858 Lambeth Nov 2009 A1
20090316721 Kanda Dec 2009 A1
20090323698 LeFaucheur Dec 2009 A1
20090323708 Ihle Dec 2009 A1
20090327392 Tripathi Dec 2009 A1
20090327462 Adams Dec 2009 A1
20090328392 Tripathi Dec 2009
20100027420 Smith Feb 2010 A1
20100046471 Hattori Feb 2010 A1
20100054260 Pandey Mar 2010 A1
20100061269 Banerjee Mar 2010 A1
20100074175 Banks Mar 2010 A1
20100097941 Carlson Apr 2010 A1
20100103813 Allan Apr 2010 A1
20100103939 Carlson Apr 2010 A1
20100131636 Suri May 2010 A1
20100158024 Sajassi Jun 2010 A1
20100165877 Shukla Jul 2010 A1
20100165995 Mehta Jul 2010 A1
20100168467 Johnston Jul 2010 A1
20100169467 Shukla Jul 2010 A1
20100169948 Budko Jul 2010 A1
20100182920 Matsuoka Jul 2010 A1
20100195489 Zhou Aug 2010 A1
20100215042 Sato Aug 2010 A1
20100215049 Raza Aug 2010 A1
20100220724 Rabie Sep 2010 A1
20100226368 Mack-Crane Sep 2010 A1
20100226381 Mehta Sep 2010 A1
20100246388 Gupta Sep 2010 A1
20100257263 Casado Oct 2010 A1
20100265849 Harel Oct 2010 A1
20100271960 Krygowski Oct 2010 A1
20100272107 Papp Oct 2010 A1
20100281106 Ashwood-Smith Nov 2010 A1
20100284414 Agarwal Nov 2010 A1
20100284418 Gray Nov 2010 A1
20100287262 Elzur Nov 2010 A1
20100287548 Zhou Nov 2010 A1
20100290473 Enduri Nov 2010 A1
20100299527 Arunan Nov 2010 A1
20100303071 Kotalwar Dec 2010 A1
20100303075 Tripathi Dec 2010 A1
20100303083 Belanger Dec 2010 A1
20100309820 Rajagopalan Dec 2010 A1
20100309912 Mehta Dec 2010 A1
20100329110 Rose Dec 2010 A1
20110019678 Mehta Jan 2011 A1
20110032945 Mullooly Feb 2011 A1
20110035489 McDaniel Feb 2011 A1
20110035498 Shah Feb 2011 A1
20110044339 Kotalwar Feb 2011 A1
20110044352 Chaitou Feb 2011 A1
20110064086 Xiong Mar 2011 A1
20110064089 Hidaka Mar 2011 A1
20110072208 Gulati Mar 2011 A1
20110085560 Chawla Apr 2011 A1
20110085563 Kotha Apr 2011 A1
20110110266 Li May 2011 A1
20110134802 Rajagopalan Jun 2011 A1
20110134803 Dalvi Jun 2011 A1
20110134925 Safrai Jun 2011 A1
20110142053 Van Der Merwe Jun 2011 A1
20110142062 Wang Jun 2011 A1
20110158113 Nanda Jun 2011 A1
20110161494 McDysan Jun 2011 A1
20110161695 Okita Jun 2011 A1
20110176412 Stine Jul 2011 A1
20110188373 Saito Aug 2011 A1
20110194403 Sajassi Aug 2011 A1
20110194563 Shen Aug 2011 A1
20110228780 Ashwood-Smith Sep 2011 A1
20110231570 Altekar Sep 2011 A1
20110231574 Saunderson Sep 2011 A1
20110235523 Jha Sep 2011 A1
20110243133 Villait Oct 2011 A9
20110243136 Raman Oct 2011 A1
20110246669 Kanada Oct 2011 A1
20110255538 Srinivasan Oct 2011 A1
20110255540 Mizrahi Oct 2011 A1
20110261828 Smith Oct 2011 A1
20110268120 Vobbilisetty Nov 2011 A1
20110268125 Vobbilisetty Nov 2011 A1
20110273988 Tourrilhes Nov 2011 A1
20110274114 Dhar Nov 2011 A1
20110280572 Vobbilisetty Nov 2011 A1
20110286457 En Nov 2011 A1
20110296052 Guo Dec 2011 A1
20110299391 Vobbilisetty Dec 2011 A1
20110299413 Chatwani Dec 2011 A1
20110299414 Yu Dec 2011 A1
20110299527 Yu Dec 2011 A1
20110299528 Yu Dec 2011 A1
20110299531 Yu Dec 2011 A1
20110299532 Yu Dec 2011 A1
20110299533 Yu Dec 2011 A1
20110299534 Koganti Dec 2011 A1
20110299535 Vobbilisetty Dec 2011 A1
20110299536 Cheng Dec 2011 A1
20110317559 Kern Dec 2011 A1
20110317703 Dunbar et al. Dec 2011 A1
20120011240 Hara Jan 2012 A1
20120014261 Salam Jan 2012 A1
20120014387 Dunbar Jan 2012 A1
20120020220 Sugita Jan 2012 A1
20120027017 Rai Feb 2012 A1
20120033663 Guichard Feb 2012 A1
20120033665 Jacob Da Silva Feb 2012 A1
20120033668 Humphries Feb 2012 A1
20120033669 Mohandas Feb 2012 A1
20120033672 Page Feb 2012 A1
20120063363 Li Mar 2012 A1
20120075991 Sugita Mar 2012 A1
20120099567 Hart Apr 2012 A1
20120099602 Nagapudi Apr 2012 A1
20120106339 Mishra May 2012 A1
20120117438 Shaffer May 2012 A1
20120131097 Baykal May 2012 A1
20120131289 Taguchi May 2012 A1
20120134266 Roitshtein May 2012 A1
20120147740 Nakash Jun 2012 A1
20120158997 Hsu Jun 2012 A1
20120163164 Terry Jun 2012 A1
20120177039 Berman Jul 2012 A1
20120210416 Mihelich Aug 2012 A1
20120243539 Keesara Sep 2012 A1
20120275297 Subramanian Nov 2012 A1
20120275347 Banerjee Nov 2012 A1
20120278804 Narayanasamy Nov 2012 A1
20120294192 Masood Nov 2012 A1
20120294194 Balasubramanian Nov 2012 A1
20120320800 Kamble Dec 2012 A1
20120320926 Kamath et al. Dec 2012 A1
20120327766 Tsai et al. Dec 2012 A1
20120327937 Melman et al. Dec 2012 A1
20130003535 Sarwar Jan 2013 A1
20130003737 Sinicrope Jan 2013 A1
20130003738 Koganti Jan 2013 A1
20130028072 Addanki Jan 2013 A1
20130034015 Jaiswal Feb 2013 A1
20130034021 Jaiswal Feb 2013 A1
20130067466 Combs Mar 2013 A1
20130070762 Adams Mar 2013 A1
20130114595 Mack-Crane et al. May 2013 A1
20130124707 Ananthapadmanabha May 2013 A1
20130127848 Joshi May 2013 A1
20130136123 Ge May 2013 A1
20130148546 Eisenhauer Jun 2013 A1
20130194914 Agarwal Aug 2013 A1
20130219473 Schaefer Aug 2013 A1
20130250951 Koganti Sep 2013 A1
20130259037 Natarajan Oct 2013 A1
20130272135 Leong Oct 2013 A1
20130294451 Li Nov 2013 A1
20130301642 Radhakrishnan Nov 2013 A1
20130346583 Low Dec 2013 A1
20140013324 Zhang Jan 2014 A1
20140025736 Wang Jan 2014 A1
20140044126 Sabhanatarajan Feb 2014 A1
20140056298 Vobbilisetty Feb 2014 A1
20140105034 Sun Apr 2014 A1
20150010007 Matsuhira Jan 2015 A1
20150030031 Zhou Jan 2015 A1
20150143369 Zheng May 2015 A1
Foreign Referenced Citations (11)
Number Date Country
102801599 Nov 2012 CN
0579567 May 1993 EP
0579567 Jan 1994 EP
0993156 Dec 2000 EP
1398920 Mar 2004 EP
1916807 Apr 2008 EP
2001167 Dec 2008 EP
2008056838 May 2008 WO
2009042919 Apr 2009 WO
2010111142 Sep 2010 WO
2014031781 Feb 2014 WO
Non-Patent Literature Citations (205)
Entry
Zhai F. Hu et al. ‘RBridge: Pseudo-Nickname; draft-hu-trill-pseudonode-nickname-02.txt’, May 15, 2012.
Mahalingam “VXLAN: A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks” Oct. 17, 2013 pp. 1-22, Sections 1, 4 and 4.1.
Office action dated Apr. 30, 2015, U.S. Appl. No. 13/351,513, filed Jan. 17, 2012.
Office Action dated Apr. 1, 2015, U.S. Appl. No. 13/656,438, filed Oct. 19, 2012.
Office Action dated May 21, 2015, U.S. Appl. No. 13/288,822, filed Nov. 3, 2011.
Siamak Azodolmolky et al. “Cloud computing networking: Challenges and opportunities for innovations”, IEEE Communications Magazine, vol. 51, No. 7, Jul. 1, 2013.
Office Action dated Apr. 1, 2015 U.S. Appl. No. 13/656,438, filed Oct. 19, 2012.
Office action dated Jun. 8, 2015, U.S. Appl. No. 14/178,042, filed Feb. 11, 2014.
Office Action Dated Jun. 10, 2015, U.S. Appl. No. 13/890,150, filed May 8, 2013.
Office Action for U.S. Appl. No. 13/030,688, filed Feb. 18, 2011, dated Apr. 25, 2013.
Office Action for U.S. Appl. No. 13/044,301, filed Mar. 9, 2011, dated Jun. 11, 2013.
Office Action for U.S. Appl. No. 13/044,301, filed Mar. 9, 2011, dated Feb. 22, 2013.
Office Action for U.S. Appl. No. 13/050,102, filed Oct. 26, 2012, dated Oct. 26, 2012.
Office Action for U.S. Appl. No. 13/050,102, filed May 16, 2013, date May 16, 2013.
Office Action for U.S. Appl. No. 13/184,526, filed Jul. 16, 2011, dated Jan. 28, 2013.
Office Action for U.S. Appl. No. 13/184,526, filed May 22, 2013, dated May 22, 2013.
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Jun. 19, 2013.
Office Action for U.S. Appl. No. 13/365,993, filed Feb. 3, 2012, dated Jul. 23, 2013.
Office Action for U.S. Appl. No. 13/365,808, filed Jul. 18, 2013, dated Jul. 18, 2013.
Office Action for U.S. Appl. No. 13/312,903, filed Dec. 6, 2011, dated Jun. 13, 2013.
Office action dated Apr. 26, 2012, U.S. Appl. No. 12/725,249, filed Mar. 16, 2010.
Office action dated Sep. 12, 2012, U.S. Appl. No. 12/725,249, filed Mar. 16, 2010.
Office action dated Dec. 21, 2012, U.S. Appl. No. 13/098,490, filed May 2, 2011.
Office action dated Mar. 27, 2014, U.S. Appl. No. 13/098,490, filed May 2, 2011.
Office action dated Jul. 9, 2013, U.S. Appl. No. 13/098,490, filed May 2, 2011.
Office action dated May 22, 2013, U.S. Appl. No. 13/087,239, filed Apr. 14, 2011.
Office action dated Dec. 5, 2012, U.S. Appl. No. 13/087,239, filed Apr. 14, 2011.
Office action dated Apr. 9, 2014, U.S. Appl. No. 13/092,724, filed Apr. 22, 2011.
Office action dated Feb. 5, 2013, U.S. Appl. No. 13/092,724, filed Apr. 22, 2011.
Office action dated Jan. 10, 2014, U.S. Appl. No. 13/092,580, filed Apr. 22, 2011.
Office action dated Jun. 10, 2013, U.S. Appl. No. 13/092,580, filed Apr. 22, 2011.
Office action dated Jan. 16, 2014, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011.
Office action dated Mar. 18, 2013, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011.
Office action dated Jul. 31, 2013, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011.
Office action dated Aug. 29, 2014, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011.
Office action dated Mar. 14, 2014, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011.
Office action dated Jun. 21, 2013, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011.
Office action dated Jan. 28, 2013, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011.
Office action dated Mar. 26, 2014, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011.
Office action dated Jul. 3, 2013, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011.
Office action dated Jul. 18, 2013, U.S. Appl. No. 13/092,752, filed Apr. 22, 2011.
Office action dated Dec. 20, 2012, U.S. Appl. No. 12/950,974, filed Nov. 19, 2010.
Office action dated May 24, 2012, U.S. Appl. No. 12/950,974, filed Nov. 19, 2010.
Office action dated Jan. 6, 2014, Appl. No. 13/092,877, filed Apr. 22, 2011.
Office action dated Sep. 5, 2013, U.S. Appl. No. 13/092,877, filed Apr. 22, 2011.
Office action dated Mar. 4, 2013, U.S. Appl. No. 13/092,877, filed Apr. 22, 2011.
Office action dated Jan. 4, 2013, U.S. Appl. No. 12/950,968, filed Nov. 19, 2010.
Office action dated Jun. 7, 2012, U.S. Appl. No. 12/950,968, filed Nov. 19, 2010.
Office action dated Sep. 19, 2012, U.S. Appl. No. 13/092,864, filed Apr. 22, 2011.
Office action dated May 31, 2013, U.S. Appl. No. 13/098,360, filed Apr. 29, 2011.
Office action dated Oct. 2, 2013, U.S. Appl. No. 13/044,326, filed Mar. 9, 2011.
Office action dated Dec. 3, 2012, U.S. Appl. No. 13/030,806, filed Feb. 18, 2011.
Office action dated Apr. 22, 2014, U.S. Appl. No. 13/030,806, filed Feb. 18, 2011.
Office action dated Jun. 11, 2013, U.S. Appl. No. 13/030,806, filed Feb. 18, 2011.
Office action dated Apr. 25, 2013, U.S. Appl. No. 13/030,688, filed Feb. 18, 2011.
Office action dated Feb. 22, 2013, U.S. Appl. No. 13/044,301, filed Mar. 9, 2011.
Office action dated Jun. 11, 2013, U.S. Appl. No. 13/044,301, filed Mar. 9, 2011.
Office action dated Oct. 26, 2012, U.S. Appl. No. 13/050,102, filed Mar. 17, 2011.
Office action dated May 16, 2013, U.S. Appl. No. 13/050,102, filed Mar. 17, 2011.
Office action dated Jan. 28, 2013, U.S. Appl. No. 13/148,526, filed Jul. 16, 2011.
Office action dated Dec. 2, 2013, U.S. Appl. No. 13/184,526, filed Jul. 16, 2011.
Office action dated May 22, 2013, U.S. Appl. No. 13/148,526, filed Jul. 16, 2011.
Office action dated Aug. 21, 2014, U.S. Appl. No. 13/184,526, filed Jul. 16, 2011.
Office action dated Nov. 29, 2013, U.S. Appl. No. 13/092,873, filed Apr. 22, 2011.
Office action dated Jun. 19, 2013, U.S. Appl. No. 13/092,873, filed Apr. 22, 2011.
Office action dated Jul. 18, 2013, U.S. Appl. No. 13/365,808, filed Feb. 3, 2012.
Office Action dated Mar. 6, 2014, U.S. Appl. No. 13/425,238, filed Mar. 20, 2012.
Office action dated Nov. 12, 2013, U.S. Appl. No. 13/312,903, filed Dec. 6, 2011.
Office action dated Jun. 13, 2013, U.S. Appl. No. 13/312,903, filed Dec. 6, 2011.
Office Action dated Jun. 18, 2014, U.S. Appl. No. 13/440,861, filed Apr. 5, 2012.
Office Action dated Feb. 28, 2014, U.S. Appl. No. 13/351,513, filed Jan. 17, 2012.
Office Action dated May 9, 2014, U.S. Appl. No. 13/484,072, filed May 30, 2012.
Office Action dated May 14, 2014, U.S. Appl. No. 13/533,843, filed Jun. 26, 2012.
Office Action dated Feb. 20, 2014, U.S. Appl. No. 13/598,204, filed Aug. 29, 2012.
Office Action dated Jun. 6, 2014, U.S. Appl. No. 13/669,357, filed Nov. 5, 2012.
Huang, Nen-Fu et al., ‘An Effective Spanning Tree Algorithm for a Bridged LAN’, Mar. 16, 1992.
Office Action for U.S. Appl. No. 13/351,513, filed Jan. 17, 2012, dated Feb. 28, 2014.
Office Action for U.S. Appl. No. 13/533,843, filed Jun. 26, 2012, dated Oct. 21, 2013.
Office action dated Aug. 4, 2014, U.S. Appl. No. 13/050,102, filed Mar. 17, 2011.
Perlman, Radia et al., ‘RBridges: Base Protocol Specification; Draft-ietf-trill-rbridge-protocol-16.txt’, Mar. 3, 2010, pp. 1-117.
‘An Introduction to Brocade VCS Fabric Technology’, BROCADE white paper, http://community.brocade.com/docs/DOC-2954, Dec. 3, 2012.
U.S. Appl. No. 13/030,806 Office Action dated Dec. 3, 2012.
Office Action dated Apr. 9, 2014, U.S. Appl. No. 13/092,752, filed Apr. 22, 2011.
Brocade ‘Brocade Unveils ‘The Effortless Network’’, http://newsroom.brocade.com/press-releases/brocade-unveils-the-effortless-network-nasdaq-brcd-0859535, 2012.
Kreeger, L. et al., ‘Network Virtualization Overlay Control Protocol Requirements draft-kreeger-nvo3-overlay-cp-00’, Jan. 30, 2012.
Lapuh, Roger et al., ‘Split Multi-link Trunking (SMLT)’, draft-lapuh-network-smlt-08, Jul. 2008.
Office Action for U.S. Appl. No. 13/365,993, filed Feb. 3, 2012, from Cho, Hong Sol., dated Jul. 23, 2013.
Office Action for U.S. Appl. No. 12/950,974, filed Nov. 19, 2010, dated Dec. 20, 2012.
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Sep. 5, 2013.
Office Action for U.S. Appl. No. 13/092,887, dated Jan. 6, 2014.
Office Action for U.S. Appl. No. 13/098,490, filed May 2, 2011, dated Mar. 27, 2014.
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Nov. 29, 2013.
Office Action for U.S. Appl. No. 13/184,526, filed Jul. 16, 2011, dated Dec. 2, 2013.
Office Action for U.S. Appl. No. 13/598,204, filed Aug. 29, 2012, dated Feb. 20, 2014.
Office Action for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011, dated Jul. 7, 2014.
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, dated Apr. 9, 2014.
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Jul. 25, 2014.
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Jun. 20, 2014.
Office Action for U.S. Appl. No. 13/312,903, filed Dec. 6, 2011, dated Aug. 7, 2014.
Office Action for U.S. Appl. No. 13/351,513, filed Jan. 17, 2012, dated Jul. 24, 2014.
Office Action for U.S. Appl. No. 13/425,238, filed Mar. 20, 2012, dated Mar. 6, 2014.
Office Action for U.S. Appl. No. 13/556,061, filed Jul. 23, 2012, dated Jun. 6, 2014.
Office Action for U.S. Appl. No. 13/742,207 dated Jul. 24, 2014, filed Jan. 15, 2013.
Office Action for U.S. Appl. No. 13/950,974, filed Nov. 19, 2010, from Haile, Awet A., dated Dec. 2, 2012.
Perlman R: ‘Challenges and opportunities in the design of TRILL: a routed layer 2 technology’, 2009 IEEE Globecom Workshops, Honolulu, HI, USA, Piscataway, NJ, USA, Nov. 30, 2009 (Nov. 30, 2009), pp. 1-6, XP002649647, DOI: 10.1109/GLOBECOM.2009.5360776 ISBN: 1-4244-5626-0 [retrieved on Jul. 19, 2011].
TRILL Working Group Internet-Draft Intended status: Proposed Standard RBridges: Base Protocol Specificaiton Mar. 3, 2010.
Office action dated Aug. 14, 2014, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011.
Office action dated Jul. 7, 2014, for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011.
Office Action dated Dec. 19, 2014, for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011.
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Nov. 7, 2014.
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Nov. 10, 2014.
Office Action for U.S. Appl. No. 13/157,942, filed Jun. 10, 2011.
Mckeown, Nick et al. “OpenFlow: Enabling Innovation in Campus Networks”, Mar. 14, 2008, www.openflow.org/documents/openflow-wp-latest.pdf.
Office Action for U.S. Appl. No. 13/044,301, dated Mar. 9, 2011.
Office Action for U.S. Appl. No. 13/184,526, filed Jul. 16, 2011, dated Jan. 5, 2015.
Office Action for U.S. Appl. No. 13/598,204, filed Aug. 29, 2012, dated Jan. 5, 2015.
Office Action for U.S. Appl. No. 13/669,357, filed Nov. 5, 2012, dated Jan. 30, 2015.
Office Action for U.S. Appl. No. 13/851,026, filed Mar. 26, 2013, dated Jan. 30, 2015.
Office Action for U.S. Appl. No. 13/786,328, filed Mar. 5, 2013, dated Mar. 13, 2015.
Office Action for U.S. Appl. No. 13/092,460, filed Apr. 22, 2011, dated Mar. 13, 2015.
Office Action for U.S. Appl. No. 13/425,238, dated Mar. 12, 2015.
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, dated Feb. 27, 2015.
Office Action for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, dated Feb. 23, 2015.
Office Action for U.S. Appl. No. 13/044,301, filed Mar. 9, 2011, dated Jan. 29, 2015.
Office Action for U.S. Appl. No. 13/050,102, filed Mar. 17, 2011, dated Jan. 26, 2015.
Office action dated Oct. 2, 2014, for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011.
Kompella, Ed K. et al., ‘Virtual Private LAN Service (VPLS) Using BGP for Auto-Discovery and Signaling’ Jan. 2007.
Rosen, E. et al., “BGP/MPLS VPNs”, Mar. 1999.
Office Action for U.S. Appl. No. 14/577,785, filed Dec. 19, 2014, dated Apr. 13, 2015.
Office Action for U.S. Appl. No. 13/425,238, filed Mar. 20, 2012, dated Mar. 12, 2015.
Abawajy J. “An Approach to Support a Single Service Provider Address Image for Wide Area Networks Environment” Centre for Parallel and Distributed Computing, School of Computer Science Carleton University, Ottawa, Ontario, K1S 5B6, Canada.
Narten, T. et al. “Problem Statement: Overlays for Network Virtualization draft-narten-nvo3-overlay-problem-statement-01”, Oct. 31, 2011.
Knight, Paul et al. “Layer 2 and 3 Virtual Private Networks: Taxonomy, Technology, and Standardization Efforts”, 2004.
An Introduction to Brocade VCS Fabric Technology, Dec. 3, 2012.
Kreeger, L. et al. “Network Virtualization Overlay Control Protocol Requirements draft-kreeger-nvo3-overlay-cp-00”, Aug. 2, 2012.
Knight, Paul et al., “Network based IP VPN Architecture using Virtual Routers”, May 2003.
Louati, Wajdi et al., “Network-Based Virtual Personal Overlay Networks Using Programmable Virtual Routers”, 2005.
Brocade Unveils “The Effortless Network”, 2009.
The Effortless Network: HyperEdge Technology for the Campus LAN, 2012.
Foundary FastIron Configuration Guide, Software Release FSX 04.2.00b, Software Release FWS 04.3.00, Software Release FGS 05.0.00a, 2008.
FastIron and Turbulron 24x Configuration Guide, 2010.
FastIron Configuration Guide, Supporting IronWare Software Release 07.0.00, 2009.
Christensen, M. et al., Considerations for Internet Group Management Protocol (IGMP) and Multicast Listener Discovery (MLD) Snooping Switches, 2006.
Perlman, Radia et al. “RBridges: Base Protocol Specification”, <draft-ietf-trill-rbridge-protocol-16.txt>, 2010.
Brocade Fabric OS (FOS) 6.2 Virtual Fabrics Feature Frequently Asked Questions, 2009.
Eastlake III, Donald et al., “RBridges: TRILL Header Options”, 2009.
Perlman, Radia “Challenges and Opportunities in the Design of TRILL: a Routed layer 2 Technology”, 2009.
Perlman, Radia et al., “RBridge VLAN Mapping”, <draft-ietf-trill-rbridge-vlan-mapping-01.txt>, 2009.
Knight, S. et al., “Virtual Router Redundancy Protocol”, 1998.
“Switched Virtual Internetworking moves beyond bridges and routers”, 8178 Data Communications 23(1994) September, No. 12.
Touch, J. et al., “Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement”, 2009.
Lapuh, Roger et al., “Split Multi-link Trunking (SMLT)”, 2002.
Lapuh, Roger et al., “Split Multi-Link Trunking (SMLT) draft-Lapuh-network-smlt-08”, 2009.
Nadas, S. et al., “Virtual Router Redundancy Protocol (VRRP) Version 3 for IPv4 and IPv6”, 2010.
Office Action for U.S. Appl. No. 12/725,249, filed Mar. 16, 2010, dated Sep. 12, 2012.
Office Action for U.S. Appl. No. 12/725,249, filed Mar. 16, 2010, dated Apr. 26, 2013.
Office Action for U.S. Appl. No. 13/087,239, filed Apr. 14, 2011, dated Dec. 5, 2012.
Office Action for U.S. Appl. No. 13/087,239, filed Apr. 14, 2011, dated May 22, 2013.
Office Action for U.S. Appl. No. 13/098,490, Filling date May 2, 2011, dated Dec. 21, 2012.
Office Action for U.S. Appl. No. 13/098,490, Filling date May 2, 2011, dated Jul. 9, 2013.
Office Action for U.S. Appl. No. 13/092,724, filed Apr. 22, 2011, dated Feb. 5, 2013.
Office Action for U.S. Appl. No. 13/092,724, filed Apr. 22, 2011, dated Jul. 16, 2013.
Office Action for U.S. Appl. No. 13/092,580, filed Apr. 22, 2011, dated Jun. 10, 2013.
Office Action for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, dated Mar. 18, 2013.
Office Action for U.S. Appl. No. 13/092,460, filed Apr. 22, 2011, dated Jun. 21, 2013.
Office Action for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, dated Jul. 31, 2013.
Office Action for U.S. Appl. No. 13/092,701, filed Apr. 22, 2011, dated Jan. 28, 2013.
Office Action for U.S. Appl. No. 13/092,701, filed Apr. 22, 2011, dated Jul. 3, 2013.
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, dated Feb. 5, 2013.
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, dated Jul. 18, 2013.
Office Action for U.S. Appl. No. 13/950,974, filed Nov. 19, 2010, dated Dec. 20, 2012.
Office Action for U.S. Appl. No. 12/950,974, filed Nov. 19, 2010, dated May 24, 2012.
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Mar. 4, 2013.
Office Action for U.S. Appl. No. 13/902,877, filed Apr. 22, 2011, dated Sep. 5, 2013.
Office Action for U.S. Appl. No. 12/950,968, filed Nov. 19, 2010, dated Jun. 7, 2012.
Office Action for U.S. Appl. No. 12/950,968, filed Nov. 19, 2010, dated Jan. 4, 2013.
Office Action for U.S. Appl. No. 13/092,864, filed Apr. 22, 2011, dated Sep. 19, 2012.
Office Action for U.S. Appl. No. 13/098,360, filed Apr. 29, 2011, dated May 31, 2013.
Office Action for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011, dated Oct. 2, 2013.
Office Action for U.S. Appl. No. 13/030,806, filed Feb. 18, 2011, dated Dec. 3, 2012.
Office Action for U.S. Appl. No. 13/030,806, filed Feb. 18, 2011, dated Jun. 11, 2013.
Office Action dated Jun. 18, 215, U.S. Appl. No. 13/098,490, filed May 2, 2011.
Office Action dated Jun. 16, 2015, U.S. Appl. No. 13/048,817, filed Mar. 15, 2011.
Office Action dated Jul. 31, 2015, U.S. Appl. No. 13/598,204, filed Aug. 29, 2014.
Office Action dated Jul. 31, 2015, U.S. Appl. No. 14/473,941, filed Aug. 29, 2014.
Office Action dated Jul. 31, 2015, U.S. Appl. No. 14/488,173, filed Sep. 16, 2014.
Office Action dated Aug. 21, 2015, U.S. Appl. No. 13/776,217, filed Feb. 25, 2013.
Office Action dated Aug. 19, 2015, U.S. Appl. No. 14/156,374, filed Jan. 15, 2014.
Office Action dated Sep. 2, 2015, U.S. Appl. No. 14/151,693, filed Jan. 9, 2014.
Office Action dated Sep. 17, 2015, U.S. Appl. No. 14/577,785, filed Dec. 19, 2014.
Office Action dated Sep. 22, 2015 U.S. Appl. No. 13/656,438, filed Oct. 19, 2012.
Office Action dated Nov. 5, 2015, U.S. Appl. No. 14/178,042, filed Feb. 11, 2014.
Office Action dated Oct. 19, 2015, U.S. Appl. No. 14/215,996, filed Mar. 17, 2014.
Office Action dated Sep. 18, 2015, U.S. Appl. No. 13/345,566, filed Jan. 6, 2012.
Open Flow Switch Specification Version 1.1.0, Feb. 28, 2011.
Open Flow Switch Specification Version 1.0.0, Dec. 31, 2009.
Open Flow Configuration and Management Protocol 1.0 (OF-Config 1.0) Dec. 23, 2011.
Open Flow Switch Specification Version 1.2 Dec. 5, 2011.
Office action dated Feb. 2, 2016, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011.
Office Action dated Feb. 2, 2016. U.S. Appl. No. 14/154,106, filed Jan. 13, 2014.
Office Action dated Feb. 3, 2016, U.S. Appl. No. 13/098,490, filed May 2, 2011.
Office Action dated Feb. 4, 2016, U.S. Appl. No. 13/557,105, filed Jul. 24, 2012.
Office Action dated Feb. 11, 2016, U.S. Appl. No. 14/488,173, filed Sep. 16, 2014.
Office Action dated Feb. 24, 2016, U.S. Appl. No. 13/971,397, filed Aug. 20, 2013.
Office Action dated Feb. 24, 2016, U.S. Appl. No. 12/705,508, filed Feb. 12, 2010.
Related Publications (1)
Number Date Country
20140198661 A1 Jul 2014 US
Provisional Applications (1)
Number Date Country
61751798 Jan 2013 US