Dynamic service insertion in a fabric switch

Information

  • Patent Grant
  • 9742693
  • Patent Number
    9,742,693
  • Date Filed
    Monday, February 25, 2013
    11 years ago
  • Date Issued
    Tuesday, August 22, 2017
    7 years ago
Abstract
One embodiment of the present invention provides a switch. The switch includes a service management module and a packet processor. During operation, the service management module identifies a service provided by an appliance coupled to the switch via a local port. The packet processor constructs a notification message for a remote switch. The notification message includes information about the service and the appliance. In this way, the switch allows the remote switch to request the service.
Description

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;


U.S. patent application Ser. No. 13/092,724, titled “Fabric Formation for Virtual Cluster Switching,” by inventors Shiv Haris and Phanidhar Koganti, filed 22 Apr. 2011;


U.S. patent application Ser. No. 13/092,580, titled “Distributed Configuration Management for Virtual Cluster Switching,” by inventors Suresh Vobbilisetty, Shiv Haris, Phanidhar Koganti, and Vidyasagara R. Guntaka, filed 22 Apr. 2011;


U.S. patent application Ser. No. 13/042,259, titled “Port Profile Management for Virtual Cluster Switching,” by inventors Dilip Chatwani, Suresh Vobbilisetty, and Phanidhar Koganti, filed 7 Mar. 2011; and


U.S. patent application Ser. No. 13/092,752, titled “Name Services for Virtual Cluster Switching,” by inventors Suresh Vobbilisetty, Phanidhar Koganti, and Jesse B. Willeke, filed 22 Apr. 2011;


the disclosures of which are incorporated by reference herein.


BACKGROUND

Field


The present disclosure relates to network management. More specifically, the present disclosure relates to dynamic insertion of services in a fabric switch.


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 service insertion and provisioning, 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.


A flexible way to improve the scalability of a switch system is to build a fabric switch. A fabric switch is a collection of individual member switches. These member switches form a single, logical switch that can have an arbitrary number of ports and an arbitrary topology. As demands grow, customers can adopt a “pay as you grow” approach to scale up the capacity of the fabric switch.


Meanwhile, layer-2 (e.g., Ethernet) switching technologies continue to evolve. More routing-like functionalities, which have traditionally been the characteristics of layer-3 (e.g., Internet Protocol or IP) networks, are migrating into layer-2. Notably, the recent development of the Transparent Interconnection of Lots of Links (TRILL) protocol allows Ethernet switches to function more like routing devices. TRILL overcomes the inherent inefficiency of the conventional spanning tree protocol, which forces layer-2 switches to be coupled in a logical spanning-tree topology to avoid looping. TRILL allows routing bridges (RBridges) to be coupled in an arbitrary topology without the risk of looping by implementing routing functions in switches and including a hop count in the TRILL header.


As Internet traffic is becoming more diverse, efficient and accurate configuration of essential services, such as firewalls, load-balancers, and intrusion detection, in a high-performance layer-2 network is becoming progressively more important as a value proposition for network architects. It is desirable to provide these services from a variety of physical and virtual appliances at distributed locations with flexibility and ease of deployment.


While a fabric switch brings many desirable features to a network, some issues remain unsolved in dynamic service insertion in the network.


SUMMARY

One embodiment of the present invention provides a switch. The switch includes a service management module and a packet processor. During operation, the service management module identifies a service provided by an appliance coupled to the switch via a local port. The packet processor constructs a notification message for a remote switch. The notification message includes information about the service and the appliance. In this way, the switch allows the remote switch to request the service.


In a variation on this embodiment, the switch also includes a virtualization module which operates in conjunction with the packet processor to represent the appliance as a virtual appliance in the notification message. The virtual appliance can be associated with one or more appliances providing the service.


In a further variation, the packet processor constructs a second notification message comprising a virtual identifier of a virtual switch. This virtual switch is associated with the switch and presented to be coupled to the virtual appliance. The virtualization module generates the virtual identifier.


In a further variation, the virtual switch is also associated with a second switch. The second switch is locally coupled to a second appliance, which is capable of providing the service and associated with the virtual appliance.


In a variation on this embodiment, during operation, the packet processor extracts information about a second service and a third appliance, which is capable of providing the second service and coupled to a third switch. The packet processor forwards a respective data requiring the second service toward the third switch.


In a further variation, the switch also includes a sequence module which receives a sequence of execution associated with the subnet, for the service and the second service. The sequence module also determines whether to forward a data frame belonging to the subnet to the appliance or the third appliance based on the sequence.


In a further variation, the packet processor encapsulates the data frame in a Transparent Interconnection of Lots of Links (TRILL) packet with a virtual routing bridge (RBridge) identifier as an egress RBridge identifier of the packet. This virtual RBridge identifier corresponds to the third switch.


In a variation on this embodiment, the service management module determines completion of the service for a data frame in response to receiving the data frame via the local port.


In a variation on this embodiment, the switch also includes a fabric switch management module which maintains a membership in a fabric switch. Such a fabric switch accommodates a plurality of switches and operates as a single logical switch.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1A illustrates an exemplary fabric switch with dynamic service insertion capability, in accordance with an embodiment of the present invention.



FIG. 1B illustrates how a new appliance for an existing service is dynamically added to a fabric switch in conjunction with the example in FIG. 1A, in accordance with an embodiment of the present invention.



FIG. 1C illustrates how a new appliance for a new service is dynamically added to a fabric switch in conjunction with the example in FIG. 1B, in accordance with an embodiment of the present invention.



FIG. 2 illustrates an exemplary configuration of a fabric switch with dynamic service insertion capability, in accordance with an embodiment of the present invention.



FIG. 3A presents a flowchart illustrating the process of a member switch of a fabric switch dynamically adding an appliance to the fabric switch, in accordance with an embodiment of the present invention.



FIG. 3B presents a flowchart illustrating the process of a member switch of a fabric switch dynamically configuring a service, in accordance with an embodiment of the present invention.



FIG. 4 illustrates an exemplary sequence of execution among dynamically inserted services in a fabric switch, in accordance with an embodiment of the present invention.



FIG. 5A presents a flowchart illustrating the process of a member switch distributing a sequence of execution for a subnet among dynamically inserted services in a fabric switch, in accordance with an embodiment of the present invention.



FIG. 5B presents a flowchart illustrating the process of a member switch configuring a sequence of execution for a subnet among dynamically inserted services in a fabric switch, in accordance with an embodiment of the present invention.



FIG. 6A presents a flowchart illustrating the process of a member switch of a fabric switch processing a data frame received from an edge port, in accordance with an embodiment of the present invention.



FIG. 6B presents a flowchart illustrating the process of a member switch of a fabric switch processing a data frame received from an inter-switch port, in accordance with an embodiment of the present invention.



FIG. 7 illustrates an exemplary member switch with dynamic service insertion capability in a fabric switch, 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 dynamically adding a service in a fabric switch is solved by distributing configuration information of a respective appliance associated with the service across all member switches of the fabric switch. As a result, a respective member switch can obtain the service from any supporting appliance coupled to any member switch. An appliance coupled to a switch, which can be a fabric switch, provides specialized service to a network. Examples of an appliance can include, but are not limited to, a firewall, load balancer, intrusion detection/protection device, network analyzer, and network virtualizer. An appliance can be a physical device or a virtual machine running on a physical device. Typically, such an appliance is optimized for the performance of that specific service. In the traditional deployment of services in a network, when an appliance is added to a network, a respective switch in the network is required to be configured for accommodating the service provided by the appliance. For example, when a firewall is added, a respective switch in the network should be configured to forward traffic to the firewall. Such configuration can be tedious, repetitious, and error-prone.


