Client auto-configuration in a multi-switch link aggregation

Information

  • Patent Grant
  • 10277464
  • Patent Number
    10,277,464
  • Date Filed
    Tuesday, March 5, 2013
    11 years ago
  • Date Issued
    Tuesday, April 30, 2019
    5 years ago
Abstract
One embodiment of the present invention provides a switch capable of auto-configuration of client devices for a link aggregation. The switch includes a packet processor, an auto-configuration module, and a link-aggregation management module. During operation, the packet processor extracts an identifier of a client device from a notification message received via a local port. The auto-configuration module, which is coupled to the packet processor, associates the local port with the identifier of the client device. If the packet processor recognizes the identifier of the client device in a message received from a remote switch, the link-aggregation management module forms a multi-switch link aggregation for the client device in conjunction with the remote switch.
Description
BACKGROUND

Field


The present disclosure relates to network management. More specifically, the present disclosure relates to a method and system for facilitating automatic configuration of a multi-switch link aggregation for a respective client device.


Related Art


The exponential growth of the Internet has made it a popular delivery medium for heterogeneous data flows. Such heterogeneity has caused an increasing demand for bandwidth. As a result, equipment vendors race to build larger and faster switches with versatile capabilities, such as link aggregation (LAG), to move more traffic efficiently. However, the complexity 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 and more versatile capability are usually more complex and expensive.


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 multi-switch link aggregation) 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. The switches participating in a multi-switch link aggregation are referred to as partner switches.


A multi-switch link aggregation allows multiple links between a client device, which can be an end host or a switching device, and a plurality of partner switches. Currently, such a multi-switch link aggregation in a network has not been able to take advantage of the automatic configuration of the client device coupled to the partner switches. While coupling the client device, a network administrator typically configures the multi-switch link aggregation manually on a respective client device. In the current era of reduced operational expenditure, such manual configuration can lead to a substantial bottleneck.


While multi-switch link aggregation brings many desirable features to networks, some issues remain unsolved for client device configurations.


SUMMARY

One embodiment of the present invention provides a switch capable of auto-configuration of client devices for a link aggregation. The switch includes a packet processor, an auto-configuration module, and a link-aggregation management module. During operation, the packet processor extracts an identifier of a client device from a notification message received via a local port. The auto-configuration module, which is coupled to the packet processor, associates the local port with the identifier of the client device. If the packet processor recognizes the identifier of the client device in a message received from a remote switch, the link-aggregation management module forms a multi-switch link aggregation for the client device in conjunction with the remote switch.


In a variation on this embodiment, the identifier of the client device is either a media access control (MAC) address of the client device or a hash value of the MAC address.


In a variation on this embodiment, the notification message is based on a discovery protocol. This discovery protocol is one of: Link Layer Discovery Protocol (LLDP), Cisco Discovery Protocol (CDP), and Advanced Device Discovery Protocol (ADDP).


In a variation on this embodiment, the notification message also includes one or more of: name and description of the client device, a port identifier associated with an outgoing port of the client device, a virtual local area network (VLAN) identifier associated with the port or the client device, an Internet Protocol (IP) management address, capabilities associated with the client device, power management information, and link aggregation information.


In a variation on this embodiment, the packet processor extracts the identifier of the client device from a plurality of notification messages received via a plurality of local ports. The link-aggregation management module forms a local link aggregation using the plurality of local ports. The auto-configuration module associates the local link aggregation with the identifier of the client device.


In a variation on this embodiment, the link-aggregation management module represents the multi-switch link aggregation using a virtual switch identifier. This virtual switch identifier is associated with the switch and the remote switch.


In a variation on this embodiment, the packet processor encapsulates a data frame received from the client device in a Transparent Interconnection of Lots of Links (TRILL) packet.


In a variation on this embodiment, the switch also includes a fabric switch management module which maintains a membership in a fabric switch. The fabric switch is configured to accommodate a plurality of switches and operates as a single logical switch.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1A illustrates an exemplary multi-switch link aggregation with client auto-configuration support, in accordance with an embodiment of the present invention.



FIG. 1B illustrates how a respective client device uses a discovery protocol for auto-configuration in conjunction with the example in FIG. 1A, in accordance with an embodiment of the present invention.



FIG. 2A presents a flowchart illustrating the auto-configuration process of a client device associated with a multi-multi-switch link aggregation, in accordance with an embodiment of the present invention.



FIG. 2B presents a flowchart illustrating the auto-configuration process of a partner switch associated with a multi-multi-switch link aggregation, in accordance with an embodiment of the present invention.



FIG. 3 presents a flowchart illustrating the process of a switch configuring a multi-multi-switch link aggregation based on client auto-configuration, in accordance with an embodiment of the present invention.



FIG. 4 illustrates an exemplary switch in a software-defined network, 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 facilitating automatic configuration of a multi-switch link aggregation for a client device is solved by sharing client device information via a proactive communication between a client device and a respective partner switch. This allows the partner switch to automatically configure a link aggregation for the client device. It is often desirable to aggregate multiple links between multiple switches and a client device in a network into a logical link aggregation (can also be referred to as a trunk) in a network. Such a link aggregation includes several links among a plurality of switches, and a client device to create a single logical link and support increased bandwidth. This multi-switch link aggregation can also provide high availability. If one of the links or switches in the multi-switch link aggregation fails, the active switch(es) associated with the link aggregation can automatically redistribute traffic across the active links in the link aggregation.


However, with the existing technologies, a multi-switch link aggregation implementation requires manual configuration for a respective client device in a respective partner switch. Such manual configuration typically requires multiple command line interface (CLI) commands for a respective client device. Consequently, a network administrator configuring the multi-switch link aggregation requires the knowledge of the exact number of client devices and the corresponding client device information, such as identification and configuration information. For example, if a multi-switch link aggregation supports 256 client devices, the network administrator needs to know the identification and configuration of 256 client devices. If configuring a client requires “x” number of command line interface commands, the network administrator issues (256*x) commands to a respective partner switch in the multi-switch link aggregation. Such a large volume of manual commands can be repetitious, tedious, and error-prone, and can lead to high operational expenses.


This problem is solved by using proactive communication between a respective client device and the partner switches, typically based on a discovery protocol available in the client devices and partner switches. A respective client device automatically sends the associated information in a notification message via a respective active link of the client device. A respective partner switch receives the notification message via an active link coupling the client device and configures the corresponding multi-switch link aggregation using the received information. Note that the discovery protocol in a respective client device can automatically send out the notification message without any external instruction.


Client device information can include one or more of: a unique identifier (e.g., a media access control (MAC) address) of the client device, name and description of the client device, a port identifier associated with the link, a virtual local area network (VLAN) identifier associated with the port or the client device, an Internet Protocol (IP) management address, capabilities associated with the client device, power management information, and link aggregation information. Examples of a discovery protocol include, but are not limited to, Link Layer Discovery Protocol (LLDP), Cisco Discovery Protocol (CDP), and Advanced Device Discovery Protocol (ADDP).


Upon receiving the client device information, a respective partner switch retrieves the unique identifier of the client device (e.g., the MAC address). The switch identifies the one or more ports from which the notification messages comprising the identifier have been received. In this way, the partner switch recognizes the ports coupling the client device. During the synchronization process with the partner switches, the switch receives the client device information from the remote partner switches. Consequently, the switch recognizes the client device to be multi-homed (i.e., coupled to multiple partner switches). Similarly, a respective remote partner switch receives the client device information from other partner switches and recognizes the client device to be multi-homed. As a result, a respective partner switch then configures a multi-switch link aggregation for the client device across the partner switches.


