Distributed bidirectional forwarding detection protocol (D-BFD) for cluster of interconnected switches

Information

  • Patent Grant
  • 10003552
  • Patent Number
    10,003,552
  • Date Filed
    Wednesday, August 19, 2015
    9 years ago
  • Date Issued
    Tuesday, June 19, 2018
    6 years ago
Abstract
One embodiment of the present invention provides a switch which comprises one or more ports adapted to receive packets. The switch is a member of a network of interconnected switches, and also comprises a path monitoring apparatus adapted to: in response to a control packet associated with a session within a predetermined time interval, set a receive indicator for the switch to an active state; and in response to absence of the control packet associated with the session within the predetermined time interval, set the receive indicator for the switch to an inactive state. The path monitoring apparatus is also adapted to set a path state associated with the session based on the receive indicators for the switch and other member switches. The switch also comprises a broadcast apparatus adapted to broadcast at least the receive indicator for the switch to the other member switches.
Description
BACKGROUND

Field


The present disclosure relates to network management. More specifically, the present disclosure relates to a method and system for detecting a forwarding path failure based on a bidirectional forwarding detection (BFD) protocol in a distributed architecture.


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, e.g., a network of interconnected 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. As Internet traffic is becoming more diverse, virtual computing in a network is becoming progressively more important as a value proposition for network architects. For example, a traditional bidirectional forwarding detection (BFD) protocol is a network protocol used to rapidly detect faults between adjacent forwarding engines, e.g., two forwarding engines connected by a link or two connected interfaces. A BFD session can be established between two endpoints that exchange BFD control packets over a particular link at a pre-negotiated interval. BFD is described in RFC 5880, “Bidirectional Forwarding Detection,” by D. Katz and D. Ward, June 2010, the entirety of which is hereby incorporated by reference. However, some issues remain unsolved when using BFD as a fault detection mechanism in a distributed architecture such as a fabric switch or a virtual cluster switch (VCS) cluster.


SUMMARY

One embodiment of the present invention provides a switch. The switch comprises one or more ports adapted to receive packets, wherein the switch is a member of a network of interconnected switches. The switch also comprises a path monitoring apparatus adapted to, in response to a control packet associated with a session within a predetermined time interval, set a receive indicator for the switch to an active state. The path monitoring apparatus is also adapted to, in response to absence of the control packet associated with the session within the predetermined time interval, set the receive indicator for the switch to an inactive state. The path monitoring apparatus is also adapted to set a path state associated with the session based on the receive indicators for the switch and one or more other member switches. The switch also comprises a broadcast apparatus adapted to broadcast at least the receive indicator for the switch to one or more other member switches.


In a variation on this embodiment, the path monitoring apparatus is further adapted to, in response to a notification message from another member switch that includes the receive indicator for the other member switch: store the receive indicator for the other switch; and set the path state based on the receive indicator for the other switch.


In a further variation, the path monitoring apparatus is further adapted to, in response to a notification message from another member switch that includes session parameters and a create command, create a session database based on the session parameters.


In a further variation, the switch further comprises a session database, which indicates parameters for the session and includes one or more of: a session identifier; a source address; a destination address; a master switch identifier; receive indicators for the switch and the other member switches; and the path state for the session.


In a further variation, the ports are adapted to receive packets based on one or more of: a virtual extensible local area network protocol; a generic routing encapsulation protocol; and a tunneling protocol based on encapsulation of a layer-2 compatible frame.


In a further variation, the broadcast apparatus is further adapted to broadcast based on an Internet Protocol.


In a further variation, the switch and the other member switches are each a virtual routing Bridge (RBridge) that belongs to the network of interconnected switches. A switch identifier for an RBridge is an RBridge identifier associated with a respective switch. The broadcast apparatus is further adapted to broadcast based on a Transparent Interconnection of Lots of Links protocol.


In a variation on this embodiment, the switch is designated as a master and further comprises a session initiator apparatus adapted to establish the session that corresponds to a path between the network of interconnected switches and a destination endpoint based on session parameters, wherein the session is based on a bidirectional forwarding detection protocol. The session initiator apparatus is also adapted to create the session database based on the session parameters. The broadcast apparatus is further adapted to broadcast the session parameters and a create command to the other member switches.


In a further variation on this embodiment, the switch comprises a forwarding apparatus adapted to construct a control packet that is destined for the destination endpoint. The path monitoring apparatus is further adapted to, in response to determining that the path state is inactive, initiate a tear down of the path.


In a further variation, the switch comprises a link tracking apparatus adapted to determine a status of all interfaces connecting to a next-hop core router. In response to determining that the status is down, the link tracking apparatus is adapted to initiate a failover to one of the other member switches and designate a new master. The broadcast apparatus is further adapted to broadcast a message to the other member switches to remove the switch from an active load balancing scheme.


In a further variation, the link tracking apparatus is further adapted to determine that the status of at least one of the interfaces is up. The broadcast apparatus is further adapted to broadcast a message to the other member switches to add the switch to the active load balancing scheme.


In a further variation, the link tracking apparatus is further adapted to determine that the master is unable to transmit a control packet. The path monitoring apparatus is further adapted to trigger a failover to one of the other member switches.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1A illustrates an exemplary environment comprising a fabric switch capable of monitoring the health of an extension tunnel in a distributed architecture, in accordance with an embodiment of the present invention.



FIG. 1B illustrates an exemplary environment comprising a fabric switch capable of monitoring the health of an extension tunnel in a distributed architecture, in accordance with an embodiment of the present invention.



FIG. 2A illustrates an exemplary environment and communication in a fabric switch capable of monitoring the health of an extension tunnel in a distributed architecture, in accordance with an embodiment of the present invention.



FIG. 2B illustrates exemplary database structures maintained by member switches of a fabric switch, corresponding to FIG. 2A, in accordance with an embodiment of the present invention.



FIG. 2C illustrates an exemplary environment and communication in a fabric switch capable of monitoring the health of an extension tunnel in a distributed architecture, in accordance with an embodiment of the present invention.



FIG. 2D illustrates exemplary database structures maintained by member switches of a fabric switch, corresponding to FIG. 2C, in accordance with an embodiment of the present invention.



FIG. 3 presents a flowchart illustrating a process of a designated master switch of a fabric switch monitoring the health of an extension tunnel, in accordance with an embodiment of the present invention.



FIG. 4A presents a flowchart illustrating a process of a member switch of a fabric switch receiving a notification message from another member switch, in accordance with an embodiment of the present invention.



FIG. 4B presents a flowchart illustrating a process of a member switch of a fabric switch receiving or not receiving a BFD control packet from a destination device within a predetermined time interval, in accordance with an embodiment of the present invention.



FIG. 5 presents a flowchart illustrating a process of a member switch of a fabric switch monitoring the health of an extension tunnel, in accordance with an embodiment of the present invention.



FIG. 6 presents a flowchart illustrating a process of a master switch for tracking links and initiating failover, in accordance with an embodiment of the present invention.



FIG. 7A presents a flowchart illustrating a process of a switch joining a fabric switch, in accordance with an embodiment of the present invention.



FIG. 7B presents a flowchart illustrating a process of a member switch leaving a fabric switch, in accordance with an embodiment of the present invention.



FIG. 8 illustrates an exemplary switch capable of monitoring the health of an extension tunnel in a distributed architecture, 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 monitoring the health of an extension tunnel in a distributed architecture (such as a fabric switch) based on BFD is solved by designating a master switch for a session, and allowing each member switch to synchronize and maintain its own session instance based on received BFD control packets. The master switch can establish a BFD session with a destination endpoint, broadcast session parameters to all other member switches, and transmit a BFD control packet at a predetermined interval to the destination endpoint. In a traditional point-to-point, non-distributed architecture, a single source node can establish a BFD session with a single destination endpoint. The source node sends a BFD control packet to a single destination node at a predetermined interval, and waits to receive (or not receive) the return BFD control packet, indicating an active (or inactive) path between the source and destination nodes. However, in a distributed architecture (such as a source fabric switch that includes multiple member switches), each member switch may need to establish individual BFD sessions with a single destination endpoint (or with multiple destination endpoints if the destination node is also a fabric switch) over each possible communication path. On a communication path, a destination endpoint can sit multiple hops away from the source fabric switch (e.g., on a data center core or a WAN), and member switches in a fabric switch can share a same virtual IP address. Thus, the number of established BFD sessions in a distributed architecture can grow exponentially with the number of virtual entity groups or virtual extensible local area network (VXLAN) tunnels configured with the same source virtual IP address.


Furthermore, because member switches of a fabric switch can share a virtual IP address and present a single logical switch view to the external network, a sending member switch can send a BFD control packet to a destination endpoint with a session identifier, which can be received by another (non-owner) member switch. The non-owner member switch can determine that the session identifier of the received BFD control packet does not match any session maintained by the non-owner switch, and the non-owner switch may discard the BFD control packet. The sending member switch, not having received the BFD control packet for the session, may falsely determine that the session is inactive, and initiate a tear down of the session even though a proper communication path exists via the non-owner member switch.


To address these inefficiencies, embodiments of the present invention provide a system that runs a BFD state machine on each member switch based on a forwarding path detection algorithm for BFD in a distributed architecture (herein referred to as a distributed bidirectional forwarding detection (D-BFD) protocol). The system designates a master switch (“BFD Master”) for a particular BFD session, while allowing the remaining member switches (“BFD Backups”) to act as backup switches for the same BFD session. The BFD Master can be elected based on parameters such as gateway priority configuration, number of active links, and/or next-hop reachability to the destination IP. Different BFD Masters can be elected for different sessions and can reside on any of the member switches. During operation, the BFD Master establishes a new BFD session with a destination endpoint using a unique session identifier for a pair of source and destination IP addresses. Before initiating the session, the BFD Master advertises parameters for the new session to all participating member switches in the D-BFD protocol, and all BFD Backups initialize a session instance based on the session parameters. The BFD Master then establishes a BFD session with the destination endpoint, and initializes its own session instance based on the session parameters.