Furthermore, a respective appliance is typically deployed in the data path of upstream or downstream traffic (which can be referred to as “north-south traffic”). For example, an appliance can be deployed at an aggregation router. However, recent growth in data centers has created demands for new services, often to traffic between servers and storage devices (which can be referred to as “east-west traffic”). Moreover, in today's networks, a respective appliance is required to be multitenant, where a single appliance can serve traffic belonging to different sub-networks (or subnets). On the other hand, the appliances providing a service can be located anywhere across a network, thereby distributing the traffic load of the network. As a result, traffic belonging to the same subnet can be served by different appliances. Configuring a network to support appliances which are simultaneously distributed and multitenant can be challenging.


To solve this problem, when an appliance is added to a member switch of a fabric switch (i.e., a switch which forms a fabric switch in conjunction with other member switches), the switch shares the location and the service provided by the appliance to the other member switches. In this way, the member switch exchanges operational and configuration data of the appliance with other member switches and integrates the appliance with the entire fabric switch. As a result, when connected to the fabric switch, the appliance automatically provides the service and its associated functionalities to the entire fabric switch. In some embodiments, one or more appliances providing a service are virtualized as a virtual appliance coupled to the fabric switch via a virtual member switch. The virtual switch is associated with the physical member switches coupled to the appliances providing the service. As a result, a respective member switch can simply forward a data frame belonging to a subnet which requires the service toward the virtual switch. Consequently, the data frame is eventually received by one of the member switches associated with the virtual switch. The member switch, in turn, forwards the data frame to the locally coupled appliance, which provides the service to the data frame. In this way, a service can be dynamically inserted via any member switch of a fabric switch without configuring individual switches in the fabric switch.


In some embodiments, the fabric switch is an Ethernet fabric switch. 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. A fabric switch appears as a single logical switch to an end device. In some further embodiments, the fabric switch is a Transparent Interconnection of Lots of Links (TRILL) network and a respective member switch of the fabric switch is a TRILL routing bridge (RBridge).


Although the present disclosure is presented using examples based on the TRILL protocol, embodiments of the present invention are not limited to networks defined using TRILL, or a particular Open System Interconnection Reference Model (OSI reference model) layer. For example, embodiments of the present invention can also be applied to a multi-protocol label switching (MPLS) network. In this disclosure, the term “fabric switch” is used in a generic sense, and can refer to a network operating in any networking layer, sub-layer, or a combination of networking layers.


In this disclosure, the term “service” is used in a generic sense, and can refer to any operation or group of operations providing specific functionality to a standalone or fabric switch operating in any network layer. Any functionality required by a switch can be referred to as a “service.” Any physical or virtual device capable of providing a service to a switch can be referred to as an “appliance.” An “appliance” can be a device separate from a switch, or a hardware or software module running in the switch.


The term “end device” can refer to a device coupled to a fabric switch. An end device can be a host, a conventional layer-2 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 network devices to enter the network. The terms “device” and “machine” are used interchangeably.


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 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 an end device or another switch 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 TRILL RBridge, or a fabric switch comprising a plurality of similar or heterogeneous smaller physical switches.


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.


The term “edge port” refers to a port in a fabric switch which exchanges data frames with an end device outside of the fabric switch. The term “inter-switch port” refers to a port which couples a member switch of a fabric switch with another member switch and is used for exchanging data frames between the member switches.


The term “switch identifier” refers to a group of bits that can be used to identify a switch. If the switch is an RBridge, the switch identifier can be an “RBridge identifier.” The TRILL standard uses “RBridge ID” to denote a 48-bit Intermediate-System-to-Intermediate-System (IS-IS) 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, is not limited to any bit format, and can refer to any format that can identify a switch. The term “RBridge identifier” is used in a generic sense, is not limited to any bit format, and can refer to “RBridge ID,” “RBridge nickname,” or any other format that can identify an RBridge.


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 fabric switch with dynamic service insertion capability, in accordance with an embodiment of the present invention. As illustrated in FIG. 1, a fabric switch 100 includes member switches 101, 102, 103, 104, and 105. Member switches in fabric switch 100 use edge ports to communicate to end devices and inter-switch ports to communicate to other member switches. For example, switch 102 is coupled to end device 190 via an edge port and to switches 101, 104, and 105 via inter-switch ports. Examples of end device 190 include, but are not limited to, a layer-2 switch, layer-3 router, top-of-the-rack switch, and physical or virtual host machine. In some embodiments, fabric switch 100 is a TRILL network; switches 101, 102, 103, 104, and 105 are RBridges; and data frames transmitted and received via inter-switch ports are encapsulated in TRILL headers.


Appliances 122 and 124 provide service 152 to fabric switch 100 and are coupled to member switches 101 and 105, respectively. Similarly, appliances 132 and 134 provide service 153 to fabric switch 100 and are coupled to member switches 101 and 104, respectively. Examples of a service include, but are not limited to, firewall, load balancing, intrusion detection/protection, network analysis, and network virtualization. Though appliance 134 is a physical machine, appliance 132 is a virtual machine running on a physical machine 131. Hence, fabric switch 100 can receive the same service (e.g., service 153) from a physical and a virtual device.


In some embodiments, when an appliance, such as appliance 122 is added to switch 101, switch 101 creates a notification message, which specifies corresponding service 152 and the association of appliance 122 with switch 101. Switch 101 then sends this notification message to other switches in fabric switch 100. Upon receiving the message, a respective switch, such as switch 102, associates service 152 with switch 101. During operation, switch 102 receives from end device 190 a data frame belonging to a subnet which requires service 152. Switch 102 identifies switch 101 to be associated with service 152 and forwards the data frame to switch 101. As result, when connected to fabric switch 100, appliance 122 automatically provides service 152 and its associated functionalities to all member switches of fabric switch 100. In this way, service 152 can be dynamically inserted into fabric switch 100 without configuring individual switches in fabric switch 100.


In some embodiments, appliances which provide a service to fabric switch 100 are virtualized as a single virtual appliance. In the example in FIG. 1A, when appliances 122 and 124 are coupled to fabric switch 100, switches 101 and 105, in conjunction with each other, virtualize appliances 122 and 124 as a virtual appliance 120 coupled to fabric switch 100 via a virtual member switch 112. Switches associated with a virtual switch can be referred to as partner switches. For example, switches 101 and 105 are the partner switches associated with virtual switch 112. Switches 101 and 105 send notification messages about virtual switch 112 and virtual appliance 120 to the other switches in fabric switch 100. One such message specifies that virtual appliance 120 is associated with service 152 and coupled to virtual switch 112. The same or a different message further specifies that virtual switch 112 is reachable via switches 101 and 105. Upon receiving the notification messages, other switches become aware of service 152, associated virtual appliance 120, and virtual switch 112. Similarly, appliances 132 and 134 are virtualized as a virtual appliance 130 coupled to a virtual switch 113, which is reachable via switches 101 and 104. Switch virtualization in a fabric switch and its associated operations, such as data frame forwarding, 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.


During operation, switch 102 receives from end device 190 a data frame belonging to a subnet which requires service 152. Switch 102 identifies virtual appliance 120 to be associated with service 152. Switch 102 also identifies that virtual appliance 120 is coupled to virtual switch 112. Switch 102 then simply forwards the data frame toward virtual switch 112. In some embodiments, switch 102 encapsulates the data frame in a TRILL packet. The data frame is then forwarded to either switch 101 or 105. If only one of switches 101 and 105 is configured for the subnet, the data frame is forwarded to that specific switch. Suppose that switch 101 receives the frame. Switch 101, in turn, forwards the data frame to locally coupled appliance 122, which provides service 152 to the data frame. For example, if service 152 is a firewall service, appliance 122 checks whether the data frame should be forwarded to the subnet.