In some embodiments, the partner switches of a multi-switch link aggregation are member switches of a fabric switch. A client device can be coupled to the fabric switch via the multi-switch 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.


Although the present disclosure is presented using examples based on the use of a discovery protocol, embodiments of the present invention are not limited to the use of a discovery protocol. Embodiments of the present invention are relevant to any method that facilitates automatic information dispersion from a client device for facilitating auto-configuration. In this disclosure, the term “discovery protocol” is used in a generic sense, and can refer to any set of actions that enable a switch to automatically learn information about a client device. Such a set of actions can be implemented in any networking layer, sub-layer, or a combination of networking layers.


The term “client device” refers to any device coupled to a switch via a link aggregation. “Client device” can refer to a host device, which is referred to as a “client host device,” or any type of network switching device, which is referred to as a “client switching device.” “Client switching device” can refer to any client device that can forward traffic to another device. Additionally, a client device can be coupled to other switches or hosts further away from a network. A client device can also be an aggregation point for a number of network devices to enter the network.


The term “message” refers to a group of bits that can be transported together across a network. “Message” should not be interpreted as limiting embodiments of the present invention to any specific networking layer. “Message” can be replaced by other terminologies referring to a group of bits, such as “frame,” “packet,” “cell,” or “datagram.” The term “frame” is used in a generic sense and 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 it can refer to any standalone or fabric switch operating in any network layer. “Switch” should not be interpreted as limiting embodiments of the present invention to layer-2 networks. Any device that can forward traffic to a client 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, a Transparent Interconnection of Lots of Links (TRILL) Routing Bridge (RBridge), an FC router, or an FC switch.


The term “Ethernet fabric switch” refers to a number of interconnected physical switches which form a single, scalable logical switch. In a fabric switch, any number of switches can be connected in an arbitrary topology, and the entire group of switches functions together as one single, logical switch. This feature makes it possible to use many smaller, inexpensive switches to construct a large fabric switch, which can be viewed as a single logical switch externally.


Network Architecture



FIG. 1A illustrates an exemplary multi-switch link aggregation with client auto-configuration support, in accordance with an embodiment of the present invention. A network 100 includes switches 102 and 104 coupled to each other via inter-switch link 110. Also included is a layer-2 and/or layer-3 sub-network 150 coupled to switches 102 and 104. In some embodiments, network 100 is a fabric switch. A large number of multi-homed client host devices, from 121 to 129, are coupled to switches 102 and 104. Similarly, a large number of multi-homed client switching devices, from 131 to 139 are coupled to switches 102 and 104. The total number of multi-homed client devices supported by switches 102 and 104 is equal to or greater than the number of client devices coupled to both switches 102 and 104. A switch can also have single-homed client devices coupled to the switch. For example, switch 104 is coupled to single-homed client host device 140.


With the existing technologies, configuring a multi-switch link aggregation for a client device (e.g., client device 121 or 131) requires manual configuration involving multiple command line interface commands on both switches 102 and 104. Furthermore, for issuing the commands, the network administrator of network 100 requires explicit knowledge of client device information, such as identification and configuration of client devices 121-129 and 131-139. A large volume of manual commands can be repetitious, tedious, and error-prone, and can lead to high operational expenses. To solve this problem, client devices 121-129 and 131-139 can proactively convey their respective client device information to switches 102 and 104.


In some embodiments, client devices 121-129 and 131-139 support one or more discovery protocols for automatic information dispersion. A respective client device can use a different discovery protocol, as long as switches 102 and 104 support that discovery protocol. Client device information of client devices 121-129 and 131-139 can include one or more of: a MAC address of the client device, name and description of the client device, a port identifier associated with the active link, a VLAN identifier associated with the port or the client device, an IP management address, capabilities associated with the client device, power management information, and link aggregation information. Examples of a discovery protocol include, but are not limited to, LLDP, CDP, and ADDP.


During operation, switches 102 and 104 are configured as partner switches for multi-switch link aggregations. As a result, all client devices multi-homed to switches 102 and 104 synchronize information with each other. Upon coupling to switch 102, client device 121 sends to switch 102 a notification message, which includes the MAC address of client device 121 and an identifier of the local port coupling switch 102. Switch 102 receives the notification message from client device 121 and retrieves the MAC address of client device 121 from the message. Switch 102 identifies the port from which the notification message has been received and associates the identifier with the port. If switch 102 receives notification messages from client device 121 via a plurality of ports, switch 102 associates these ports with client device 121. In this way, switch 102 recognizes all local ports coupling client device 121. Similarly, client device 121 sends a notification message to switch 104 as well for a respective link coupling client device 121 to switch 104. This allows switch 104 to recognize the local ports coupling client device 121.


Partner switches 102 and 104 synchronize the received information from client device 121 with each other via inter-switch link 110. When switch 102 receives information of client device 121 from partner switch 104, switch 102 checks whether the same client device (e.g., a device with the same MAC address) is locally coupled and discovers that client device 121 is coupled to switch 102 as well. In this way, switch 102 recognizes client device 121 to be multi-homed. Similarly, when switch 104 receives information about client device 121 from switch 102, switch 104 recognizes client device 121 to be multi-homed. Partner switches 102 and 104, in conjunction with each other, configure a multi-switch link aggregation for client device 121 across switches 102 and 104. Similarly, client devices 122-129 and 131-139 send respective client device information to switches 102 and 104. Partner switches 102 and 104 configure a respective multi-switch link aggregation for client devices 122-129 and 131-139 across switches 102 and 104.



FIG. 1B illustrates how a respective client device uses a discovery protocol for auto-configuration in conjunction with the example in FIG. 1A, in accordance with an embodiment of the present invention. A respective client device can be coupled to a respective partner switch via any number of links within the maximum number of links supported by the switch and the client device. As a result, a client device can couple with different partner switches via different numbers of links. In the example in FIG. 1B, client device 121 is coupled to switches 102 and 104 via one and two links, respectively. Similarly, client device 131 is coupled to switches 102 and 104 via two and three links, respectively.


When client device 121 sends a notification message to switch 102 via port 161, client device 121 includes the MAC address of client device 121 and an identifier of port 161. Client device 121 can also include the corresponding link capability and a VLAN identifier associated with port 161. Upon receiving the notification message from client device 121, switch 102 identifies the MAC address of client device 121 and the port identifier of port 161. Switch 102 also identifies port 171 from which switch 102 has received the notification message comprising the MAC address of client device 121. Similarly, when client device 121 sends notification messages to switch 104 via ports 162 and 163, client device 121 includes the MAC address of client device 121 in both notification messages. However, client device 121 includes in the message an identifier of port 162 while sending via port 162 and an identifier of port 163 when sending via port 163. Switch 104 receives the notification messages from client device 121, and identifies the MAC address of client device 121 and the port identifiers of ports 162 and 163. Switch 102 also identifies ports 172 and 173 from which switch 104 has received the notification messages comprising the MAC address of client device 121.


Because switch 104 has received notification messages with the same MAC address (i.e., the MAC address of client device 121) via multiple ports (i.e., ports 172 and 173), switch 104 detects that client device 121 is coupled to switch 104 via multiple links. Switch 104 then forms a local link aggregation 170 comprising ports 172 and 173. In some embodiments, switch 104 sends a notification message to client device 121 regarding the link aggregation. Client device 121 receives the notification message and becomes aware of the link aggregation via ports 162 and 163. In some embodiments, client device 121 and switches 102 and 104 support a dynamic link aggregation protocol. An example of a dynamic link aggregation protocol includes, but is not limited to, Link Aggregation Control Protocol (LACP). A dynamic link aggregation protocol allows client device 121 and switches 102 and 104 to verify local link aggregation 170 and detect any misconfiguration, such as inconsistent link aggregation configuration between ports 172 and 173.