The BFD Master sends a BFD control packet for the session at a predetermined time interval to the destination endpoint. Each member switch (e.g., the BFD Master and all BFD Backups) tracks reception of the return BFD control packet. Each member switch broadcasts a notification message to all other member switches upon receiving (or not receiving) the return BFD control packet within the predetermined time interval. Each member switch can update its own session instance by setting the state of a path (e.g., the particular BFD session) to an active or inactive state based on these notification messages. In this way, the BFD Master knows whether a particular BFD session is active or inactive, and can act accordingly. For example, if a BFD session is determined to be inactive, the BFD Master can initiate a tear down of the path. In some embodiments, the BFD Master can also track the status of interfaces connected to the BFD Master. If the status of all interfaces is determined to be down, the BFD Master can initiate a failover by designating a new master switch and notifying all other member switches of this event. Tracking links and initiating failover is described below in relation to FIG. 6.


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


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


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


It should also be noted that a fabric switch is distinct from a virtual local area network (VLAN). A fabric switch can accommodate a plurality of VLANs. A VLAN is typically identified by a VLAN tag. In contrast, the fabric switch is identified by a fabric identifier (e.g., a cluster identifier), which is assigned to the fabric switch. A respective member switch of the fabric switch is associated with the fabric identifier. In some embodiments, a fabric switch identifier is pre-assigned to a member switch. As a result, when the switch joins a fabric switch, other member switches identify the switch to be a member switch of the fabric switch.


In this disclosure, the term “fabric switch” refers to a number of interconnected physical switches which form a single, scalable network of switches. The member switches of the fabric switch may operate as individual switches. The member switches of the fabric switch can also operate as a single, logical switch in the provision and control plane, the data plane, or both. 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 external device. “Fabric switch” should not be interpreted as limiting embodiments of the present invention to a plurality of switches operating as a single, logical switch. The term “fabric switch” can also refer to a network of interconnected switches. In some further embodiments, the fabric switch can be a Transparent Interconnection of Lots of Links (TRILL) network and a respective member of switch of the fabric switch is a TRILL routing bridge (RBridge). In some embodiments, the fabric switch can be a layer-3 (e.g., Internet Protocol or IP) network and a member switch can be a layer-3 node (e.g., capable of routing based on a routing protocol).


Although the present disclosure is presented using examples based on an encapsulation protocol, embodiments of the present invention are not limited to networks defined using one particular encapsulation protocol associated with 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 “encapsulation” is used in a generic sense, and can refer to encapsulation in any networking layer, sub-layer, or a combination of networking layers.


The term “end device” can refer to any device external to a network (e.g., does not perform forwarding in that network). Examples of an end device include, but are not limited to, a physical or virtual machine, a conventional layer-2 switch, a layer-3 router, or any other type of network device. Additionally, an end device can be coupled to other switches or hosts further away from a layer-2 or layer-3 network. An end device can also be an aggregation point for a number of network devices to enter the network. An end device hosting one or more virtual machines can be referred to as a host machine. In this disclosure, the terms “end device,” “endpoint,” and “host machine” are used interchangeably.


The term “VLAN” is used in a generic sense, and can refer to any virtualized network. Any virtualized network comprising a segment of physical networking devices, software network resources, and network functionality can be can be referred to as a “VLAN.” “VLAN” should not be interpreted as limiting embodiments of the present invention to layer-2 networks. “VLAN” can be replaced by other terminologies referring to a virtualized network or network segment, such as “Virtual Private Network (VPN),” “Virtual Private LAN Service (VPLS),” or “Easy Virtual Network (EVN).”


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


The term “switch” is used in a generic sense, and can refer to any standalone or fabric switch operating in any network layer. “Switch” can be a physical device or software running on a computing device. “Switch” should not be interpreted as limiting embodiments of the present invention to layer-2 networks. Any device that can forward traffic to an external 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 “edge port” refers to a port on a network which exchanges data frames with a device outside of the network (i.e., an edge port is not used for exchanging data frames with another member switch of a network). The term “inter-switch port” refers to a port which sends/receives data frames among member switches of the network. A link between inter-switch ports is referred to as an “inter-switch link.” The terms “interface” and “port” are used interchangeably.


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 “switch identifier” refers to a group of bits that can be used to identify a switch. Examples of a switch identifier include, but are not limited to, a media access control (MAC) address, an Internet Protocol (IP) address, an RBridge identifier, or a combination thereof. 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. 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.” 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 terms “tunnel” or “extension tunnel” refer to a data communication where one or more networking protocols are encapsulated using another networking protocol. Although the present disclosure is presented using examples based on a layer-3 encapsulation of a layer-2 protocol, “tunnel” should not be interpreted as limiting embodiments of the present invention to layer-2 and layer-3 protocols. A “tunnel” can be established for and using any networking layer, sub-layer, or a combination of networking layers.


Network Architecture



FIG. 1A illustrates an exemplary environment 100 comprising a fabric switch capable of monitoring the health of an extension tunnel in a distributed architecture, in accordance with an embodiment of the present invention. Environment 100 can include fabric switches 110 and 140, which include member switches 111-115 and member switches 141-145, respectively. Some of member switches 111-115 can participate as switches in active gateways 119 (e.g., member switches 111, 112, and 113) and some of member switches 141-145 can participate in active gateways 149 (e.g., member switches 141-143).


Member switches in fabric switches 110 and 140 use edge ports to communicate with end devices and inter-switch ports to communicate with other member switches. For example, switch 114 is coupled to end devices 131 and 132 via an edge port, and to switch 115 via an inter-switch port. Switch 115 is coupled to an end device 133 via an edge port. Switches 111, 112 and 113 are coupled to end devices (e.g., routers) 122, 123, and 124, respectively, via edge ports. Routers 122, 123, and 124 can be coupled to an end device (e.g., a data center core router) 121, which can communicate over a network 102 with an end device (e.g., a data center core router) 151.


Communication between member switches via inter-switch ports can be based on IP. In some embodiments, fabric switches 110 and 140 are each a layer-3 (e.g., IP) network, switches 111-115 and switches 141-145 are layer-3 nodes, and data frames transmitted and received via inter-switch ports are encapsulated in IP headers. Communication between an end device and a member switch via an edge port can be based on Ethernet. For example, switch 115 can receive an Ethernet frame from end device 133 via an edge port. Switch 115 can encapsulate the Ethernet frame in an IP header (e.g., a layer-3 tunnel header) and forward the encapsulated packet to another member switch via an inter-switch port. It should be noted that the encapsulated packet can have an external Ethernet header for layer-2 forwarding. In some embodiments, fabric switches 110 and 140 are each a TRILL network, switches 111-115 and switches 141-145 are RBridges, and data frames transmitted and received via inter-switch ports are encapsulated in TRILL headers.


Member switches 141-143 can be coupled to router 151 via edge ports, whose corresponding links can be trunked in a virtual link aggregation group (VLAG) 152, as described in U.S. Pat. No. 8,665,886, titled “Redundant Host Connection in a Routed Network,” which is incorporated by reference herein. Examples of end devices 121-124, 131-133, 151, and 161-163 include, but are not limited to, a layer-2 switch, layer-3 router, top-of-the-rack switch, and physical or virtual host machine.


Environment 100 can include multiple virtual tunnels between fabric switches 110 and 140 through network 102. Network 102 can be a layer-3 network (e.g., an IP network). Fabric switches 110 and 140 can each act as a VXLAN tunnel endpoint in a VXLAN-based communication. As depicted in FIG. 1A, multiple communication paths exist between member switches in fabric switches 110 and 140. In addition, as possible tunnel endpoints, member switches participating in active gateways 119 and 149 (e.g., switches 111-113 and 141-143, respectively) can implement functionality for both a virtual router redundancy protocol extended (VRRP-E) and a VXLAN protocol. This allows participating member switches 111-113 and 141-143 to equalize traffic load to route packets to the next-hop IP. Furthermore, VXLAN-encapsulated packets sent to a destination IP can be received by any participating member switch in a respective active gateway.



FIG. 1B illustrates an exemplary environment 150 comprising a fabric switch capable of monitoring the health of an extension tunnel in a distributed architecture, in accordance with an embodiment of the present invention. Environment 150 can include fabric switches 110 and 140, which include member switches 111-115 and member switches 141-142, respectively. Member switches 111-113 can participate in active gateways 119 and member switches 141-142 can participate in active gateways 159. Switches 111, 112, and 113 are coupled, respectively, to routers 122, 123, and 124 and 125, and switches 141 and 142 are coupled, respectively, to routers 171 and 172. Routers 122-125 can communicate over network 102 via links 181-184, respectively. Links 181-184 form part of four separate equal-cost multi-path (ECMP) routing paths to destination end device 140 (assuming fabric switch 140 is an end device). Using a standard BFD protocol may require that each of member switches 111-113 establish individual BFD sessions over each possible communication path with destination end device 140. As the number of paths increases, so does the number of BFD sessions, which can result in efficient network behavior.


In addition, if member switch 111 sends the BFD control packet, but the return BFD control packet is received by member switch 112, member switch 112 may discard the packet as not matching any of its current sessions, and member switch 111 may inaccurately declare the session to be inactive and initiate a tear down of the session. Furthermore, running multiple sessions for the same destination may not work when multiple communication paths overlap (as in FIG. 1A, where the first-hop router is the same for all BFD sessions). Also, some devices may not be able to support multiple BFD sessions for the same pair of source and destination IP addresses because of the additional overhead involved in maintaining redundant sessions.


Embodiments of the present invention address these problems by designating a master switch and allowing all member switches to maintain and synchronize its own instance for a specific BFD session based on the communication and method described below in relation to FIGS. 2A-2D.


Exemplary Communication in a Distributed Architecture



FIG. 2A illustrates an exemplary environment 200 and communication in a fabric switch capable of monitoring the health of an extension tunnel in a distributed architecture, in accordance with an embodiment of the present invention. Environment 200 includes member switches 211, 212, and 213, which can be part of a fabric switch 210 (or a network 210 of interconnected switches). Switches 211-213 can communicate over a network 202 with end device 231 and 232. Switches 211, 212, and 213 maintain session databases 260, 270, and 280, respectively, which include parameters for multiple instances corresponding to BFD sessions. For example, switch 211 can maintain session database 260 which includes a session identifier field 261, a source IP address field 262, a destination IP address field 263, a master switch identifier field 264, a receive indicators field 265, and a path state 266.