Upon receiving back the data frame from appliance 122, switch 101 checks whether the data frame requires any other service. If the data frame requires service 153 as well, switch 101 identifies appliance 132, which can provide service 153, to be a local appliance and forwards the data frame to appliance 132. When switch 101 receives the data frame back from appliance 132, switch 101 checks whether the data frame requires any other service. If not, switch 101 forwards the data frame toward its destination. In this way, fabric switch 100 receives services from appliances 122, 124, 132, and 134 without configuring individual switches in fabric switch 100.


Virtual switch 112 allows switches 102, 103, and 104 to simply forward data frames belonging to a subnet which requires service 152 toward virtual switch 112. The data frames reach either switch 101 or 105 based on the routing policy of fabric switch 100. In some embodiments, virtual appliance 120 can be logically coupled to switches 101 and 105, instead of virtual switch 112. Under such a scenario, instead of creating virtual switch 112, switches 101 and 105 advertise virtual appliance 120 to be a locally coupled appliance to switches 102, 103, and 104. As a result, switches 102, 103, and 104 send data frames belonging to a subnet which requires service 152 to either switch 101 or 105. However, without virtual switch 112, a respective switch has to explicitly choose either switch 101 or 105 to be an egress RBridge for sending the data frames. For example, switch 102 can choose switch 105, while switch 103 can choose switch 101 for forwarding data frames toward virtual appliance 120.


A new appliance is added to fabric switch 100 can be associated with either an existing service or a new service. FIG. 1B illustrates how a new appliance for an existing service is dynamically added to a fabric switch in conjunction with the example in FIG. 1A, in accordance with an embodiment of the present invention. In this example, appliance 136, which provides existing service 153, is added to fabric switch 100. Appliance 136 is a virtual machine running on a physical machine 135. Hence, a new appliance added to fabric switch 100 can be a virtual machine. Because virtual appliance 130 and virtual switch 113 are already associated with service 153 in fabric switch 100, switch 103 is aware of service 153, associated virtual appliance 130, and virtual switch 113. In some embodiments, switch 103 sends a query message to other member switches in fabric switch 100 to identify the switches associated with virtual switch 113 (e.g., switches 101 and 104).


Upon detecting appliance 136, switch 103, in conjunction with switches 101 and 104, associates appliance 136 with virtual appliance 130. Furthermore, switch 103 becomes a partner switch associated with virtual switch 113. As a result, other member switches, such as switches 102 and 105, still perceive that only one appliance (e.g., virtual appliance 130) is providing service 153 to fabric switch 100. During operation, switch 102 receives from end device 190 a data frame belonging to a subnet which requires service 153. Switch 102 identifies that virtual appliance 130 is coupled to virtual switch 113. Switch 102 simply forwards the data frame toward virtual switch 113. Because switch 103 is now associated with virtual switch 113, the data frame can be forwarded to any of switches 101, 103, and 104. Suppose that switch 103 receives the data frame. Switch 103 then forwards the data frame to locally coupled appliance 136, which provides service 153 to the data frame.



FIG. 1C illustrates how a new appliance for a new service is dynamically added to a fabric switch in conjunction with the example in FIG. 1B, in accordance with an embodiment of the present invention. In this example, appliance 142, which provides a new service 154, is added to fabric switch 100. Because service 154 is new, upon detecting appliance 142, switch 103 creates a virtual appliance 140 associated with service 154 in fabric switch 100. Switch 103 also creates a virtual switch 114 and sends a notification message to other member switches in fabric switch 100 notifying them that virtual switch 114 has joined fabric switch 100 and is reachable via switch 103. Switch 103 also notifies the other switches via the same or a different message that virtual appliance 140 can provide service 154 to fabric switch 100 and is coupled to virtual switch 114.


Upon receiving the messages, other switches detect virtual switch 114 to be another member switch and virtual appliance 140 to be a physical appliance coupled to virtual switch 114. These switches update their respective forwarding information accordingly. During operation, switch 102 receives from end device 190 a data frame belonging to a subnet which requires service 154. Switch 102 identifies that virtual appliance 140 is coupled to virtual switch 114. Switch 102 then forwards the data frame toward virtual switch 114. Because only switch 103 is associated with virtual switch 114, the data frame is forwarded to switch 103. When switch 103 receives the data frame, switch 103 forwards the data frame to locally coupled appliance 142, which provides service 154 to the data frame. In this way, service 154 can be dynamically inserted into fabric switch 100 only via switch 103 without manually configuring switches 101, 102, 104, and 105.


Dynamic Service Insertion



FIG. 2 illustrates an exemplary configuration of a fabric switch with dynamic service insertion capability, in accordance with an embodiment of the present invention. In this example, a fabric switch 200 includes switches 212, 214, and 216. Fabric switch 200 also includes switches 202, 204, 222 and 224, each with a number of edge ports which can be coupled to external devices. For example, switches 202 and 204 are coupled with end devices 262 and 264 via Ethernet edge ports. Upon learning the media access control (MAC) addresses of end devices 262 and 264, switches 202 and 204 share the learned MAC addresses with rest of fabric switch 200. Similarly, switches 222 and 224 are coupled to appliances 252 and 254, also via Ethernet edge ports. Appliances 252 and 254 provide service 270 to fabric switch 200.


In some embodiments, switches in fabric switch 200 are TRILL RBridges and in communication with each other using TRILL protocol. These RBridges have TRILL-based inter-switch ports for connection with other TRILL RBridges in fabric switch 200. Although the physical switches within fabric switch 200 are labeled as “TRILL RBridges,” they are different from conventional TRILL RBridge in the sense that they are controlled by the FC switch fabric control plane. In other words, the assignment of switch addresses, link discovery and maintenance, topology convergence, routing, and forwarding can be handled by the corresponding FC protocols. Particularly, each TRILL RBridge's switch ID or nickname is mapped from the corresponding FC switch domain ID, which can be automatically assigned when a switch joins fabric switch 200 (which is logically similar to an FC switch fabric).


Note that TRILL is only used as a transport between the switches within fabric switch 200. This is because TRILL can readily accommodate native Ethernet frames. Also, the TRILL standards provide a ready-to-use forwarding mechanism that can be used in any routed network with arbitrary topology (although the actual routing in fabric switch 200 is done by the FC switch fabric protocols). Embodiments of the present invention should be not limited to using only TRILL as the transport. Other protocols (such as multi-protocol label switching (MPLS) or Internet Protocol (IP)), either public or proprietary, can also be used for the transport.


When appliances 252 and 254 are coupled to fabric switch 200, switches 222 and 224, in conjunction with each other, virtualize appliances 252 and 254 as a virtual appliance 250 coupled to fabric switch 200 via a virtual member switch 240. In some embodiments, virtual switch 240 is a TRILL RBridge and assigned a virtual RBridge identifier 245. RBridges 222 and 224 send notification messages to RBridges 202, 204, 212, 214, and 216. The notification message specifies that virtual RBridge 240, which is associated with virtual RBridge identifier 245, is reachable via RBridges 222 and 224. RBridges 222 and 224 specify in the same message or in a different notification message that virtual appliance 250 is associated with service 270 and coupled to virtual switch 240.