Partner switches 102 and 104 synchronize the received information from client device 121 with each other. When switch 102 receives the MAC address of client device 121 from partner switch 104, switch 102 detects that the MAC address is associated with a locally coupled client device 121 and recognizes client device 121 to be multi-homed. Similarly, switch 104 receives the MAC address of client device 121 from switch 102 and recognizes client device 121 to be multi-homed. Partner switches 102 and 104 then automatically configure multi-switch link aggregation 180 for client device 121 across switches 102 and 104. Switch 102 associates port 171 with multi-switch link aggregation 180 while switch 104 associates local link aggregation 170 with multi-switch link aggregation 180.


Auto-Configuration


In the example in FIG. 1B, switches 102 and 104, and client device 121 facilitate auto-configuration using proactive communication between them. FIG. 2A presents a flowchart illustrating the auto-configuration process of a client device associated with a multi-multi-switch link aggregation, in accordance with an embodiment of the present invention. During the initial powering up (i.e., the booting up), the client device identifies the locally configured discovery protocol (operation 202). The client device constructs a notification message, which is based on the discovery protocol, comprising a device identifier (e.g., a MAC address of the client device) (operation 204). The client device identifies an active local port (i.e., an active link) (operation 206) and includes an identifier to the identified port, and other associated information, such as a VLAN identifier, a link capability, and link aggregation information, in the notification message (operation 208). Note that the construction of the notification message and inclusion of the client device information can be specified in the discovery protocol. The client device simply implements the discovery protocol to facilitate the auto-configuration.


The client device can check whether the client device supports a dynamic link aggregation protocol (operation 210). In some embodiments, the dynamic link aggregation protocol is LACP. If the client device supports a dynamic link aggregation protocol, the client device indicates the support for the dynamic link aggregation protocol in the notification message (operation 212). In some embodiments, the client device uses a modified notification message of the discovery protocol to indicate the support for the dynamic link aggregation protocol. For example, the client device can use a modified version of an LLDP notification message to indicate the support for LACP. The client device then transmits the notification message via the identified port (operation 214). Next, the client device checks whether the client device has any more active ports (operation 216). If so, the client device continues to identify active ports (operation 206).



FIG. 2B presents a flowchart illustrating the auto-configuration process of a partner switch associated with a multi-multi-switch link aggregation, in accordance with an embodiment of the present invention. Upon receiving a notification message via a local port (operation 252), the switch obtains a device identifier of a client device from the received notification message (operation 254). This identifier can be a MAC address of the client device. The switch generates a local identifier, which can be shorter than the received client device identifier, for the client device (operation 256). Such generation of shorter local identifier can reduce memory requirements and have ease of deployment. In some embodiments, the local identifier is a hashed value of the MAC address of the client device. A respective partner switch uses the same hash function. Consequently, the same MAC address generates the same local identifier in a respective partner switch. In the example in FIG. 1B, switches 102 and 104 generate the same local identifier for the MAC address of device 121. The switch can optionally generate a local name for the client device (operation 258). In some embodiments, the local name is created as a combined string of the phrase “Auto,” a system name of the client device with a maximum length of 20 characters, and the 12 digits of the base MAC address of the client device.


The switch then associates the local port with the local identifier (operation 260). This allows the switch to identify a respective port from which a notification message from the same client device (i.e., comprising the same identifier) has been received. The switch then identifies other local ports, if any, associated with the local identifier (operation 262) and checks whether a local link aggregation is required (operation 264), as described in conjunction with FIG. 1B. The switch can check the requirement of a local link aggregation by checking whether a plurality of ports are associated with the same local identifier. If a local link aggregation is needed, the switch forms a local link aggregation using the plurality of ports associated with the local identifier (operation 266). In some embodiments, the switch checks whether the switch supports a dynamic link aggregation protocol (operation 268). An example of the dynamic link aggregation protocol is LACP. If the switch supports dynamic link aggregation protocol, the switch verifies the local link aggregation based on the dynamic link aggregation protocol (operation 270) and detects any misconfiguration, such as inconsistent link aggregation configuration.


Multi-Switch Link Aggregation


In the example in FIG. 1B, after the auto-configuration of device 121, switches 102 and 104, in conjunction with each other, automatically configure a multi-switch link aggregation for client device 121. FIG. 3 presents a flowchart illustrating the process of a switch configuring a multi-multi-switch link aggregation based on client auto-configuration, in accordance with an embodiment of the present invention. The switch can repeat the process described in conjunction with FIG. 3 for a respective partner switch. During operation, the switch receives an information message comprising client device information from a partner switch (operation 302). The switch retrieves the device identifier from the information message (operation 304). This device identifier can be the MAC address of the client device or a locally generated hashed value of the MAC address. Next, the switch checks whether the same identifier is locally known (i.e., associated with a local port) (operation 306). If not, the corresponding client device is not multi-homed and not a candidate for a multi-switch link aggregation. The switch then continues to receive information message from the partner switch (operation 302).


If the same identifier exists locally, the corresponding client device is multi-homed. The switch then checks whether the switch has a local link aggregation for the identifier (i.e., a local link aggregation is associated with the identifier) (operation 308). If the switch does not have a local link aggregation for the identifier, the switch identifies the local port associated with the identifier (operation 310). Otherwise, the switch identifies the link aggregation associated with the identifier (operation 312). After identifying the local port or link aggregation, the switch forms a multi-switch link aggregation using the local port or link aggregation associated with the identifier (operation 314). In some embodiments, the switch can check whether the client device supports a dynamic link aggregation protocol (operation 316), such as LACP.


If the end device supports a dynamic link aggregation protocol, the switch verifies the multi-switch link aggregation based on the dynamic link aggregation protocol (operation 318) and detects any misconfiguration, such as inconsistent link aggregation configuration. If the end device does not support a dynamic link aggregation protocol (operation 316) or has verified the multi-switch link aggregation (operation 318), the switch notifies the partner switch regarding the multi-switch link aggregation (operation 320). Consequently, the partner switches become aware of each others' multi-switch link aggregation configuration. In some embodiments, the switch, in conjunction with the partner switch, can create a virtual switch representing the multi-switch link aggregation. Switch virtualization and its associated operations, such as data synchronization, are specified in U.S. Patent Publication No. 2010/0246388, titled “Redundant Host Connection in a Routed Network,” the disclosure of which is incorporated herein in its entirety.


Exemplary Switch



FIG. 4 illustrates an exemplary switch in a software-defined network, in accordance with an embodiment of the present invention. In this example, a switch 400 includes a number of communication ports 402, a link aggregation management module 420, an auto-configuration module 430, a packet processor 410 coupled to auto-configuration module 430, and a storage 450. In some embodiments, switch 400 may maintain a membership in a fabric switch, wherein switch 400 also includes a fabric switch management module 440. Fabric switch management module 440 maintains a configuration database in storage 450 that maintains the configuration state of a respective switch within the fabric switch. Fabric switch management module 440 maintains the state of the fabric switch, which is used to join other switches. Under such a scenario, communication ports 402 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.


