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, the disclosure of which is incorporated by reference herein.
Field
The present disclosure relates to communication networks. More specifically, the present disclosure relates to a method for a constructing a scalable system that facilitates persistent storage in a switch.
Related Art
The exponential growth of the Internet has made it a popular delivery medium for a variety of applications running on physical and virtual devices. 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. However, the size of a switch cannot grow infinitely. It is limited by physical space, power consumption, and design complexity, to name a few factors. Furthermore, switches with higher capability are usually more complex and expensive. More importantly, because an overly large and complex system often does not provide economy of scale, simply increasing the size and capability of a switch may prove economically unviable due to the increased per-port cost.
A flexible way to improve the scalability of a switch system is to build a fabric switch. A fabric switch is a collection of individual member switches. These member switches form a single, logical switch that can have an arbitrary number of ports and an arbitrary topology. As demands grow, customers can adopt a “pay as you grow” approach to scale up the capacity of the fabric switch.
Meanwhile, a switch, an individual or a member switch of a fabric switch, continues to store more configuration information as the switch participates in network virtualizations, partitions, and switch groups, and operates on a plurality of network protocols of different network layers. This configuration needs to be applied to the switch when the switch powers up, and thus, should be persistent. A switch typically stores such configuration information in a local storage in an unstructured format. The switch reads the information during booting up (i.e., powering up), and loads the information into memory. Managing persistent storage in unstructured format is inefficient and requires runtime structuring.
While persistent storage brings many desirable features to a switch, some issues remain unsolved in efficiently facilitating persistent storage in a structured way in a switch.
One embodiment of the present invention provides a switch. The switch includes a packet processor, a persistent storage module, and a boot-up management module. The packet processor identifies a switch identifier associated with the switch in the header of a packet. The persistent storage module stores configuration information of the switch in a first table in a local persistent storage. This configuration information is included in a configuration file, and the first table includes one or more columns for the attribute values of the configuration information. The boot-up management module loads the attribute values to corresponding switch modules from the first table without processing the configuration file.
In a variation on this embodiment, the boot-up management module also determines whether the configuration file has been changed during a reboot of the switch.
In a further variation, in response to determining that the configuration file has been changed, boot-up management module determines a changed portion of the configuration file and updates the first table based on the changed portion.
In a variation on this embodiment, the boot-up management module maintains the order in which the attribute values are loaded to the switch modules.
In a further variation, the boot-up management module maintains the order based on a sequence table. The sequence table includes one or more execution passes. The boot-up management module sequentially loads attribute values of one pass at time to the switch modules.
In a further variation, a pass includes one or more features, which are loaded to the processing hardware during the pass. A feature corresponds to a collection of attribute values.
In a further variation, the boot-up management module maintains the order of attribute values of a feature based on a dependency map. The dependency map indicates a dependency based on a Unified Modeling Language (UML) model.
In a further variation, a pass is associated with a processing indicator which indicates whether the features of a pass are loaded to the switch modules serially or in parallel.
In a further variation, the sequence table is associated with a scope. This scope indicates a subset of attribute values of a feature to be loaded to the switch modules.
In a further variation, the sequence table is expressed based on Extensible Markup Language (XML).
In a variation on this embodiment, the switch also includes a fabric switch module which maintains a membership in a fabric switch. The fabric switch includes a plurality of switches and operates as a single switch.
In the figures, like reference numerals refer to the same figure elements.
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 efficiently rebooting a switch is solved by storing configuration information of the switch in a persistent storage, such as an object relational database. During reboot, the configuration information is loaded into the switch modules (e.g., processing hardware of the switch, such as an application-specific integrated circuit (ASIC) chips) from the persistent storage without applying the configuration information to the switch.
A switch, individual or a member switch of a fabric switch, stores configuration information (e.g., information associated with the operations of the switch), often in a configuration file. Such configuration information can be related to network virtualizations, partitions, and switch groups, and a plurality of network protocols of different network layers. The attribute values (e.g., parameters) of the configuration are applied to the switch (e.g., loaded to the switch modules) when the switch boots up (i.e., when the switch powers up).
Furthermore, before applying the configuration, the switch validates whether the configuration is correct and cross-checks whether the configuration includes any conflict. Moreover, during the boot up process, the switch reads and parses the attribute values stored in an unstructured format. The switch structures the attribute values during runtime, which is inefficient. As a result, each time the switch reboots, even when the switch's configuration information is not changed, the switch goes through this extensive configuration process, which can be inefficient and cause delay to network convergence.
To solve this problem, the switch is equipped with a persistent storage framework which stores the configuration information in a local persistent storage. This configuration information is loaded from this persistent storage to the switch modules (e.g., ASIC chips of the switch). The switch modules can include information based on which the switch processes packets (e.g., determines output ports for packets). During the initial boot up of the switch, the switch validates, cross-checks, and executes the configuration information from the configuration file and loads the corresponding attribute values into the switch modules.
Furthermore, the framework stores these attribute values in the persistent storage (e.g., an object relational database) of the switch. When the switch reboots, the switch checks whether the configuration information has been changed. Upon detecting one or more changes, the framework locates where the changes are and updates the corresponding persistent storage accordingly. If no change is detected, or the changes have been incorporated, the switch loads the attribute values from its persistent storage to the switch modules. In this way, the switch provides a fast reboot by bypassing the processing of the configuration file, and its corresponding extensive execution, cross-checks, and validations of the configuration information.
Segments of configuration information often depend on each other. For example, a port should be configured before associating the port with a port channel (e.g., for a trunked link). Typically, the switch processes the configuration information sequentially from the configuration file. A user (e.g., a network administrator) can enforce the dependency in configuration by including configuration information in the configuration file in a proper order. The proper order refers to a sequence of execution for the configuration file which allows the switch to be configured properly during the boot up process. However, since embodiments of the present invention bypass processing of the configuration file, dependency in the configuration information may not be enforced by the configuration file.
To solve this problem, the switch is equipped with a sequence table, which includes one or more execution passes (e.g., steps), and for each pass, includes one or more features that should be loaded to the switch modules during that pass. The switch sequentially loads configuration information of one pass at time, and sequentially loads attribute values of a respective feature in the order of the appearance of the feature in the pass to the switch modules. In this way, the switch provides a loading order for its fast reboot process. In this disclosure, the description in conjunction with
In some embodiments, the framework supports Model Driven Architecture (MDA), Object Oriented Programming (OOP), and/or Model/View/Controller (MVC) design patterns to facilitate modular development and operation of the units. The framework can also support class frameworks based on Unified Modeling Language (UML). Upon receiving class models (e.g., class name, attributes, and methods) and their relations based on UML, the framework automatically generates the corresponding code, thereby ensuring structure in the operational units of a switch. In some embodiments, the class models are expressed in YANG, which is a data modeling language used to model configuration and state data manipulated by the Network Configuration Protocol (NETCONF).
Since the units operate on the framework in a modular way, their associated attribute values can be stored in a persistent storage in a structured way. In some embodiments, the framework uses Object-Relational Mapping to store the attribute values of the units in a structured way in an object relational database. The framework allows different classes to be defined for a unit based on MDA, OOP, and/or MVC design patterns. The framework then seamlessly maps a respective class to a database table and vice-versa. Furthermore, the framework also seamlessly represents the relationships among the classes (e.g., an association or a composition) in the database. As a result, when a unit becomes operational on the switch, attribute values associated with a respective class in that unit is automatically loaded from the database. Moreover, if a class changes (e.g., a new attribute or a new relationship), the framework seamlessly incorporates that change into the database.
In some embodiments, the switch can be a member switch of a fabric switch. The switch can include one or more units which allow the switch to join and operate as a member switch of the fabric switch. These units can also run on the framework. In a fabric switch, any number of switches coupled in an arbitrary topology may logically operate as a single switch. The fabric switch can be an Ethernet fabric switch or a virtual cluster switch (VCS), which can operate as a single Ethernet switch. Any member switch may join or leave the fabric switch in “plug-and-play” mode without any manual configuration. In some embodiments, a respective switch in the fabric switch is a Transparent Interconnection of Lots of Links (TRILL) routing bridge (RBridge). In some further embodiments, a respective switch in the fabric switch is an Internet Protocol (IP) routing-capable switch (e.g., an IP router).
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.
In this disclosure, the term “fabric switch” refers to a number of interconnected physical switches which form a single, scalable logical switch. These physical switches are referred to as member switches of the fabric switch. In a fabric switch, any number of switches can be connected in an arbitrary topology, and the entire group of switches functions together as one single, logical switch. This feature makes it possible to use many smaller, inexpensive switches to construct a large fabric switch, which can be viewed as a single logical switch externally. Although the present disclosure is presented using examples based on a fabric switch, embodiments of the present invention are not limited to a fabric switch. Embodiments of the present invention are relevant to any computing device that includes a plurality of devices operating as a single device.
The term “end device” can refer to any device external to a fabric switch. Examples of an end device include, but are not limited to, a host 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 fabric switch. An end device hosting one or more virtual machines can be referred to as a host machine. In this disclosure, the terms “end device” and “host machine” are used interchangeably.
The term “switch” is used in a generic sense, and it can refer to any standalone or fabric switch operating in any network layer. “Switch” should not be interpreted as limiting embodiments of the present invention to layer-2 networks. Any device that can forward traffic to an external device or another switch can be referred to as a “switch.” Any physical or virtual device (e.g., a virtual machine/switch operating on a computing device) that can forward traffic to an end device can be referred to as a “switch.” Examples of a “switch” include, but are not limited to, a layer-2 switch, a layer-3 router, a TRILL RBridge, or a fabric switch comprising a plurality of similar or heterogeneous smaller physical and/or virtual switches.
The term “edge port” refers to a port on a fabric switch which exchanges data frames with a network device outside of the fabric switch (i.e., an edge port is not used for exchanging data frames with another member switch of a fabric switch). The term “inter-switch port” refers to a port which sends/receives data frames among member switches of a fabric switch. The terms “interface” and “port” are used interchangeably.
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, and an RBridge identifier. Note that the TRILL standard uses “RBridge ID” (RBridge identifier) to denote a 48-bit intermediate-system-to-intermediate-system (IS-IS) System ID assigned to an RBridge, and “RBridge nickname” to denote a 16-bit value that serves as an abbreviation for the “RBridge ID.” In this disclosure, “switch identifier” is used as a generic term, is not limited to any bit format, and can refer to any format that can identify a switch. The term “RBridge identifier” is also used in a generic sense, is not limited to any bit format, and can refer to “RBridge ID,” “RBridge nickname,” or any other format that can identify an RBridge.
The term “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 “message,” “frame,” “cell,” or “datagram.”
Network Architecture
In some embodiments, network 100 is a TRILL network and a respective switch of network 100, such as switch 102, is a TRILL RBridge. Under such a scenario, communication among the switches in network 100 is based on the TRILL protocol. For example, upon receiving an Ethernet frame from end device 112, switch 102 encapsulates the received Ethernet frame in a TRILL header and forwards the TRILL packet. In some further embodiments, network 100 is an IP network and a respective switch of network 100, such as switch 102, is an IP-capable switch, which calculates and maintains a local IP routing table (e.g., a routing information base or RIB), and is capable of forwarding packets based on its IP addresses. Under such a scenario, communication among the switches in network 100 is based on IP. For example, upon receiving an Ethernet frame from end device 112, switch 102 encapsulates the received Ethernet frame in an IP header and forwards the IP packet.
In some embodiments, network 100 is a fabric switch (under such a scenario, network 100 can also be referred to as fabric switch 100). Fabric switch 100 is assigned with a fabric switch identifier. A respective member switch of fabric switch 100 is associated with that fabric switch identifier. This allows the member switch to indicate that it is a member of fabric switch 100. In some embodiments, whenever a new member switch joins fabric switch 100, the fabric switch identifier is automatically associated with that new member switch. Furthermore, a respective member switch of fabric switch 100 is assigned a switch identifier (e.g., an RBridge identifier, a Fibre Channel (FC) domain ID (identifier), or an IP address). This switch identifier identifies the member switch in fabric switch 100.
Switches in fabric switch 100 use edge ports to communicate with end devices (e.g., non-member switches) and inter-switch ports to communicate with other member switches. For example, switch 102 is coupled to end device 112 via an edge port and to switches 101, 103, 104, and 105 via inter-switch ports and one or more links. Data communication via an edge port can be based on Ethernet and via an inter-switch port can be based on the IP and/or TRILL protocol. It should be noted that control message exchange via inter-switch ports can be based on a different protocol (e.g., the IP or FC protocol).
A switch, such as switch 102, stores configuration information needed to operate switch 102 as an individual switch or as a member switch of fabric switch 100. Furthermore, switch 102 can participate in various services and operations, such as network virtualization (e.g., a virtual local area networks (VLAN)), switch partitioning, and link aggregations (e.g., a multi-chassis trunk). Furthermore, switch 102 operates on a plurality of network protocols of different network layers (e.g., Ethernet, TRILL, FC, and IP). As a result, switch 102 runs protocol daemons for each of these protocols. However, to incorporate the services and operations, the protocol daemons need to be directly modified, which can lead to conflicts and errors.
Furthermore, each of the operations, services, and the protocols is associated with one or more attributes. These attribute values (e.g., parameters) is typically applied to switch 102 when switch 102 powers up. As a result, these attribute values are stored in a persistent storage so that these values can be retrieved even when switch 102 is powered off or restarts. With existing technologies, switch 102 may store such attribute values in a local storage in an unstructured format (e.g., a string comprising the attribute values). During the boot up process, switch 102 reads and parses the attribute values in the unstructured format, and loads the attribute values into switch memory. Managing persistent storage in unstructured format is inefficient and requires runtime structuring.
To solve this problem, switch 102 is equipped with a persistent storage framework 120 which facilitates structured persistent storage to the attribute values associated with different operational units of switch 102 (e.g., modules and services of switch 102). It should be noted that other switches of network 100 can be equipped with a persistent storage framework and support persistent storage. In some embodiments, some switch of network 100 may not be equipped with a persistent storage framework. Different units of switch 102, each of which facilitates an aspect of switch 102's operations, operate on framework 120 in a structured and modular way. This allows a respective unit to be independently introduced to framework 120 in such a way that the unit can interoperate with other units (e.g., modules and services) of switch 102. Framework 120 supports MDA, OOP, and/or MVC design patterns to facilitate structured development and operation of the units in switch 102.
Since the units operate on framework 120 in a structured way, their associated attribute values can be stored in a persistent storage in a structured way. In some embodiments, framework 120 uses Object-Relational Mapping to store the attribute values of the units in a structured way in an object relational database. Framework 120 allows different classes to be defined for a unit during development based on MDA, OOP, and/or MVC design patterns. Framework 120 supports class models based on UML. In some embodiments, class models are expressed in YANG, which is a data modeling language used to model configuration and state data manipulated by NETCONF. Upon receiving class models (e.g., class name, attributes, and methods) and their relationships based on UML, framework 120 automatically generates the corresponding code, thereby ensuring structure in the operational units of switch 102.
Framework 120 seamlessly maps a respective class to a database table and vice-versa. Furthermore, framework 120 also seamlessly represents the relations among the classes (e.g., an association or a composition) in the database. As a result, when a unit becomes operational on switch 102 (e.g., when switch 102 powers up), attribute values associated with a respective class in that unit is automatically loaded from the database. Moreover, if a class changes (e.g., a new attribute or a new relationship), framework 120 seamlessly incorporates that change into the database.
Persistent Storage Framework
Switch 102 further includes an input interface 122 to switch 102 (e.g., a graphical user interface (GUI) and/or a command line interface (CLI). A user can access input interface 122 via end device 114. The user can obtain information from and provide instruction to switch 102 via input interface 122. Switch 102 also includes a configuration daemon 124, which can receive configuration (e.g., an IP address) for switch 102 from end device 114 (e.g., from a user) via input interface 122. Configuration daemon 124 provides this configuration information to framework 120. Framework 120 can include a configuration daemon gateway module 132, which communicates with configuration daemon 124. Upon receiving the configuration information, framework 120 can identify different attribute values (e.g., a VLAN identifier) and assigns those attribute values to the corresponding attribute of an operational unit of switch 102.
On the other hand, switch 102 can receive an instruction via input interface 122 to provide its configuration associated with one or more units. For example, a user can issue a command to show the IP addresses assigned to switch 102 from end device 114. Input interface 122 provides this instruction to configuration daemon 124, which in turn, sends an internal command to configuration daemon gateway module 132 for the requested configuration information. In response, framework 120 identifies the attributes (e.g., IP addresses) associated with the requested configuration information and obtains the corresponding attribute values (e.g., assigned IP addresses to switch 120) from a persistent storage. Configuration daemon gateway module 132 provides the obtained attribute values to configuration daemon 124. Upon receiving the attribute values, configuration daemon 124 provides the attribute values as the requested configuration information to input interface 122, which in turn, provides the configuration information to end device 114.
Framework 120 includes a core management module 130, which facilitates structured persistent storage to the attribute values associated with different operational units of switch 102 (e.g., modules and services of switch 102). Different units of switch 102 operate on core management module 130 in a structured way. This allows a respective unit to be independently introduced to framework 120 such a way that the unit can interoperate with other units (e.g., modules and services) of switch 102. Framework 120 supports MDA, OOP, and/or MVC design pattern to facilitate structured development and operation of the units in switch 102.
For example, instead of modifying protocol daemons 140, switch 102 can have plug-ins 134 for protocol daemons 140. Core management module 130 facilitates inter-operations between plug-in 134 and protocol daemons 140. Suppose that a modification to standard Ethernet protocol is needed. Instead of modifying the native protocol daemon of Ethernet, a plug-in for the protocol daemon of Ethernet can be introduced to core management module 130. Similarly, to facilitate membership to a fabric switch, fabric switch module 136 can be introduced to core management module 130. Fabric switch module 136 allows switch 102 to run a control plane with automatic configuration capability and join a fabric switch based on the control plane. Plug-ins 134 and fabric switch module 136 can be developed using MDA, OOP, and/or MVC design patterns, supported by framework 120.
Since the units of switch 102 operate core management module 130 in a structured way, their associated attribute values can be stored in a persistent storage in a structured way. In some embodiments, core management module 130 uses Object-Relational Mapping to store the attribute values of the units in a structured way in an object relational database 150. Core management module 130 allows different classes to be defined for a unit during development based on MDA, OOP, and/or MVC design patterns and expressed as a UML model, and seamlessly maps a respective class to a database table in database 150 and vice-versa.
Furthermore, core management module 130 also seamlessly represents the relations among the classes (e.g., an association or a composition) in database 150. As a result, when a unit becomes operational on switch 102 (e.g., when switch 102 powers up), attribute values associated with a respective class in that unit is automatically loaded from database 150. Moreover, if a class changes (e.g., a new attribute or a new relationship), core management module 130 seamlessly incorporates that change into database 150. It should be noted that a class defined by a user may not include explicit instructions (e.g., a Structured Query Language (SQL) query) for inserting and retrieving attribute values from database 150. The class simply includes an instruction indicating that persistent storage is required for some operations and core management module 130 facilitates the object relational mapping, and the corresponding database operations (e.g., SQL insert and select).
Attribute Data Types
To facilitate seamless object relational mapping, a persistent storage framework defines a set of data types for different categories of attributes. These attributes can be used to define class attributes of different operational units of a switch. In some embodiments, the framework can identify these class attributes expressed in a UML model. It should be noted that such expression can be represented in various forms, such as graphical, textual, XML, etc. The framework ensures these attributes are compatible with an object relational database. As a result, during operation, the framework can seamlessly map the class attributes to an object relational database and provide persistent storage to the attributes.
A data type of an attribute is basic entity provided by the framework that can be persisted or transported in the object relational database. A data type is associated with an identifier (e.g., a name). A data type can be, persisted or ephemeral, configuration or operational and read-only or read-write. The framework can serialize or de-serialize a data type to or from: XML, remote procedure call (RPC), SQL, JavaScript Object Notation (JSON), and Open vSwitch Database (OVSDB) management protocol.
The framework supports different categories of attributes. Such categories include, but are not limited to, integers and numbers, string, date and time, messaging, UML relations, network, and others. In addition, the framework supports user defined data types and corresponding attributes. Table 1 includes different categories of attributes and their corresponding data types supported by the framework. It should be noted that the categories and data types listed in Table 1 is not exhaustive. The framework can support more categories and data types.
The framework provides extensive list of built-in data types, as described in conjunction with Table 1. These data types capture the attribute values (e.g., data fields) of objects. In some embodiments, the framework includes one or more attributes that provide run time introspection that allows runtime identification of classes. Since attributes can be serialized to and de-serialized from a variety of formats, the framework provides extensive support for custom behavior overriding in serialization and de-serialization. Furthermore, the framework supports user defined data types.
Object Identifier
In the example in
However, a switch can have a plurality of line cards. For another line card, another object (i.e., another instance) of the class is created in the memory of switch 102, and framework 120 stores the attribute values of that other object in the table associated with the class in database 150. In this way, the same table can store attribute values of different objects of the same class. To identify different objects of a class in the table, framework 120 generates and assigns an object identifier (object ID or OID) to a respective object of a respective class. This object identifier operates as the primary identifier of that object. In the database table, this primary identifier is the primary key of that table. It should be noted that an object identifier is referred to be associated with a class in a generic sense, which indicates an object identifier of an object of the class.
In some embodiments, object identifier includes a class identifier (a class ID or CID) 220 and an instance identifier (an instance ID or IID) 230. Class identifier 220 represents the class from which the object is instantiated. In some embodiments, class identifier 220 is generated based on a hash function (e.g., Rabin Polynomial hash function) applied to the name of the class. Instance identifier 230 represents that particular instance of the object. Hence, if two objects of the same class are created, class identifier 220 of object identifier 210 remains the same for both the objects. However, the two objects differ in their respective instance identifier 230. Typically, class identifier 220 and instance identifier 230 are 32 and 64 bits long, respectively. However, these lengths can vary.
In some embodiments, instance identifier 230 includes a group identifier 232, a location identifier 234, a management module identifier 236, and a serial identifier 238. Group identifier 232 identifies a group in which the switch is a member. For example, if the switch is a member switch of a fabric switch, group identifier 232 can be a fabric switch identifier, which identifies a fabric switch. Location identifier 234 identifies the switch in the group. For example, if the switch is a member switch of a fabric switch, location identifier 234 can be a switch identifier, which identifies the switch within that fabric switch. Typically, group identifier 232 and location identifier 234 are 10 and 20 bits long, respectively.
Management module identifier 236 identifies the type of management module is operating the switch. For example, if the switch is participating in an active-standby high availability protocol (e.g., Virtual Router Redundancy Protocol (VRRP) and Virtual Switch Redundancy Protocol (VSRP)), management module identifier 236 can indicate whether the switch is an active or a standby switch. Typically, management module identifier 236 is 1 bit long. However, length of management module identifier 236 can be increased by incorporating adjacent bits from location identifier 234.
Serial identifier 238 provides identification of a specific instance of an object and can be a wrapped-around monotonically increasing number (e.g., an unsigned integer). Typically, serial identifier 238 is 32 bits long. In this way, object identifier 210 uniquely identifies an object of a class created by a management module in a switch, which can be in a fabric switch. In other words, object identifier 210 can be unique among objects, classes, management modules, fabric switches, and switch locations within a corresponding fabric switch.
Base Classes
In the example in
The framework supports a set of base classes and multiple inheritance from these base classes.
Class 304 outlines the most common attributes and operations of the objects managed by the framework. In other words, all class hierarchies derive virtually from the PersistableObject class. Since a class can inherit from multiple classes and each of these classes can inherit from the PersistableObject class, there can potentially be a conflict during execution of a managed object. This problem is generally referred to as the diamond problem. To solve this problem, the framework supports virtual derivation from the PersistableObject class. Another base class 306, denoted as the LocalManagedObjectBase class, outlines the attributes and operations locally managed within a switch. For example, a port is locally managed in a switch.
Base class 308, denoted as the LocalManagedObject class, is virtually derived from the ManagedObject class and the ManagedObjectBase class. Hence, the LocalManagedObject class outlines the attributes and operations of a switch which are locally and globally managed. For example, a port is locally managed within a switch and a VLAN configured for the port is managed globally. In some embodiments, an application (e.g., a protocol plug-in) running on a switch can specify more base classes for that application. Typically, base classes are not directly mapped to the tables of the object relational database. These base classes provide object relational mapping support. The attributes (i.e., the data fields) of these classes become part of a respective managed object derived from these base classes. As a result, the managed objects can share states and behavior.
In some embodiments, the attributes of a managed object can be any of the attribute data types supported by the framework, as described in conjunction with Table 1. The framework also supports vector variants (e.g., arrays and lists) for a number of the data types. Furthermore, the framework provides support to check whether a particular attribute is user configured. As described in conjunction with
Object Relational Mapping
In some embodiments, a persistent storage framework of a switch supports, both one-to-one and one-to-many, association, aggregation, and composition UML relationships. Association and aggregation are supported via ObjectID and ObjectIDVector data types, and ObjectIDAssociation and ObjectIDAssociationVector attributes, respectively. On the other hand, composition is supported via ManagedObectPointer and ManagedObectPointerVector data types and corresponding attributes. In some embodiments, the framework supports smart pointers and vector to facilitate seamless development.
Similarly, a switch can include one or more line cards. Hence, the Node class has a relationship with class 406, denoted as the LineCard class, which represents a line card. A line card can be in one switch and a switch includes (i.e., is composed of) a plurality of line cards. Hence, the relationship between the Node class and the LineCard class is a one-to-many composition, which is denoted as “includes.” On the other hand, a switch typically has a power source, which may not be inside of the switch. So, the Node class has a relationship with class 408, denoted as the PowerSource class, which represents a power source of a node. Suppose that, at a time, a power source can power one switch and a switch can receive power from one source. Hence, the relationship between the Node class and the PowerSource class is a one-to-one association, which is denoted as “getsPower.”
A power source can be based on alternating current (AC) or direct current (DC). So, class 408-A, denoted as the ACPowerSource class, and class 408-B, denoted as the DCPowerSource class, are derived from the PowerSource class. The ACPowerSource class and the DCPowerSource class represent AC and DC power sources, respectively. Hence, based on the getsPower association, a Node can get power from a generic power source, an AC power source, or a DC power source. In this UML diagram, since the relationship between the Node class and class 408 is one-to-one, an object of the Node class can have only one of the power sources. In this example, the PowerSource class, the ACPowerSource class, and the DCPowerSource class can be referred to as the inheritance chain of the PowerSource class (class 408).
The framework can receive the UML diagram of
XML definition 400 includes a respective attribute, such as NodeID, and its type (i.e., data type, as described in conjunction with Table 1). XML definition 400 also includes one-to-one and one-to-many relationships for which the Node class is a container class. For example, a node contains line cards. Hence, XML definition 400 specifies aggregation “includes” as an attribute, its type, and the class to which Node is related. It should be noted that the isMemberOf relationship is not represented in XML definition 400 even though the isMemberOf relationship to the Node class. This is because the container class for the isMemberOf relationship is the SwitchGroup class. Hence, the isMemberOf relationship is represented in an XML definition corresponding to the SwitchGroup class (not shown in
Persistent Storage in a Switch
Upon receiving XML definitions associated with the classes of a UML model, the framework creates a respective table for a respective class, their derivations, their instances (i.e., objects), and their one-to-many relationships in an object relational database.
Table 420 also includes a column for a respective attribute of the Node class. For example, table 420 includes a column 424 for a NodeID of the Node class. Furthermore, since the Node class has a one-to-one association with the PowerSource class, for which the Node class is the container class, the framework includes a column 425 for an object identifier of an object of the PowerSource class (i.e., an object associated with the PowerSource class). Column 425 includes two columns 426 and 427 for the class identifier and instance identifier, respectively, of the object identifier associated with the PowerSource class. The framework also creates a table 410 for the PowerSource class, comprising column 411 for the object identifier associated with the PowerSource class. Column 411 includes two columns 412 and 413 for the class identifier and instance identifier, respectively, of the object identifier of the PowerSource class.
Similarly, the framework also creates a table 440 for the ACPowerSource class, comprising column 441 for an object identifier of an object of the ACPowerSource class (i.e., an object associated with the ACPowerSource class). Column 441 includes two columns 442 and 443 for the class identifier and instance identifier, respectively, of the object identifier associated with the ACPowerSource class. In the same way, the framework also creates a table 450 for the DCPowerSource class, comprising column 451 for an object identifier of an object of the PowerSource class. Column 451 includes two columns 452 and 453 for the class identifier and instance identifier, respectively, of the object identifier associated with the DCPowerSource class.
In some embodiments, the framework creates auxiliary tables to enforce consistency on columns 426 and 427. For example, the framework creates an auxiliary table 430 for the derivations of the PowerSource class (e.g., based on the UML model in
When a class identifier is generated for any class of the inheritance chain of the PowerSource class, that class identifier is inserted into table 430. The framework identifies the PowerSource, the ACPowerSource, and the DCPowerSource classes of the inheritance chain of the PowerSource class from the UML model in
When an object identifier is inserted into table 410, 440, or 450, the instance identifier of the object identifier is concurrently inserted into table 460 (denoted with dotted arrow). Suppose that, upon detecting an object in the memory of the switch, the framework inserts an object identifier comprising a class identifier 432 and instance identifier 435 into table 410. Similarly, an object identifier comprising a class identifier 433 and instance identifier 444, and an object identifier comprising a class identifier 433 and instance identifier 445 are inserted into table 440. An object identifier comprising a class identifier 434 and instance identifier 454 is inserted into table 450. The framework ensures that instance identifiers 435, 444, 445, and 454 are also inserted into table 460. Column 461 of table 460 provides consistency enforcement to column 426 of table 420 (denoted with a dashed arrow). In some embodiments, consistency enforcement to column 427 is based on a foreign key constraint on column 461 of table 460.
During operation, an object of the Node class is instantiated in the memory of the switch. The framework identifies the object in the memory and generates an object identifier for the object comprising a class identifier 464 and an instance identifier 465. The framework identifies the attribute values of the object, which includes NodeID 466 and an object identifier of a power source object. Suppose that the power source for the switch is an AC power source, and the object identifier comprises a class identifier 433 and an instance identifier 444, as stored in table 440 corresponding to the ACPowerSource class. The framework creates an entry in table 420 by inserting class identifier 464, instance identifier 465, NodeID 466, class identifier 433, and instance identifier 444 into table 420. Since consistency is enforced on columns 426 and 427, the relational database ensures that class identifier 433 and instance identifier 444 appear in columns 431 and 461, respectively.
However, even though the Node class is related to the LineCard class, since it is a one-to-many relationship, table 420 does not include an object identifier associated with the LineCard class. The framework creates an auxiliary table to represent the relationship the Node class and the LineCard class.
During operation, an object of the LineCard class is instantiated in the memory of the switch. The framework identifies the object in memory and generates an object identifier comprising a class identifier 474 and an instance identifier 475 for the object. The framework then creates an entry in table 470 by inserting the object identifier into table 470. Similarly, the framework generates an object identifier comprising a class identifier 474 and an instance identifier 476 for another object of the LineCard class, and a third object identifier comprising a class identifier 474 and an instance identifier 477 for an object of the LineCard class. The framework creates respective entries in table 470 by inserting these object identifiers into table 470.
In some embodiments, the framework creates an auxiliary table 480 to represent the one-to-many “includes” relationship between the Node class and the LineCard class. In the relationship, the Node class is the container class and the LineCard class is the related class. Table 480 includes a column 481 for an object identifier associated with the Node class, and a column 484 for an object identifier associated with the LineCard class. Column 481 includes two columns 482 and 483 for the class identifier and instance identifier, respectively, of the object identifier associated with the Node class. Similarly, column 484 includes two columns 485 and 486 for the class identifier and instance identifier, respectively, of the object identifier associated with the LineCard class.
Suppose that the object of the Node class, which is associated with class identifier 464 and instance identifier 465, includes two line cards. Hence, the object of the Node class include two objects (e.g., an ManagedObjectVector) of the LineCard class. Suppose that instance identifiers 475 and 476 belong to these two objects. As a result, the framework inserts class identifier 464, instance identifier 465, class identifier 474, and instance identifier 475 into table 480. The framework also inserts class identifier 464, instance identifier 465, class identifier 474, and instance identifier 476 into table 480. In this way, the relationship between the object of the Node class (associated with instance identifier 465) and two objects of the LineCard class (associated with instance identifier 475 and 476) is stored in table 480.
In some embodiments, similar to tables 430 and 460, the framework creates auxiliary table 490 for the derivations of the Node class (e.g., based on the UML model in
In the same way, the framework creates auxiliary table 495 for the derivations of the LineCard class (and its derivations, if any). Table 495 includes a column 496 for the class identifier associated with the derivations of the LineCard class. Similarly, the framework creates an auxiliary table 497 for the objects instantiated from the derivations of the LineCard class. In this example, table 497 corresponds to the LineCard class (and its derivations, if any). Table 497 includes a column 498 for the instance identifiers of the objects instantiated from the derivations of the LineCard class.
When a class identifier is generated for the Node class or the LineCard class, that class identifier is inserted into table 490 or 495, respectively. The framework inserts class identifiers 464 and 474 associated with the Node and the LineCard classes, respectively, into tables 490 and 495, respectively. In this example, an entry in a table is denoted with dotted lines. Column 491 of table 490 provides consistency enforcement to column 482 of table 480 (denoted with a dashed arrow). In some embodiments, consistency enforcement of column 482 is based on a foreign key constraint on column 491 of table 490. In the same way, column 496 of table 495 provides consistency enforcement to column 485 of table 480 (denoted with a dashed arrow). In some embodiments, consistency enforcement of column 485 is based on a foreign key constraint on column 496 of table 495.
On the other hand, when the framework identifies objects of the Node or the LineCard class, the framework generates a corresponding object identifier and inserts the object identifier, comprising a class identifier and an instance identifier, into table 420 or 470, respectively. When an object identifier is inserted into table 420 or 470, the instance identifier of the object identifier is concurrently inserted into table 492 or 497, respectively (denoted with dotted arrow). For example, when the framework inserts an object identifier comprising a class identifier 464 and instance identifier 465 into table 420, instance identifier 465 is inserted into table 492. In the same way, when the framework inserts an object identifier comprising a class identifier 474 and instance identifier 475 into table 470, instance identifier 475 is inserted into table 497.
Similar to table 480, the framework also creates an auxiliary table to represent the one-to-many “isMemberOf” relationship between the Node class and the SwitchGroup class, as described in conjunction with
It should be noted that the framework distinguishes between a composition relationship (e.g., “includes” in
Operations of a Persistent Storage Framework
The framework identifies an attribute of the identified class (operation 536). It should be noted that the relationships for which the class is a container class are can also be attributes, as described in conjunction with
The framework enforces consistency on the class identifier and the instance identifier based on the corresponding auxiliary tables of the related classes (operation 548), as described in conjunction with
The framework adds a column for an object identifier comprising columns for class identifier and instance identifier of the container class (operation 564), as described in conjunction with
Fast Reboot
In the example in
With existing technologies, before applying the configuration, switch 102 validates whether the configuration is correct and cross-checks whether the configuration includes any conflict. Moreover, during the boot up process, switch 102 reads and parses the attribute values stored in an unstructured format (e.g., a string comprising the configuration information). Switch 102 structures the attribute values during runtime, which is inefficient. As a result, each time switch 102 reboots, even when switch 102's configuration information is not changed, switch 102 goes through this extensive configuration process, which can be inefficient and cause delay to network convergence.
To solve this problem, persistent storage framework 120 loads the configuration information from database 120 to the switch modules in switch 102.
When switch 102 reboots (e.g., due to a restart), boot-up manager 640 checks whether configuration file 630 has changed (e.g., based on calculating a file difference and/or hash value). If boot-up manager 640 detects any change, boot-up manager 640 locates where the changes are and updates corresponding entries in database 150. If no change is detected, or the changes have been incorporated, boot-up manager 640 loads the attribute values from database tables 620 in database 150 to switch modules 610. In this way, boot-up manager 640 provides a fast reboot by bypassing the processing of configuration file 630, and its corresponding extensive execution, cross-checks, and validations of the configuration information. It should be noted that, in
Dependency in Configuration
In the example in
To solve this problem, boot-up manager 640 uses dependency maps and a sequence table determine the order at which attribute values should be loaded into switch modules 610 from database 150. Framework 120 generates the dependency maps from the UML models (e.g., the UML model in
Accordingly, dependency map 700 shows that the objects of the Node class depend on the objects of the LineCard class. For example, in switch 102, boot-up manager 640 should load the configuration information of the objects of the LineCard class from table 470, as shown in
On the other hand, since the objects of the inheritance chain of the PowerSource class are not dependent on each other, boot-up manager 640 can load these objects from tables 410, 440, and 450, as shown in
However, a dependency map only captures the dependencies expressed in a UML model. Different operational units of the switch are often developed separately (e.g., by different development groups). As a result, a dependency map may not capture interdependencies among different UML models. Hence, a boot-up manager may not be able to maintain proper order based only on dependency maps.
Sequence table 710 includes one or more execution passes (e.g., steps), and for each pass, one or more features that should be configured in that pass. The switch sequentially loads configuration information of one pass at time, and sequentially loads attribute values of a respective feature in the order of the appearance of the feature in the pass to the processing hardware of the switch. In this way, the switch maintains the proper order during its fast reboot process.
A collection of attribute values in the configuration information can be referred to as a feature. Features can vary in the amount of configuration information (e.g., the number of attribute values) included in it. For example, one feature can correspond to a column in a table and another feature can correspond to the entire table in a persistent storage. The framework can generate the sequence table by parsing across difference dependency maps and connecting the common classes. The sequence table can also be generated and provided to the switch by a user (e.g., a developer).
Sequence table 710 includes rows corresponding to a start execution pass 720, which indicates it to be the first execution pass, and subsequent execution passes 722-1, 722-2, . . . , 722-n. Sequence table 710 also includes columns corresponding to features 730-1, 730-2, 730-3, . . . , 730-m. For a specific pass, one or more features can be selected (denoted with a check mark). For example, for start pass 720, features 730-1 and 730-3 are selected. During the boot-up process, the boot-up manager of the framework first load features 730-1 and 730-3 of start pass 720 to the switch modules. The boot-up manager then loads the features of pass 722-1, then of pass—722-2, and so on. It should be noted that the features and passes can be represented in a sequence table in rows and columns, respectively, as well.
In some embodiments, a respective pass is associated with a corresponding processing indicator (or p. indicator). A processing indicator indicates whether the features of that pass can be loaded serially or in parallel. Parallel loading of features can the reduce boot-up time. In sequence table 710, passes 720, 722-1, 722-2, . . . , 722-n are associated with corresponding processing indicators 714, 716-1, 716-2, . . . , 716-n, respectively. In some embodiments, a processing indicator is expressed as a field in an XML tag.
Processing indicators provide additional flexibility to the boot-up manager. For example, features 730-1 and 730-3 are selected for start pass 720 and pass 722-2. In one of the passes, features 730-1 and 730-3 can be loaded serially, and in the other pass, features 730-1 and 730-3 can be loaded in parallel. Furthermore, if some features in a pass can be loaded in parallel and some others should be loaded serially, the features that can be loaded in parallel can be put into a separate pass and the corresponding processing indicator can be set to parallel.
In some embodiments, sequence table 710 is associated with one or more scopes 712. A scope defines, for an operational aspect of the switch, the subset of attribute values of a feature that should be loaded to the switch modules. Scopes 712 allow sequence table 710 to load different subsets of attribute values of a feature to the switch modules under different circumstances. Suppose that a feature indicates VLANs associated with the switch. When the switch reboots, the corresponding scope in scopes 712 indicates that the attribute values associated with the entire switch should be loaded to the switch modules. As a result, the boot-up manager loads all VLAN configurations. On the other hand, when a single line card reboots (e.g., taken out and put in), the corresponding scope in scopes 712 indicates that the attribute values associated with that line card should be loaded into the switch modules. As a result, the boot-up manager loads only VLAN configurations associated with that line card.
Operations of Fast Reboot
The switch then sequentially reads a line from the configuration file (operation 804) and identifies the class(es) associated with the line (operation 804). In some embodiments, the configuration file is a batch file, which can be processed sequentially. The switch creates corresponding object(s) and assigns attribute values to the object(s) based the configuration file (operation 808). The switch then creates entries comprising corresponding object identifier and attribute values in corresponding class tables (and auxiliary tables) in the local persistent storage (operation 810) and checks whether the configuration file has been processed (operation 812). If the configuration file has not been processed, the switch sequentially reads the next line from the configuration file (operation 804).
If the switch has detected a difference, the user may have changed the configuration. The switch identifies the line(s) associated with the difference in the current configuration file (operation 842). The switch then obtains a line (e.g., the first line) from the identified line (operation 844) and applies the configuration specified in the line by generating or updating corresponding objects and associated attribute values (operation 846). The switch creates or updates entries comprising the corresponding object identifiers and attribute values in the corresponding class and auxiliary tables in the local persistent storage (operation 848), as described in conjunction with
If the switch has not detected a difference (operation 836), the configuration of the switch is the same as the initial boot-up, as described in conjunction with
The switch identifies the order of the attributes within the selected feature based on one or more dependency maps associated with the feature (operation 868). Here, the sequence table ensures the proper order among the features of the switch and the dependency maps associated with the feature ensures the proper order within that feature. A feature includes the attribute values whose interdependency is represented in an UML model and its corresponding dependency map. The switch obtains the attribute values associated with the selected feature from the identified tables (operation 870) and loads the attribute values to the switch modules (operation 872), as described in conjunction with
On the other hand, if the processing indicator indicates parallel processing, a respective feature of the pass can be processed in parallel, thereby further speeding up the reboot process (i.e., reducing the reboot time). For a respective feature in the selected pass, the switch identifies associated table(s) from the local persistent storage (operation 856) and identifies the order of the attributes within the feature based on one or more dependency maps associated with that feature (operation 858). For a respective feature in the selected pass, the switch obtains the attribute values associated with the feature from the corresponding identified tables (operation 860) and loads the attribute values to the switch modules (operation 862), as described in conjunction with
If the processing indicator indicates parallel processing and the attribute values are loaded into the switch modules (operation 862), or the processing indicator indicates serial processing and the switch has completed the pass (operation 874), the switch checks whether the switch has traversed all passes of the sequence table (operation 876). If the switch has not traversed all passes of the sequence table, the switch selects the next pass from the sequence table (operation 852). In this way, using the sequence table, the switch provides a fast reboot by loading the attribute values associated with a configuration file of the switch into the processing hardware of the switch in the proper sequence without relying on the configuration file.
Exemplary Switch
In some embodiments, switch 900 maintains a membership in a fabric switch, as described in conjunction with
Communication ports 902 can include inter-switch communication channels for communication within the fabric switch. This inter-switch communication channel can be implemented via a regular communication port and based on any open or proprietary format. Communication ports 902 can also include one or more extension communication ports for communication between neighbor fabric switches. Communication ports 902 can include one or more TRILL ports capable of receiving frames encapsulated in a TRILL header. Communication ports 902 can also include one or more IP ports capable of receiving IP packets. An IP port is capable of receiving an IP packet and can be configured with an IP address. Packet processor 910 can process TRILL-encapsulated frames and/or IP packets.
During operation, persistent storage module 930 stores configuration information, which can be in a configuration file, of switch 900 in a table in object relational database 940 in storage device 950. Boot-up management module 932 loads the attribute values to switch modules 960 from the table without processing the configuration file. Boot-up management module 932 also determines whether the configuration file has been changed during a reboot of switch 900. In some embodiments, upon determining that the configuration file has been changed, boot-up management module 932 determines the changed portion of the configuration file and update the first table in a local persistent storage based on the changed portion, as described in conjunction with
Boot-up management module 932 also maintains the order in which the attribute values are loaded to switch modules 960. In some embodiments, boot-up management module 932 maintains the order based on a sequence table, as described in conjunction with
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 900. When executed, these instructions cause the processor(s) to perform the aforementioned functions.
In summary, embodiments of the present invention provide a switch and a method which provide fast reboot for the switch. In one embodiment, the switch includes a packet processor, a persistent storage module, and a boot-up management module. The packet processor identifies a switch identifier associated with the switch in the header of a packet. The persistent storage module stores configuration information of the switch in a first table in a local persistent storage. This configuration information is included in a configuration file, and the first table includes one or more columns for the attribute values of the configuration information. The boot-up management module loads the attribute values to corresponding switch modules from the first table without processing the configuration file.
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.
Number | Name | Date | Kind |
---|---|---|---|
829529 | Keathley | Aug 1906 | A |
5390173 | Spinney | Feb 1995 | A |
5802278 | Isfeld | Sep 1998 | A |
5878232 | Marimuthu | Mar 1999 | A |
5959968 | Chin | Sep 1999 | A |
5973278 | Wehrill, III | Oct 1999 | A |
5983278 | Chong | Nov 1999 | A |
6041042 | Bussiere | Mar 2000 | A |
6085238 | Yuasa | Jul 2000 | A |
6104696 | Kadambi | Aug 2000 | A |
6185214 | Schwartz | Feb 2001 | B1 |
6185241 | Sun | Feb 2001 | B1 |
6331983 | Haggerty | Dec 2001 | B1 |
6438106 | Pillar | Aug 2002 | B1 |
6498781 | Bass | Dec 2002 | B1 |
6542266 | Phillips | Apr 2003 | B1 |
6633761 | Singhal | Oct 2003 | B1 |
6636963 | Stein | Oct 2003 | B1 |
6771610 | Seaman | Aug 2004 | B1 |
6873602 | Ambe | Mar 2005 | B1 |
6937576 | DiBenedetto | Aug 2005 | B1 |
6956824 | Mark | Oct 2005 | B2 |
6957269 | Williams | Oct 2005 | B2 |
6975581 | Medina | Dec 2005 | B1 |
6975864 | Singhal | Dec 2005 | B2 |
7016352 | Chow | Mar 2006 | B1 |
7061877 | Gummalla | Jun 2006 | B1 |
7173934 | Lapuh | Feb 2007 | B2 |
7197308 | Singhal | Mar 2007 | B2 |
7206288 | Cometto | Apr 2007 | B2 |
7310664 | Merchant | Dec 2007 | B1 |
7313637 | Tanaka | Dec 2007 | B2 |
7315545 | Chowdhury et al. | Jan 2008 | B1 |
7316031 | Griffith | Jan 2008 | B2 |
7330897 | Baldwin | Feb 2008 | B2 |
7380025 | Riggins | May 2008 | B1 |
7397794 | Lacroute | Jul 2008 | B1 |
7430164 | Bare | Sep 2008 | B2 |
7453888 | Zabihi | Nov 2008 | B2 |
7477894 | Sinha | Jan 2009 | B1 |
7480258 | Shuen | Jan 2009 | B1 |
7508757 | Ge | Mar 2009 | B2 |
7558195 | Kuo | Jul 2009 | B1 |
7558273 | Grosser | Jul 2009 | B1 |
7571447 | Ally | Aug 2009 | B2 |
7599901 | Mital | Oct 2009 | B2 |
7688736 | Walsh | Mar 2010 | B1 |
7688960 | Aubuchon | Mar 2010 | B1 |
7690040 | Frattura | Mar 2010 | B2 |
7706255 | Kondrat et al. | Apr 2010 | B1 |
7716370 | Devarapalli | May 2010 | B1 |
7720076 | Dobbins | May 2010 | B2 |
7729296 | Choudhary | Jun 2010 | B1 |
7787480 | Mehta | Aug 2010 | B1 |
7792920 | Istvan | Sep 2010 | B2 |
7796593 | Ghosh | Sep 2010 | B1 |
7808992 | Homchaudhuri | Oct 2010 | B2 |
7836332 | Hara | Nov 2010 | B2 |
7843906 | Chidambaram et al. | Nov 2010 | B1 |
7843907 | Abou-Emara | Nov 2010 | B1 |
7860097 | Lovett | Dec 2010 | B1 |
7898959 | Arad | Mar 2011 | B1 |
7912091 | Krishnan | Mar 2011 | B1 |
7924837 | Shabtay | Apr 2011 | B1 |
7937756 | Kay | May 2011 | B2 |
7945941 | Sinha | May 2011 | B2 |
7949638 | Goodson | May 2011 | B1 |
7957386 | Aggarwal | Jun 2011 | B1 |
8018938 | Fromm | Sep 2011 | B1 |
8027354 | Portolani | Sep 2011 | B1 |
8054832 | Shukla | Nov 2011 | B1 |
8068442 | Kompella | Nov 2011 | B1 |
8078704 | Lee | Dec 2011 | B2 |
8102781 | Smith | Jan 2012 | B2 |
8102791 | Tang | Jan 2012 | B2 |
8116307 | Thesayi | Feb 2012 | B1 |
8125928 | Mehta | Feb 2012 | B2 |
8134922 | Elangovan | Mar 2012 | B2 |
8155150 | Chung | Apr 2012 | B1 |
8160063 | Maltz | Apr 2012 | B2 |
8160080 | Arad | Apr 2012 | B1 |
8170038 | Belanger | May 2012 | B2 |
8175107 | Yalagandula | May 2012 | B1 |
8194674 | Pagel | Jun 2012 | B1 |
8195774 | Lambeth | Jun 2012 | B2 |
8204061 | Sane | Jun 2012 | B1 |
8213313 | Doiron | Jul 2012 | B1 |
8213336 | Smith | Jul 2012 | B2 |
8230069 | Korupolu | Jul 2012 | B2 |
8239960 | Frattura | Aug 2012 | B2 |
8249069 | Raman | Aug 2012 | B2 |
8270401 | Barnes | Sep 2012 | B1 |
8295291 | Ramanathan | Oct 2012 | B1 |
8295921 | Wang | Oct 2012 | B2 |
8301686 | Appajodu | Oct 2012 | B1 |
8339994 | Gnanasekaran | Dec 2012 | B2 |
8351352 | Eastlake | Jan 2013 | B1 |
8369335 | Jha | Feb 2013 | B2 |
8369347 | Xiong | Feb 2013 | B2 |
8392496 | Linden | Mar 2013 | B2 |
8462774 | Page | Jun 2013 | B2 |
8467375 | Blair | Jun 2013 | B2 |
8520595 | Yadav | Aug 2013 | B2 |
8599850 | Jha | Dec 2013 | B2 |
8599864 | Chung | Dec 2013 | B2 |
8615008 | Natarajan | Dec 2013 | B2 |
8706905 | McGlaughlin | Apr 2014 | B1 |
8724456 | Hong | May 2014 | B1 |
8806031 | Kondur | Aug 2014 | B1 |
8826385 | Congdon | Sep 2014 | B2 |
8918631 | Kumar | Dec 2014 | B1 |
8937865 | Kumar | Jan 2015 | B1 |
8995272 | Agarwal | Mar 2015 | B2 |
20010005527 | Vaeth | Jun 2001 | A1 |
20010055274 | Hegge | Dec 2001 | A1 |
20020019904 | Katz | Feb 2002 | A1 |
20020021701 | Lavian | Feb 2002 | A1 |
20020039350 | Wang | Apr 2002 | A1 |
20020054593 | Morohashi | May 2002 | A1 |
20020091795 | Yip | Jul 2002 | A1 |
20030041085 | Sato | Feb 2003 | A1 |
20030123393 | Feuerstraeter | Jul 2003 | A1 |
20030147385 | Montalvo | Aug 2003 | A1 |
20030174706 | Shankar | Sep 2003 | A1 |
20030189905 | Lee | Oct 2003 | A1 |
20030208616 | Laing | Nov 2003 | A1 |
20030216143 | Roese | Nov 2003 | A1 |
20030233534 | Bernhard | Dec 2003 | A1 |
20040001433 | Gram | Jan 2004 | A1 |
20040003094 | See | Jan 2004 | A1 |
20040010600 | Baldwin | Jan 2004 | A1 |
20040049699 | Griffith | Mar 2004 | A1 |
20040057430 | Paavolainen | Mar 2004 | A1 |
20040081171 | Finn | Apr 2004 | A1 |
20040117508 | Shimizu | Jun 2004 | A1 |
20040120326 | Yoon | Jun 2004 | A1 |
20040156313 | Hofmeister et al. | Aug 2004 | A1 |
20040165595 | Holmgren | Aug 2004 | A1 |
20040165596 | Garcia | Aug 2004 | A1 |
20040205234 | Barrack | Oct 2004 | A1 |
20040213232 | Regan | Oct 2004 | A1 |
20050007951 | Lapuh | Jan 2005 | A1 |
20050044199 | Shiga | Feb 2005 | A1 |
20050074001 | Mattes | Apr 2005 | A1 |
20050094568 | Judd | May 2005 | A1 |
20050094630 | Valdevit | May 2005 | A1 |
20050122979 | Gross | Jun 2005 | A1 |
20050157645 | Rabie et al. | Jul 2005 | A1 |
20050157751 | Rabie | Jul 2005 | A1 |
20050169188 | Cometto | Aug 2005 | A1 |
20050195813 | Ambe | Sep 2005 | A1 |
20050207423 | Herbst | Sep 2005 | A1 |
20050213561 | Yao | Sep 2005 | A1 |
20050220096 | Friskney | Oct 2005 | A1 |
20050265356 | Kawarai | Dec 2005 | A1 |
20050278565 | Frattura | Dec 2005 | A1 |
20060007869 | Hirota | Jan 2006 | A1 |
20060018302 | Ivaldi | Jan 2006 | A1 |
20060023707 | Makishima et al. | Feb 2006 | A1 |
20060029055 | Perera | Feb 2006 | A1 |
20060034292 | Wakayama | Feb 2006 | A1 |
20060036765 | Weyman | Feb 2006 | A1 |
20060059163 | Frattura | Mar 2006 | A1 |
20060062187 | Rune | Mar 2006 | A1 |
20060072550 | Davis | Apr 2006 | A1 |
20060083254 | Ge | Apr 2006 | A1 |
20060098589 | Kreeger | May 2006 | A1 |
20060140130 | Kalkunte | Jun 2006 | A1 |
20060168109 | Warmenhoven | Jul 2006 | A1 |
20060184937 | Abels | Aug 2006 | A1 |
20060221960 | Borgione | Oct 2006 | A1 |
20060227776 | Chandrasekaran | Oct 2006 | A1 |
20060235995 | Bhatia | Oct 2006 | A1 |
20060242311 | Mai | Oct 2006 | A1 |
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 |
20070036178 | Hares | Feb 2007 | A1 |
20070053294 | Ho | Mar 2007 | A1 |
20070083625 | Chamdani | Apr 2007 | A1 |
20070086362 | Kato | Apr 2007 | A1 |
20070094464 | Sharma | Apr 2007 | A1 |
20070097968 | Du | May 2007 | A1 |
20070098006 | Parry | May 2007 | A1 |
20070116224 | Burke | May 2007 | A1 |
20070116422 | Reynolds | May 2007 | A1 |
20070156659 | Lim | Jul 2007 | A1 |
20070177525 | Wijnands | Aug 2007 | A1 |
20070177597 | Ju | Aug 2007 | A1 |
20070183313 | Narayanan | Aug 2007 | A1 |
20070211712 | Fitch | Sep 2007 | A1 |
20070258449 | Bennett | Nov 2007 | A1 |
20070274234 | Kubota | Nov 2007 | A1 |
20070289017 | Copeland, III | Dec 2007 | A1 |
20080052487 | Akahane | Feb 2008 | A1 |
20080056135 | Lee | Mar 2008 | A1 |
20080065760 | Damm | Mar 2008 | A1 |
20080080517 | Roy | Apr 2008 | A1 |
20080095160 | Yadav | Apr 2008 | A1 |
20080101386 | Gray | May 2008 | A1 |
20080112400 | Dunbar et al. | May 2008 | A1 |
20080133760 | Berkvens | Jun 2008 | A1 |
20080159277 | Vobbilisetty | Jul 2008 | A1 |
20080172492 | Raghunath | Jul 2008 | A1 |
20080181196 | Regan | Jul 2008 | A1 |
20080181243 | Vobbilisetty | Jul 2008 | A1 |
20080186981 | Seto | Aug 2008 | A1 |
20080205377 | Chao | Aug 2008 | A1 |
20080219172 | Mohan | Sep 2008 | A1 |
20080225852 | Raszuk | Sep 2008 | A1 |
20080225853 | Melman | Sep 2008 | A1 |
20080228897 | Ko | Sep 2008 | A1 |
20080240129 | Elmeleegy | Oct 2008 | A1 |
20080267179 | LaVigne | Oct 2008 | A1 |
20080285458 | Lysne | Nov 2008 | A1 |
20080285555 | Ogasahara | Nov 2008 | A1 |
20080298248 | Roeck | Dec 2008 | A1 |
20080304498 | Jorgensen | Dec 2008 | A1 |
20080310342 | Kruys | Dec 2008 | A1 |
20090022069 | Khan | Jan 2009 | A1 |
20090037607 | Farinacci | Feb 2009 | A1 |
20090042270 | Dolly | Feb 2009 | A1 |
20090044270 | Shelly | Feb 2009 | A1 |
20090067422 | Poppe | Mar 2009 | A1 |
20090067442 | Killian | Mar 2009 | A1 |
20090079560 | Fries | Mar 2009 | A1 |
20090080345 | Gray | Mar 2009 | A1 |
20090083445 | Ganga | Mar 2009 | A1 |
20090092042 | Yuhara | Apr 2009 | A1 |
20090092043 | Lapuh | Apr 2009 | A1 |
20090106405 | Mazarick | Apr 2009 | A1 |
20090116381 | Kanda | May 2009 | A1 |
20090129384 | Regan | May 2009 | A1 |
20090138577 | Casado | May 2009 | A1 |
20090138752 | Graham | May 2009 | A1 |
20090161584 | Guan | Jun 2009 | A1 |
20090161670 | Shepherd | Jun 2009 | A1 |
20090168647 | Holness | Jul 2009 | A1 |
20090199177 | Edwards | Aug 2009 | A1 |
20090204965 | Tanaka | Aug 2009 | A1 |
20090213783 | Moreton | Aug 2009 | A1 |
20090222879 | Kostal | Sep 2009 | A1 |
20090232031 | Vasseur | Sep 2009 | A1 |
20090245137 | Hares | Oct 2009 | A1 |
20090245242 | Carlson | Oct 2009 | A1 |
20090246137 | Hadida | Oct 2009 | A1 |
20090252049 | Ludwig | Oct 2009 | A1 |
20090252061 | Small | Oct 2009 | A1 |
20090260083 | Szeto | Oct 2009 | A1 |
20090279558 | Davis | Nov 2009 | A1 |
20090292858 | Lambeth | Nov 2009 | A1 |
20090316721 | Kanda | Dec 2009 | A1 |
20090323698 | LeFaucheur | Dec 2009 | A1 |
20090323708 | Ihle | Dec 2009 | A1 |
20090327392 | Tripathi | Dec 2009 | A1 |
20090327462 | Adams | Dec 2009 | A1 |
20100027420 | Smith | Feb 2010 | A1 |
20100046471 | Hattori | Feb 2010 | A1 |
20100054260 | Pandey | Mar 2010 | A1 |
20100061269 | Banerjee | Mar 2010 | A1 |
20100074175 | Banks | Mar 2010 | A1 |
20100097941 | Carlson | Apr 2010 | A1 |
20100103813 | Allan | Apr 2010 | A1 |
20100103939 | Carlson | Apr 2010 | A1 |
20100131636 | Suri | May 2010 | A1 |
20100158024 | Sajassi | Jun 2010 | A1 |
20100165877 | Shukla | Jul 2010 | A1 |
20100165995 | Mehta | Jul 2010 | A1 |
20100168467 | Johnston | Jul 2010 | A1 |
20100169467 | Shukla | Jul 2010 | A1 |
20100169948 | Budko | Jul 2010 | A1 |
20100182920 | Matsuoka | Jul 2010 | A1 |
20100195489 | Zhou | Aug 2010 | A1 |
20100215042 | Sato | Aug 2010 | A1 |
20100215049 | Raza | Aug 2010 | A1 |
20100220724 | Rabie | Sep 2010 | A1 |
20100226368 | Mack-Crane | Sep 2010 | A1 |
20100226381 | Mehta | Sep 2010 | A1 |
20100246388 | Gupta | Sep 2010 | A1 |
20100257263 | Casado | Oct 2010 | A1 |
20100265849 | Harel | Oct 2010 | A1 |
20100271960 | Krygowski | Oct 2010 | A1 |
20100272107 | Papp | Oct 2010 | A1 |
20100281106 | Ashwood-Smith | Nov 2010 | A1 |
20100284414 | Agarwal | Nov 2010 | A1 |
20100284418 | Gray | Nov 2010 | A1 |
20100287262 | Elzur | Nov 2010 | A1 |
20100287548 | Zhou | Nov 2010 | A1 |
20100290473 | Enduri | Nov 2010 | A1 |
20100299527 | Arunan | Nov 2010 | A1 |
20100303071 | Kotalwar | Dec 2010 | A1 |
20100303075 | Tripathi | Dec 2010 | A1 |
20100303083 | Belanger | Dec 2010 | A1 |
20100309820 | Rajagopalan | Dec 2010 | A1 |
20100309912 | Mehta | Dec 2010 | A1 |
20100329110 | Rose | Dec 2010 | A1 |
20110019678 | Mehta | Jan 2011 | A1 |
20110032945 | Mullooly | Feb 2011 | A1 |
20110035489 | McDaniel | Feb 2011 | A1 |
20110035498 | Shah | Feb 2011 | A1 |
20110044339 | Kotalwar | Feb 2011 | A1 |
20110044352 | Chaitou | Feb 2011 | A1 |
20110064086 | Xiong | Mar 2011 | A1 |
20110064089 | Hidaka | Mar 2011 | A1 |
20110072208 | Gulati | Mar 2011 | A1 |
20110085560 | Chawla | Apr 2011 | A1 |
20110085563 | Kotha | Apr 2011 | A1 |
20110110266 | Li | May 2011 | A1 |
20110134802 | Rajagopalan | Jun 2011 | A1 |
20110134803 | Dalvi | Jun 2011 | A1 |
20110134925 | Safrai | Jun 2011 | A1 |
20110142053 | Van Der Merwe et al. | Jun 2011 | A1 |
20110142062 | Wang | Jun 2011 | A1 |
20110161494 | Mcdysan | Jun 2011 | A1 |
20110161695 | Okita | Jun 2011 | A1 |
20110176412 | Stine | Jul 2011 | A1 |
20110188373 | Saito | Aug 2011 | A1 |
20110194403 | Sajassi | Aug 2011 | A1 |
20110194563 | Shen | Aug 2011 | A1 |
20110228780 | Ashwood-Smith | Sep 2011 | A1 |
20110231570 | Altekar | Sep 2011 | A1 |
20110231574 | Saunderson | Sep 2011 | A1 |
20110235523 | Jha | Sep 2011 | A1 |
20110243133 | Villait | Oct 2011 | A9 |
20110243136 | Raman | Oct 2011 | A1 |
20110246669 | Kanada | Oct 2011 | A1 |
20110255538 | Srinivasan | Oct 2011 | A1 |
20110255540 | Mizrahi | Oct 2011 | A1 |
20110261828 | Smith | Oct 2011 | A1 |
20110268120 | Vobbilisetty | Nov 2011 | A1 |
20110268125 | Vobbilisetty | Nov 2011 | A1 |
20110273988 | Tourrilhes | Nov 2011 | A1 |
20110274114 | Dhar | Nov 2011 | A1 |
20110280572 | Vobbilisetty | Nov 2011 | A1 |
20110286457 | Ee | Nov 2011 | A1 |
20110296052 | Guo | Dec 2011 | A1 |
20110299391 | Vobbilisetty | Dec 2011 | A1 |
20110299413 | Chatwani | Dec 2011 | A1 |
20110299414 | Yu | Dec 2011 | A1 |
20110299527 | Yu | Dec 2011 | A1 |
20110299528 | Yu | Dec 2011 | A1 |
20110299531 | Yu | Dec 2011 | A1 |
20110299532 | Yu | Dec 2011 | A1 |
20110299533 | Yu | Dec 2011 | A1 |
20110299534 | Koganti | Dec 2011 | A1 |
20110299535 | Vobbilisetty | Dec 2011 | A1 |
20110299536 | Cheng | Dec 2011 | A1 |
20110317559 | Kern | Dec 2011 | A1 |
20110317703 | Dunbar et al. | Dec 2011 | A1 |
20120011240 | Hara | Jan 2012 | A1 |
20120014261 | Salam | Jan 2012 | A1 |
20120014387 | Dunbar | Jan 2012 | A1 |
20120020220 | Sugita | Jan 2012 | A1 |
20120027017 | Rai | Feb 2012 | A1 |
20120033663 | Guichard | Feb 2012 | A1 |
20120033665 | Jacob | Feb 2012 | A1 |
20120033668 | Humphries | Feb 2012 | A1 |
20120033669 | Mohandas | Feb 2012 | A1 |
20120033672 | Page | Feb 2012 | A1 |
20120063363 | Li | Mar 2012 | A1 |
20120075991 | Sugita | Mar 2012 | A1 |
20120099567 | Hart | Apr 2012 | A1 |
20120099602 | Nagapudi | Apr 2012 | A1 |
20120106339 | Mishra | May 2012 | A1 |
20120117438 | Shaffer | May 2012 | A1 |
20120131097 | Baykal | May 2012 | A1 |
20120131289 | Taguchi | May 2012 | A1 |
20120134266 | Roitshtein | May 2012 | A1 |
20120147740 | Nakash | Jun 2012 | A1 |
20120158997 | Hsu | Jun 2012 | A1 |
20120163164 | Terry | Jun 2012 | A1 |
20120177039 | Berman | Jul 2012 | A1 |
20120210416 | Mihelich | Aug 2012 | A1 |
20120239918 | Huang | Sep 2012 | A1 |
20120243539 | Keesara | Sep 2012 | A1 |
20120260079 | Mruthyunjaya | Oct 2012 | A1 |
20120275297 | Subramanian | Nov 2012 | A1 |
20120275347 | Banerjee | Nov 2012 | A1 |
20120278804 | Narayanasamy | Nov 2012 | A1 |
20120294192 | Masood | Nov 2012 | A1 |
20120294194 | Balasubramanian | Nov 2012 | A1 |
20120320800 | Kamble | Dec 2012 | A1 |
20120320926 | Kamath et al. | Dec 2012 | A1 |
20120327766 | Tsai et al. | Dec 2012 | A1 |
20120327937 | Melman et al. | Dec 2012 | A1 |
20130003535 | Sarwar | Jan 2013 | A1 |
20130003737 | Sinicrope | Jan 2013 | A1 |
20130003738 | Koganti | Jan 2013 | A1 |
20130028072 | Addanki | Jan 2013 | A1 |
20130034015 | Jaiswal | Feb 2013 | A1 |
20130034021 | Jaiswal | Feb 2013 | A1 |
20130067466 | Combs | Mar 2013 | A1 |
20130070762 | Adams | Mar 2013 | A1 |
20130114595 | Mack-Crane et al. | May 2013 | A1 |
20130124707 | Ananthapadmanabha | May 2013 | A1 |
20130127848 | Joshi | May 2013 | A1 |
20130136123 | Ge | May 2013 | A1 |
20130148546 | Eisenhauer | Jun 2013 | A1 |
20130194914 | Agarwal | Aug 2013 | A1 |
20130219473 | Schaefer | Aug 2013 | A1 |
20130250951 | Koganti | Sep 2013 | A1 |
20130259037 | Natarajan | Oct 2013 | A1 |
20130272135 | Leong | Oct 2013 | A1 |
20130294451 | Li | Nov 2013 | A1 |
20130301642 | Radhakrishnan | Nov 2013 | A1 |
20130346583 | Low | Dec 2013 | A1 |
20140013324 | Zhang | Jan 2014 | A1 |
20140025736 | Wang | Jan 2014 | A1 |
20140044126 | Sabhanatarajan | Feb 2014 | A1 |
20140056298 | Vobbilisetty | Feb 2014 | A1 |
20140105034 | Sun | Apr 2014 | A1 |
20150010007 | Matsuhira | Jan 2015 | A1 |
20150030031 | Zhou | Jan 2015 | A1 |
20150143369 | Zheng | May 2015 | A1 |
20150248298 | Gavrilov | Sep 2015 | A1 |
20150281066 | Koley | Oct 2015 | A1 |
Number | Date | Country |
---|---|---|
102801599 | Nov 2012 | CN |
0579567 | May 1993 | EP |
0579567 | Jan 1994 | EP |
0993156 | Dec 2000 | EP |
1398920 | Mar 2004 | EP |
1916807 | Apr 2008 | EP |
2001167 | Oct 2008 | EP |
2008056838 | May 2008 | WO |
2009042919 | Apr 2009 | WO |
2010111142 | Sep 2010 | WO |
2014031781 | Feb 2014 | WO |
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. |
‘RBridges: Base Protocol Specification’, IETF Draft, Perlman et al., Jun. 26, 2009. |
Switched Virtual Networks. ‘Internetworking Moves Beyond Bridges and Routers’ Data Communications, McGraw Hill. New York, US, vol. 23, No. 12, Sep. 1, 1994 (Sep. 1, 1994), pp. 66-70,72,74, XP000462385 ISSN: 0363-6399. |
Office action dated 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 Aug. 21, 2014, U.S. Appl. No. 13/184,526, filed Jul. 16, 2011. |
Office Action dated Mar. 6, 2014, U.S. Appl. No. 13/425,238, filed Mar. 20, 2012. |
Office Action dated Feb. 28, 2014, U.S. Appl. No. 13/351,513, filed Jan. 17, 2012. |
Brocade, ‘Brocade Fabrics OS (FOS) 6.2 Virtual Fabrics Feature Frequently Asked Questions’, pp. 1-6, 2009 Brocade Communications Systems, Inc. |
Brocade, ‘FastIron and TurboIron 24x Configuration Guide’, Feb. 16, 2010. |
Brocade, ‘The Effortless Network: Hyperedge Technology for the Campus LAN’ 2012. |
Brocade ‘An Introduction to Brocade VCS Fabric Technology’, Dec. 3, 2012. |
Christensen, M. et al., ‘Considerations for Internet Group Management Protocol (IGMP) and Multicast Listener Discovery (MLD) Snooping Switches’, May 2006. |
FastIron Configuration Guide Supporting Ironware Software Release 07.0.00, Dec. 18, 2009. |
Foundary 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. |
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. 142, No. 6, Jun. 1, 2004 (Jun. 1, 2004), pp. 124-131, XP001198207, ISSN: 0163-6804, DOI: 1109/MCOM.2004.1304248. |
Knight S et al: ‘Virtual Router Redundancy Protocol’ Internet Citation Apr. 1, 1998 (Apr. 1, 1998), XP002135272 Retrieved from the Internet: URL:ftp://ftp.isi.edu/in-notes/rfc2338.txt [retrieved on Apr. 10, 2000]. |
Lapuh, Roger et al., ‘Split Multi-Link Trunking (SMLT)’, Network Working Group, Oct. 2012. |
Lapuh, Roger et al., ‘Split Multi-link Trunking (SMLT) draft-lapuh-network-smlt-08’, Jan. 2009. |
Louati, Wajdi et al., ‘Network-based virtual personal overlay networks using programmable virtual routers’, IEEE Communications Magazine, Jul. 2005. |
Narten, T. et al., ‘Problem Statement: Overlays for Network Virtualization d raft-narten-n vo3-over l ay-problem -statement-01’, Oct. 31, 2011. |
Office Action for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, from Jaroenchonwanit, Bunjob, dated Jan. 16, 2014. |
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, from Park, Jung H., dated Jul. 18, 2013. |
Office Action for U.S. Appl. No. 13/365,993, filed Feb. 3, 2012, from Cho, Hong Sol., dated Jul. 23, 2013. |
Office Action for U.S. Appl. No. 12/725,249, filed Mar. 16, 2010, dated Apr. 26, 2013. |
Office Action for U.S. Appl. No. 12/725,249, filed Mar. 16, 2010, dated Sep. 12, 2012. |
Office Action for U.S. Appl. No. 12/950,968, filed Nov. 19, 2010, dated Jan. 4, 2013. |
Office Action for U.S. Appl. No. 12/950,968, filed Nov. 19, 2010, dated Jun. 7, 2012. |
Office Action for U.S. Appl. No. 12/950,974, filed Nov. 19, 2010, dated Dec. 20, 2012. |
Office Action for U.S. Appl. No. 12/950,974, filed Nov. 19, 2010, dated May 24, 2012. |
Office Action for U.S. Appl. No. 13/030,688, filed Feb. 18, 2011, dated Apr. 25, 2013. |
Office Action for U.S. Appl. No. 13/030,806, filed Feb. 18, 2011, dated Dec. 3, 2012. |
Office Action for U.S. Appl. No. 13/030,806, filed Feb. 18, 2011, dated Jun. 11, 2013. |
Office Action for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, dated Mar. 18, 2013. |
Office Action for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, dated Jul. 31, 2013. |
Office Action for U.S. Appl. No. 13/044,301, filed Mar. 9, 2011, dated Feb. 22, 2013. |
Office Action for U.S. Appl. No. 13/044,301, filed Mar. 9, 2011, dated Jun. 11, 2013. |
Office Action for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011, dated Oct. 2, 2013. |
Office Action for U.S. Appl. No. 13/050,102, filed Mar. 17, 2011, dated Oct. 26, 2012. |
Office Action for U.S. Appl. No. 13/050,102, filed Mar. 17, 2011, dated May 16, 2013. |
Office Action for U.S. Appl. No. 13/087,239, filed Apr. 14, 2011, dated May 22, 2013. |
Office Action for U.S. Appl. No. 13/092,460, filed Apr. 22, 2011, dated Jun. 21, 2013. |
Office Action for U.S. Appl. No. 13/092,580, filed Apr. 22, 2011, dated Jun. 10, 2013. |
Office Action for U.S. Appl. No. 13/092,701, filed Apr. 22, 2011, dated Jan. 28, 2013. |
Office Action for U.S. Appl. No. 13/092,701, filed Apr. 22, 2011, dated Jul. 3, 2013. |
Office Action for U.S. Appl. No. 13/092,724, filed Apr. 22, 2011, dated Feb. 5, 2013. |
Office Action for U.S. Appl. No. 13/092,724, filed Apr. 22, 2011, dated Jul. 16, 2013. |
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, dated Feb. 5, 2013. |
Office Action for U.S. Appl. No. 13/092,864, filed Apr. 22, 2011, dated Sep. 19, 2012. |
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Jun. 19, 2013. |
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Mar. 4, 2013. |
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Sep. 5, 2013. |
Office Action for U.S. Appl. No. 13/098,360, filed Apr. 29, 2011, dated May 31, 2013. |
Office Action for U.S. Appl. No. 13/098,490, filed May 2, 2011, dated Dec. 21, 2012. |
Office Action for U.S. Appl. No. 13/098,490, filed May 2, 2011, dated Jul. 9, 2013. |
Office Action for U.S. Appl. No. 13/184,526, filed Jul. 16, 2011, dated Jan. 28, 2013. |
Office Action for U.S. Appl. No. 13/184,526, filed Jul. 16, 2011, dated May 22, 2013. |
Office Action for U.S. Appl. No. 13/312,903, filed Dec. 6, 2011, dated Jun. 13, 2013. |
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Nov. 29, 2013. |
Office Action for U.S. Appl. No. 13/184,526, filed Jul. 16, 2011, dated Dec. 2, 2013. |
Office Action for U.S. Appl. No. 13/533,843, filed Jun. 26, 2012, dated Oct. 21, 2013. |
Office Action for U.S. Appl. No. 13/598,204, filed Aug. 29, 2012, dated Feb. 20, 2014. |
Perlman, Radia et al., ‘Challenges and Opportunities in the Design of TRILL: a Routed layer 2 Technology’, 2009. |
S. Nadas et al., ‘Virtual Router Redundancy Protocol (VRRP) Version 3 for IPv4 and IPv6’, Internet Engineering Task Force, Mar. 2010. |
Office Action dated Apr. 9, 2014, U.S. Appl. No. 13/092,724, filed Apr. 22, 2011. |
Office Action dated Mar. 26, 2014, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011. |
Office Action dated Apr. 9, 2014, U.S. Appl. No. 13/092,752, filed Apr. 22, 2011. |
Office Action dated Jun. 18, 2014, U.S. Appl. No. 13/440,861, filed Apr. 5, 2012. |
Office Action dated May 9, 2014, U.S. Appl. No. 13/484,072, filed May 30, 2012. |
Office Action dated May 14, 2014, U.S. Appl. No. 13/533,843, filed Jun. 26, 2012. |
Office Action dated Feb. 20, 2014, U.S. Appl. No. 13/598,204, filed Aug. 29, 2012. |
Office Action dated Jun. 6, 2014, U.S. Appl. No. 13/669,357, filed Nov. 5, 2012. |
Huang, Nen-Fu et al., ‘An Effective Spanning Tree Algorithm for a Bridged LAN’, Mar. 16, 1992. |
Lapuh, Roger et al., ‘Split Multi-link Trunking (SMLT)’, draft-lapuh-network-smlt-08, Jul. 2008. |
Office Action for U.S. Appl. No. 13/098,490, filed May 2, 2011, dated Mar. 27, 2014. |
Perlman, Radia et al., ‘RBridges: Base Protocol Specification; Draft-ietf-trill-rbridge-protocol-16.txt’, Mar. 3, 2010, pp. 1-117. |
Zhai F. Hu et al. ‘RBridge: Pseudo-Nickname; draft-hu-trill-pseudonode-nickname-02.txt’, May 15, 2012. |
‘An Introduction to Brocade VCS Fabric Technology’, Brocade white paper, http://community.brocade.com/docs/DOC-2954, Dec. 3, 2012. |
U.S. Appl. No. 13/030,806 Office Action dated Dec. 3, 2012. |
Office action dated Jan. 10, 2014, U.S. Appl. No. 13/092,580, filed Apr. 22, 2011. |
Office action dated Jan. 16, 2014, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011. |
Office action dated Jul. 31, 2013, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011. |
Office action dated Jan. 6, 2014, U.S. Appl. No. 13/092,877, filed Apr. 22, 2011. |
Office action dated Oct. 2, 2013, U.S. Appl. No. 13/044,326, filed Mar. 9, 2011. |
Office action dated Dec. 2, 2013, U.S. Appl. No. 13/184,526, filed Jul. 16, 2011. |
Office action dated Nov. 29, 2013, U.S. Appl. No. 13/092,873, filed Apr. 22, 2011. |
Office action dated Nov. 12, 2013, U.S. Appl. No. 13/312,903, filed Dec. 6, 2011. |
Brocade ‘Brocade Unveils’ The Effortless Network, http://newsroom.brocade.com/press-releases/brocade-unveils-the-effortless-network-nasdaq-brcd-0859535, 2012. |
Kreeger, L. et al., ‘Network Virtualization Overlay Control Protocol Requirements draft-kreeger-nvo3-overlay-cp-00’, Jan. 30, 2012. |
Office Action for U.S. Appl. No. 13/365,808, Filing date Jul. 18, 2013, dated Jul. 18, 2013. |
Office Action for U.S. Appl. No. 13/092,887, dated Jan. 6, 2014. |
Office action dated Apr. 26, 2012, U.S. Appl. No. 12/725,249, filed Mar. 16, 2010. |
Office action dated Sep. 12, 2012, U.S. Appl. No. 12/725,249, filed Mar. 16, 2010. |
Office action dated Dec. 21, 2012, U.S. Appl. No. 13/098,490, filed May 2, 2011. |
Office action dated Mar. 27, 2014, U.S. Appl. No. 13/098,490, filed May 2, 2011. |
Office action dated Jul. 9, 2013, U.S. Appl. No. 13/098,490, filed May 2, 2011. |
Office action dated May 22, 2013, U.S. Appl. No. 13/087,239, filed Apr. 14, 2011. |
Office action dated Dec. 5, 2012, U.S. Appl. No. 13/087,239, filed Apr. 14, 2011. |
Office action dated Feb. 5, 2013, U.S. Appl. No. 13/092,724, filed Apr. 22, 2011. |
Office action dated Jun. 10, 2013, U.S. Appl. No. 13/092,580, filed Apr. 22, 2011. |
Office action dated Mar. 18, 2013, U.S. Appl. No. 13/042,259, filed Mar. 7, 2011. |
Office action dated Jun. 21, 2013, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011. |
Office action dated Jan. 28, 2013, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011. |
Office action dated Jul. 3, 2013, U.S. Appl. No. 13/092,701, filed Apr. 22, 2011. |
Office action dated Jul. 18, 2013, U.S. Appl. No. 13/092,752, filed Apr. 22, 2011. |
Office action dated Dec. 20, 2012, U.S. Appl. No. 12/950,974, filed Nov. 19, 2010. |
Office action dated May 24, 2012, U.S. Appl. No. 12/950,974, filed Nov. 19, 2010. |
Office action dated Sep. 5, 2013, U.S. Appl. No. 13/092,877, filed Apr. 22, 2011. |
Office action dated Mar. 4, 2013, U.S. Appl. No. 13/092,877, filed Apr. 22, 2011. |
Office action dated Jan. 4, 2013, U.S. Appl. No. 12/950,968, filed Nov. 19, 2010. |
Office action dated Jun. 7, 2012, U.S. Appl. No. 12/950,968, filed Nov. 19, 2010. |
Office action dated Sep. 19, 2012, U.S. Appl. No. 13/092,864, filed Apr. 22, 2011. |
Office action dated May 31, 2013, U.S. Appl. No. 13/098,360, filed Apr. 29, 2011. |
Office action dated Dec. 3, 2012, U.S. Appl. No. 13/030,806, filed Feb. 18, 2011. |
Office action dated Apr. 22, 2014, U.S. Appl. No. 13/030,806, filed Feb. 18, 2011. |
Office action dated Jun. 11, 2013, U.S. Appl. No. 13/030,806, filed Feb. 18, 2011. |
Office action dated Apr. 25, 2013, U.S. Appl. No. 13/030,688, filed Feb. 18, 2011. |
Office action dated Feb. 22, 2013, U.S. Appl. No. 13/044,301, filed Mar. 9, 2011. |
Office action dated Jun. 11, 2013, U.S. Appl. No. 13/044,301, filed Mar. 9, 2011. |
Office action dated Oct. 26, 2012, U.S. Appl. No. 13/050,102, filed Mar. 17, 2011. |
Office action dated May 16, 2013, U.S. Appl. No. 13/050,102, filed Mar. 17, 2011. |
Office action dated Aug. 4, 2014, U.S. Appl. No. 13/050,102, filed Mar. 17, 2011. |
Office action dated Jan. 28, 2013, U.S. Appl. No. 13/148,526, filed Jul. 16, 2011. |
Office action dated May 22, 2013, U.S. Appl. No. 13/148,526, filed Jul. 16, 2011. |
Office action dated Jun. 19, 2013, U.S. Appl. No. 13/092,873, filed Apr. 22, 2011. |
Office action dated Jul. 18, 2013, U.S. Appl. No. 13/365,808, filed Feb. 3, 2012. |
Office action dated Jun. 13, 2013, U.S. Appl. No. 13/312,903, filed Dec. 6, 2011. |
Office Action for U.S. Appl. No. 13/030,688, filed Feb. 18, 2011, dated Jul. 17, 2014. |
Office Action for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011, dated Jul. 7, 2014. |
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, dated Apr. 9, 2014. |
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Jul. 25, 2014. |
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Jun. 20, 2014. |
Office Action for U.S. Appl. No. 13/312,903, filed Dec. 6, 2011, dated Aug. 7, 2014. |
Office Action for U.S. Appl. No. 13/351,513, filed Jan. 17, 2012, dated Jul. 24, 2014. |
Office Action for U.S. Appl. No. 13/425,238, filed Mar. 20, 2012, dated Mar. 6, 2014. |
Office Action for U.S. Appl. No. 13/556,061, filed Jul. 23, 2012, dated Jun. 6, 2014. |
Office Action for U.S. Appl. No. 13/742,207 dated Jul. 24, 2014, filed Jan. 15, 2013. |
Office Action for U.S. Appl. No. 13/950,974, filed Nov. 19, 2010, from Haile, Awet A., dated Dec. 2, 2012. |
Office Action for U.S. Appl. No. 13/087,239, filed Apr. 14, 2011, dated Dec. 5, 2012. |
Office Action for U.S. Appl. No. 13/351,513, filed Jan. 17, 2012, dated Feb. 28, 2014. |
Perlman R: ‘Challenges and opportunities in the design of TRILL: a routed layer 2 technology’, 2009 IEEE GLOBECOM Workshops, Honolulu, HI, USA, Piscataway, NJ, USA, Nov. 30, 2009 (Nov. 30, 2009), pp. 1-6, XP002649647, DOI: 10.1109/GLOBECOM.2009.5360776 ISBN: 1-4244-5626-0 [retrieved on Jul. 19, 2011]. |
TRILL Working Group Internet-Draft Intended status: Proposed Standard RBridges: Base Protocol Specificaiton Mar. 3, 2010. |
Office action dated Aug. 14, 2014, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011. |
Office action dated Jul. 7, 2014, for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011. |
Office Action dated Dec. 19, 2014, for U.S. Appl. No. 13/044,326, filed Mar. 9, 2011. |
Office Action for U.S. Appl. No. 13/092,873, filed Apr. 22, 2011, dated Nov. 7, 2014. |
Office Action for U.S. Appl. No. 13/092,877, filed Apr. 22, 2011, dated Nov. 10, 2014. |
Office Action for U.S. Appl. No. 13/157,942, filed Jun. 10, 2011. |
Mckeown, Nick et al. “OpenFlow: Enabling Innovation in Campus Networks”, Mar. 14, 2008, www.openflow.org/documents/openflow-wp-latest.pdf. |
Office Action for U.S. Appl. No. 13/044,301, dated Mar. 9, 2011. |
Office Action for U.S. Appl. No. 13/184,526, filed Jul. 16, 2011, dated Jan. 5, 2015. |
Office Action for U.S. Appl. No. 13/598,204, filed Aug. 29, 2012, dated Jan. 5, 2015. |
Office Action for U.S. Appl. No. 13/669,357, filed Nov. 5, 2012, dated Jan. 30, 2015. |
Office Action for U.S. Appl. No. 13/851,026, filed Mar. 26, 2013, dated Jan. 30, 2015. |
Office Action for U.S. Appl. No. 13/092,460, filed Apr. 22, 2011, dated Mar. 13, 2015. |
Office Action for U.S. Appl. No. 13/425,238, dated Mar. 12, 2015. |
Office Action for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011, dated Feb. 27, 2015. |
Office Action for U.S. Appl. No. 13/042,259, filed Mar. 7, 2011, dated Feb. 23, 2015. |
Office Action for U.S. Appl. No. 13/044,301, filed Mar. 9, 2011, dated Jan. 29, 2015. |
Office Action for U.S. Appl. No. 13/050,102, filed Mar. 17, 2011, dated Jan. 26, 2015. |
Office action dated Oct. 2, 2014, for U.S. Appl. No. 13/092,752, filed Apr. 22, 2011. |
Kompella, Ed K. et al., ‘Virtual Private LAN Service (VPLS) Using BGP for Auto-Discovery and Signaling’ Jan. 2007. |
Rosen, E. et al., “BGP/MPLS VPNs”, Mar. 1999. |
Abawajy J. “An Approach to Support a Single Service Provider Address Image for Wide Area Networks Environment” Centre for Parallel and Distributed Computing, School of Computer Science Carleton University, Ottawa, Ontario, K1S 5B6, Canada. |
Office Action for U.S. Appl. No. 13/425,238, filed Mar. 20, 2012, dated Mar. 12, 2015. |
Office Action for U.S. Appl. No. 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. |
Mahalingam “VXLAN: A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks” Oct. 17, 2013 pp. 1-22, Sections 1, 4 and 4.1. |
Office action dated Apr. 30, 2015, U.S. Appl. No. 13/351,513, filed Jan. 17, 2012. |
Office Action dated Apr. 1, 2015, U.S. Appl. No. 13/656,438, filed Oct. 19, 2012. |
Office Action dated May 21, 2015, U.S. Appl. No. 13/288,822, filed Nov. 3, 2011. |
Siamak Azodolmolky et al. “Cloud computing networking: Challenges and opportunities for innovations”, IEEE Communications Magazine, vol. 51, No. 7, Jul. 1, 2013. |
Office Action dated Apr. 1, 2015 U.S. Appl. No. 13/656,438 filed Oct. 19, 2012. |
Office action dated Jun. 8, 2015, U.S. Appl. No. 14/178,042, filed Feb. 11, 2014. |
Office Action Dated Jun. 10, 2015, U.S. Appl. No. 13/890,150, filed May 8, 2013. |
Office Action dated Jun. 18, 215, U.S. Appl. No. 13/098,490, filed May 2, 2011. |
Office Action dated Jun. 16, 2015, U.S. Appl. No. 13/048,817, filed Mar. 15, 2011. |
Office Action dated 06/18/215, U.S. Appl. No. 13/098,490, filed May 2, 2011. |
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, K1 S 5B6, Canada. |
Office Action dated Jul. 31, 2015, U.S. Appl. No. 13/598,204, filed Aug. 29, 2014. |
Office Action dated Jul. 31, 2015, U.S. Appl. No. 14/473,941, filed Aug. 29, 2014. |
Office Action dated Jul. 31, 2015, U.S. Appl. No. 14/488,173, filed Sep. 16, 2014. |
Office Action dated Aug. 21, 2015, U.S. Appl. No. 13/776,217, filed Feb. 25, 2013. |
Office Action dated Aug. 19, 2015, U.S. Appl. No. 14/156,374, filed Jan. 15, 2014. |
Office Action dated Sep. 2, 2015, U.S. Appl. No. 14/151,693, filed Jan. 9, 2014. |
Office Action dated Sep. 17, 2015, U.S. Appl. No. 14/577,785, filed Dec. 19, 2014. |
Office Action dated Sep. 22, 2015 U.S. Appl. No. 13/656,438 filed Oct. 19, 2012. |
Office Action dated Nov. 5, 2015, U.S. Appl. No. 14/178,042, filed Feb. 11, 2014. |
Office Action dated Oct. 19, 2015, U.S. Appl. No. 14/215,996, filed Mar. 17, 2014. |
Office Action dated Sep. 18, 2015, U.S. Appl. No. 13/345,566, filed Jan. 6, 2012. |
Open Flow Switch Specification Version 1.1.0, Feb. 28, 2011. |
Open Flow Switch Specification Version 1.0.0, Dec. 31, 2009. |
Open Flow Configuration and Management Protocol 1.0 (OF-Config 1.0) Dec. 23, 2011. |
Open Flow Switch Specification Version 1.2 Dec. 5, 2011. |
Office action dated Feb. 2, 2016, U.S. Appl. No. 13/092,460, filed Apr. 22, 2011. |
Office Action dated Feb. 2, 2016. U.S. Appl. No. 14/154,106, filed Jan. 13, 2014. |
Office Action dated Feb. 3, 2016, U.S. Appl. No. 13/098,490, filed May 2, 2011. |
Office Action dated Feb. 4, 2016, U.S. Appl. No. 13/557,105, filed Jul. 24, 2012. |
Office Action dated Feb. 11, 2016, U.S. Appl. No. 14/488,173, filed Sep. 16, 2014. |
Office Action dated Feb. 24, 2016, U.S. Appl. No. 13/971,397, filed Aug. 20, 2013. |
Office Action dated Feb. 24, 2016, U.S. Appl. No. 12/705,508, filed Feb. 12, 2010. |
Number | Date | Country | |
---|---|---|---|
20160103692 A1 | Apr 2016 | US |