Suppose that end devices 262 and 264 belong to a subnet which requires service 270. During operation, end device 262 sends a data frame to end device 264. RBridge 202 receives the data frame and detects the requirement of service 270 for the data frame. Based on the notification messages received from RBridges 222 and 224, RBridge 202 is aware of virtual appliance 250 and virtual RBridge 240. RBridge 202 encapsulates the data frame in a TRILL packet with virtual RBridge identifier 245 as the egress RBridge identifier and forwards the packet toward virtual RBridge 240.


RBridge 222 receives the packet via intermediate RBridge 212 and recognizes the packet to be destined to virtual RBridge 240. Because virtual RBridge 240 is associated with service 270 and the packet includes virtual RBridge identifier 245, RBridge 222 detects that the encapsulated data frame requires service 270. RBridge 222 extracts the data frame from the TRILL packet and forwards the data frame to locally coupled appliance 252. Upon receiving back the data frame from appliance 252, RBridge 222 identifies the destination MAC address of end device 264, encapsulates the data frame in a TRILL packet with an RBridge identifier of RBridge 204 as the egress RBridge identifier, and forwards the packet toward RBridge 204.


In the examples in FIGS. 1B and 1C, upon detecting appliance 136, switch 103 identifies appliance 136 to be associated with an existing service 153, and associates appliance 136 with corresponding virtual appliance 130. On the other hand, upon detecting appliance 142, switch 103 identifies appliance 142 to be associated with a new service 154 and creates a virtual appliance 140 for service 154. Hence, a respective member switch can dynamically add an appliance for an existing service, or insert a new service and a corresponding appliance in a fabric switch. FIG. 3A presents a flowchart illustrating the process of a member switch of a fabric switch dynamically adding an appliance to the fabric switch, in accordance with an embodiment of the present invention. Upon detecting a new appliance (operation 302), the switch marks the edge port coupling the appliance and identifies the service associated with the appliance (operation 304). In this way, the switch can take appropriate action to the data frames received from the edge port. The switch then checks whether the service exists in the fabric switch (operation 306).


If the service exists, the switch identifies the virtual appliance associated with the service (operation 320) and the virtual switch logically coupled to the virtual appliance (operation 322). The switch identifies the partner switches associated with the virtual switch (operation 324) and notifies the partner switches about the newly coupled appliance (operation 326). In some embodiments, the switch sends a notification message comprising information about the new appliance to notify the identified partner switches. The switch, in conjunction with the partner switches, associates the local switch with the virtual switch (operation 328). Through operation 328, the switch becomes logically coupled to the virtual switch, and other partner switches start considering the switch as a new partner switch for the virtual switch. The switch notifies other switches in the fabric switch about the virtual switch to be coupled to the local switch (operation 330). As a result, other switches can forward data frames destined to the virtual switch toward the switch.


If the service does not exist, the appliance is providing a new service. The switch creates a virtual appliance associated with the service (operation 310) and a virtual switch logically coupled to the virtual appliance (operation 312). The switch then generates a virtual switch identifier and assigns the virtual switch identifier to the virtual switch (operation 314). The switch notifies other member switches about the new virtual switch as a new member switch coupled to the local switch (operation 316). In some embodiments, the switch sends a notification message comprising the virtual switch identifier to notify other member switches. The switch notifies other member switches about the newly coupled appliance which provides a new service and is coupled to the virtual switch (operation 318). Note that other member switches may consider the virtual appliance and the virtual switch to be physical devices and physically coupled to each other.



FIG. 3B presents a flowchart illustrating the process of a member switch of a fabric switch dynamically configuring a service, in accordance with an embodiment of the present invention. The switch receives notifications about a new switch (operation 352) and a new appliance, which provides a new service and is coupled to the new switch (operation 354). The switch can receive these two notifications via a single message or a plurality of messages. Even though the new switch and new appliance are virtual devices logically coupled to each other, the switch may consider the appliance and the switch to be physical devices physically coupled to each other. The switch then becomes aware of the service available to the fabric. Hence, the switch configures the local switch to identify the data frames belonging to the subnet which requires the service (operation 356) and configures the local switch to forward the identified data frames to the new switch (operation 358).


Sequence of Execution


When a plurality of services are associated with a fabric switch, the services may require a specific sequence of execution. Such a sequence can be based on the interdependency and/or priority of the services. FIG. 4 illustrates an exemplary sequence of execution among dynamically inserted services in a fabric switch, in accordance with an embodiment of the present invention. As illustrated in FIG. 4, a fabric switch 400 includes member switches 401, 402, 403, 404, and 405. End devices 492 and 494 are coupled to fabric switch 400 via member switches 402 and 405, respectively. Examples of end devices 492 and 494 include, but are not limited to, a layer-2 switch, layer-3 router, top-of-the-rack switch, and physical or virtual host machine. In some embodiments, fabric switch 400 is a TRILL network; switches 401, 402, 403, 404, and 405 are RBridges; and data frames transmitted and received via inter-switch ports are encapsulated in TRILL headers.


Appliances 422 and 424 provide service 452 to fabric switch 400 and are coupled to member switches 401 and 404, respectively. Similarly, appliances 432 and 434 provide service 453 to fabric switch 400 and are coupled to member switches 403 and 404, respectively; and appliance 442 provides service 454 to fabric switch 400 and is coupled to member switch 403. Examples of a service include, but are not limited to, firewall, load balancing, intrusion detection/protection, network analysis, and network virtualization. Though appliance 434 is a physical machine, appliance 432 is a virtual machine running on a physical machine 431. Switches 401 and 404, in conjunction with each other, virtualize appliances 422 and 424 as a virtual appliance 420 coupled to fabric switch 400 via a virtual member switch 412. Similarly, appliances 432 and 434 are virtualized as a virtual appliance 430 coupled to a virtual switch 413; and appliance 442 is virtualized as a virtual appliance 440 coupled to a virtual switch 414.


Any of the member switches of fabric switch 400, such as switch 402, can receive a service configuration for a subnet. In some embodiments, a network administrator provides the service configuration to switch 402 (e.g., configures switch 402 with the service configuration). In this example, the service configuration specifies that the data frames belonging to the subnet require services 452, 453, and 454. The configuration also specifies the sequence of the required services to be services 452, 454, and 453. For example, if services 452, 453, and 454 correspond to firewall, load balancing, and intrusion detection, the sequence of the services specifies that a respective data frame belonging to the subnet should first be filtered with a firewall, then checked for intrusion, and finally forwarded based on a configured policy in a load balancer.


During operation, switch 402 receives from end device 492 a data frame, which belongs to the subnet and is destined to end device 494. Switch 402 identifies the initial service required for the data frame to be service 452, which is associated with virtual appliance 420. Switch 402 also identifies that virtual appliance 420 is coupled to virtual switch 412. Switch 402 forwards the data frame to virtual switch 412. The data frame is forwarded to switch 401 based on an internal routing policy of fabric switch 400. Switch 401 recognizes the received data frame to be destined to virtual switch 412 and realizes that the data frame requires service 452. Switch 401 forwards the data frame via port 462 to appliance 422, which provides service 452 to the data frame. For example, if service 452 is a firewall service, appliance 452 checks whether the data frame should be filtered or forwarded to the subnet. Because appliance 422 is coupled to switch 401 via port 462, when switch 401 receives the data frame back via port 462, switch 401 detects that appliance 422 has completed service 452.