During operation, switch 211 is elected as the BFD Master (“Master 211”). Switch 211 determines new session parameters, which can include, e.g., a session identifier, a desired or pre-negotiated transaction interval, a destination IP address, an initial state, a polling mechanism, a demand mode, and an echo receive interval. Master 211 broadcasts a notification message 250 that includes the session parameters and a “create” command to the other member switches (e.g., switches 212 and 213). Master 211 then establishes a BFD session that corresponds to the path between fabric switch 210 and destination endpoint 231. Master 211 also creates a session instance (e.g., session database 260) based on the session parameters (time T1). In FIG. 2A, Master 211 creates session database 260 with the following values: a session identifier with a value of “10”; a source IP address (e.g., a VIP 221) with a value of “10.10.10.10/24” which indicates the virtual IP address for fabric switch 210; a destination IP address (e.g., IP 241) with a value of “11.11.11.11/24” which indicates destination end device 231; a master switch identifier with a value of “211” which indicates Master 211; receive indicators for each of member switches 211-213, with initial values set to “0” to indicate an inactive receive state; and a path state with an initial value set to “0” to indicate an inactive path state.



FIG. 2B illustrates exemplary database structures maintained by member switches of a fabric switch, corresponding to FIG. 2A, in accordance with an embodiment of the present invention. Upon receiving notification message 250 (time T2), switches 212 and 213 each create a session instance based on the received session parameters and the create command (e.g., session databases 270 and 280, respectively), with the same values as session database 260 at time T1.


Master 211 then sends a BFD control packet (“BFD Tx”) 204 to destination end device 231 for session ID=10. Subsequently, switch 213 receives BFD control packet (“BFD Rx”) 206 from destination end device 231 for session ID=10 within the predetermined time interval. Switch 213 updates its local session database 280 by setting the receive indicator for switch 213 to an active state with a value of “1,” and further sets the path state to an active state with a value of “1” (time T3). Switch 213 then broadcasts a notification message 252 to the other member switches (e.g., switch 212 and Master 211) indicating the session ID and an active receive indicator for switch 213. Upon receiving message 252, Master 211 and switch 212 update their respective local session databases 260 and 270 by setting the receive indicator for switch 213 to an active state with a value of “1,” and further set the path state to an active state with a value of “1” (time T4). Because at least one forwarding path to the destination exists (e.g., the path from Master 211 to destination end device 231 to switch 213), the D-BFD session for session ID=10 is determined to be active. For example, if at least one of receive indicators 265 in session database 260 is active or set to a value of “1,” Master 211 determines that the D-BFD session for the corresponding path is active. Note that if Master 211 receives BFD Rx 206, the system acts in similar fashion, with Master 211 setting its own receive indicator to active and updating its path state in its local session database, and subsequently broadcasting a notification message to the other member switches indicating its receive indicator as active, thus allowing all member switches to maintain and synchronize their own local session databases.


A session is determined to be down or inactive only if the state of the D-BFD session is determined to be down or inactive on all member switches. For example, if all of receive indicators 265 in session database 260 are inactive or set to a value of “0,” Master 211 determines that the D-BFD session for the corresponding path is inactive and can initiate a tear down of the path. FIG. 2C illustrates an exemplary environment 290 and communication in a fabric switch capable of monitoring the health of an extension tunnel in a distributed architecture, in accordance with an embodiment of the present invention. At time T4 (as depicted in FIGS. 2A-2C), all member switches of fabric switch 210 (e.g., Master 211 and switches 212 and 213) determine that the path state for BFD session ID=10 is active (e.g., “1”), as reflected in each of session databases 260, 270, and 280.



FIG. 2D illustrates exemplary database structures maintained by member switches of a fabric switch, corresponding to FIG. 2C, in accordance with an embodiment of the present invention. At the end of the predetermined time interval, Master 211 can send a BFD Tx 208 to destination end device 231 for session ID=10. In some embodiments, Master 211 does not need to broadcast a notification message for subsequent BFD transmit control packets because each member switch creates and maintains an instance of the session database for the corresponding session ID in a previous operation. If switch 213 does not receive a BFD Rx from destination device 231 within the predetermined time interval, switch 213 updates its local session database 280 by setting the receive indicator for switch 213 to an inactive state with a value of “0,” and further sets the path state to an inactive state with a value of “0” (time T5). Switch 213 then broadcasts a message 256 to the other member switches (e.g., Master 211 and switch 212) indicating the session ID and an inactive receive indicator for switch 213. Upon receiving message 256, Master 211 and switch 212 update their respective local session databases 260 and 270 by setting the receive indicator for switch 213 to an inactive state with a value of “0,” and further set the path state to an inactive state with a value of “0” (time T6). Subsequently, Master 211 determines that the D-BFD session for session ID=10 is down and Master 211 can initiate a teardown of the D-BFD session.


Role of Master/Initiator D-BFD Switch



FIG. 3 presents a flowchart illustrating a process of a designated master switch of a fabric switch monitoring the health of an extension tunnel, in accordance with an embodiment of the present invention. During operation, the master switch advertises new session parameters to all other member switches of the fabric switch (operation 302). As described above, the session parameters can include, e.g., a session identifier, a desired or pre-negotiated transaction interval, a destination IP address, an initial state, a polling mechanism, a demand mode, and an echo receive interval. The master switch initiates a BFD session with a destination device based on the new session parameters (operation 304). The source IP address used to establish the session can be a virtual IP address of the master switch, and can be shared by all member switches of the fabric switch. The master switch transmits a BFD control packet to the destination device (operation 306), which can occur at the desired or pre-negotiated transaction interval. Subsequently, the master switch can receive a notification message from another member switch (operation 308), and the operation continues as depicted by Label A, described below in relation to FIG. 4A. Alternatively, the master switch can receive (or not receive) the return BFD control packet from the destination device (operation 310), and the operation continues as depicted by Label B, described below in relation to FIG. 4B.


Returning from the operations depicted by Labels A and B, respectively, in FIGS. 4A and 4B below, the master determines if the current path state is active (decision 316). If the path state as indicated in the local session database maintained by the master switch is active (e.g., state 266 of session database 260 of FIG. 2A indicates a value of “1” at time T4), the operation returns. If the path state is inactive (e.g., state 266 of session database 260 of FIG. 2C indicates a value of “0” at time T6), the master switch initiates a teardown of the corresponding BFD session (operation 318).


Member Switch Receives Notification Message and/or BFD Control Packet



FIG. 4A presents a flowchart illustrating a process of a member switch of a fabric switch receiving a notification message from another member switch, in accordance with an embodiment of the present invention. During operation, a member switch (“receiving member switch”) receives a notification message from another member switch, where the notification message contains the receive status (“receive indicator”) of the other member switch for an established BFD session (operation 402). The receiving member switch can be the designated master switch or any other member switch of the fabric switch. The receiving member switch updates its local session database by storing the receive indicator (e.g., indicating a value of active or inactive) of the other member switch (operation 404). The receiving member switch also updates its local session database by setting the path state based on the receive indicator of the other member switch and the receive indicators of all other member switches (operation 406). If the receive indicator of any member switch is active, the corresponding BFD session is active or up. If the receive indicator of all member switches is inactive, the BFD session is inactive or down.



FIG. 4B presents a flowchart illustrating a process of a member switch of a fabric switch receiving or not receiving a BFD control packet from a destination device within a predetermined time interval, in accordance with an embodiment of the present invention. During operation, a member switch determines whether it receives a BFD control packet (decision 452). If the member switch does not receive a BFD control packet, the member switch determines whether the current time is within the predetermined time interval or before expiration of the time interval (decision 454). If the current time is before the expiration of the time interval (e.g., within the time interval), the operation returns to operation 452. If the current time is not before the expiration of the time interval (e.g., after the expiration of the time interval), the member switch updates its local session database by setting its own receive status to inactive or “0” (operation 458).


If the member switch does receive a BFD control packet (decision 452), the member switch determines whether the current time is within the predetermined time interval or before expiration of the time interval (decision 456). If the current time is before the expiration of the time interval (e.g., within the time interval), the member switch updates its local session database by setting its own receive status to active or “1” (operation 460). If the current time is not before the expiration of the time interval (e.g., after the expiration of the time interval), the member switch updates its local session database by setting its own receive status to inactive or “0” (operation 458).


Subsequently, the member switch updates the local session database by setting the current path state based on the receive indicators of all member switches (operation 462). The member switch also broadcasts a notification message to all other member switches, where the notification message contains the receive indicator or receive status of the local switch (operation 464).


Role of Master/Initiator D-BFD Switch



FIG. 5 presents a flowchart illustrating a process of a member switch of a fabric switch monitoring the health of an extension tunnel, in accordance with an embodiment of the present invention. During operation, a member switch (“receiving member switch”) receives new session parameters from a master switch (operation 502). In some embodiments, the member switch can receive a “create” command from the master switch in conjunction with the new session parameters. The member switch then creates a session database (e.g., instantiates a session instance) based on the new session parameters (operation 504). Subsequently, the member switch can receive a notification message from another member switch (operation 506), and the operation continues as depicted by Label A, described above in relation to FIG. 4A. Alternatively, the member switch can receive (or not receive) the return BFD control packet from the destination device (operation 508), and the operation continues as depicted by Label B, described above in relation to FIG. 4B.


Tracking Links and Initiating Failover



FIG. 6 presents a flowchart illustrating a process of a master switch for tracking links and initiating failover, in accordance with an embodiment of the present invention. During operation, the “original” master switch determines if all interfaces connecting to the fabric switch are down (decision 602). If all interfaces are not down (e.g., there is at least one interface available and active to carry data between the fabric switch and the destination device), the system returns to operation 602. If all interfaces are down, the original master switch initiates a BFD session failover to another member switch (e.g., a member switch participating in the same active gateway) (operation 604). The original master switch can remove itself from an active load balancing scheme by broadcasting a notification message to all other member switches, where the notification message contains information indicating that the administrator is down (e.g., “admin_down”) (operation 606). The system elects a “new” master switch that has favorable link parameters. In some embodiments, the system uses the same parameters to elect the new master switch as it does to initially elect the original master switch. The original master switch then transfers master status to the new master switch (operation 608). The new master switch can thus continue transmission of the BFD control packets, providing a seamless transition in the event of link failure.