During operation, packet processor 410 extracts an identifier of a client device from a notification message received via a local port, which is one of the communication ports 402. This identifier of the client device can be the MAC address of the client device or a hash value of the MAC address, as described in conjunction with FIG. 2B. In some embodiments, the notification message is based on a discovery protocol 432. Discovery protocol 432 enables switch 400 to recognize the notification message sent by the client device. The notification message can also include one or more of: name and description of the client device, a port identifier, a VLAN identifier associated with the port or the client device, an IP management address, capabilities associated with the client device, power management information, and link aggregation information. Examples of discovery protocol 432 include, but are not limited to, LLDP, CDP, and ADDP.


Auto-configuration module 430 then associates the local port with the identifier of the client device. If packet processor 410 recognizes the identifier of the client device in a message received from a remote switch, link-aggregation management module 420 forms a multi-switch link aggregation for the client device in conjunction with the remote switch. If the client device is coupled to switch 400 via multiple links, packet processor 410 can extract the identifier of the client device from a plurality of notification messages received via the corresponding local ports. Under such a scenario, link-aggregation management module 420 forms a local link-aggregation using the plurality of local ports. Auto-configuration module 430 associates the local link aggregation with the identifier of the client device.


In some embodiments, link-aggregation management module 420 represents the multi-switch link aggregation using a virtual switch identifier. This virtual switch identifier is associated with the switch and the remote switch. In some embodiments, switch 400 is a TRILL RBridge. Under such a scenario, the virtual switch identifier can be a virtual RBridge identifier. Furthermore, packet processor 410 encapsulates a respective data frame received from the client device in a TRILL packet to send the data packet to another RBridge.


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 400. When executed, these instructions cause the processor(s) to perform the aforementioned functions.


In summary, embodiments of the present invention provide a switch and a method for facilitating automatic configuration of a client device for a multi-switch link aggregation. In one embodiment, the switch includes a packet processor, an auto-configuration module, and a link aggregation management module. During operation, the packet processor extracts an identifier of a client device from a notification message received via a local port. The auto-configuration module, which is coupled to the packet processor, associates the local port with the identifier of the client device. If the packet processor recognizes the identifier of the client device in a message received from a remote switch, the link-aggregation management module forms a multi-switch link aggregation for the client device in conjunction with the remote switch.


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;processing circuitry configured to obtain, from a first message from a client device, a device identifier of the client device, a port identifier of a port of the client device, and an indicator, which is distinct from the device identifier and indicates indicating whether the client device supports dynamic link aggregation; andmanagement circuitry configured to: obtain, from a second message from a remote switch, the device identifier, wherein the switch and the remote switch are in a plug-and-play mode for forming a logical switch;determine that the client device is multi-homed with the switch and the remote switch; anddetermine whether the client device supports dynamic link aggregation based on the indicator;in response to the indicator indicating that the client device supports dynamic link aggregation: dynamically form a multi-switch link aggregation for the client device;verify the multi-switch link aggregation based on a dynamic link aggregation protocol for detecting any misconfiguration; andin response to detecting a misconfiguration, generate a notification message for the remote switch regarding the misconfiguration;in response to the indicator indicating that the client device does not support dynamic link aggregation, generate a notification message for the remote switch regarding the multi-switch link aggregation.
  • 2. The switch of claim 1, wherein the device identifier of the client device is one of: a media access control (MAC) address of the client device and a hash value of the MAC address.
  • 3. The switch of claim 1, wherein the first message is based on a discovery protocol; and wherein the discovery protocol is one of: Link Layer Discovery Protocol (LLDP);Cisco Discovery Protocol (CDP); andAdvanced Device Discovery Protocol (ADDP).
  • 4. The switch of claim 1, wherein the first message further comprises one or more of: name and description of the client device;a virtual local area network (VLAN) identifier associated with the port of the client device;an Internet Protocol (IP) management address;capabilities associated with the client device;power management information; andlink aggregation information.
  • 5. The switch of claim 1, wherein the first message received is via a first port of the one or more ports of the switch; wherein the processing circuitry is further configured to obtain the device identifier of the client device from a third message received via a second port of the one or more ports of the switch; andwherein the management circuitry is further configured to form a local link aggregation for the client device using the first and second ports, wherein the local link aggregation is incorporated in the multi-switch link aggregation.
  • 6. The switch of claim 1, wherein the multi-switch link aggregation is represented by a virtual switch reachable from the switch and the remote switch, and wherein the virtual switch is identified by a virtual switch identifier associated with the switch and the remote switch.
  • 7. The switch of claim 6, wherein the packet processing circuitry is further configured to encapsulate, with an encapsulation header, a data frame received via the multi-switch link aggregation from the client device, wherein the virtual switch identifier is an ingress identifier of the encapsulation header.
  • 8. The switch of claim 1, wherein the switch and the remote switch are members of a network of interconnected switches, wherein the network of interconnected switches is identified by a fabric identifier associated with the switch and the remote switch.
  • 9. A method, comprising: obtaining, from a first message from a client device, a device identifier of the client device, a port identifier of a port of the client device, and an indicator, which is distinct from the device identifier and indicates whether the client device supports dynamic link aggregation;obtain, from a second message from a remote switch, the device identifier;determining that the client device is multi-homed with a local switch and the remote switch, wherein the switch and the remote switch are in a plug-and-play mode for forming a logical switch;determining whether the client device supports dynamic link aggregation based on the indicator;in response to the indicator indicating that the client device supports dynamic link aggregation; forming a multi-switch link aggregation for the client device;verify the multi-switch link aggregation based on a dynamic link aggregation protocol for detecting any misconfiguration; andin response to detecting a misconfiguration, generate a notification message for the remote switch regarding the misconfiguration;in response to the indicator indicating that the client device does not support dynamic link aggregation, generate a notification message for the remote switch regarding the multi-switch link aggregation.
  • 10. The method of claim 9, wherein the device identifier of the client device is one of: a media access control (MAC) address of the client device and a hash value of the MAC address.
  • 11. The method of claim 9, wherein the first message is based on a discovery protocol; and wherein the discovery protocol is one of: Link Layer Discovery Protocol (LLDP);Cisco Discovery Protocol (CDP); andAdvanced Device Discovery Protocol (ADDP).
  • 12. The method of claim 9, wherein the first message further comprises one or more of: name and description of the client device;a virtual local area network (VLAN) identifier associated with the port of the client device;an Internet Protocol (IP) management address;capabilities associated with the client device;power management information; andlink aggregation information.
  • 13. The method of claim 9, wherein the first message received is via a first port of the local switch; and wherein the method further comprises: obtaining the device identifier of the client device from a third message received via a second port of the local switch; andforming a local link aggregation for the client device using the first and second ports, wherein the local link aggregation is incorporated in the multi-switch link aggregation.
  • 14. The method of claim 9, wherein the multi-switch link aggregation is represented by a virtual switch reachable from the local switch and the remote switch, and wherein the virtual switch is identified by a virtual switch identifier associated with the local switch and the remote switch.
  • 15. The method of claim 14, further comprising encapsulating, with an encapsulation header, a data frame received via the multi-switch link aggregation from the client device, wherein the virtual switch identifier is an ingress identifier of the encapsulation header.
  • 16. The method of claim 9, wherein the local switch and the remote switch are members of a network of interconnected switches, wherein the network of interconnected switches is identified by a fabric identifier associated with the local switch and the remote switch.
  • 17. A computing system, comprising: one or more ports;a processor; anda non-transitory memory storing instructions that when executed by the processor cause the computing system to perform a method, the method comprising: obtaining, from a first message from a client device, a device identifier of the client device from a first message from the client device, a port identifier of a port of the client device, and an indicator, which is distinct from the device identifier and indicates whether the client device supports dynamic link aggregation;obtaining, from a second message from a remote computing system, the device identifier, wherein the computing system and the remote computing system are in a plug-and-play mode for forming a logical switch;determining that the client device is multi-homed with the computing system and the remote computing system; anddetermine whether the client device supports dynamic link aggregation based on the indicator;in response to the indicator indicating that the client device supports dynamic link aggregation; forming a multi-switch link aggregation for the client device;verify the multi-switch link aggregation based on a dynamic link aggregation protocol for detecting any misconfiguration; andin response to detecting a misconfiguration, generate a notification message for the remote switch regarding the misconfiguration;in response to the indicator indicating that the client device does not support dynamic link aggregation, generate a notification message for the remote switch regarding the multi-switch link aggregation.
  • 18. The computing system of claim 17, wherein the device identifier of the client device is one of: a media access control (MAC) address of the client device and a hash value of the MAC address.
  • 19. The computing system of claim 17, wherein the first message is based on a discovery protocol; and wherein the discovery protocol is one of: Link Layer Discovery Protocol (LLDP);Cisco Discovery Protocol (CDP); andAdvanced Device Discovery Protocol (ADDP).
  • 20. The computing system of claim 17, wherein the first message further comprises one or more of: name and description of the client device;a virtual local area network (VLAN) identifier associated with the port of the client device;an Internet Protocol (IP) management address;capabilities associated with the client device;power management information; and link aggregation information.
  • 21. The computing system of claim 17, wherein the first message received is via a first port of the one or more ports of the computing system; and wherein the method further comprises: obtaining the device identifier of the client device from a third message received via a second port of the one or more ports of the computing system;forming a local link aggregation for the client device using the first and second ports, wherein the local link aggregation is incorporated in the multi-switch link aggregation.
  • 22. The computing system of claim 17, wherein the multi-switch link aggregation is represented by a virtual switch reachable via the computing system and the remote computing system, and wherein the virtual switch is identified by a virtual switch identifier associated with the computing system and the remote computing system.
  • 23. The computing system of claim 22, wherein the method further comprises encapsulating, with an encapsulation header, a data frame received via the multi-switch link aggregation from the client device, wherein the virtual switch identifier is an ingress identifier of the encapsulation header.
  • 24. The computing system of claim 17, wherein the method further comprises maintaining a membership in a network of interconnected switches, wherein the network of interconnected switches is identified by a fabric identifier associated with the computing system and the remote computing system.
RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 61/650,360, titled “Dynamic Detection And Cluster Configuration Of Server And Switch Clients Connected To A Cluster,” by inventors Mei Yang, Ravindran Suresh, Arijit Bhattacharyya, and Maocheng Hu, filed 22 May 2012, the disclosure of which is incorporated by reference herein. The present disclosure is related to 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 disclosure of which is incorporated by reference herein.

US Referenced Citations (606)
Number Name Date Kind
829529 Keathley Aug 1906 A
2854352 Gronemeyer Sep 1958 A
5390173 Spinney Feb 1995 A
5802278 Isfeld Sep 1998 A
5878232 Marimuthu Mar 1999 A
5879173 Poplawski Mar 1999 A
5959968 Chin Sep 1999 A
5973278 Wehrill, III Oct 1999 A
5983278 Chong Nov 1999 A
5995262 Hirota Nov 1999 A
6041042 Bussiere Mar 2000 A
6085238 Yuasa Jul 2000 A
6092062 Lohman Jul 2000 A
6104696 Kadambi Aug 2000 A
6185214 Schwartz Feb 2001 B1
6185241 Sun Feb 2001 B1
6295527 McCormack Sep 2001 B1
6331983 Haggerty Dec 2001 B1
6438106 Pillar Aug 2002 B1
6498781 Bass Dec 2002 B1
6542266 Phillips Apr 2003 B1
6553029 Alexander Apr 2003 B1
6571355 Linnell May 2003 B1
6583902 Yuen Jun 2003 B1
6633761 Singhal Oct 2003 B1
6636963 Stein Oct 2003 B1
6771610 Seaman Aug 2004 B1
6870840 Hill Mar 2005 B1
6873602 Ambe Mar 2005 B1
6910149 Perloff et al. Jun 2005 B2
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
7062177 Grivna Jun 2006 B1
7097308 Kim et al. Aug 2006 B2
7173934 Lapuh Feb 2007 B2
7197308 Signhal 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
7397768 Betker Jul 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
7559990 Mital Oct 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
7801021 Triantafillis 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
7937438 Miller May 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
8090805 Chawla Jan 2012 B1
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
8095774 Lambeth Jun 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
8124906 Raman Aug 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
8451717 Srikrishnan May 2013 B2
8462774 Page Jun 2013 B2
8465774 Page Jun 2013 B2
8467375 Blair Jun 2013 B2
8520595 Yadav Aug 2013 B2
8553710 White Oct 2013 B1
8599850 Ha Dec 2013 B2
8599864 Chung Dec 2013 B2
8615008 Natarajan Dec 2013 B2
8619788 Sankaran Dec 2013 B1
8705526 Hasan Apr 2014 B1
8706905 McGlaughlin Apr 2014 B1
8717895 Koponen May 2014 B2
8724456 Hong May 2014 B1
8792501 Rustagi Jul 2014 B1
8798045 Aybay Aug 2014 B1
8798055 An Aug 2014 B1
8804736 Drake Aug 2014 B1
8806031 Kondur Aug 2014 B1
8826385 Congdon Sep 2014 B2
8918631 Kumar Dec 2014 B1
8937865 Kumar Jan 2015 B1
8948181 Kapadia Feb 2015 B2
8995272 Agarwal Mar 2015 B2
9178793 Marlow Nov 2015 B1
9350680 Thayalan May 2016 B2
9401818 Venkatesh Jul 2016 B2
9438447 Basso Sep 2016 B2
20010005527 Vaeth Jun 2001 A1
20010055274 Hegge Dec 2001 A1
20020019904 Katz Feb 2002 A1
20020021701 Lavian Feb 2002 A1
20020027885 Ben-Ami Mar 2002 A1
20020039350 Wang Apr 2002 A1
20020054593 Morohashi May 2002 A1
20020087723 Williams Jul 2002 A1
20020091795 Yip Jul 2002 A1
20030026290 Umayabashi Feb 2003 A1
20030041085 Sato Feb 2003 A1
20030093567 Lolayekar May 2003 A1
20030097464 Martinez May 2003 A1
20030097470 Lapuh May 2003 A1
20030123393 Feuerstraeter Jul 2003 A1
20030147385 Montalvo Aug 2003 A1
20030152075 Hawthorne Aug 2003 A1
20030174706 Shankar Sep 2003 A1
20030189905 Lee Oct 2003 A1
20030189930 Terrell Oct 2003 A1
20030208616 Laing Nov 2003 A1
20030216143 Roese Nov 2003 A1
20030223428 BlanquerGonzalez Dec 2003 A1
20030233534 Bernhard Dec 2003 A1
20040001433 Gram Jan 2004 A1
20040003094 See Jan 2004 A1
20040010600 Baldwin Jan 2004 A1
20040088668 Bornowski Jan 2004 A1
20040049699 Griffith Mar 2004 A1
20040057430 Paavolainen Mar 2004 A1
20040081171 Finn Apr 2004 A1
20040095900 Siegel 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
20040225725 Enomoto Nov 2004 A1
20040243673 Goyal Dec 2004 A1
20050007951 Lapuh Jan 2005 A1
20050025179 McLaggan Feb 2005 A1
20050044199 Shiga Feb 2005 A1
20050074001 Mattes Apr 2005 A1
20050094568 Judd May 2005 A1
20050094630 Valdevit May 2005 A1
20050108375 Hallak-Stamler May 2005 A1
20050111352 Ho May 2005 A1
20050122979 Gross Jun 2005 A1
20050152335 Lodha Jul 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
20050265330 Suzuki Dec 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
20060036648 Frey Feb 2006 A1
20060036765 Weyman Feb 2006 A1
20060039366 Ghosh Feb 2006 A1
20060059163 Frattura Mar 2006 A1
20060062187 Rune Mar 2006 A1
20060072550 Davis Apr 2006 A1
20060083172 Jordan Apr 2006 A1
20060083254 Ge Apr 2006 A1
20060092860 Higashitaniguchi May 2006 A1
20060093254 Mozdy May 2006 A1
20060098589 Kreeger May 2006 A1
20060126511 Youn Jun 2006 A1
20060140130 Kalkunte Jun 2006 A1
20060155828 Ikeda Jul 2006 A1
20060168109 Warmenhoven Jul 2006 A1
20060184937 Abels Aug 2006 A1
20060209886 Silberman Sep 2006 A1
20060221960 Borgione Oct 2006 A1
20060227776 Chandrasekaran Oct 2006 A1
20060235995 Bhatia Oct 2006 A1
20060242311 Mai Oct 2006 A1
20060242398 Fontijn 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
20060294413 Filz Dec 2006 A1
20070036178 Hares Feb 2007 A1
20070053294 Ho Mar 2007 A1
20070061817 Atkinson Mar 2007 A1
20070074052 Hemmah Mar 2007 A1
20070081530 Nomura Apr 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 Burke May 2007 A1
20070121617 Kanekar May 2007 A1
20070130295 Rastogi Jun 2007 A1
20070156659 Lim Jul 2007 A1
20070177525 Wijnands Aug 2007 A1
20070177597 Ju Aug 2007 A1
20070183313 Narayanan Aug 2007 A1
20070206762 Chandra Sep 2007 A1
20070211712 Fitch Sep 2007 A1
20070220059 Lu Sep 2007 A1
20070226214 Smits Sep 2007 A1
20070230472 Jesuraj Oct 2007 A1
20070238343 Velleca Oct 2007 A1
20070258449 Bennett Nov 2007 A1
20070274234 Kubota Nov 2007 A1
20070280223 Pan Dec 2007 A1
20070289017 Copeland, III Dec 2007 A1
20080052487 Akahane Feb 2008 A1
20080056135 Lee Mar 2008 A1
20080056300 Williams Mar 2008 A1
20080057918 Abrant Mar 2008 A1
20080065760 Damm Mar 2008 A1
20080080517 Roy Apr 2008 A1
20080095160 Yadav Apr 2008 A1
20080101386 Gray May 2008 A1
20080112133 Torudbakken May 2008 A1
20080112400 Dunbar et al. May 2008 A1
20080133760 Henricus Jun 2008 A1
20080159260 Vobbilisetty Jul 2008 A1
20080159277 Vobbilisetty Jul 2008 A1
20080172492 Raghunath Jul 2008 A1
20080181196 Regan Jul 2008 A1
20080181243 Vobbilisetty Jul 2008 A1
20080186968 Farinacci Aug 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
20080288020 Einav Nov 2008 A1
20080298248 Roeck Dec 2008 A1
20080304428 Stilling Dec 2008 A1
20080304498 Jorgensen Dec 2008 A1
20080304519 Koenen Dec 2008 A1
20080310342 Kruys Dec 2008 A1
20090022069 Khan Jan 2009 A1
20090024734 Merbach Jan 2009 A1
20090037607 Farinacci Feb 2009 A1
20090037977 Gai Feb 2009 A1
20090041046 Hirata 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
20090094354 Rastogi Apr 2009 A1
20090106298 Furusho Apr 2009 A1
20090106405 Mazarick Apr 2009 A1
20090113408 Toeroe 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
20090144720 Roush Jun 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
20090225752 Mitsumori 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 Oct 2009 A1
20090249444 Macauley Oct 2009 A1
20090252049 Ludwig Oct 2009 A1
20090252061 Small Oct 2009 A1
20090252503 Ishigami 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
20100002382 Aybay Jan 2010 A1
20100027420 Smith Feb 2010 A1
20100042869 Szabo Feb 2010 A1
20100046471 Hattori Feb 2010 A1
20100054260 Pandey Mar 2010 A1
20100061269 Banerjee Mar 2010 A1
20100074175 Banks Mar 2010 A1
20100085981 Gupta Apr 2010 A1
20100097941 Carlson Apr 2010 A1
20100103813 Allan Apr 2010 A1
20100103939 Carlson Apr 2010 A1
20100114818 Lier May 2010 A1
20100131636 Suri May 2010 A1
20100157844 Casey Jun 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
20100189119 Sawada Jul 2010 A1
20100195489 Zhou Aug 2010 A1
20100195529 Liu 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
20100254703 Kirkpatrick Oct 2010 A1
20100257263 Casado Oct 2010 A1
20100258263 Douxchamps 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
20100284698 McColloch Nov 2010 A1
20100287262 Elzur Nov 2010 A1
20100287548 Zhou Nov 2010 A1
20100290464 Assarpour Nov 2010 A1
20100290472 Raman 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
20100329265 Lapuh Dec 2010 A1
20110007738 Berman Jan 2011 A1
20110019678 Mehta Jan 2011 A1
20110032945 Mullooly et al. Feb 2011 A1
20110035489 McDaniel Feb 2011 A1
20110035498 Shah Feb 2011 A1
20110044339 Kotalwar Feb 2011 A1
20110044352 Chaitou Feb 2011 A1
20110051723 Rabie Mar 2011 A1
20110058547 Waldrop Mar 2011 A1
20110064086 Xiong Mar 2011 A1
20110064089 Hidaka Mar 2011 A1
20110072208 Gulati Mar 2011 A1
20110085560 Chawla Apr 2011 A1
20110085562 Bao Apr 2011 A1
20110085563 Kotha Apr 2011 A1
20110088011 Ouali 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
20110149526 Turner 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
20110225540 d'Entremont Sep 2011 A1
20110228767 Singla Sep 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
20110268118 Schlansker Nov 2011 A1
20110268120 Vobbilisetty Nov 2011 A1
20110268125 Vobbilisetty Nov 2011 A1
20110273988 Tourrilhes Nov 2011 A1
20110273990 Rajagopalan Nov 2011 A1
20110274114 Dhar Nov 2011 A1
20110280572 Vobbilisetty et al. Nov 2011 A1
20110286357 Haris Nov 2011 A1
20110286457 Ee Nov 2011 A1
20110286462 Kompella Nov 2011 A1
20110055274 Hegge Dec 2011 A1
20110292947 Vobbilisetty Dec 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
20120039163 Nakajima Feb 2012 A1
20120042095 Kotha Feb 2012 A1
20120063363 Li Mar 2012 A1
20120075991 Sugita Mar 2012 A1
20120099567 Hart Apr 2012 A1
20120099602 Nagapudi Apr 2012 A1
20120099863 Xu Apr 2012 A1
20120102160 Breh 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
20120136999 Roitshtein May 2012 A1
20120147740 Nakash Jun 2012 A1
20120158997 Hsu Jun 2012 A1
20120163164 Terry Jun 2012 A1
20120170491 Kern Jul 2012 A1
20120173905 Diab Jul 2012 A1
20120177039 Berman Jul 2012 A1
20120210416 Mihelich Aug 2012 A1
20120221636 Surtani Aug 2012 A1
20120230225 Matthews Sep 2012 A1
20120239918 Huang Sep 2012 A1
20120243359 Keesara Sep 2012 A1
20120243539 Keesara Sep 2012 A1
20120250502 Brolin Oct 2012 A1
20120260079 Mruthyunjaya Oct 2012 A1
20120275297 Subramanian Nov 2012 A1
20120275347 Banerjee Nov 2012 A1
20120278804 Narayanasamy Nov 2012 A1
20120287785 Kamble Nov 2012 A1
20120294192 Masood Nov 2012 A1
20120294194 Balasubramanian Nov 2012 A1
20120230800 Kamble Dec 2012 A1
20120320800 Kamble et al. 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
20130003549 Matthews 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
20130034094 Cardona Feb 2013 A1
20130058354 Casado Mar 2013 A1
20130066947 Ahmad Mar 2013 A1
20130067466 Combs Mar 2013 A1
20130070762 Adams Mar 2013 A1
20130083693 Himura Apr 2013 A1
20130097345 Munoz Apr 2013 A1
20130114595 Mack-Crane et al. May 2013 A1
20130124707 Ananthapadmanabha May 2013 A1
20130127848 Joshi May 2013 A1
20130132296 Manfred May 2013 A1
20130135811 Dunwoody May 2013 A1
20130136123 Ge May 2013 A1
20130148546 Eisenhauer Jun 2013 A1
20130156425 Kirkpatrick Jun 2013 A1
20130194914 Agarwal Aug 2013 A1
20130219473 Schaefer Aug 2013 A1
20130223221 Xu Aug 2013 A1
20130223449 Koganti Aug 2013 A1
20130235881 Sharma Sep 2013 A1
20130250951 Koganti Sep 2013 A1
20130250958 Watanabe Sep 2013 A1
20130259037 Natarajan Oct 2013 A1
20130266015 Qu Oct 2013 A1
20130268590 Mahadevan Oct 2013 A1
20130272135 Leong Oct 2013 A1
20130294451 Li Nov 2013 A1
20130297757 Han Nov 2013 A1
20130301425 Chandra Nov 2013 A1
20130301642 Radhakrishnan Nov 2013 A1
20130308492 Baphna Nov 2013 A1
20130308647 Rosset Nov 2013 A1
20130315125 Ravishankar Nov 2013 A1
20130315586 Kipp Nov 2013 A1
20130322427 Stiekes Dec 2013 A1
20130332660 Talagala Dec 2013 A1
20130336104 Talla Dec 2013 A1
20130346583 Low Dec 2013 A1
20140013324 Zhang Jan 2014 A1
20140019608 Kawakami Jan 2014 A1
20140025736 Wang Jan 2014 A1
20140044126 Sabhanatarajan Feb 2014 A1
20140050223 Foo Feb 2014 A1
20140056298 Vobbilisetty Feb 2014 A1
20140059225 Gasparakis Feb 2014 A1
20140064056 Sakata Mar 2014 A1
20140086253 Yong Mar 2014 A1
20140105034 Huawei Apr 2014 A1
20140112122 Kapadia Apr 2014 A1
20140140243 Ashwood-Smith May 2014 A1
20140157251 Hocker Jun 2014 A1
20140241147 Rajagopalan Aug 2014 A1
20140258446 Bursell Sep 2014 A1
20140269720 Srinivasan Sep 2014 A1
20140269733 Venkatesh Sep 2014 A1
20140298091 Carlen Oct 2014 A1
20140355477 Moopath Dec 2014 A1
20150009992 Zhang Jan 2015 A1
20150010007 Matsuhira Jan 2015 A1
20150030031 Zhou Jan 2015 A1
20150110111 Song Apr 2015 A1
20150110487 Fenkes Apr 2015 A1
20150127618 Alberti May 2015 A1
20150143369 Zheng May 2015 A1
20150172098 Agarwal Jun 2015 A1
20150188753 Anumala Jul 2015 A1
20150195093 Ramasubramani Jul 2015 A1
20150222506 Kizhakkiniyil Aug 2015 A1
20150248298 Gavrilov Sep 2015 A1
20150263991 MacChiano Sep 2015 A1
20150281066 Koley Oct 2015 A1
20150301901 Rath Oct 2015 A1
20150347468 Bester Dec 2015 A1
20160072899 Tung Mar 2016 A1
20170026197 Venkatesh Jan 2017 A1
Foreign Referenced Citations (38)
Number Date Country
1735062 Feb 2006 CN
1777149 May 2006 CN
101064682 Oct 2007 CN
101459618 Jun 2009 CN
101471899 Jul 2009 CN
101548511 Sep 2009 CN
101645880 Feb 2010 CN
102098237 Jun 2011 CN
102148749 Aug 2011 CN
102301663 Dec 2011 CN
102349268 Feb 2012 CN
102378176 Mar 2012 CN
102404181 Apr 2012 CN
102415065 Apr 2012 CN
102415065 Apr 2012 CN
102801599 Nov 2012 CN
102801599 Nov 2012 CN
102088388 Apr 2014 CN
0579567 May 1993 EP
0579567 Jan 1994 EP
0993156 Apr 2000 EP
0993156 Dec 2000 EP
1398920 Mar 2004 EP
1398920 Mar 2004 EP
1916807 Apr 2008 EP
2001167 Dec 2008 EP
2854352 Apr 2015 EP
2874359 May 2015 EP
2008056838 May 2008 WO
2009042919 Apr 2009 WO
2010111142 Sep 2010 WO
2010111142 Sep 2010 WO
2011132568 Oct 2011 WO
2011140028 Nov 2011 WO
2011140028 Nov 2011 WO
2012033663 Mar 2012 WO
2012093429 Jul 2012 WO
2014031781 Feb 2014 WO
Non-Patent Literature Citations (209)
Entry
IEEE Computer Society, IEEE Standard for Local and metropolitan area networks—Station and Media Access Control Connectivity Discovery, IEEE Standard 802.1AB-2009, pp. 25-34.
IEEE Computer Society, IEEE Standard for Local and metropolitan area networks—Link Aggregation, IEEE Standard 802.1AX-2008, pp. 7-78.
IEEE et al., “Amendment to Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Access Method and Physical Layer Specifications—Aggregation of Multiple Link Segments”, Mar. 30, 2000, IEEE Computer Society, IEEE Std 802.3ad-2000, pp. 116-117.
“Switched Virtual Internetworking moved beyond bridges and routers”, 8178 Data Communications Sep. 23, 1994, No. 12, New York.
S. Night et al., “Virtual Router Redundancy Protocol”, Network Working Group, XP-002135272, Apr. 1998.
Eastlake 3rd., Donald et al., “RBridges: TRILL Header Options”, Draft-ietf-trill-rbridge-options-00.txt, Dec. 24, 2009.
J. Touch, et al., “Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement”, May 2009.
Perlman, Radia et al., “RBridge VLAN Mapping”, Draft-ietf-trill-rbridge-vlan-mapping-01.txt, Dec. 4, 2009.
Brocade Fabric OS (FOS) 6.2 Virtual Fabrics Feature Frequently Asked Questions.
Perlman, Radia “Challenges and Opportunities in the Design of TRILL: a Routed layer 2 Technology”, XP-002649647, 2009.
Nadas, S. et al., “Virtual Router Redundancy Protocol (VRRP) Version 3 for IPv4 and IPv6”, Mar. 2010.
Perlman, Radia et al., “RBridges: Base Protocol Specification”, draft-ietf-trill-rbridge-protocol-16.txt, Mar. 3, 2010.
Christensen, M. et al., “Considerations for Internet Group Management Protocol (IGMP) and Multicast Listener Discovery (MLD) Snooping Switches”, May 2006.
Lapuh, Roger et al., “Split Multi-link Trunking (SMLT)”, Oct. 2002.
Lapuh, Roger et al., “Split Multi-link Trunking (SMLT) draft-lapuh-network-smlt-08”, 2008.
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.
Touch, J. et al., ‘Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement’, May 2009, Network Working Group, pp. 1-17.
Zhai F. Hu et al. ‘RBridge: Pseudo-Nickname; draft-hu-trill-pseudonode-nickname-02.txt’, May 15, 2012.
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.
‘An Introduction to Brocade VCS Fabric Technology’, BROCADE white paper, http://community.brocade.com/docs/DOC-2954, Dec. 3, 2012.
‘RBridges: Base Protocol Specification’, IETF Draft, Perlman et al., Jun. 26, 2009.
U.S. Appl. No. 13/030,806 Office Action dated Dec. 3, 2012.
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 Aug. 14, 2014, 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 Oct. 2, 2014, for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011.
Office Action dated Apr. 9, 2014, U.S. Appl. No. 13/092,752, 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, U.S. 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 Jul. 7, 2014, U.S. Appl. No. 13/044,326, filed Mar. 9, 2011.
Office action dated Oct. 2, 2013, 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 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 Aug. 4, 2014, 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.
Brocade, ‘FastIron and TurboIron 24x Configuration Guide’, Feb. 16, 2010.
Brocade, ‘The Effortless Network: Hyperedge Technology for the Campus LAN’ 2012.
Brocade ‘An Introduction to Brocade VCS Fabric Technology’, Dec. 3, 2012.
Brocade ‘Brocade Unveils ‘The Effortless Network’’, http://newsroom.brocade.com/press-releases/brocade-unveils-the-effortless-network-nasdaq-brcd-0859535, 2012.
FastIron Configuration Guide Supporting Ironware Software Release 07.0.00, Dec. 18, 2009.
Foundary FastIron Configuration Guide, Software Release FSX 04.2.00b, Software Release FWS 04.3.00, Software Release FGS 05.0.00a, Sep. 2008.
Huang, Nen-Fu et al., ‘An Effective Spanning Tree Algorithm for a Bridged LAN’, Mar. 16, 1992.
Knight, ‘Network Based IP VPN Architecture using Virtual Routers’, May 2003.
Knight P et al: ‘Layer 2 and 3 Virtual Private Networks: Taxonomy, Technology, and Standardization Efforts’, IEEE Communications Magazine, IEEE Service Center, Pscataway, US, vol. 42, No. 6, Jun. 1, 2004 (Jun. 1, 2004), pp. 124-131, XP001198207, ISSN: 0163-6804. DOI: 10.1109/MCOM.2004.304248.
Kompella, Ed K. et al., ‘Virtual Private LAN Service (VPLS) Using BGP for Auto-Discovery and Signaling’ Jan. 2007.
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’, Jan. 2009.
Louati, Wajdi et al., ‘Network-based virtual personal overlay networks using programmable virtual routers’, IEEE Communications Magazine, Jul. 2005.
Mckeown, Nick et al. “OpenFlow: Enabling Innovation in Campus Networks”, Mar. 14, 2008, www.openflow.org/documents/openflow-wp-latest.pdf.
Narten, T. et al., ‘Problem Statement: Overlays for Network Virtualization d raft-narten-n vo3-over l ay-problem-statement-01’, Oct. 31, 2011.
Office Action for U.S. Appl. No. 13/030,688, filed Feb. 18, 2011, dated Jul. 17, 2014.
Office Action for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, dated Jan. 16, 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,752, filed Apr. 22, 2011, dated Jul. 18, 2013.
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/365,993, filed Feb. 3, 2012, dated Jul. 23, 2013.
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, dated Dec. 2, 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. 12/725,249, filed Mar. 16, 2010, dated Sep. 12, 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. 12/950,968, filed Nov. 19, 2010, dated Jun. 7, 2012.
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. 12/950,974, filed Nov. 19, 2010, dated May 24, 2012.
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/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 for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, dated Feb. 23, 2015.
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/042,259, filed Mar. 7, 2011, dated Jul. 31, 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/044,301, filed Mar. 9, 2011, dated Jun. 11, 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/050,102, filed Mar. 17, 2011, dated Oct. 26, 2012.
Office Action for U.S. Appl. No. 13/050,102, filed Mar. 17, 2011, dated May 16, 2013.
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/092,460, filed Apr. 22, 2011, dated Jun. 21, 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/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,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,752, filed Apr. 22, 2011, dated Feb. 5, 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/092,873, filed Apr. 22, 2011, dated Jun. 19, 2013.
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/092,877, filed Apr. 22, 2011, dated Sep. 5, 2013.
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/098,490, filed May 2, 2011, dated Dec. 21, 2012.
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/098,490, filed May 2, 2011, dated Jul. 9, 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 Jul. 16, 2011, dated May 22, 2013.
Office Action for U.S. Appl. No. 13/312,903, filed Dec. 6, 2011, dated Jun. 13, 2013.
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/044,301, dated Mar. 9, 2011.
Office Action for U.S. Appl. No. 13/050,102, filed Mar. 17, 2011, dated Jan. 26, 2015.
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/092,460, filed Apr. 22, 2011, dated Mar. 13, 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/092,873, filed Apr. 22, 2011, dated Nov. 29, 2013.
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,.
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/184,526, filed Jul. 16, 2011, dated Dec. 2, 2013.
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/365,808, filed Jul. 18, 2013, dated Jul. 18, 2013.
Office Action for U.S. Appl. No. 13/425,238, dated Mar. 12, 2015.
Office Action for U.S. Appl. No. 13/533,843, filed Jun. 26, 2012, dated Oct. 21, 2013.
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/598,204, filed Aug. 29, 2012, dated Feb. 20, 2014.
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/786,328, filed Mar. 5, 2013, dated Mar. 13, 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/092,887, dated Jan. 6, 2014.
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].
Rosen, E. et al., “BGP/MPLS VPNs”, Mar. 1999.
TRILL Working Group Internet-Draft Intended status: Proposed Standard RBridges: Base Protocol Specificaiton Mar. 3, 2010.
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.
Office Action for U.S. Appl. No. 13/425,238, filed Mar. 20, 2012, dated Mar. 12, 2015.
Office Action for U.S. Appl. No. 14/577,785, filed Dec. 19, 2014, dated Apr. 13, 2015.
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 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 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.
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.
“Network based IP VPN Architecture using Virtual Routers” Paul Knight et al.
Yang Yu et al “A Framework of using OpenFlow to handle transient link failure”, TMEE, 2011 International Conference on, IEEE, Dec. 16, 2011.
Office Action for U.S. Appl. No. 14/662,095, dated Mar. 24, 2017.
Office Action for U.S. Appl. No. 15/005,967, dated Mar. 31, 2017.
Related Publications (1)
Number Date Country
20130315097 A1 Nov 2013 US
Provisional Applications (1)
Number Date Country
61650360 May 2012 US