Switch 401 checks for the next required service, if any, for the subnet and identifies service 454 to be the next service. Switch 401 identifies virtual appliance 440 associated with service 454. Switch 401 also identifies that virtual appliance 440 is coupled to virtual switch 414. Switch 401 forwards the data frame to virtual switch 414. Switch 403 receives the frame and detects that the data frame requires service 454. Switch 403 forwards the data frame via port 464 to appliance 442, which in turn, provides service 454 to the data frame. Because appliance 442 is coupled to switch 403 via port 464, when switch 403 receives the data frame back via port 464, switch 403 detects that appliance 442 has completed service 454.


Switch 403 then checks for the next required service, if any, for the subnet and identifies the next service to be service 453, which is associated with virtual appliance 430 coupled to virtual switch 413. Because switch 403 is a partner switch associated with virtual switch 413, switch 403 identifies locally coupled appliance 432 and forwards the data frame to appliance 432 via port 466. When switch 403 receives the data frame back via port 466, switch 403 realizes that appliance 432 has completed service 453. Upon completing the services, switch 403 forwards the data frame toward egress switch 405 based on the MAC address of end device 494.



FIG. 5A presents a flowchart illustrating the process of a member switch distributing a sequence of execution for a subnet among dynamically inserted services in a fabric switch, in accordance with an embodiment of the present invention. Upon receiving a service configuration for a subnet (operation 502), the switch identifies the sequence of execution for the services associated with the subnet (operation 504). In some embodiments, a respective member switch can belong to one or more subnets. The switch can optionally identify the member switches belonging to the subnet (operation 506). The switch creates a notification message comprising the sequence of execution (operation 508) and sends the message to a respective member switch (operation 510). The message can be a control message specific to the fabric switch. In some embodiments, the switch sends the message to only the member switches belonging to the subnet.



FIG. 5B presents a flowchart illustrating the process of a member switch configuring a sequence of execution for a subnet among dynamically inserted services in a fabric switch, in accordance with an embodiment of the present invention. The switch first receives a sequence of execution of services for a subnet (operation 552). The switch can receive the sequence of execution from a local configuration or a notification message from another member switch, as described in conjunction with FIG. 5A. The switch checks whether the initial service of the sequence is locally available (operation 554). If an appliance providing the service is coupled to the switch, the service is locally available. If the service is not locally available, the switch identifies the virtual appliance and the corresponding virtual switch associated with the initial service (operation 556). Note that the switch may consider the virtual appliance and the virtual switch to be physical devices and physically coupled to each other. The local switch configures itself to forward data frames of the subnet (i.e., data frames belonging to the subnet) to the identified virtual switch (operation 558). If the service is locally available, the local switch configures itself to forward frames of the subnet to the local appliance associated with the initial service (operation 560).


The switch checks whether the sequence has any other service (operation 562). If the sequence has more services, the switch configures the local switch to identify frames of the subnet received from the virtual or local switch associated with the current service in sequence (operation 564). For example, if the switch is a partner switch associated with the virtual switch, the switch can locally identify the frame, as described in conjunction with FIG. 4. Operation 564 ensures that the switch maintains the sequence of execution and facilitates detection of potential errors in the configuration of the sequence of execution.


The switch checks whether the next service of the sequence is locally available (operation 566). If the service is not locally available, the switch identifies the virtual appliance and the corresponding virtual switch associated with the service (operation 568). Note that the switch may consider the virtual appliance and the virtual switch to be physical devices and physically coupled to each other. The local switch configures itself to forward identified data frames to the identified virtual switch (operation 570). If the service is locally available, the local switch configures itself to forward the identified frames to the local appliance associated with the service (operation 572). The switch checks whether the sequence has any other service (operation 562) and continues to configure the local switch for the next services, if any.


Data Frame Processing


In the example in FIG. 2, member switches 202 and 222 couple an end device and an appliance via their respective edge ports. Hence, a member switch needs to distinguish between edge ports coupling an end device and an appliance. FIG. 6A presents a flowchart illustrating the process of a member switch of a fabric switch processing a data frame received from an edge port, in accordance with an embodiment of the present invention. Upon receiving a data frame via an edge port (operation 602), the switch checks whether the edge port couples an appliance (operation 604). In some embodiments, the switch marks an edge port coupling an appliance to distinguish the port from other edge ports, as described in conjunction with FIG. 3A.


If the port does not couple an appliance, the data frame is received from an end device. The switch identifies the subnet to which the data frame belongs (operation 606) and the initial service required for the data frame (operation 608). For a respective subnet, the switch can be configured with the required services and its corresponding order of execution, as described in conjunction with FIG. 5B. The switch checks whether the service is locally available (operation 610). A service is locally available if an appliance providing the service is coupled to a local edge port. If the service is not locally available, the switch identifies the virtual appliance associated with the service (operation 612) and forwards the frame toward the virtual switch coupled to the virtual appliance (operation 614).


If the service is locally available, the switch identifies the local edge port which couples the appliance associated with the service (operation 616) and transmits the frame to the identified edge port (operation 618). If the port couples an appliance (operation 604), the frame is from a local appliance after completion of a service. When the switch receives a data frame from an edge port coupling an appliance, the switch detects that the appliance has completed the associated service and the data frame is ready for further processing. For example, if the appliance is a firewall and if the data frame should not be forwarded to the subnet, the data frame is filtered at the firewall. If the switch receives the data frame back via the edge port coupling the firewall, the switch perceives the frame to be “allowable” for forwarding to the subnet.


The switch checks whether the sequence of execution for the subnet has any other service (operation 620). If so, the switch checks whether that service is locally available (operation 610) and continues to take action on the frame. If the sequence of execution for the subnet does not have any other service, the frame is ready for forwarding to its destination. The switch checks whether the destination of the frame is local (operation 622). If the destination is local, the switch transmits the frame based on the destination MAC address of the data frame (operation 624). For example, when the destination is a local end device, the switch transmits the frame to the edge port from which the switch has learned the MAC address of the end device. If the destination of the frame is not local, the switch identifies the member egress switch associated with the destination (operation 626) and forwards the data frame to the egress switch (operation 628). Because a respective member switch in a fabric switch shares the locally learned MAC addresses with other member switches, a respective member switch is aware of all end devices coupled to the entire fabric switch. In some embodiments, the switch encapsulates the data frame in a TRILL packet, sets the identifier of the egress switch as the egress RBridge identifier of the packet, and forwards the packet to the egress RBridge.



FIG. 6B presents a flowchart illustrating the process of a member switch of a fabric switch processing a data frame received from an inter-switch port, in accordance with an embodiment of the present invention. Upon receiving a data frame via an inter-switch port (operation 652), the switch checks whether the egress switch for the received data frame is the local switch (operation 654). If so, the switch transmits the data frame based on the destination MAC address of the data frame (operation 672), as described in conjunction with FIG. 6A. If the egress switch is not the local switch, the switch checks whether the egress switch for the received data frame is a virtual switch (operation 656). In some embodiments, the received data frame is encapsulated in a TRILL packet and the switch determines whether the egress switch for the received frame is the local or a virtual switch based on the egress RBridge identifier of the packet.


If the egress switch of the frame is not a local or virtual switch, the data frame is destined for another switch. The switch forwards the data frame to the next-hop switch based on the egress switch identifier (operation 674). In some embodiments, the data frame is encapsulated in a TRILL packet. Under such a scenario, the switch identifies the next-hop switch based on the egress RBridge identifier of the packet and sets the MAC address of the next-hop switch as the outer MAC address of the packet. If the egress switch of the frame is not the local switch but is a virtual switch (operations 654 and 656), the switch checks whether the virtual switch is logically coupled to a virtual appliance (operation 658). If the egress switch of the frame is not the local switch but is a virtual switch logically coupled to a virtual appliance, the switch identifies the local appliance associated with the virtual appliance, which is logically coupled to the virtual switch (operation 662) and transmits the data frame to the edge port coupling the identified appliance (operation 664).