If the original link parameters become favorable (e.g., the system determines that the interfaces connecting from the original master switch to the fabric switch are up or otherwise determined to be favorable) (decision 610), the system can re-transfer master status by allowing the original master switch to re-assume master status (operation 612). The original master switch broadcasts a notification message to all other member switches, where the notification message contains information indicating that the administrator is up (e.g., “admin_up”) (operation 614). Member switches participating in active gateways can send “admin_down” and “admin_up” messages to aid in tracking links.


New Switch Joins or Leaves a Fabric Switch



FIG. 7A presents a flowchart illustrating a process of a switch joining a fabric switch, in accordance with an embodiment of the present invention. During operation, a new switch joins a fabric switch (or a network of interconnected switches) (operation 702). The new switch requests forwarding path information from all member switches participating in the BFD protocol for existing sessions (operation 704). The new switch then receives current state information from all participating member switches for all sessions maintained by each participating member switch (operation 706). The current state information can include one or more of: negotiated and configured BFD session parameters; an indicator of an active or inactive session state (e.g., path state); and information regarding the current BFD Master for a particular session. The new switch instantiates a BFD session based on the state information received from the participating member switches (operation 708). Subsequently, the new switch begins advertising its BFD session state to the other participating member switches (operation 710).



FIG. 7B presents a flowchart illustrating a process of a member switch leaving a fabric switch, in accordance with an embodiment of the present invention. During operation, the fabric switch (or network of interconnected switches) detects the failure or loss of an inter-switch link to a member switch (operation 752). The fabric switch generates a notification message and broadcasts the notification to all other member switches, where the notification message contains information indicating the failure (e.g., “domain_unreachable”) (operation 754). The other member switches receive the domain_unreachable notification message for the lost member switch, and clear the entry for the lost node in their respective forwarding information databases (operation 756).


Exemplary Switch



FIG. 8 illustrates an exemplary switch capable of monitoring the health of an extension tunnel in a distributed architecture, in accordance with an embodiment of the present invention. In this example, a switch 800 includes a number of communication ports 802, a path monitoring module 820, a session initiator module 822, a broadcast module 824, a forwarding module 826, a link tracking module 828, and a storage 850. In some embodiments, switch 800 may maintain a membership in a fabric switch, wherein switch 800 also includes a fabric switch management module 840. Fabric switch management module 840 maintains a configuration database in storage 850 that maintains the configuration state of a respective switch within the fabric switch. Fabric switch management module 840 maintains the state of the fabric switch, which is used to join other switches. Under such a scenario, communication ports 802 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. Each of modules 820, 822, 824, 826, 828, and 840 can be implemented as an apparatus.


During operation, path monitoring module 820 operates to receive a control packet associated with a session within a predetermined time interval via one of communication ports 802. In response to receiving the control packet within the time interval, path monitoring module 820 is adapted to set a receive indicator for the switch to an active state, and in response to not receiving the control packet within the time interval, path monitoring module 820 is adapted to set the receive indicator for the switch to an inactive state. Path monitoring module 820 is also adapted to set a path state associated with the session based on the receive indicators for the switch and the one or more other member switches. Broadcast module 824 is adapted to broadcast at least the receive indicator for the switch to one or more other member switches.


Path monitoring module 820 is further adapted to, in response to receiving a notification message from another member switch that includes the receive indicator of the other member switch: store the receive indicator of the other switch; and set the path state based on the receive indicator for the other switch. Path monitoring module 820 is further adapted to, in response to receiving a notification message from another member switch that includes session parameters and a create command, create a session database based on the session parameters.


In some embodiments, switch 800 is designated as a master switch. Session initiator module 822 is adapted to establish the session that corresponds to a path between the network of interconnected switches and a destination endpoint based on session parameters, wherein the session is based on a bidirectional forwarding detection (BFD) protocol. Session initiator module 822 is also adapted to create the session database based on the session parameters. Broadcast module 824 is further adapted to broadcast the session parameters and a create command to the other member switches. Forwarding module 826 is adapted to construct a control packet that is destined for the destination endpoint. Path monitoring module 820 is further adapted to, in response to determining that the path state is inactive, initiate a tear down of the path. Link tracking module 828 is adapted to determine a status of all interfaces connecting to a next-hop core router. In response to determining that the status is down, link tracking module 828 is adapted to initiate a failover to one of the other member switches and designate a new master. Broadcast module 824 is further adapted to broadcast a message to the other member switches to remove the switch from an active load balancing scheme. Link tracking module 828 is further adapted to determine that the status of at least one of the interfaces is up. Broadcast module 824 is further adapted to broadcast a message to the other member switches to add the switch to an active load balancing scheme.


Storage 850 can store a session database which indicates parameters for the session and includes one or more of: a session identifier; a source address; a destination address; a master switch identifier; receive indicators for the switch and the other member switches; and the path state for the session.


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


In summary, embodiments of the present invention provide a switch, method, and computer system for monitoring the health of an extension tunnel. In one embodiment, the switch includes a path monitoring apparatus and a broadcast apparatus. During operation, the path monitoring apparatus, via the switch, in response to a control packet or absence of the control packet within a predetermined time interval, sets a receive indicator for the switch to an active or inactive state, and sets a path state associated with the session based on the receive indicators for the switch and one or more other member switches. The broadcast apparatus broadcasts at least the receive indicator for the switch to one or more other member switches. In another embodiment, the path monitoring apparatus, in response to a notification message from another member switch that includes the receive indicator for the other switch, stores the receive indicator for the other switch and sets the path state based on the receive indicator for the other switch. In another embodiment, the switch is designated as a master and performs the operations described herein. Thus, the switch facilitates monitoring the health of an extension tunnel in a distributed architecture by allowing each member switch to maintain its own synchronized version of a session database, and allowing the designated master switch to determine an appropriate action based on a path state for a particular BFD session.


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


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


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

Claims
  • 1. A switch, comprising: one or more ports;tunnel circuitry configured to jointly operate the switch and a second switch in a network of interconnected switches as a tunnel endpoint for a tunnel session;monitoring circuitry configured to: in response to identifying a control packet associated with the tunnel session within a predetermined time interval, determine that the switch is active for the tunnel session;set a path state associated with the tunnel session indicating at least one active path for the tunnel session; andnotification circuitry configured to generate a first notification message, which is destined to the second switch and indicates that the switch is active for the tunnel session.
  • 2. The switch of claim 1, wherein monitoring circuitry is further configured to: in response to identifying a second notification message from the second switch: determine that the second switch is active for the tunnel session; andset the path state indicating at least one active path for the tunnel session based on the second notification message from the second switch.
  • 3. The switch of claim 1, wherein the monitoring circuitry is further configured to: in response to identifying a second notification message, from the second switch, that includes session parameters and a create command, create a session database comprising the session parameters.
  • 4. The switch of claim 1, further comprising a storage device configured to store a session database, which indicates parameters for the tunnel session and includes one or more of: a session identifier;a source address;a destination address;a master switch identifier;receive indicators for the switch and the second switch; andthe path state for the tunnel session.
  • 5. The switch of claim 1, wherein the tunnel session is based on one or more of: a virtual extensible local area network protocol;a generic routing encapsulation protocol; anda tunneling protocol based on encapsulation of a layer-2 compatible frame.
  • 6. The switch of claim 1, wherein the notification circuitry is further configured to generate the first notification message based on an Internet Protocol.
  • 7. The switch of claim 1, wherein the switch and the second switch are each identified by a switch identifier in the network of interconnected switches; and wherein the first notification message is forwardable in a routed network.
  • 8. The switch of claim 1, wherein the switch is designated as a master switch, and further comprises initiator circuitry configured to: establish the tunnel session that corresponds to a path between the tunnel endpoint and a destination endpoint based on session parameters, wherein the tunnel session is based on a bidirectional forwarding detection protocol; andcreate a session database based on the session parameters; andwherein the notification circuitry is further configured to generate, for the second switch, a second notification message comprising the session parameters and a create command.
  • 9. The switch of claim 8, further comprising: forwarding circuitry configured to construct a second control packet destined to the destination endpoint; andwherein the monitoring circuitry is further configured to, in response to determining that the path state is inactive, initiate a tear down of the path.
  • 10. The switch of claim 8, further comprising: tracking circuitry configured to: determine a status of one or more local interfaces corresponding to a next-hop router; andin response to determining that the status of the one or more local interfaces is down: initiate a failover to the second switch; anddesignate the second switch as a new master switch; andwherein the notification circuitry is further configured to generate, for the second switch, a third notification message instructing to remove the switch from an active load balancing scheme.
  • 11. The switch of claim 10, wherein the tracking circuitry is further configured to: determine that the status of at least one of the one or more local interfaces is up; andwherein the notification circuitry is further configured to generate, for the second switch, a fourth notification instructing to add the switch to the active load balancing scheme.
  • 12. The switch of claim 10, wherein the tracking circuitry is further configured to: determine that the master switch is unable to determine whether the master switch is active for the tunnel session; andwherein the monitoring circuitry is further configured to trigger a failover to a third switch associated with the tunnel endpoint.
  • 13. A computer-implemented method, comprising: jointly operating a first switch and a second switch in a network of interconnected switches as a tunnel endpoint for a tunnel session;in response to identifying a control packet associated with the tunnel session within a predetermined time interval, determine that the first switch is active for the tunnel session;setting a path state associated with the tunnel session indicating at least one active path for the tunnel session; andgenerate a first notification message, which is destined to the second switch and indicates that the first switch is active for the tunnel session.
  • 14. The method of claim 13, further comprising: in response to identifying a second notification message from the second switch: determining that the second switch is active for the tunnel session; andsetting the path state indicating at least one active path for the tunnel session based on the second notification message from the second switch.
  • 15. The method of claim 13, further comprising: in response to identifying a second notification message, from the second switch, that includes session parameters and a create command, creating a session database comprising the session parameters.
  • 16. The method of claim 13, further comprising storing, in a storage device of the first switch, a session database, which indicates parameters for the tunnel session and includes one or more of: a session identifier;a source address;a destination address;a master switch identifier;receive indicators for the first switch and the second switch; andthe path state for the tunnel session.
  • 17. The method of claim 13, wherein the tunnel session is based on one or more of: a virtual extensible local area network protocol;a generic routing encapsulation protocol; anda tunneling protocol based on encapsulation of a layer-2 compatible frame.
  • 18. The method of claim 13, wherein generating the first notification message is based on an Internet Protocol.
  • 19. The method of claim 13, wherein the first switch and the second switch are each identified by a switch identifier in the network of interconnected switches; and wherein the first notification message is forwardable in a routed network.
  • 20. The method of claim 13, wherein the first switch is designated as a master switch, and wherein the method further comprises: establishing the tunnel session that corresponds to a path between the tunnel endpoint and a destination endpoint based on session parameters, wherein the tunnel session is based on a bidirectional forwarding detection protocol;creating a session database based on the session parameters; andgenerating, for the second switch, a second notification message comprising the session parameters and a create command.
  • 21. The method of claim 20, further comprising: constructing a second control packet destined to the destination endpoint; andin response to determining that the path state is inactive, initiating a tear down of the path.
  • 22. The method of claim 20, further comprising: determining a status of one or more interfaces of the first switch corresponding to a next-hop router;in response to determining that the status of the one or more interfaces is down: initiating a failover to the second switch; anddesignating the second switch as a new master switch; andgenerate, for the second switch, a third notification instructing to remove the first switch from an active load balancing scheme.
  • 23. The method of claim 22, further comprising: determining that the status of at least one of the one or more interfaces is up; andgenerate, for the second switch, a fourth notification message instructing to add the first switch to an active load balancing scheme.
  • 24. The method of claim 22, further comprising: determining that the master switch is unable to determine whether the master switch is active for the tunnel session; andtriggering a failover to a third switch associated with the tunnel endpoint.
  • 25. A computer system for monitoring path health, the system comprising: a processor; anda storage device coupled to the processor and storing instructions that when executed by a computer cause the computer to perform a method, the method comprising: jointly operating a first switch and a second switch in a network of interconnected switches as a tunnel endpoint for a tunnel session;in response to identifying a control packet associated with the tunnel session within a predetermined time interval, determining that the first switch is active for the tunnel session;setting a path state associated with the tunnel session indicating at least one active path for the tunnel session; andgenerating a first notification message, which is destined to the second switch and indicates that the first switch is active for the tunnel session.