If the egress switch of the frame is not the local switch but is a virtual switch not logically coupled to a virtual appliance (operations 654, 656, and 658), the virtual switch is associated with a different feature of the switch, such as virtual link aggregation, as specified in U.S. Patent Publication No. 2010/0246388, titled “Redundant Host Connection in a Routed Network;” or storage network virtualization, as specified in U.S. patent application Ser. No. 13/669,357, titled “Integrated Fibre Channel Support in an Ethernet Fabric Switch,” by inventors Phanidhar Koganti and Suresh Vobbilisetty, filed 5 Nov. 2012,” the disclosure of which is incorporated by reference herein. Hence, the switch forwards the data frame based on the switch feature associated with the virtual switch (operation 676).


Exemplary Switch



FIG. 7 illustrates an exemplary member switch with dynamic service insertion capability in a fabric switch, in accordance with an embodiment of the present invention. In this example, a switch 700 includes a number of communication ports 702, a sequence module 720, a service management module 730, a packet processor 710, and a storage 750. 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 750 that maintains the configuration state of a respective switch within the fabric switch. Fabric switch management module 760 maintains the state of the fabric switch, which is used to join other switches. 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.


During operation, service management module 730 detects an appliance coupled to switch 700 via one of communication ports 702. Service management module 730 identifies the service provided by the appliance. Upon detecting the appliance, packet processor 710 constructs a notification message comprising information about the service and the appliance for a remote switch in the fabric switch. When the remote switch receives the notification message, the remote switch dynamically configures the local switch to send a respective data frame requiring the service to switch 700. Upon receiving a data frame belonging to a subnet which requires the service, packet processor 710 forwards the packet to the appliance via the communication port. When packet processor 710 receives the data frame back via the same communication port, service management module 730 considers the service to be completed for the data frame, as described in conjunction with FIG. 2.


In some embodiments, the switch also includes a virtualization module 732, which virtualizes the appliance and any other appliance providing the service as one virtual appliance, as described in conjunction with FIG. 3A. The virtualization module 732 can also virtualize the switch and any other switch in the fabric switch associated with the service as a virtual switch, as described in conjunction with FIG. 3A. While doing so, the virtualization module 732 generates a virtual identifier for the virtual switch. Packet processor 710 constructs a second notification message which presents the virtual switch to be coupled to the virtual appliance.


When a different member switch in the fabric switch notifies switch 700 about a second service, the packet processor forwards a respective data frame belonging to a subnet requiring the second service toward that other member switch. This other member switch can be a virtual switch identified by a virtual switch identifier. In some embodiments, the virtual switch identifier is a virtual RBridge identifier. Under such a scenario, packet processor 710 encapsulates the data frame in a TRILL packet with the virtual RBridge identifier as egress RBridge identifier of the packet, as described in conjunction with FIG. 2. Sequence module 720, upon receiving a sequence of execution associated with the subnet, determines whether to forward a data frame belonging to the subnet to the appliance or the appliance coupled to the virtual switch based on the sequence, as described in conjunction with FIG. 5B.


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. 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 dynamic service insertion in an Ethernet fabric switch. In one embodiment, the switch includes a service management module and a packet processor. During operation, the service management module identifies a service provided by an appliance coupled to the switch via a local port. The packet processor constructs a notification message for a remote switch. The notification message includes information about the service and the appliance. In this way, the switch allows the remote switch to request the service.


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: service management circuitry configured to:identify an appliance and a service provided by the appliance via an edge port of the switch; andmarking the edge port of the switch to be associated with the appliance; andpacket processing circuitry configured to:in response to identifying the appliance, construct for a remote switch a notification message comprising information about the service and the appliance, wherein the switch and the remote switch are member switches of a network of interconnected switches, wherein a fabric identifier identifies the network of interconnected switches and is assigned to the switch and the remote switch, and wherein the information about the appliance indicates that the appliance is reachable via the switch; anddetermine that a data frame from the remote switch requires the service.
  • 2. The switch of claim 1, wherein the appliance is a virtual appliance, wherein the virtual appliance is associated with one or more appliances providing the service.
  • 3. The switch of claim 2, further comprising virtualization circuitry configured to generate a virtual switch identifier of a virtual switch associated with the switch; and wherein the packet processing circuitry is further configured to include in the notification message the virtual switch identifier, wherein the notification message indicates that the appliance is reachable via the virtual switch.
  • 4. The switch of claim 3, wherein the virtual switch is further associated with a second switch; and wherein the second switch is coupled to a second appliance capable of providing the service and associated with the virtual appliance.
  • 5. The switch of claim 1, wherein the packet processing circuitry is further configured to: extract information about a second service and a third appliance, wherein the third appliance is capable of providing the second service and reachable via a third switch; anddetermine the third switch as an egress switch for a respective data frame requiring the second service.
  • 6. The switch of claim 5, further comprising sequence circuitry configured to: receive a sequence of execution for the service and the second service, wherein the sequence is associated with a subnet; anddetermine whether to forward a data frame belonging to the subnet to the appliance or the third appliance based on the sequence.
  • 7. The switch of claim 5, wherein the packet processing circuitry is further configured to encapsulate the data frame with an encapsulation header comprising a switch identifier as an egress switch identifier; and wherein the switch identifier is associated with the third switch.
  • 8. The switch of claim 1, wherein the service management circuitry is further configured to determine completion of the service for the data frame in response to receiving the data frame via the edge port.
  • 9. The switch of claim 1, wherein inter-switch packets within the network of interconnected switches is encapsulated with an encapsulation header.
  • 10. A method, comprising: identifying an appliance and a service provided by the appliance via an edge port of a switch;marking the edge port of the switch to be associated with the appliance;in response to identifying the appliance, constructing for a remote switch a notification message comprising information about the service and the appliance, wherein the switch and the remote switch are member switches of a network of interconnected switches, wherein a fabric identifier identifies the network of interconnected switches and is assigned to the switch and the remote switch, and wherein the information about the appliance indicates that the appliance is reachable the switch; anddetermining that a data frame from the remote switch requires the service.
  • 11. The method of claim 10, wherein the appliance is a virtual appliance, wherein the virtual appliance is associated with one or more appliances providing the service.
  • 12. The method of claim 11, further comprising: generating a virtual switch identifier of a virtual switch associated with the switch; andincluding in the notification message the virtual switch identifier, wherein the notification message indicates that the appliance is reachable via the virtual switch.
  • 13. The method of claim 12, wherein the virtual switch is further associated with a second switch; and wherein the second switch is coupled to a second appliance capable of providing the service and associated with the virtual appliance.
  • 14. The method of claim 10, further comprising: extracting information about a second service and a third appliance, wherein the third appliance is capable of providing the second service and reachable via a third switch; anddetermining the third switch as an egress switch for a respective data frame requiring the second service.
  • 15. The method of claim 14, further comprising: receiving a sequence of execution for the service and the second service, wherein the sequence is associated with a subnet; anddetermining whether to forward a data frame belonging to the subnet to the appliance or the third appliance based on the sequence.
  • 16. The method of claim 14, further comprising encapsulating the data frame with an encapsulation header comprising a switch identifier as an egress switch identifier; and wherein the switch identifier is associated with the third switch.
  • 17. The method of claim 10, further comprising determining completion of the service for the data frame in response to receiving the data frame via the edge port.
  • 18. The method of claim 10, wherein inter-switch packets within the network of interconnected switches is encapsulated with an encapsulation header.
  • 19. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for securing a database configuration from undesired modifications, the method comprising: identifying an appliance and a service provided by the appliance via an edge port of a switch;marking the edge port of the switch to be associated with the appliance;in response to identifying the appliance, constructing for a remote switch a notification message comprising information about the service and the appliance, wherein the switch and the remote switch are member switches of a network of interconnected switches, wherein a fabric identifier identifies the network of interconnected switches and is assigned to the switch and the remote switch, and wherein the information about the appliance indicates that the appliance is reachable via the switch; anddetermining that a data frame from the remote switch requires the service, wherein the appliance is not coupled to a local port of the remote switch, and wherein the fabric identifier is assigned to the switch and the remote switch.
  • 20. The computer-readable storage medium of claim 19, wherein the appliance is a virtual appliance, wherein the virtual appliance is associated with one or more appliances providing the service; andwherein the method further comprises: generating a virtual switch identifier of a virtual switch associated with the switch; andincluding in the notification message the virtual switch identifier, wherein the notification message indicates that the virtual appliance is reachable via the virtual switch.
  • 21. A switch means, comprising: a service management means for: identifying an appliance means and a service provided by the appliance means via an edge port of the switch means; andmarking the edge port of the switch to be associated with the appliance; anda packet processor means for: in response to identifying the appliance, constructing for a remote switch means a notification message comprising information about the service and the appliance means, wherein the switch means and the remote switch means are member switches of a network of interconnected switch means, wherein a fabric identifier identifies the network of interconnected switch means and is assigned to the switch means and the remote switch means, and wherein the information about the appliance means indicates that the appliance means is reachable via the switch means; anddetermining that a data frame from the remote switch means requires the service.
RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 61/603,817, titled “Dynamic Service Insertion in Ethernet Fabric Switch,” by inventors Phanidhar Koganti and Suresh Vobbilisetty, filed 27 Feb. 2012, the disclosure of which is incorporated by reference herein.

US Referenced Citations (570)
Number Name Date Kind
829529 Keathley Aug 1986 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 Wehrli, 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
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 et al. Jun 2006 B1
7062177 Grivna 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 et al. 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 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
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 et al. 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
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 Jan 2013 B1
8369335 Jha Feb 2013 B2
8369347 Xiong Feb 2013 B2
8392496 Linden Mar 2013 B2
8451717 Venkataraman et al. May 2013 B2
8462774 Page Jun 2013 B2
8467375 Blair Jun 2013 B2
8520595 Yadav Aug 2013 B2
8553710 White Oct 2013 B1
8599850 Jha 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
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
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
20020039350 Wang Apr 2002 A1
20020054593 Morohashi et al. 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
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
20040008868 Bornowski Jan 2004 A1
20040010600 Baldwin 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
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
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
20060098589 Kreeger May 2006 A1
20060126511 Youn Jun 2006 A1
20060140130 Kalkunte Jun 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 Reynolds 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
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 Berkvens 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
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
20080304498 Jorgensen 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 et al. Jul 2010 A1
20100169948 Budko Jul 2010 A1
20100182920 Matsuoka Jul 2010 A1
20100189119 Sawada 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
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 et al. 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
20110007738 Berman Jan 2011 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
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 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
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 et al. Nov 2011 A1
20110273988 Tourrilhes Nov 2011 A1
20110273990 Rajagopalan Nov 2011 A1
20110274114 Dhar Nov 2011 A1
20110280572 Vobbilisetty Nov 2011 A1
20110286357 Haris Nov 2011 A1
20110286457 Ee Nov 2011 A1
20110286462 Kompella Nov 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 et al. Jan 2012 A1
20120020220 Sugita Jan 2012 A1
20120027017 Rai Feb 2012 A1
20120033663 Guichard Feb 2012 A1
20120033665 Jacob 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 et al. 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
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
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
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
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
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 Koppenhagen 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
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 Udutha et al. Nov 2013 A1
20130301642 Radhakrishnan et al. 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 et al. 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 Sun Apr 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 Velayudhan et al. Dec 2014 A1
20150010007 Matsuhira Jan 2015 A1
20150030031 Zhou Jan 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 Mahadevan et al. 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
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
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
1916807 Apr 2008 EP
2001167 Oct 2008 EP
2001167 Dec 2008 EP
2874359 May 2015 EP
2008056838 May 2008 WO
2009042919 Apr 2009 WO
2010111142 Sep 2010 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 (265)
Entry
Louati, Wajdi et al., “Network-Based Virtual Personal Overlay Networks Using Programmable Virtual Routers”, 2005.
Knight, Paul et al., “Network based IP VPN Architecture using Virtual Routers”, May 2003.
Kreeger, L. et al. “Network Virtualization Overlay Control Protocol Requirements draft-kreeger-nvo3-overlay-cp-00”, Aug. 2, 2012.
An Introduction to Brocade VCS Fabric Technology, Dec. 3, 2012.
Knight, Paul et al. “Layer 2 and 3 Virtual Private Networks: Taxonomy, Technology, and Standardization Efforts”, 2004.
Narten, T. et al. “Problem Statement: Overlays for Network Virtualization draft-narten-nvo3-overlay-problem-statement-01”, Oct. 31, 2011.
The Effortless Network: HyperEdge Technology for the Campus LAN, 2012.
FastIron and Turbulron 24x Configuration Guide, 2010.
FastIron Configuration Guide, Supporting IronWare Software Release 07.0.00, 2009.
Foundary FastIron Configuration Guide, Software Release FSX 04.2.00b, Software Release FWS 04.3.00, Software Release FGS 05.0.00a, 2008.
Brocade Unveils “The Effortless Network”, 2009.
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/184,526, filed May 22, 2013, dated May 22, 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 Feb. 3, 2012, dated Jul. 18, 2013.
Christensen, M. et al., “Considerations for Internet Group Management Protocol (IGMP) and Multicast Listener Discovery (MLD) Snooping Switches”, May 2006.
Perlman, Radia et al., “RBridges: Base Protocol Specification”, <draft-ietf-trill-rbridge-protocol-16.txt> Mar. 2010.
Brocade Fabric OS (FOS) 6.2 Virtual Fabrics Feature Frequently Asked Questions, 2008.
Eastlake III, Doanld et al., “RBridges: TRILL Header Options” <draft-ietf-trill-rbridge-options-00.txt>, Dec. 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>, Dec. 2009.
Knight, S. et al., “Virtual Router Redundancy Protocol”, Apr. 1998.
“Switched Virtual Internetworking Moves Beyond Bridges and Routers”, 8178 Data Communications 23 Sep. 1994, No. 12.
Touch, J. et al. “Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement”, May 2009.
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”, Jan. 2009.
S. Nadas et al., “Virtual Router Redundancy Protocol (VRRP) Version 3 for IPv4 and IPv6”, Mar. 2010.
Office Action for U.S. Appl. No. 13/312,903, filed Dec. 6, 2011, dated Nov. 12, 2013.
Office Action for U.S. Appl. No. 13/194,526, filed Jul. 16, 2011, dated Dec. 2, 2013.
Office Action for U.S. Appl. No. 13/092,460, filed Apr. 22, 2011, dated Mar. 14, 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/092,580, filed Apr. 22, 2011, dated Jan. 10, 2014.
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Jan. 6, 2014.
Office Action for U.S. Appl. No. 13/092,701, filed Apr. 22, 2011, dated Mar. 26, 2014.
Office Action for U.S. Appl. No. 13/092,724, filed Apr. 22, 2011, dated Apr. 9, 2014.
Eastlake, D. et al., ‘RBridges: TRILL Header Options’, Dec. 24, 2009, pp. 1-17, TRILL Working Group.
Perlman, Radia et al., ‘RBridge VLAN Mapping’, TRILL Working Group, Dec. 4, 2009, pp. 1-12.
Touch, J. et al., ‘Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement’, May 2009, Network Working Group, pp. 1-17 . . . .
‘RBridges: Base Protocol Specification’, IETF Draft, Perlman et al., Jun. 26, 2009.
Switched Virtual Networks. ‘Internetworking Moves Beyond Bridges and Routers’ Data Communications, McGraw Hill. New York, US, vol. 23, No. 12, Sep. 1, 1994 (Sep. 1, 1994), pp. 66-70,72,74, XP000462385 ISSN: 0363-6399.
Office Action dated Apr. 9, 2014, U.S. Appl. No. 13/092,724, filed Apr. 22, 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 Mar. 26, 2014, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011.
Office Action dated Apr. 9, 2014, U.S. Appl. No. 13/092,752, filed Apr. 22, 2011.
Office action dated Aug. 21, 2014, U.S. Appl. No. 13/184,526, filed Jul. 16, 2011.
Office Action dated Mar. 6, 2014, U.S. Appl. No. 13/425,238, filed Mar. 20, 2012.
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, ‘Brocade Fabrics OS (FOS) 6.2 Virtual Fabrics Feature Frequently Asked Questions’, pp. 1-6, 2009 Brocade Communications Systems, Inc.
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.
Christensen, M. et al., ‘Considerations for Internet Group Management Protocol (IGMP) and Multicast Listener Discovery (MLD) Snooping Switches’, May 2006.
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, Piscataway, US, vol. 42, No. 6, Jun. 1, 2004 (Jun. 1, 2004), pp. 124-131, XP001198207, ISSN: 0163-6804, DOI: 10.1109/MCOM.2004.1304248.
Knight S et al: ‘Virtual Router Redundancy Protocol’ Internet Citation Apr. 1, 1998 (Apr. 1, 1998), XP002135272 Retrieved from the Internet: URL:ftp://ftp.isi.edu/in-notes/rfc2338.txt [retrieved on Apr. 10, 2000].
Lapuh, Roger et al., ‘Split Multi-link Trunking (SMLT)’, draft-lapuh-network-smlt-08, Jul. 2008.
Lapuh, Roger et al., ‘Split Multi-Link Trunking (SMLT)’, Network Working Group, Oct. 2012.
Louati, Wajdi et al., ‘Network-based virtual personal overlay networks using programmable virtual routers’, IEEE Communications Magazine, Jul. 2005.
Narten, T. et al., ‘Problem Statement: Overlays for Network Virtualization d raft-narten-n. vo3-over I ay-problem -statement-01’, Oct. 31, 2011.
Office Action for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, from Jaroenchonwanit, Bunjob, dated Jan. 16, 2014.
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, from Park, Jung H., dated Jul. 18, 2013.
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/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 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/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/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 Feb. 20, 2014.
Perlman, Radia et al., ‘Challenges and Opportunities in the Design of TRILL: a Routed layer 2 Technology’, 2009.
Perlman, Radia et al., ‘RBridges: Base Protocol Specification; Draft-ietf-trill-rbridge-protocol-16.txt’, Mar. 3, 2010, pp. 1-117.
S. Nadas et al., ‘Virtual Router Redundancy Protocol (VRRP) Version 3 for IPv4 and IPv6’, Internet Engineering Task Force, Mar. 2010.
‘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 Jan. 10, 2014, 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 Jul. 31, 2013, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011.
Office action dated Jan. 6, 2014, U.S. Appl. No. 13/092,877, filed Apr. 22, 2011.
Office action dated Oct. 2, 2013, U.S. Appl. No. 13/044,326, filed Mar. 9, 2011.
Office action dated Dec. 2, 2013, 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 Nov. 12, 2013, U.S. Appl. No. 13/312,903, filed Dec. 6, 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.
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/092,887, dated Jan. 6, 2014.
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 Feb. 5, 2013, U.S. Appl. No. 13/092,724, filed Apr. 22, 2011.
Office action dated Jun. 10, 2013, U.S. Appl. No. 13/092,580, filed Apr. 22, 2011.
Office action dated Mar. 18, 2013, U.S. Appl. No. 13/042,259, filed Mar. 7, 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 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 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 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 May 22, 2013, U.S. Appl. No. 13/148,526, filed Jul. 16, 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 Jun. 13, 2013, U.S. Appl. No. 13/312,903, filed Dec. 6, 2011.
Lapuh, Roger et al., ‘Split Multi-link Trunking (SMLT) draft-lapuh-network-smlt-08’, Jan. 2009.
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/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, dated Dec. 2, 2012.
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/351,513, filed Jan. 17, 2012, dated Feb. 28, 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].
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.
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 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.
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 Jun. 18, 2015, 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.
Office Action dated Jul. 6, 2016, U.S. Appl. No. 14/618,941, filed Feb. 10, 2015.
Office Action dated Jul. 20, 2016, U.S. Appl. No. 14/510,913, filed Oct. 9, 2014.
Office Action dated Jul. 29, 2016, U.S. Appl. No. 14/473,941, filed Aug. 29, 2014.
Office Action dated Jul. 28, 2016, U.S. Appl. No. 14/284,212, filed May 21, 2016.
Office Action dated Jan. 31, 2017, U.S. Appl. No. 13/184,526, filed Jul. 16, 2011.
Office Action dated Jan. 27, 2017, U.S. Appl. No. 14/216,292, filed Mar. 17, 2014.
Office Action dated Jan. 26, 2017, U.S. Appl. No. 13/786,328, filed Mar. 5, 2013.
Office Action dated Dec. 2, 2016, U.S. Appl. No. 14/512,268, filed Oct. 10, 2014.
Office Action dated Dec. 1, 2016, U.S. Appl. No. 13/899,849, filed May 22, 2013.
Office Action dated Dec. 1, 2016, U.S. Appl. No. 13/656,438, filed Oct. 19, 2012.
Office Action dated Nov. 30, 2016, U.S. Appl. No. 13/598,204, filed Aug. 29, 2012.
Office Action dated Nov. 21, 2016, U.S. Appl. No. 13/669,357, filed Nov. 5, 2012.
Office Action dated Feb. 8, 2017, U.S. Appl. No. 14/473,941, filed Aug. 29, 2014.
Office Action dated Feb. 8, 2017, U.S. Appl. No. 14/822,380, filed Aug. 10, 2015.
“Network based IP VPN Architecture using Virtual Routers” Paul Knight et al., Mar. 2017.
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. 15/227,789, dated Feb. 27, 2017.
Office Action for U.S. Appl. No. 14/822,380, dated Feb. 8, 2017.
Office Action for U.S. Appl. No. 14/704,660, dated Feb. 27, 2017.
Office Action for U.S. Appl. No. 14/510,913, dated Mar. 3, 2017.
Office Action for U.S. Appl. No. 14/473,941, dated Feb. 8, 2017.
Office Action for U.S. Appl. No. 14/329,447, dated Feb. 10, 2017.
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.
Office Action for U.S. Appl. No. 15/215,377, dated Apr. 7, 2017.
Office Action for U.S. Appl. No. 13/098,490, dated Apr. 6, 2017.
Office Action for U.S. Appl. No. 14/662,092, dated Mar. 29, 2017.
Related Publications (1)
Number Date Country
20130223449 A1 Aug 2013 US
Provisional Applications (1)
Number Date Country
61603817 Feb 2012 US