RELATED APPLICATIONS

This application claims the benefit of: U.S. Provisional Application No. 62/099,983, titled “Distributed Bidirectional Forwarding Detection Protocol (D-BFD) For VCS Cluster,” by inventors Pavan Kumar, Prabu Thayalan, Shivalingayya Chikkamath, and Mythilikanth Raman, filed 5 Jan. 2015, the disclosure of which is incorporated by reference herein. The present disclosure is related to: U.S. patent application Ser. No. 13/087,239, titled “Virtual Cluster Switching,” by inventors Suresh Vobbilisetty and Dilip Chatwani, filed 14 Apr. 2011 (hereinafter U.S. patent application Ser. No. 13/087,239); 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 (hereinafter U.S. patent application Ser. No. 13/092,724”); and U.S. Pat. No. 8,665,886, titled “Redundant Host Connection in a Routed Network,” by inventors Somesh Gupta, Anoop Ghanwani, Phanidhar Koganti, and Shunjia Yu, issued 4 Mar. 2014 (hereinafter “U.S. Pat. No. 8,665,886”), the disclosures of which are incorporated by reference herein.

US Referenced Citations (648)
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 Wehrill, III Oct 1999 A
5983278 Chong Nov 1999 A
5995262 Hirota Nov 1999 A
6041042 Bussiere Mar 2000 A
6085238 Yuasa Jul 2000 A
6092062 Lohman Jul 2000 A
6104696 Kadambi Aug 2000 A
6185214 Schwartz Feb 2001 B1
6185241 Sun Feb 2001 B1
6295527 McCormack Sep 2001 B1
6331983 Haggerty Dec 2001 B1
6438106 Pillar Aug 2002 B1
6498781 Bass Dec 2002 B1
6542266 Phillips Apr 2003 B1
6553029 Alexander Apr 2003 B1
6571355 Linnell May 2003 B1
6583902 Yuen Jun 2003 B1
6633761 Singhal Oct 2003 B1
6636963 Stein Oct 2003 B1
6771610 Seaman Aug 2004 B1
6870840 Hill Mar 2005 B1
6873602 Ambe Mar 2005 B1
6920503 Nanji Jul 2005 B1
6937576 DiBenedetto Aug 2005 B1
6956824 Mark Oct 2005 B2
6957269 Williams Oct 2005 B2
6975581 Medina Dec 2005 B1
6975864 Singhal Dec 2005 B2
7016352 Chow Mar 2006 B1
7061877 Gummalla Jun 2006 B1
7062177 Grivna Jun 2006 B1
7097308 Kim et al. Aug 2006 B2
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
7397768 Betker Jul 2008 B1
7397794 Lacroute Jul 2008 B1
7430164 Bare Sep 2008 B2
7453888 Zabihi Nov 2008 B2
7477894 Sinha Jan 2009 B1
7480258 Shuen Jan 2009 B1
7508757 Ge Mar 2009 B2
7558195 Kuo Jul 2009 B1
7558273 Grosser Jul 2009 B1
7571447 Ally Aug 2009 B2
7599901 Mital Oct 2009 B2
7653056 Dianes Jan 2010 B1
7688736 Walsh Mar 2010 B1
7688960 Aubuchon Mar 2010 B1
7690040 Frattura Mar 2010 B2
7706255 Kondrat et al. Apr 2010 B1
7716370 Devarapalli May 2010 B1
7720076 Dobbins May 2010 B2
7729296 Choudhary Jun 2010 B1
7787480 Mehta Aug 2010 B1
7792920 Istvan Sep 2010 B2
7796593 Ghosh Sep 2010 B1
7801021 Triantafillis Sep 2010 B1
7808992 Homchaudhuri Oct 2010 B2
7836332 Hara Nov 2010 B2
7843906 Chidambaram et al. Nov 2010 B1
7843907 Abou-Emara Nov 2010 B1
7860097 Lovett Dec 2010 B1
7898959 Arad Mar 2011 B1
7912091 Krishnan Mar 2011 B1
7924837 Shabtay Apr 2011 B1
7937438 Miller May 2011 B1
7937756 Kay May 2011 B2
7945941 Sinha May 2011 B2
7949638 Goodson May 2011 B1
7957386 Aggarwal Jun 2011 B1
8018938 Fromm Sep 2011 B1
8027354 Portolani Sep 2011 B1
8054832 Shukla Nov 2011 B1
8068442 Kompella Nov 2011 B1
8078704 Lee Dec 2011 B2
8090805 Chawla Jan 2012 B1
8102781 Smith Jan 2012 B2
8102791 Tang Jan 2012 B2
8116307 Thesayi Feb 2012 B1
8125928 Mehta Feb 2012 B2
8134922 Elangovan Mar 2012 B2
8155150 Chung Apr 2012 B1
8160063 Maltz Apr 2012 B2
8160080 Arad Apr 2012 B1
8170038 Belanger May 2012 B2
8175107 Yalagandula May 2012 B1
8095774 Lambeth Jun 2012 B1
8194674 Pagel Jun 2012 B1
8195774 Lambeth Jun 2012 B2
8204061 Sane Jun 2012 B1
8213313 Doiron Jul 2012 B1
8213336 Smith Jul 2012 B2
8230069 Korupolu Jul 2012 B2
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 J Ha Feb 2013 B2
8369347 Xiong Feb 2013 B2
8392496 Linden Mar 2013 B2
8451717 Srikrishnan May 2013 B2
8462774 Page Jun 2013 B2
8465774 Page Jun 2013 B2
8467375 Blair Jun 2013 B2
8520595 Yadav Aug 2013 B2
8553710 White Oct 2013 B1
8595479 Radhakrishnan Nov 2013 B2
8599850 J Ha Dec 2013 B2
8599864 Chung Dec 2013 B2
8615008 Natarajan Dec 2013 B2
8619788 Sankaran Dec 2013 B1
8625616 Vobbilisetty Jan 2014 B2
8705526 Hasan Apr 2014 B1
8706905 McGlaughlin Apr 2014 B1
8717895 Koponen May 2014 B2
8724456 Hong May 2014 B1
8792501 Rustagi Jul 2014 B1
8798045 Aybay Aug 2014 B1
8798055 An Aug 2014 B1
8804732 Hepting 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
8971173 Choudhury Mar 2015 B1
8995272 Agarwal Mar 2015 B2
9019976 Gupta Apr 2015 B2
9178793 Marlow Nov 2015 B1
9231890 Vobbilisetty Jan 2016 B2
9350680 Thayalan May 2016 B2
9401818 Venkatesh Jul 2016 B2
9438447 Basso Sep 2016 B2
9524173 Guntaka Dec 2016 B2
9626255 Guntaka Apr 2017 B2
9628407 Guntaka Apr 2017 B2
20010005527 Vaeth Jun 2001 A1
20010055274 Hegge Dec 2001 A1
20020019904 Katz Feb 2002 A1
20020021701 Lavian Feb 2002 A1
20020027885 Ben-Ami Mar 2002 A1
20020039350 Wang Apr 2002 A1
20020054593 Morohashi May 2002 A1
20020087723 Williams Jul 2002 A1
20020091795 Yip Jul 2002 A1
20030026290 Umayabashi Feb 2003 A1
20030041085 Sato Feb 2003 A1
20030093567 Lolayekar May 2003 A1
20030097464 Martinez May 2003 A1
20030097470 Lapuh May 2003 A1
20030123393 Feuerstraeter Jul 2003 A1
20030147385 Montalvo Aug 2003 A1
20030152075 Hawthorne Aug 2003 A1
20030174706 Shankar Sep 2003 A1
20030189905 Lee Oct 2003 A1
20030189930 Terrell Oct 2003 A1
20030208616 Laing Nov 2003 A1
20030216143 Roese Nov 2003 A1
20030223428 BlanquerGonzalez Dec 2003 A1
20030233534 Bernhard Dec 2003 A1
20040001433 Gram Jan 2004 A1
20040003094 See Jan 2004 A1
20040010600 Baldwin Jan 2004 A1
20040088668 Bornowski Jan 2004 A1
20040047349 Fujita Mar 2004 A1
20040049699 Griffith Mar 2004 A1
20040057430 Paavolainen Mar 2004 A1
20040081171 Finn Apr 2004 A1
20040095900 Siegel May 2004 A1
20040117508 Shimizu Jun 2004 A1
20040120326 Yoon Jun 2004 A1
20040156313 Hofmeister et al. Aug 2004 A1
20040165595 Holmgren Aug 2004 A1
20040165596 Garcia Aug 2004 A1
20040205234 Barrack Oct 2004 A1
20040213232 Regan Oct 2004 A1
20040225725 Enomoto Nov 2004 A1
20040243673 Goyal Dec 2004 A1
20050007951 Lapuh Jan 2005 A1
20050025179 McLaggan Feb 2005 A1
20050036488 Kalkunte Feb 2005 A1
20050044199 Shiga Feb 2005 A1
20050074001 Mattes Apr 2005 A1
20050094568 Judd May 2005 A1
20050094630 Valdevit May 2005 A1
20050108375 Hallak-Stamler May 2005 A1
20050111352 Ho May 2005 A1
20050122979 Gross Jun 2005 A1
20050152335 Lodha Jul 2005 A1
20050157645 Rabie et al. Jul 2005 A1
20050157751 Rabie Jul 2005 A1
20050169188 Cometto Aug 2005 A1
20050195813 Ambe Sep 2005 A1
20050207423 Herbst Sep 2005 A1
20050213561 Yao Sep 2005 A1
20050220096 Friskney Oct 2005 A1
20050259586 Hafid Nov 2005 A1
20050265330 Suzuki Dec 2005 A1
20050265356 Kawarai Dec 2005 A1
20050278565 Frattura Dec 2005 A1
20060007869 Hirota Jan 2006 A1
20060018302 Ivaldi Jan 2006 A1
20060023707 Makishima Feb 2006 A1
20060029055 Perera Feb 2006 A1
20060034292 Wakayama Feb 2006 A1
20060036648 Frey Feb 2006 A1
20060036765 Weyman Feb 2006 A1
20060039366 Ghosh Feb 2006 A1
20060059163 Frattura Mar 2006 A1
20060062187 Rune Mar 2006 A1
20060072550 Davis Apr 2006 A1
20060083172 Jordan Apr 2006 A1
20060083254 Ge Apr 2006 A1
20060092860 Higashitaniguchi May 2006 A1
20060093254 Mozdy May 2006 A1
20060098589 Kreeger May 2006 A1
20060126511 Youn Jun 2006 A1
20060140130 Kalkunte Jun 2006 A1
20060155828 Ikeda Jul 2006 A1
20060168109 Warmenhoven Jul 2006 A1
20060184937 Abels Aug 2006 A1
20060206655 Chappell Sep 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
20070121617 Kanekar May 2007 A1
20070130295 Rastogi Jun 2007 A1
20070156659 Lim Jul 2007 A1
20070177525 Wijnands Aug 2007 A1
20070177597 Ju Aug 2007 A1
20070183313 Narayanan Aug 2007 A1
20070206762 Chandra Sep 2007 A1
20070211712 Fitch Sep 2007 A1
20070220059 Lu Sep 2007 A1
20070226214 Smits Sep 2007 A1
20070230472 Jesuraj Oct 2007 A1
20070238343 Velleca Oct 2007 A1
20070258449 Bennett Nov 2007 A1
20070274234 Kubota Nov 2007 A1
20070280223 Pan Dec 2007 A1
20070289017 Copeland, III Dec 2007 A1
20080052487 Akahane Feb 2008 A1
20080056135 Lee Mar 2008 A1
20080056300 Williams Mar 2008 A1
20080057918 Abrant Mar 2008 A1
20080065760 Damm Mar 2008 A1
20080075078 Watanabe 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
20080165705 Umayabashi Jul 2008 A1
20080172492 Raghunath Jul 2008 A1
20080181196 Regan Jul 2008 A1
20080181243 Vobbilisetty Jul 2008 A1
20080186968 Farinacci Aug 2008 A1
20080186981 Seto Aug 2008 A1
20080205377 Chao Aug 2008 A1
20080219172 Mohan Sep 2008 A1
20080225852 Raszuk Sep 2008 A1
20080225853 Melman Sep 2008 A1
20080228897 Ko Sep 2008 A1
20080240129 Elmeleegy Oct 2008 A1
20080253380 Cazares 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
20080304519 Koenen Dec 2008 A1
20080310342 Kruys Dec 2008 A1
20090022069 Khan Jan 2009 A1
20090024734 Merbach Jan 2009 A1
20090037607 Farinacci Feb 2009 A1
20090037977 Gai Feb 2009 A1
20090041046 Hirata Feb 2009 A1
20090042270 Dolly Feb 2009 A1
20090044270 Shelly Feb 2009 A1
20090067422 Poppe Mar 2009 A1
20090067442 Killian Mar 2009 A1
20090079560 Fries Mar 2009 A1
20090080345 Gray Mar 2009 A1
20090083445 Ganga Mar 2009 A1
20090092042 Yuhara Apr 2009 A1
20090092043 Lapuh Apr 2009 A1
20090094354 Rastogi Apr 2009 A1
20090106298 Furusho Apr 2009 A1
20090106405 Mazarick Apr 2009 A1
20090113408 Toeroe Apr 2009 A1
20090116381 Kanda May 2009 A1
20090122700 Aboba May 2009 A1
20090129384 Regan May 2009 A1
20090129389 Halna DeFretay 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
20090279701 Moisand 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
20100027429 Jorgens Feb 2010 A1
20100042869 Szabo Feb 2010 A1
20100046471 Hattori Feb 2010 A1
20100054260 Pandey Mar 2010 A1
20100061269 Banerjee Mar 2010 A1
20100074175 Banks Mar 2010 A1
20100085981 Gupta Apr 2010 A1
20100097941 Carlson Apr 2010 A1
20100103813 Allan Apr 2010 A1
20100103939 Carlson Apr 2010 A1
20100114818 Lier May 2010 A1
20100131636 Suri May 2010 A1
20100157844 Casey Jun 2010 A1
20100158024 Sajassi Jun 2010 A1
20100165877 Shukla Jul 2010 A1
20100165995 Mehta Jul 2010 A1
20100168467 Johnston Jul 2010 A1
20100169467 Shukla Jul 2010 A1
20100169948 Budko Jul 2010 A1
20100182920 Matsuoka Jul 2010 A1
20100189119 Sawada Jul 2010 A1
20100192225 Ma Jul 2010 A1
20100195489 Zhou Aug 2010 A1
20100195529 Liu Aug 2010 A1
20100214913 Kompella 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
20100246580 Kaganoi Sep 2010 A1
20100254703 Kirkpatrick Oct 2010 A1
20100257263 Casado Oct 2010 A1
20100258263 Douxchamps Oct 2010 A1
20100265849 Harel Oct 2010 A1
20100271960 Krygowski Oct 2010 A1
20100272107 Papp Oct 2010 A1
20100281106 Ashwood-Smith Nov 2010 A1
20100284414 Agarwal Nov 2010 A1
20100284418 Gray Nov 2010 A1
20100284698 McColloch Nov 2010 A1
20100287262 Elzur Nov 2010 A1
20100287548 Zhou Nov 2010 A1
20100290464 Assarpour Nov 2010 A1
20100290472 Raman Nov 2010 A1
20100290473 Enduri Nov 2010 A1
20100299527 Arunan Nov 2010 A1
20100303071 Kotalwar Dec 2010 A1
20100303075 Tripathi Dec 2010 A1
20100303083 Belanger Dec 2010 A1
20100309820 Rajagopalan Dec 2010 A1
20100309912 Mehta Dec 2010 A1
20100316055 Belanger Dec 2010 A1
20100329110 Rose Dec 2010 A1
20100329265 Lapuh Dec 2010 A1
20110007738 Berman Jan 2011 A1
20110019678 Mehta Jan 2011 A1
20110032945 Mullooly 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
20110134924 Hewson Jun 2011 A1
20110134925 Safrai Jun 2011 A1
20110142053 VanDerMerwe Jun 2011 A1
20110142062 Wang Jun 2011 A1
20110149526 Turner Jun 2011 A1
20110158113 Nanda Jun 2011 A1
20110161494 McDysan Jun 2011 A1
20110161695 Okita Jun 2011 A1
20110176412 Stine Jul 2011 A1
20110188373 Saito Aug 2011 A1
20110194403 Sajassi Aug 2011 A1
20110194563 Shen Aug 2011 A1
20110225540 d'Entremont Sep 2011 A1
20110228767 Singla Sep 2011 A1
20110228780 Ashwood-Smith Sep 2011 A1
20110231570 Altekar Sep 2011 A1
20110231574 Saunderson Sep 2011 A1
20110235523 Jha Sep 2011 A1
20110243133 Villait Oct 2011 A9
20110243136 Raman Oct 2011 A1
20110246669 Kanada Oct 2011 A1
20110255538 Srinivasan Oct 2011 A1
20110255540 Mizrahi Oct 2011 A1
20110261828 Smith Oct 2011 A1
20110268118 Schlansker Nov 2011 A1
20110268120 Vobbilisetty Nov 2011 A1
20110268125 Vobbilisetty Nov 2011 A1
20110273988 Tourrilhes Nov 2011 A1
20110273990 Rajagopalan Nov 2011 A1
20110274114 Dhar Nov 2011 A1
20110280572 Vobbilisetty Nov 2011 A1
20110286357 Haris Nov 2011 A1
20110286457 Ee Nov 2011 A1
20110286462 Kompella Nov 2011 A1
20110055274 Hegge Dec 2011 A1
20110292947 Vobbilisetty Dec 2011 A1
20110296052 Guo Dec 2011 A1
20110299391 Vobbilisetty Dec 2011 A1
20110299413 Chatwani Dec 2011 A1
20110299414 Yu Dec 2011 A1
20110299527 Yu Dec 2011 A1
20110299528 Yu Dec 2011 A1
20110299531 Yu Dec 2011 A1
20110299532 Yu Dec 2011 A1
20110299533 Yu Dec 2011 A1
20110299534 Koganti Dec 2011 A1
20110299535 Vobbilisetty Dec 2011 A1
20110299536 Cheng Dec 2011 A1
20110317559 Kern Dec 2011 A1
20110317703 Dunbar et al. Dec 2011 A1
20120011240 Hara Jan 2012 A1
20120014261 Salam Jan 2012 A1
20120014387 Dunbar Jan 2012 A1
20120020220 Sugita Jan 2012 A1
20120027017 Rai Feb 2012 A1
20120033663 Guichard Feb 2012 A1
20120033665 Jacob Feb 2012 A1
20120033668 Humphries Feb 2012 A1
20120033669 Mohandas Feb 2012 A1
20120033672 Page Feb 2012 A1
20120039163 Nakajima Feb 2012 A1
20120042095 Kotha Feb 2012 A1
20120063363 Li Mar 2012 A1
20120075991 Sugita Mar 2012 A1
20120099567 Hart Apr 2012 A1
20120099602 Nagapudi Apr 2012 A1
20120099863 Xu Apr 2012 A1
20120102160 Breh Apr 2012 A1
20120106339 Mishra May 2012 A1
20120117438 Shaffer May 2012 A1
20120131097 Baykal May 2012 A1
20120131289 Taguchi May 2012 A1
20120134266 Roitshtein May 2012 A1
20120136999 Roitshtein May 2012 A1
20120147740 Nakash Jun 2012 A1
20120158997 Hsu Jun 2012 A1
20120163164 Terry Jun 2012 A1
20120170491 Kern Jul 2012 A1
20120177039 Berman Jul 2012 A1
20120210416 Mihelich Aug 2012 A1
20120221636 Surtani Aug 2012 A1
20120230225 Matthews Sep 2012 A1
20120239918 Huang Sep 2012 A1
20120243359 Keesara Sep 2012 A1
20120243539 Keesara Sep 2012 A1
20120250502 Brolin Oct 2012 A1
20120260079 Mruthyunjaya Oct 2012 A1
20120275297 Subramanian Nov 2012 A1
20120275347 Banerjee Nov 2012 A1
20120278804 Narayanasamy Nov 2012 A1
20120281700 Koganti Nov 2012 A1
20120287785 Kamble Nov 2012 A1
20120294192 Masood Nov 2012 A1
20120294194 Balasubramanian Nov 2012 A1
20120230800 Kamble Dec 2012 A1
20120320800 Kamble 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
20130003608 Lei Jan 2013 A1
20130003737 Sinicrope Jan 2013 A1
20130003738 Koganti Jan 2013 A1
20130028072 Addanki Jan 2013 A1
20130034015 Jaiswal Feb 2013 A1
20130034021 Jaiswal Feb 2013 A1
20130034094 Cardona Feb 2013 A1
20130044629 Biswas Feb 2013 A1
20130058354 Casado Mar 2013 A1
20130066947 Ahmad Mar 2013 A1
20130067466 Combs Mar 2013 A1
20130070762 Adams Mar 2013 A1
20130083693 Himura Apr 2013 A1
20130097345 Munoz Apr 2013 A1
20130114595 Mack-Crane et al. May 2013 A1
20130124707 Ananthapadmanabha May 2013 A1
20130124750 Anumala May 2013 A1
20130127848 Joshi May 2013 A1
20130132296 Manfred May 2013 A1
20130135811 Dunwoody May 2013 A1
20130136123 Ge May 2013 A1
20130145008 Kannan Jun 2013 A1
20130148546 Eisenhauer Jun 2013 A1
20130148663 Xiong Jun 2013 A1
20130156425 Kirkpatrick Jun 2013 A1
20130194914 Agarwal Aug 2013 A1
20130201992 Masaki 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 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
20140029419 Jain Jan 2014 A1
20140044126 Sabhanatarajan Feb 2014 A1
20140050223 Foo Feb 2014 A1
20140056298 Vobbilisetty Feb 2014 A1
20140059225 Gasparakis Feb 2014 A1
20140064056 Sakata Mar 2014 A1
20140071987 Janardhanan Mar 2014 A1
20140086253 Yong Mar 2014 A1
20140092738 Grandhi Apr 2014 A1
20140105034 Huawei Apr 2014 A1
20140112122 Kapadia Apr 2014 A1
20140140243 Ashwood-Smith May 2014 A1
20140157251 Hocker Jun 2014 A1
20140169368 Grover Jun 2014 A1
20140192804 Ghanwani Jul 2014 A1
20140241147 Rajagopalan Aug 2014 A1
20140258446 Bursell Sep 2014 A1
20140269701 Kaushik 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
20140362854 Addanki Dec 2014 A1
20140362859 Addanki Dec 2014 A1
20150009992 Zhang Jan 2015 A1
20150010007 Matsuhira Jan 2015 A1
20150016300 Devireddy Jan 2015 A1
20150030031 Zhou Jan 2015 A1
20150092593 Kompella Apr 2015 A1
20150110111 Song Apr 2015 A1
20150110487 Fenkes Apr 2015 A1
20150117256 Sabaa Apr 2015 A1
20150127618 Alberti May 2015 A1
20150139234 Hu May 2015 A1
20150143369 Zheng May 2015 A1
20150172098 Agarwal Jun 2015 A1
20150188753 Anumala Jul 2015 A1
20150195093 Ramasubramani Jul 2015 A1
20150222506 Kizhakkiniyil Aug 2015 A1
20150248298 Gavrilov Sep 2015 A1
20150263991 MacChiano Sep 2015 A1
20150281066 Koley Oct 2015 A1
20150301901 Rath Oct 2015 A1
20150347468 Bester Dec 2015 A1
20160072899 Tung Mar 2016 A1
20160087885 Tripathi Mar 2016 A1
20160139939 Bosch May 2016 A1
20160182458 Shatzkamer Jun 2016 A1
20160344640 Soderlund et al. Nov 2016 A1
20170026197 Venkatesh Jan 2017 A1
20170097841 Chang Apr 2017 A1
Foreign Referenced Citations (20)
Number Date Country
0579567 May 1993 EP
0579567 Jan 1994 EP
0993156 Apr 2000 EP
0993156 Dec 2000 EP
1398920 Mar 2004 EP
1398920 Mar 2004 EP
1916807 Apr 2008 EP
2001167 Oct 2008 EP
2854352 Apr 2015 EP
2874359 May 2015 EP
2008056838 May 2008 WO
2009042919 Apr 2009 WO
2010111142 Sep 2010 WO
2010111142 Sep 2010 WO
2011132568 Oct 2011 WO
2011140028 Nov 2011 WO
2011140028 Nov 2011 WO
2012033663 Mar 2012 WO
2012093429 Jul 2012 WO
2014031781 Feb 2014 WO
Non-Patent Literature Citations (244)
Entry
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.
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.
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].
Office Action dated Jun. 18, 2015, U.S. Appl. No. 13/098,490, filed May 2, 2011.
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 Jun. 16, 2015, U.S. Appl. No. 13/048,817, filed Mar. 15, 2011.
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.
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Nov. 29, 2013.
Perlman, Radia et al., ‘RBridges: Base Protocol Specification; Draft-ietf-trill-rbridge-protocol-16.txt’, Mar. 3, 2010, pp. 1-117.
‘An Introduction to Brocade VCS Fabric Technology’, BROCADE white paper, http://community.brocade.com/docs/DOC-2954, Dec. 3, 2012.
Brocade, ‘Brocade Fabrics OS (FOS) 6.2 Virtual Fabrics Feature Frequently Asked Questions’, pp. 1-6, 2009 Brocade Communications Systems, Inc.
BROCADE, ‘Fastlron and Turbolron 24x Configuration Guide’, Feb. 16, 2010.
BROCADE, ‘The Effortless Network: Hyperedge Technology for the Campus LAN’ 2012.
BROCADE ‘Brocade Unveils ‘The Effortless Network’’, http://newsroom.brocade.com/press-releases/brocade-unveils-the-effortless-network-nasdaq-brcd-0859535, 2012.
Christensen, M. et al., ‘Considerations for Internet Group Management Protocol (IGMP) and Multicast Listener Discovery (MLD) Snooping Switches’, May 2006.
Fastlron Configuration Guide Supporting Ironware Software Release 07.0.00, Dec. 18, 2009.
Foundary Fastlron Configuration Guide, Software Release FSX 04.2.00b, Software Release FWS 04.3.00, Software Release FGS 05.0.00a, Sep. 2008.
Knight, ‘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’, Jan. 30, 2012.
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/092,752, filed Apr. 22, 2011, from Park, Jung H., dated Jul. 18, 2013.
Office Action for U.S. Appl. No. 13/351,513, filed Jan. 17, 2012, dated Jul. 24, 2014.
Office Action for U.S. Appl. No. 13/365,993, filed Feb. 3, 2012, from Cho, Hong Sol., dated Jul. 23, 2013.
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. 12/725,249, filed Mar. 16, 2010, dated Apr. 26, 2013.
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 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/365,808, filed Jul. 18, 2013, dated Jul. 18, 2013.
Perlman, Radia et al., ‘Challenges and Opportunities in the Design of TRILL: a Routed layer 2 Technology’, 2009.
S. Nadas et al., ‘Virtual Router Redundancy Protocol (VRRP) Version 3 for IPv4 and IPv6’, Internet Engineering Task Force, Mar. 2010.
‘RBridges: Base Protocol Specification’, IETF Draft, Perlman et al., Jun. 26, 2009.
U.S. Appl. No. 13/030,806 Office Action dated Dec. 3, 2012.
Office action dated Apr. 26, 2012, U.S. Appl. No. 12/725,249, filed Mar. 16, 2010.
Office action dated Sep. 12, 2012, U.S. Appl. No. 12/725,249, filed Mar. 16, 2010.
Office action dated Dec. 21, 2012, U.S. Appl. No. 13/098,490, filed May 2, 2011.
Office action dated Mar. 27, 2014, U.S. Appl. No. 13/098,490, filed May 2, 2011.
Office action dated Jul. 9, 2013, U.S. Appl. No. 13/098,490, filed May 2, 2011.
Office action dated May 22, 2013, U.S. Appl. No. 13/087,239, filed Apr. 14, 2011.
Office action dated Dec. 5, 2012, U.S. Appl. No. 13/087,239, filed Apr. 14, 2011.
Office action dated Apr. 9, 2014, U.S. Appl. No. 13/092,724, filed Apr. 22, 2011.
Office action dated Feb. 5, 2013, U.S. Appl. No. 13/092,724, filed Apr. 22, 2011.
Office action dated Jan. 10, 2014, U.S. Appl. No. 13/092,580, filed Apr. 22, 2011.
Office action dated Jun. 10, 2013, U.S. Appl. No. 13/092,580, filed Apr. 22, 2011.
Office action dated Jan. 16, 2014, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011.
Office action dated Mar. 18, 2013, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011.
Office action dated Jul. 31, 2013, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011.
Office action dated Aug. 29, 2014, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011.
Office action dated Mar. 14, 2014, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011.
Office action dated Jun. 21, 2013, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011.
Office action dated Aug. 14, 2014, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011.
Office action dated Jan. 28, 2013, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011.
Office Action dated Mar. 26, 2014, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011.
Office action dated Jul. 3, 2013, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011.
Office Action dated Apr. 9, 2014, U.S. Appl. No. 13/092,752, filed Apr. 22, 2011.
Office action dated Jul. 18, 2013, U.S. Appl. No. 13/092,752, filed Apr. 22, 2011.
Office action dated Dec. 20, 2012, U.S. Appl. No. 12/950,974, filed Nov. 19, 2010.
Office action dated May 24, 2012, U.S. Appl. No. 12/950,974, filed Nov. 19, 2010.
Office action dated Jan. 6, 2014, U.S. Appl. No. 13/092,877, filed Apr. 22, 2011.
Office action dated Sep. 5, 2013, U.S. Appl. No. 13/092,877, filed Apr. 22, 2011.
Office action dated Mar. 4, 2013, U.S. Appl. No. 13/092,877, filed Apr. 22, 2011.
Office action dated Jan. 4, 2013, U.S. Appl. No. 12/950,968, filed Nov. 19, 2010.
Office action dated Jun. 7, 2012, U.S. Appl. No. 12/950,968, filed Nov. 19, 2010.
Office action dated Sep. 19, 2012, U.S. Appl. No. 13/092,864, filed Apr. 22, 2011.
Office action dated May 31, 2013, U.S. Appl. No. 13/098,360, filed Apr. 29, 2011.
Office action dated Jul. 7, 2014, for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011.
Office action dated Oct. 2, 2013, U.S. Appl. No. 13/044,326, filed Mar. 9, 2011.
Office Action dated Dec. 19, 2014, for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011.
Office action dated Dec. 3, 2012, U.S. Appl. No. 13/030,806, filed Feb. 18, 2011.
Office action dated Apr. 22, 2014, U.S. Appl. No. 13/030,806, filed Feb. 18, 2011.
Office action dated Jun. 11, 2013, U.S. Appl. No. 13/030,806, filed Feb. 18, 2011.
Office action dated Apr. 25, 2013, U.S. Appl. No. 13/030,688, filed Feb. 18, 2011.
Office action dated Feb. 22, 2013, U.S. Appl. No. 13/044,301, filed Mar. 9, 2011.
Office action dated Jun. 11, 2013, U.S. Appl. No. 13/044,301, filed Mar. 9, 2011.
Office action dated Oct. 26, 2012, U.S. Appl. No. 13/050,102, filed Mar. 17, 2011.
Office action dated May 16, 2013, U.S. Appl. No. 13/050,102, filed Mar. 17, 2011.
Office action dated Aug. 4, 2014, U.S. Appl. No. 13/050,102, filed Mar. 17, 2011.
Office action dated Jan. 28, 2013, U.S. Appl. No. 13/148,526, filed Jul. 16, 2011.
Office action dated Dec. 2, 2013, U.S. Appl. No. 13/184,526, filed Jul. 16, 2011.
Office action dated May 22, 2013, U.S. Appl. No. 13/148,526, filed Jul. 16, 2011.
Office action dated Aug. 21, 2014, U.S. Appl. No. 13/184,526, filed Jul. 16, 2011.
Office action dated Nov. 29, 2013, U.S. Appl. No. 13/092,873, filed Apr. 22, 2011.
Office action dated Jun. 19, 2013, U.S. Appl. No. 13/092,873, filed Apr. 22, 2011.
Office action dated Jul. 18, 2013, U.S. Appl. No. 13/365,808, filed Feb. 3, 2012.
Office Action dated Mar. 6, 2014, U.S. Appl. No. 13/425,238, filed Mar. 20, 2012.
Office action dated Nov. 12, 2013, U.S. Appl. No. 13/312,903, filed Dec. 6, 2011.
Office action dated Jun. 13, 2013, U.S. Appl. No. 13/312,903, filed Dec. 6, 2011.
Office Action dated Jun. 18, 2014, U.S. Appl. No. 13/440,861, filed Apr. 5, 2012.
Office Action dated Feb. 28, 2014, U.S. Appl. No. 13/351,513, filed Jan. 17, 2012.
Office Action dated May 9, 2014, U.S. Appl. No. 13/484,072, filed May 30, 2012.
Office Action dated May 14, 2014, U.S. Appl. No. 13/533,843, filed Jun. 26, 2012.
Office Action dated Feb. 20, 2014, U.S. Appl. No. 13/598,204, filed Aug. 29, 2012.
Office Action dated Jun. 6, 2014, U.S. Appl. No. 13/669,357, filed Nov. 5, 2012.
Brocade ‘An Introduction to Brocade VCS Fabric Technology’, Dec. 3, 2012.
Huang, Nen-Fu et al., ‘An Effective Spanning Tree Algorithm for a Bridged LAN’, Mar. 16, 1992.
Lapuh, Roger et al., ‘Split Multi-link Trunking (SMLT) draft-lapuh-network-smlt-08’, Jan. 2009.
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/030,688, filed Feb. 18, 2011, dated Jul. 17, 2014.
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/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/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/950,974, filed Nov. 19, 2010, from Haile, Awet A., dated Dec. 2, 2012.
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. 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/312,903, filed Dec. 6, 2011, dated Jun. 13, 2013.
Office Action for U.S. Appl. No. 13/044,301, dated Mar. 9, 2011.
Office Action for U.S. Appl. No. 13/087,239, filed Apr. 14, 2011, dated Dec. 5, 2012.
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Nov. 7, 2014.
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Nov. 10, 2014.
Office Action for U.S. Appl. No. 13/157,942, filed Jun. 10, 2011.
Office Action for U.S. Appl. No. 13/184,526, filed Jul. 16, 2011, dated Jan. 5, 2015.
Office Action for U.S. Appl. No. 13/184,526, filed Jul. 16, 2011, dated Dec. 2, 2013.
Office Action for U.S. Appl. No. 13/351,513, filed Jan. 17, 2012, dated Feb. 28, 2014.
Office Action for U.S. Appl. No. 13/533,843, filed Jun. 26, 2012, dated Oct. 21, 2013.
Office Action for U.S. Appl. No. 13/598,204, filed Aug. 29, 2012, dated Jan. 5, 2015.
Office Action for U.S. Appl. No. 13/598,204, filed Aug. 29, 2012, dated Feb. 20, 2014.
Office Action for U.S. Appl. No. 13/669,357, filed Nov. 5, 2012, dated Jan. 30, 2015.
Office Action for U.S. Appl. No. 13/851,026, filed Mar. 26, 2013, dated Jan. 30, 2015.
Office Action for U.S. Appl. No. 13/092,887, dated Jan. 6, 2014.
Zhai F. Hu et al. ‘RBridge: Pseudo-Nickname; draft-hu-trill-pseudonode-nickname-02.txt’, May 15, 2012.
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 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.
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 for U.S. Appl. No. 13/092,460, filed Apr. 22, 2011, dated Mar. 13, 2015.
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, dated Feb. 27, 2015.
Office Action for U.S. Appl. No. 13/425,238, filed Mar. 20, 2012, dated Mar. 12, 2015.
Office Action for U.S. Appl. No. 13/425,238, dated Mar. 12, 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. 14/577,785, filed Dec. 19, 2014, dated Apr. 13, 2015.
Rosen, E. et al., “BGP/MPLS VPNs”, Mar. 1999.
Office action dated Jun. 8, 2015, U.S. Appl. No. 14/178,042, filed Feb. 11, 2014.
Office Action dated May 21, 2015, U.S. Appl. No. 13/288,822, filed Nov. 3, 2011.
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 Apr. 1, 2015 U.S. Appl. No. 13/656,438, filed Oct. 19, 2012.
Office Action Dated Jun. 10, 2015, U.S. Appl. No. 13/890,150, filed May 8, 2013.
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.
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 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.2 Dec. 5, 2011.
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.
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.
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.
Office Action for U.S. Appl. No. 14/660,803, dated May 17, 2017.
Office Action for U.S. Appl. No. 14/488,173, dated May 12, 2017.
Office Action for U.S. Appl. No. 13/288,822, dated May 26, 2017.
Office Action for U.S. Appl. No. 14/329,447, dated Jun. 8, 2017.
Office Action for U.S. Appl. No. 14/817,097, dated May 4, 2017.
Office Action for U.S. Appl. No. 14/872,966, dated Apr. 20, 2017.
Office Action for U.S. Appl. No. 14/680,915, dated May 3, 2017.
Office Action for U.S. Appl. No. 14/792,166, dated Apr. 26, 2017.
Office Action for U.S. Appl. No. 14/510,913, dated Jun. 30, 2017.
Office Action for U.S. Appl. No. 15/005,946, dated Jul. 14, 2017.
Office Action for U.S. Appl. No. 13/092,873, dated Jul. 19, 2017.
Office Action for U.S. Appl. No. 15/047,539, dated Aug. 7, 2017.
Office Action for U.S. Appl. No. 14/830,035, dated Aug. 28, 2017.
Office Action for U.S. Appl. No. 13/098,490, dated Aug. 24, 2017.
Office Action for U.S. Appl. No. 13/786,328, dated Aug. 21, 2017.
Related Publications (1)
Number Date Country
20160197853 A1 Jul 2016 US
Provisional Applications (1)
Number Date Country
62099983 Jan 2015 US