US 8,717,895 B2Grant
Network virtualization apparatus and method with a table mapping engine
Issue Date:2014-05-06
•23 Claims
•31 Drawing Sheets
Abstract
Some embodiments provide a virtualizer for managing a plurality of managed switching elements that forward data through a network. The virtualizer comprises a first set of tables for storing input logical forwarding plane data and a second set of tables for storing output physical control plane data. It also includes a table mapping engine for mapping the input logical forwarding plane data in the first set of tables to output physical control plane data in the second set of tables by performing a set of database join operations on the input logical forwarding plane data in the first set of tables. In some embodiments, the physical control plane data is subsequently translated into physical forwarding behaviors that direct the forwarding of data by the managed switching elements.
Metadata
Assignee
- Nicira, Inc.
Inventors
- Teemu Koponen
- Pankaj Thakkar
- Martin Casado
- W. Andrew Lambeth
- Alexander Yip
- Jeremy Stribling
Application Information
Application Number:US 13/177,530
Filing Date:2011-07-06
Priority Date:2010-07-06
Art Unit:2465
Classifications
IPC:
H04L12/26H04L12/54G06F15/173G06F12/10
Patent Drawings (31 sheets)
Description
[0001] This application claims benefit to U.S. Provisional Patent Application 61/361,912, filed on Jul. 6, 2010; U.S. Provisional Patent Application 61/361,913, filed on Jul. 6, 2010; U.S. Provisional Patent Application 61/429,753, filed on Jan. 4, 2011; U.S. Provisional Patent Application 61/429,754, filed on Jan. 4, 2011; U.S. Provisional Patent Application 61/466,453, filed on Mar. 22, 2011; U.S. Provisional Patent Application 61/482,205, filed on May 3, 2011; U.S. Provisional Patent Application 61/482,615, filed on May 4, 2011; U.S. Provisional Patent Application 61/482,616, filed on May 4, 2011; U.S. Provisional Patent Application 61/501,743, filed on Jun. 27, 2011; and U.S. Provisional Patent Application 61/501,785, filed on Jun. 28, 2011. These provisional applications are incorporated herein by reference.
Background
[0002] Many current enterprises have large and sophisticated networks comprising switches, hubs, routers, servers, workstations and other networked devices, which support a variety of connections, applications and systems. The increased sophistication of computer networking, including virtual machine migration, dynamic workloads, multi-tenancy, and customer specific quality of service and security configurations require a better paradigm for network control. Networks have traditionally been managed through low-level configuration of individual components. Network configurations often depend on the underlying network: for example, blocking a user's access with an access control list (“ACL”) entry requires knowing the user's current IP address. More complicated tasks require more extensive network knowledge: forcing guest users' port 80 traffic to traverse an HTTP proxy requires knowing the current network topology and the location of each guest. This process is of increased difficulty where the network switching elements are shared across multiple users.
[0003] In response, there is a growing movement, driven by both industry and academia, towards a new network control paradigm called Software-Defined Networking (SDN). In the SDN paradigm, a network controller, running on one or more servers in a network, controls, maintains, and implements control logic that governs the forwarding behavior of shared network switching elements on a per user basis. Making network management decisions often requires knowledge of the network state. To facilitate management decision-making, the network controller creates and maintains a view of the network state and provides an application programming interface upon which management applications may access a view of the network state.
[0004] Three of the many challenges of large networks (including datacenters and the enterprise) are scalability, mobility, and multi-tenancy and often the approaches taken to address one hamper the other. For instance, one can easily provide network mobility for virtual machines (VMs) within an L2 domain, but L2 domains cannot scale to large sizes. Also, retaining tenant isolation greatly complicates mobility. Despite the high-level interest in SDN, no existing products have been able to satisfy all of these requirements.
Brief Summary
[0005] Some embodiments of the invention provide a system that allows several different logical data path sets to be specified for several different users through one or more shared network infrastructure switching elements (referred to as “switching elements” below). In some embodiments, the system includes a set of software tools that allows the system to accept logical data path sets from users and to configure the switching elements to implement these logical data path sets. These software tools allow the system to virtualize control of the shared switching elements and the network that is defined by the connections between these shared switching elements, in a manner that prevents the different users from viewing or controlling each other's logical data path sets (i.e., each other's switching logic) while sharing the same switching elements.
[0006] In some embodiments, one of the software tools that allows the system to virtualize control of a set of switching elements (i.e., to allow several users to share the same switching elements without viewing or controlling each other's logical data path sets) is an intermediate data storage structure that (1) stores the state of the network, (2) receives and records modifications to different parts of the network from different users, and (3), in some embodiments, provides different views of the state of the network to different users. For instance, in some embodiments, the intermediate data storage structure is a network information base (NIB) data structure that stores the state of the network that is defined by one or more switching elements. The system uses this NIB data structure as an intermediate storage structure for reading the state of the network and writing modifications to the state of the network. In some embodiments, the NIB also stores the logical configuration and the logical state for each user specified logical data path set. In these embodiments, the information in the NIB that represents the state of the actual switching elements accounts for only a subset of the total information stored in the NIB.
[0007] In some embodiments, the system has (1) a network operating system (NOS) to create and maintain the NIB storage structure, and (2) one or more applications that run on top of the NOS to specify logic for reading values from and writing values to the NIB. When the NIB is modified in order to effectuate a change in the switching logic of a switching element, the NOS of some embodiments also propagates the modification to the switching element.
[0008] The system of different embodiments uses the NIB differently to virtualize access to the shared switching elements and network. In some embodiments, the system provides different views of the NIB to different users in order to ensure that different users do not have direct view and control over each other's switching logic. For instance, in some embodiments, the NIB is a hierarchical data structure that represents different attributes of different switching elements as elements (e.g., different nodes) in a hierarchy. The NIB in some of these embodiments is a multi-layer hierarchical data structure, with each layer having a hierarchical structure and one or more elements (e.g., nodes) on each layer linked to one or more elements (e.g., nodes) on another layer. In some embodiments, the lowest layer elements correspond to the actual switching elements and their attributes, while each of the higher layer elements serve as abstractions of the actual switching elements and their attributes. As further described below, some of these higher layer elements are used in some embodiments to show different abstract switching elements and/or switching element attributes to different users in a virtualized control system.
[0009] In some embodiments, the definition of different NIB elements at different hierarchical levels in the NIB and the definition of the links between these elements are used by the developers of the applications that run on top of the NOS in order to define the operations of these applications. For instance, in some embodiments, the developer of an application running on top of the NOS uses these definitions to enumerate how the application is to map the logical data path sets of the user to the physical switching elements of the control system. Under this approach, the developer would have to enumerate all different scenarios that the control system may encounter as well as the mapping operation of the application for each scenario. This type of network virtualization (in which different views of the NIB are provided to different users) is referred to below as Type I network virtualization.
[0010] Another type of network virtualization, which is referred to below as Type II network virtualization, does not require the application developers to have intimate knowledge of the NIB elements and the links (if any) in the NIB between these elements. Instead, this type of virtualization allows the application to simply provide user specified logical switching element attributes in the form of one or more tables, which are then mapped to NIB records by a table mapping engine. In other words, the Type II virtualized system of some embodiments accepts the logical switching element configurations (e.g., access control list table configurations, L2 table configurations, L3 table configurations, etc.) that the user defines without referencing any operational state of the switching elements in a particular network configuration. It then maps the logical switching element configurations to the switching element configurations stored in the NIB.
[0011] To perform this mapping, the system of some embodiments uses a database table mapping engine to map input tables, which are created from (1) logical switching configuration attributes, and (2) a set of properties associated with switching elements used by the system, to output tables. The content of these output tables are then transferred to the NIB elements. In some embodiments, the system uses a variation of the datalog database language, called nLog, to create the table mapping engine that maps input tables containing logical data path data and switching element attributes to the output tables. Like datalog, nLog provides a few declaratory rules and operators that allow a developer to specify different operations that are to be performed upon the occurrence of different events. In some embodiments, nLog provides a limited subset of the operators that are provided by datalog in order to increase the operational speed of nLog. For instance, in some embodiments, nLog only allows the AND operator to be used in any of the declaratory rules.
[0012] The declaratory rules and operations that are specified through nLog are then compiled into a much larger set of rules by an nLog compiler. In some embodiments, this compiler translates each rule that is meant to address an event into several sets of database join operations. Collectively the larger set of rules forms the table mapping, rules engine that is referred to below as the nLog engine. In some embodiments, the nLog virtualization engine also provides feedback (e.g., from one or more of the output tables or from NIB records that are updated to reflect values stored in the output tables) to the user in order to provide the user with state information about the logical data path set that he or she created. In this manner, the updates that the user gets are expressed in terms of the logical space that the user understand and not in terms of the underlying switching element states, which the user does not understand.
[0013] The use of nLog serves as a significant distinction between Type I virtualized control systems and Type II virtualized control systems, even for Type II systems that store user specified logical data path sets in the NIB. This is because nLog provides a machine-generated rules engine that addresses the mapping between the logical and physical domains in a more robust, comprehensive manner than the hand-coded approach used for Type I virtualized control systems. In the Type I control systems, the application developers need to have a detailed understanding of the NIB structure and need to use this detailed understanding to write code that addresses all possible conditions that the control system would encounter at runtime. On the other hand, in Type II control systems, the application developers only need to produce applications that express the user-specified logical data path sets in terms of one or more tables, which are then mapped in an automated manner to output tables and later transferred from the output tables to the NIB. This approach allows the Type II virtualized systems not to maintain the data regarding the logical data path sets in the NIB. However, some embodiments maintain this data in the NIB in order to distribute this data among other NOS instances, as further described below.
[0014] As apparent from the above discussion, the applications that run on top of a NOS instance can perform several different sets of operations in several different embodiments of the invention. Examples of such operations include providing an interface to a user to access NIB data regarding the user's switching configuration, providing different layered NIB views to different users, providing control logic for modifying the provided NIB data, providing logic for propagating received modifications to the NIB, etc.
[0015] In some embodiments, the system embeds some or all such operations in the NOS instead of including them in an application operating on top of the NOS. Alternatively, in other embodiments, the system separates some or all of these operations into different subsets of operations and then has two or more applications that operate above the NOS perform the different subsets of operations. One such system runs two applications on top of the NOS, a control application and a virtualization application. In some embodiments, the control application allows a user to specify and populate logical data path sets, while the virtualization application implements the specified logical data path sets by mapping the logical data path set to the physical switching infrastructure. In some embodiments, the virtualization application translates control application input into records that are written into the NIB, and from the NIB these records are then subsequently transferred to the switching infrastructure through the operation of the NOS. In some embodiments, the NIB stores both the logical data path set input received through the control application and the NIB records that are produced by the virtualization application.
[0016] In some embodiments, the control application can receive switching infrastructure data from the NIB. In response to this data, the control application may modify record(s) associated with one or more logical data path sets (LDPS). Any such modified LDPS record would then be translated to one or more physical switching infrastructure records by the virtualization application, which might then be transferred to the physical switching infrastructure by the NOS.
[0017] In some embodiments, the NIB stores data regarding each switching element within the network infrastructure of a system, while in other embodiments, the NIB stores state information about only switching elements at the edge of a network infrastructure. In some embodiments, edge switching elements are switching elements that have direct connections with the computing devices of the users, while non-edge switching elements only connect to edge switching elements and other non-edge switch elements.
[0018] The system of some embodiments only controls edge switches (i.e., only maintains data in the NIB regarding edge switches) for several reasons. Controlling edge switches provides the system with a sufficient mechanism for maintaining isolation between computing devices, which is needed, as opposed to maintaining isolation between all switch elements, which is not needed. The interior switches forward data packets between the switching elements. The edge switches forward data packets between computing devices and other network elements (e.g., other switching elements). Thus, the system can maintain user isolation simply by controlling the edge switching elements because the edge switching elements are the last switches in line to forward packets to hosts.
[0019] Controlling only edge switches also allows the system to be deployed independent of concerns about the hardware vendor of the non-edge switches. Deploying at the edge allows the edge switches to treat the internal nodes of the network as simply a collection of elements that moves packets without considering the hardware makeup of these internal nodes. Also, controlling only edge switches makes distributing switching logic computationally easier. Controlling only edge switches also enables non-disruptive deployment of the system. Edge switching solutions can be added as top of rack switches without disrupting the configuration of the non-edge switches.
[0020] In addition to controlling edge switches, the network control system of some embodiments also utilizes and controls non-edge switches that are inserted in the switch network hierarchy to simplify and/or facilitate the operation of the controlled edge switches. For instance, in some embodiments, the control system requires the switches that it controls to be interconnected in a hierarchical switching architecture that has several edge switches as the leaf nodes and one or more non-edge switches as the non-leaf nodes. In some such embodiments, each edge switch connects to one or more of the non-leaf switches, and uses such non-leaf switches to facilitate its communication with other edge switches. Examples of functions that such non-leaf switches provide to facilitate such communications between edge switches in some embodiments include (1) routing of a packet with an unknown destination address (e.g., unknown MAC address) to the non-leaf switch so that this switch can route this packet to the appropriate edge switch, (2) routing a multicast or broadcast packet to the non-leaf switch so that this switch can convert this packet to a series of unicast packets to the desired destinations, (3) bridging remote managed networks that are separated by one or more networks, and (4) bridging a managed network with an unmanaged network.
[0021] Some embodiments employ one level of non-leaf (non-edge) switches that connect to edge switches and in some cases to other non-leaf switches. Other embodiments, on the other hand, employ multiple levels of non-leaf switches, with each level of non-leaf switch after the first level serving as a mechanism to facilitate communication between lower level non-leaf switches and leaf switches. In some embodiments, the non-leaf switches are software switches that are implemented by storing the switching tables in the memory of a standalone computer instead of an off the shelf switch. In some embodiments, the standalone computer may also be executing in some cases a hypervisor and one or more virtual machines on top of that hypervisor. Irrespective of the manner by which the leaf and non-leaf switches are implemented, the NIB of the control system of some embodiments stores switching state information regarding the leaf and non-leaf switches.
[0022] The above discussion relates to the control of edge switches and non-edge switches by a network control system of some embodiments. In some embodiments, edge switches and non-edge switches (leaf and non-leaf nodes) may be referred to as managed switches. This is because these switches are managed by the network control system (as opposed to unmanaged switches, which are not managed by the network control system, in the network) in order to implement logical data path sets through the managed switches.
[0023] In addition to using the NIB to store switching-element data, the virtualized network-control system of some embodiments also stores other storage structures to store data regarding the switching elements of the network. These other storage structures are secondary storage structures that supplement the storage functions of the NIB, which is the primary storage structure of the system while the system operates. In some embodiments, the primary purpose for one or more of the secondary storage structures is to back up the data in the NIB. In these or other embodiments, one or more of the secondary storage structures serve a purpose other than backing up the data in the NIB (e.g., for storing data that are not in the NIB).
[0024] In some embodiments, the NIB is stored in system memory (e.g., RAM) while the system operates. This allows for fast access of the NIB records. In some embodiments, one or more of the secondary storage structures, on the other hand, are stored on disks, or other non-volatile memories, which are slower to access. Such non-volatile disks or other non-volatile memories, however, improve the resiliency of the system as they allow the data to be stored in a persistent manner.
[0025] The system of some embodiments uses multiple types of storages in its pool of secondary storage structures. These different types of structures store different types of data, store data in different manners, and provide different query interfaces that handle different types of queries. For instance, in some embodiments, the system uses a persistent transactional database (PTD) and a hash table structure. The PTD in some embodiments is a database that is stored on disk or other non-volatile memory. In some embodiments, the PTD is a commonly available database, such as MySQL or SQLite. The PTD of some embodiments can handle complex transactional queries. As a transactional database, the PTD can undo a series of earlier query operations that it has performed as part of a transaction when one of the subsequent query operations of the transaction fails.
[0026] Moreover, some embodiments define a transactional guard processing (TGP) layer before the PTD in order to allow the PTD to execute conditional sets of database transactions. The TGP layer allows the PTD to avoid unnecessary later database operations when conditions of earlier operations are not met. The PTD in some embodiments stores the exact replica of the data that is stored in the NIB, while in other embodiments it stores only a subset of the data that is stored in the NIB. In some embodiments, some or all of the data in the NIB is stored in the PTD in order to ensure that the NIB data will not be lost in the event of a crash of the NOS or the NIB.
[0027] While the system is running, the hash table of some embodiments is not stored on a disk or other non-volatile memory. Instead, it is a storage structure that is stored in volatile system memory when the system is running. When the system is powered down, the content of the hash table is stored on a disk or any other non-volatile memory. The hash table uses hashed indices that allow it to retrieve records in response to queries. This structure combined with the hash table's placement in the system's volatile memory allows the table to be accessed very quickly. To facilitate this quick access, a simplified query interface is used in some embodiments. For instance, in some embodiments, the hash table has just two queries, a Put query for writing values to the table and a Get query for retrieving values from the table. The system of some embodiments uses the hash table to store data that the NOS needs to retrieve very quickly. Examples of such data include network entity status, statistics, state, uptime, link arrangement, and packet handling information. Furthermore, in some embodiments, the NOS uses the hash tables as a cache to store information that is repeatedly queried, such as flow entries that will be written to multiple nodes.
[0028] Using a single NOS instance to control a network can lead to scaling and reliability issues. As the number of network elements increases, the processing power and/or memory capacity that are required by those elements will saturate a single node. Some embodiments further improve the resiliency of the control system by having multiple instances of NOS running on one or more computers, with each instance of NOS containing one or more of the secondary storage structures described above. Each instance in some embodiments not only includes a NOS instance, but also includes a virtualization application instance and/or a control application instance. In some of these embodiments, the control and/or virtualization applications partition the workload between the different instances in order to reduce each instance's control and/or virtualization workload. Also, in some embodiments, the multiple instances of NOS communicate the information stored in their secondary storage layers to enable each instance of NOS to cover for the others in the event of a NOS instance failing. Moreover, some embodiments use the secondary storage layer (i.e., one or more of the secondary storages) as a channel for communicating between the different instances.
[0029] The distributed, multi-instance control system of some embodiments maintains the same switch element data records in the NIB of each instance, while in other embodiments, the system allows NIBs of different instances to store different sets of switch element data records. Some embodiments that allow different instances to store different portions of the NIB, divide the NIB into N mutually exclusive portions and store each NIB portion in one NIB of one of N controller instances, where N is an integer value greater than 1. Other embodiments divide the NIB into N portions and store different NIB portions in different controller instances, while allowing some or all of the portions to partially (but not completely) overlap with the other NIB portions.
[0030] The hash tables in the distributed control system of some embodiments form a distributed hash table (DHT), with each hash table serving as a DHT instance. In some embodiments, the DHT instances of all controller instances collectively store one set of records that is indexed based on hashed indices for quick access. These records are distributed across the different controller instances to minimize the size of the records within each instance and to allow for the size of the DHT to be increased by adding other DHT instances. According to this scheme, each DHT record is not stored in each controller instance. In fact, in some embodiments, each DHT record is stored in at most one controller instance. To improve the system's resiliency, some embodiments, however, allow one DHT record to be stored in more than one controller instance, so that in case one instance fails, the DHT records of that failed instance can be accessed from other instances. Some embodiments do not allow for replication of records across different DHT instances or allow only a small amount of such records to be replicated because the system of these embodiments stores in the DHT only the type of data that can be quickly re-generated.
[0031] The distributed control system of some embodiments replicates each NIB record in the secondary storage layer (e.g., in each PTD instance and/or in the DHT) in order to maintain the records in the NIB in a persistent manner. For instance, in some embodiments, all the NIB records are stored in the PTD storage layer. In other embodiments, only a portion of the NIB data is replicated in the PTD storage layer. For instance, some embodiments store a subset of the NIB records in another one of the secondary storage records, such as the DHT.
[0032] By allowing different NOS instances to store the same or overlapping NIB records, and/or secondary storage structure records, the system improves its overall resiliency by guarding against the loss of data due to the failure of any NOS or secondary storage structure instance. For instance, in some embodiments, the portion of NIB data that is replicated in the PTD (which is all of the NIB data in some embodiments or part of the NIB data in other embodiments) is replicated in the NIBs and PTDs of all controller instances, in order to protect against failures of individual controller instances (e.g., of an entire controller instance or a portion of the controller instance).
[0033] In some embodiments, each of the storages of the secondary storage layer uses a different distribution technique to improve the resiliency of a multiple NOS instance system. For instance, as mentioned above, the system of some embodiments replicates the PTD across NOS instances so that every NOS has a full copy of the PTD to enable a failed NOS instance to quickly reload its PTD from another instance. In some embodiments, the system distributes the DHT fully or with minimal overlap across multiple controller instances in order to maintain the DHT instance within each instance small. This approach also allows the size of the DHT to be increased by adding additional DHT instances, and this in turn allows the system to be more scalable.
[0034] For some or all of the communications between the distributed instances, the distributed system of some embodiments uses coordination managers (CM) in the controller instances to coordinate activities between the different controllers. Examples of such activities include writing to the NIB, writing to the PTD, writing to the DHT, controlling the switching elements, facilitating intra-controller communication related to fault tolerance of controller instances, etc.
[0035] To distribute the workload and to avoid conflicting operations from different controller instances, the distributed control system of some embodiments designates one controller instance within the system as the master of any particular NIB portion (e.g., as the master of a logical data path set) and one controller instance within the system as the master of any given switching element. Even with one master controller, a different controller instance can request changes to different NIB portions and/or to different switching elements controlled by the master. If allowed, the master instance then effectuates this change and writes to the desired NIB portion and/or switching element. Otherwise, the master rejects the request.
[0036] The preceding Summary is intended to serve as a brief introduction to some embodiments of the invention. It is not meant to be an introduction or overview of all inventive subject matter disclosed in this document. The Detailed Description that follows and the Drawings that are referred to in the Detailed Description will further describe the embodiments described in the Summary as well as other embodiments. Accordingly, to understand all the embodiments described by this document, a full review of the Summary, Detailed Description and the Drawings is needed. Moreover, the claimed subject matters are not to be limited by the illustrative details in the Summary, Detailed Description and the Drawing, but rather are to be defined by the appended claims, because the claimed subject matters can be embodied in other specific forms without departing from the spirit of the subject matters.
Brief Description of the Drawings
[0037] The novel features of the invention are set forth in the appended claims. However, for purposes of explanation, several embodiments of the invention are set forth in the following figures.
[0038] FIG. 1 illustrates a virtualized network system of some embodiments.
[0039] FIG. 2 illustrates an example of switch controller functionality of the network operating system (NOS) of some embodiments.
[0040] FIG. 3 illustrates an example of displaying different network information base (NIB) views to different users.
[0041] FIG. 4 illustrates a virtualized system that employs control and virtualization applications.
[0042] FIG. 5 illustrates an example of a virtualized system of some embodiments.
[0043] FIG. 6 illustrates the switch infrastructure of a multi-tenant server hosting system in some embodiments.
[0044] FIG. 7 illustrates a virtualized network control system that manages edge switches.
[0045] FIG. 8 illustrates an example of a virtualized system that employs secondary storage structures that supplement the NIB's storage operations.
[0046] FIG. 9 illustrates a multi-instance, distributed network control system of some embodiments.
[0047] FIG. 10 illustrates an approach of maintaining an entire global NIB data structure in each NOS instance.
[0048] FIG. 11 illustrates an alternative approach of dividing the global NIB into two separate portions, and storing each of these portions in a different NOS instance.
[0049] FIG. 12 illustrates another alternative approach of dividing the global NIB into two separate portions having overlapping portions.
[0050] FIG. 13 illustrates an example of specifying a master controller instance for a switch in a distributed system.
[0051] FIG. 14 illustrates a particular distributed network control system of some embodiments of the invention.
[0052] FIG. 15 conceptually illustrates a single NOS instance of some embodiments.
[0053] FIG. 16 illustrates propagation of instructions to control a managed switch through the various processing layers of the controller instances of some embodiments.
[0054] FIG. 17 illustrates propagation of instructions to control several managed switches through the various processing layers of the controller instances of some embodiments.
[0055] FIG. 18 illustrates a conceptual process that the virtualization application of some embodiments performs to convert logical data to physical data.
[0056] FIG. 19 illustrates a virtualization application of some embodiments.
[0057] FIG. 20 illustrates input and output tables of some embodiments.
[0058] FIG. 21 illustrates a development process that some embodiments employ to develop the rules engine of the control application.
[0059] FIG. 22 illustrates that the rules engine of some embodiments implements partitioned management of logical data path sets (LDPS').
[0060] FIG. 23 illustrates a conceptual process that the virtualization application of some embodiments performs each time a record in a RE input table changes.
[0061] FIG. 24 illustrates an example of a set of join operations.
[0062] FIG. 25 illustrates an example of a set of join operations failing when they relate to a LDPS that does not relate to an input table event that has occurred.
[0063] FIGS. 26 A-B illustrate an example of reducing workloads on nLog instances.
[0064] FIG. 27 illustrates a virtualization application of some embodiments.
[0065] FIG. 28 illustrates a conceptual process that the control application of some embodiments performs to convert logical control plane data to logical forwarding data.
[0066] FIG. 29 illustrates a control application of some embodiments.
[0067] FIG. 30 illustrates the control and virtualization applications of some embodiments.
[0068] FIG. 31 illustrates an integrated control/virtualization application of some embodiments.
[0069] FIG. 32 conceptually illustrates an electronic system with which some embodiments of the invention are implemented.
Detailed Description
[0070] In the following detailed description of the invention, numerous details, examples, and embodiments of the invention are set forth and described. However, it will be clear and apparent to one skilled in the art that the invention is not limited to the embodiments set forth and that the invention may be practiced without some of the specific details and examples discussed.
[0071] Some embodiments of the invention provide a method that allows several different logical data path sets to be specified for several different users through one or more shared switching elements without allowing the different users to control or even view each other's switching logic. In some embodiments, the method provides a set of software tools that allows the system to accept logical data path sets from users and to configure the switching elements to implement these logical data path sets. These software tools allow the method to virtualize control of the shared switching elements and the network that is defined by the connections between these shared switching elements, in a manner that prevents the different users from viewing or controlling each other's logical data path sets while sharing the same switching elements.
[0072] In some embodiments, one of the software tools that the method provides that allows it to virtualize control of a set of switching elements (i.e., to enable the method to allow several users to share the same switching elements without viewing or controlling each other's logical data path sets) is an intermediate data storage structure that (1) stores the state of the network, (2) receives modifications to different parts of the network from different users, and (3), in some embodiments, provide different views of the state of the network to different users. For instance, in some embodiments, the intermediate data storage structure is a network information base (NIB) data structure that stores the state of the network that is defined by one or more switching elements. In some embodiments, the NIB also stores the logical configuration and the logical state for each user specified logical data path set. In these embodiments, the information in the NIB that represents the state of the actual switching elements accounts for only a subset of the total information stored in the NIB.
[0073] The method uses the NIB data structure to read the state of the network and to write modifications to the state of the network. When the data structure is modified in order to effectuate a change in the switching logic of a switching element, the method propagates the modification to the switching element.
[0074] In some embodiments, the method is employed by a virtualized network control system that (1) allows user to specify different logical data path sets, (2) maps these logical data path sets to a set of switching elements managed by the control system. In some embodiments, the network infrastructure switching elements includes virtual or physical network switches, software switches (e.g., Open vSwitch), routers, and/or other switching devices, as well as any other network elements (such as load balancers, etc.) that establish connections between these switches, routers, and/or other switching devices. Such switching elements (e.g., physical switching elements, such as physical switches or routers) are implemented as software switches in some embodiments. Software switches are switches that are implemented by storing the switching tables in the memory of a standalone computer instead of an off the shelf switch. In some embodiments, the standalone computer may also be executing in some cases a hypervisor and one or more virtual machines on top of that hypervisor
[0075] These switches are referred to below as managed switching elements or managed forwarding elements as they are managed by the network control system in order to implement the logical data path sets. In some embodiments described below, the control system manages these switching elements by pushing physical control plane data to them, as further described below. Switching elements generally receive data (e.g., a data packet) and perform one or more processing operations on the data, such as dropping a received data packet, passing a packet that is received from one source device to another destination device, processing the packet and then passing it a destination device, etc. In some embodiments, the physical control plane data that is pushed to a switching element is converted by the switching element (e.g., by a general purpose processor of the switching element) to physical forwarding plane data that specify how the switching element (e.g., how a specialized switching circuit of the switching element) processes data packets that it receives.
[0076] The virtualized control system of some embodiments includes (1) a network operating system (NOS) that creates and maintains the NIB storage structure, and (2) one or more applications that run on top of the NOS to specify control logic for reading values from and writing values to the NIB. The NIB of some of these embodiments serves as a communication channel between the different controller instances and, in some embodiments, a communication channel between different processing layers of a controller instance.
[0077] Several examples of such systems are described below in Section I. Section II then describes the software architecture of a NOS instance. Section III further describes the control data pipeline of some embodiments of the invention. Section IV next describes how some embodiments perform the virtualization operations that map user specified input to data tuples in the NIB. Then, Section V describes operations the control application of some embodiments performs. Finally, Section VI describes the computer systems and processes used to implement some embodiments of the invention.
I. Virtualized Control System
[0078] FIG. 1 illustrates a virtualized network system 100 of some embodiments of the invention. This system allows multiple users to create and control multiple different sets of logical data paths on a shared set of network infrastructure switching elements (e.g., switches, virtual switches, software switches, etc.). In allowing a user to create and control the user's set of logical data paths (i.e., the user's switching logic), the system does not allow the user to have direct access to another user's set of logical data paths in order to view or modify the other user's switching logic. However, the system does allow different users to pass packets through their virtualized switching logic to each other if the users desire such communication.
[0079] As shown in FIG. 1 , the system 100 includes one or more switching elements 105, a network operating system 110, a network information base 115, and one or more applications 120. The switching elements include N switching devices (where N is a number equal to 1 or greater) that form the network infrastructure switching elements of the system 100. In some embodiments, the network infrastructure switching elements includes virtual or physical network switches, software switches (e.g., Open vSwitch), routers, and/or other switching devices, as well as any other network elements (such as load balancers, etc.) that establish connections between these switches, routers, and/or other switching devices. All such network infrastructure switching elements are referred to below as switching elements or forwarding elements.
[0080] The virtual or physical switching devices 105 typically include control switching logic 125 and forwarding switching logic 130. In some embodiments, a switch's control logic 125 specifies (1) the rules that are to be applied to incoming packets, (2) the packets that will be discarded, and (3) the packet processing methods that will be applied to incoming packets. The virtual or physical switching elements 105 use the control logic 125 to populate tables governing the forwarding logic 130. The forwarding logic 130 performs lookup operations on incoming packets and forwards the incoming packets to destination addresses.
[0081] As further shown in FIG. 1 , the system 100 includes one or more applications 120 through which switching logic (i.e., sets of logical data paths) is specified for one or more users (e.g., by one or more administrators or users). The network operating system (NOS) 110 serves as a communication interface between (1) the switching elements 105 that perform the physical switching for any one user, and (2) the applications 120 that are used to specify switching logic for the users. In this manner, the application logic determines the desired network behavior while the NOS merely provides the primitives needed to access the appropriate network state. In some embodiments, the NOS 110 provides a set of Application Programming Interfaces (API) that provides the applications 120 programmatic access to the network switching elements 105 (e.g., access to read and write the configuration of network switching elements). In some embodiments, this API set is data-centric and is designed around a view of the switching infrastructure, allowing control applications to read and write state to any element in the network.
[0082] To provide the applications 120 programmatic access to the switching elements, the NOS 110 needs to be able to control the switching elements 105 itself. The NOS uses different techniques in different embodiments to control the switching elements. In some embodiments, the NOS can specify both control and forwarding switching logic 125 and 130 of the switching elements. In other embodiments, the NOS 110 controls only the control switching logic 125 of the switching elements, as shown in FIG. 1 . In some of these embodiments, the NOS 110 manages the control switching logic 125 of a switching element through a commonly known switch-access interface that specifies a set of APIs for allowing an external application (such as a network operating system) to control the control plane functionality of a switching element. Two examples of such known switch-access interfaces are the OpenFlow interface and the Open Virtual Switch interface, which are respectively described in the following two papers: McKeown, N. (2008). OpenFlow: Enabling Innovation in Campus Networks (which can be retrieved from the Internet), and Pettit, J. (2010). Virtual Switching in an Era of Advanced Edges (which can be retrieved from the Internet). These two papers are incorporated herein by reference.
[0083] FIG. 1 conceptually illustrates the use of switch-access APIs through the depiction of halos 135 around the control switching logic 125. Through these APIs, the NOS can read and write entries in the control plane flow tables. The NOS' connectivity to the switching elements' control plane resources (e.g., the control plane tables) is implemented in-band (i.e., with the network traffic controlled by NOS) in some embodiments, while it is implemented out-of-band (i.e., over a separate physical network) in other embodiments. There are only minimal requirements for the chosen mechanism beyond convergence on failure and basic connectivity to the NOS, and thus, when using a separate network, standard IGP protocols such as IS-IS or OSPF are sufficient.
[0084] In order to define the control switching logic 125 for physical switching elements, the NOS of some embodiments uses the Open Virtual Switch protocol to create one or more control tables within the control plane of a switch element. The control plane is typically created and executed by a general purpose CPU of the switching element. Once the system has created the control table(s), the system then writes flow entries to the control table(s) using the OpenFlow protocol. The general purpose CPU of the physical switching element uses its internal logic to convert entries written to the control table(s) to populate one or more forwarding tables in the forwarding plane of the switch element. The forwarding tables are created and executed typically by a specialized switching chip of the switching element. Through its execution of the flow entries within the forwarding tables, the switching chip of the switching element can process and route packets of data that it receives.
[0085] To enable the programmatic access of the applications 120 to the switching elements 105, the NOS also creates the network information base (NIB) 115. The NIB is a data structure in which the NOS stores a copy of the switch-element states tracked by NOS. The NIB of some embodiments is a graph of all physical or virtual switch elements and their interconnections within a physical network topology and their forwarding tables. For instance, in some embodiments, each switching element within the network infrastructure is represented by one or more data objects in the NIB. However, in other embodiments, the NIB stores state information about only some of the switching elements. For example, as further described below, the NIB in some embodiments only keeps track of switching elements at the edge of a network infrastructure. In yet other embodiments, the NIB stores state information about edge switching elements in a network as well as some non-edge switching elements in the network that facilitate communication between the edge switching elements. In some embodiments, the NIB also stores the logical configuration and the logical state for each user specified logical data path set. In these embodiments, the information in the NIB that represents the state of the actual switching elements accounts for only a subset of the total information stored in the NIB.
[0086] In some embodiments, the NIB 115 is the heart of the NOS control model in the virtualized network system 100. Under one approach, applications control the network by reading from and writing to the NIB. Specifically, in some embodiments, the application control logic can (1) read the current state associated with network entity objects in the NIB, (2) alter the network state by operating on these objects, and (3) register for notifications of state changes to these objects. Under this model, when an application 120 needs to modify a record in a table (e.g., a control plane flow table) of a switching element 105, the application 120 first uses the NOS' APIs to write to one or more objects in the NIB that represent the table in the NIB. The NOS then acting as the switching element's controller propagates this change to the switching element's table.
[0087] FIG. 2 presents one example that illustrates this switch controller functionality of the NOS 110. In particular, this figure illustrates in four stages the modification of a record (e.g., a flow table record) in a switch 205 by an application 215 and a NOS 210. In this example, the switch 205 has two switch logic records 230 and 235. As shown in stage one of FIG. 2 , a NIB 240 stores two records 220 and 225 that correspond to the two switch logic records 230 and 235 of the switch. In the second stage, the application uses the NOS' APIs to write three new values d, e, and f in the record 220 of the NIB to replace three previous values a, b, and c.
[0088] Next, in the third stage, the NOS uses the set of switch-access APIs to write a new set of values into the switch. In some embodiments, the NIB performs a translation operation that modifies the format of the records before writing these records into the NIB. These operations are pictorially illustrated in FIG. 2 by showing the values d, e, f translated into d′, e′, f′, and the writing of these new values into the switch 205. Alternatively, in some embodiments, one or more sets of values are kept identically in the NIB and the switching element, which thereby causes the NOS 210 to write the NIB values directly to the switch 205 unchanged.
[0089] In yet other embodiments, the NOS' translation operation might modify the set of values in the NIB (e.g., the values d, e, f) into a different set of values with fewer values (e.g., values x and y, where x and y might be a subset of d, e, and f, or completely different) or additional values (e.g., the w, x, y, z, where w, x, y, and z might be a super set of all or some of d, e, and f, or completely different). The NOS in these embodiments would then write this modified set of values (e.g., values x and y, or values w, x, y and z into the switching element).
[0090] The fourth stage finally shows the switch 205 after the old values a, b, and c have been replaced in the switch control record 230 with the values d′, e′, and f′. Again, in the example shown in FIG. 2 , the NOS of some embodiments propagates NIB records to the switches as modified versions of the records were written to the NIB. In other embodiments, the NOS applies processing (e.g., data transformation) to the NIB records before the NOS propagates the NIB records to the switches, and such processing changes the format, content and quantity of data written to the switches.
[0091] A. Different NIB Views
[0092] In some embodiments, the virtualized system 100 of FIG. 1 provides different views of the NIB to different users in order (1) to ensure that different users do not have direct view and control over each other's switching logic and (2) to provide each user with a view of the switching logic at an abstraction level that is desired by the user. For instance, in some embodiments, the NIB is a hierarchical data structure that represents different attributes of different switching elements as elements (e.g., different nodes) in a hierarchy. The NIB in some of these embodiments is a multi-layer hierarchical data structure, with each layer having a hierarchical structure and one or more elements (e.g., nodes) on each layer linked to one or more elements (e.g., nodes) on another layer. In some embodiments, the lowest layer elements correspond to the actual switching elements and their attributes, while each of the higher layer elements serves as abstractions of the actual switching elements and their attributes. As further described below, some of these higher layer elements are used in some embodiments to show different abstract switching elements and/or switching element attributes to different users in a virtualized control system. In other words, the NOS of some embodiments generates the multi-layer, hierarchical NIB data structure, and the NOS or an application that runs on top of the NOS shows different users different views of different parts of the hierarchical levels and/or layers, in order to provide the different users with virtualized access to the shared switching elements and network.
[0093] FIG. 3 illustrates an example of displaying different NIB views to different users. Specifically, this figure illustrates a virtualized switching system 300 that includes several switching elements that are shared by two users. The system 300 is similar to the system 100 of FIG. 1 , except that the system 300 is shown to include four switching elements 105a-105d and one application 120, as opposed to the more general case of N switching elements 105 and M (where M is a number greater than or equal to 1) applications in FIG. 1 . The number of switching elements and the use of one application are purely exemplary. Other embodiments might use more or fewer switching elements and applications. For instance, instead of having the two users interface with the same application, other embodiments provide two applications to interface with the two users.
[0094] In system 300, the NIB 115 stores sets of data records for each of the switching elements 105a-105d. In some embodiments, a system administrator can access these four sets of data through an application 120 that interfaces with the NOS. However, other users that are not system administrators do not have access to all of the four sets of records in the NIB, because some switch logic records in the NIB might relate to the logical switching configuration of other users.
[0095] Instead, each non system-administrator user can only view and modify the switching element records in the NIB that relate to the logical switching configuration of the user. FIG. 3 illustrates this limited view by showing the application 120 providing a first layered NIB view 345 to a first user 355 and a second layered NIB view 350 to a second user 360. The first layered NIB view 345 shows the first user data records regarding the configuration of the shared switching elements 105a-105d for implementing the first user's switching logic and the state of this configuration. The second layered NIB view 350 shows the second user data records regarding the configuration of the shared switching elements 105a-105d for implementing the second user's switching logic and the state of this configuration. In viewing their own logical switching configuration, neither user can view the other user's logical switching configuration.
[0096] In some embodiments, each user's NIB view is a higher level NIB view that represents an abstraction of the lowest level NIB view that correlates to the actual network infrastructure that is formed by the switching elements 105a-105d. For instance, as shown in FIG. 3 , the first user's layered NIB view 345 shows two switches that implement the first user's logical switching configuration, while the second user's layered NIB view 350 shows one switch that implements the second user's logical switching configuration. This could be the case even if either user's switching configuration uses all four switching elements 105a-105d. However, under this approach, the first user perceives that his computing devices are interconnected by two switching elements, while the second user perceives that her computing devices are interconnected by one switching element.
[0097] The first layered NIB view is a reflection of a first set of data records 365 that the application 120 allows the first user to access from the NIB, while the second layered NIB view is a representation of a second set of data records 370 that the application 120 allows the second user to access from the NIB. In some embodiments, the application 120 retrieves the two sets of data records 365 and 370 from the NIB and maintains these records locally, as shown in FIG. 3 . In other embodiments, however, the application does not maintain these two sets of data records locally. Instead, in these other embodiments, the application simply provides the users with an interface to access the limited set of first and second data records from the NIB 115. Also, in other embodiments, the system 300 does not provide switching element abstractions in the higher layered NIB views 345 and 350 that it provides to the users. Rather, it simply provides views to the limited first and second set of data records 365 and 370 from the NIB.
[0098] Irrespective of whether the application maintains a local copy of the first and second data records or whether the application only provides the switching element abstractions in its higher layered NIB views, the application 120 serves as an interface through which each user can view and modify the user's logical switching configuration, without being able to view or modify the other user's logical switching configuration. Through the set of APIs provided by the NOS 110, the application 120 propagates to the NIB 115 changes that a user makes to the logical switching configuration view that the user receives from the application. The propagation of these changes entails the transferring, and in some cases of some embodiments, the transformation, of the high level data entered by a user for a higher level NIB view to lower level data that is to be written to lower level NIB data that is stored by the NOS.
[0099] In the system 300 of FIG. 3 , the application 120 can perform several different sets of operations in several different embodiments of the invention, as discussed above. Examples of such operations include providing an interface to a user to access NIB data regarding the user's logical switching configuration, providing different layered NIB views to different users, providing control logic for modifying the provided NIB data, providing logic for propagating received modifications to the NIB structure stored by the NOS, etc.
[0100] The system of some embodiments embeds all such operations in the NOS 110 instead of in the application 120 operating on top of the NOS. Alternatively, in other embodiments the system separates these operations into several applications that operate above the NOS. FIG. 4 illustrates a virtualized system that employs several such applications. Specifically, this figure illustrates a virtualized system 400 that is similar to the virtualized system 300 of FIG. 3 , except that the operations of the application 120 in the system 400 have been divided into two sets of operations, one that is performed by a control application 420 and one that is performed by a virtualization application 425.
[0101] In some embodiments, the virtualization application 425 interfaces with the NOS 110 to provide different views of different NIB records to different users through the control application 420. The control application 420 also provides the control logic for allowing a user to specify different operations with respect to the limited NIB records/views provided by the virtualization application. Examples of such operations can be read operations from the NIB or write operations to the NIB. The virtualization application then translates these operations into operations that access the NIB. In translating these operations, the virtualization application in some embodiments also transfers and/or transforms the data that are expressed in terms of the higher level NIB records/views to data that are expressed in terms of lower level NIB records.
[0102] Even though FIG. 4 shows just one control application and one virtualization application being used for the two users, the system 400 in other embodiments employs two control applications and/or two virtualization applications for the two different users. Similarly, even though several of the above-described figures show one or more applications operating on a single NOS instance, other embodiments provide several different NOS instances on top of each of which, one or more applications can execute. Several such embodiments will be further described below.
[0103] B. Type I versus Type II Virtualized System
[0104] Different embodiments of the invention use different types of virtualization applications. One type of virtualization application exposes the definition of different elements at different hierarchical levels in the NIB and the definition of the links between these elements to the control applications that run on top of the NOS and the virtualization application in order to allow the control application to define its operations by reference to these definitions. For instance, in some embodiments, the developer of the control application running on top of the virtualization application uses these definitions to enumerate how the application is to map the logical data path sets of the user to the physical switching elements of the control system. Under this approach, the developer would have to enumerate all different scenarios that the control system may encounter and the mapping operation of the application for each scenario. This type of virtualization is referred to below as Type I network virtualization.
[0105] Another type of network virtualization, which is referred to below as Type II network virtualization, does not require the application developers to have intimate knowledge of the NIB elements and the links in the NIB between these elements. Instead, this type of virtualization allows the application to simply provide user specified switching element attributes in the form of one or more tables, which are then mapped to NIB records by a table mapping engine. In other words, the Type II virtualized system of some embodiments accepts switching element configurations (e.g., access control list table configurations, L2 table configurations, L3 table configurations, etc.) that the user defines without referencing any operational state of the switching elements in a particular network configuration. It then maps the user-specified switching element configurations to the switching element configurations stored in the NIB.
[0106] FIG. 5 illustrates an example of such a Type II virtualized system. Like the virtualized system 300 of FIG. 3 and the virtualized system 400 of FIG. 4 , the virtualized system 500 in this example is shown to include one NOS 110 and four switching elements 105a-105d. Also, like the virtualized system 400, the system 500 includes a control application 520 and a virtualization application 525 that run on top of the NOS 110. In some embodiments, the control application 520 allows a user to specify and populate logical data path sets, while the virtualization application 525 implements the specified logical data path sets by mapping the logical data path set to the physical switching infrastructure.
[0107] More specifically, the control application 520 allows (1) a user to specify abstract switching element configurations, which the virtualization application 525 then maps to the data records in the NIB, and (2) the user to view the state of the abstract switching element configurations. In some embodiments, the control application 520 uses a network template library 530 to allow a user to specify a set of logical data paths by specifying one or more switch element attributes (i.e., one or more switch element configurations). In the example shown in FIG. 5 , the network template library includes several types of tables that a switching element may include. In this example, the user has interfaced with the control application 520 to specify an L2 table 535, an L3 table 540, and an access control list (ACL) table 545. These three tables specify a logical data path set 550 for the user. In specifying these tables, the user simply specifies desired switch configuration records for one or more abstract, logical switching elements. When specifying these records, the user of the system 500 does not have any understanding of the switching elements 105a-105d employed by the system or any data regarding these switching elements from the NIB 115. The only switch-element specific data that the user of the system 500 receives is the data from the network template library, which specifies the types of network elements that the user can define in the abstract, which the system can then process.
[0108] While the example in FIG. 5 shows the user specifying ACL table, one of ordinary skill in the art will realize that the system of some embodiments does not provide such specific switch table attributes in the library 530. For instance, in some embodiments, the switch-element abstractions provided by the library 530 are generic switch tables and do not relate to any specific switching element table, component and/or architecture. In these embodiments, the control application 520 enables the user to create generic switch configurations for a generic set of one or more tables. Accordingly, the abstraction level of the switch-element attributes that the control application 520 allows the user to create is different in different embodiments.
[0109] Irrespective of the abstraction level of the switch-element attributes produced through the control logic application, the virtualization application 525 performs a mapping operation that maps the specified switch-element attributes (e.g., the specific or generic switch table records) to records in the NIB. In some embodiments, the virtualization application translates control application input into one or more NIB records 585. The virtualization application then writes the resulting NIB records 585 to the NIB through the API set provided by NOS. From the NIB, these records are then subsequently transferred to the switching infrastructure through the operation of the NOS. In some embodiments, the NIB stores both the logical data path set input received through the control application as well as the NIB records that are produced by the virtualization application.
[0110] In some embodiments, the control application can receive switching infrastructure data from the NIB. In response to this data, the control application may modify record(s) associated with one or more logical data path sets (LDPS). Any such modified LDPS record would then be translated to one or more physical switching infrastructure records by the virtualization application, which might then be transferred to the physical switching infrastructure by the NOS.
[0111] To map the control application input to physical switching infrastructure attributes for storage in the NIB, the virtualization application of some embodiments uses a database table mapping engine to map input tables to output tables. These input tables are created from (1) the control-application specified input tables, and (2) a set of properties associated with switching elements used by the system. The content of these output tables are then transferred to the NIB elements.
[0112] Some embodiments use a variation of the datalog database language to allow application developers to create the table mapping engine for the virtualization application, and thereby to specify the manner by which the virtualization application maps logical data path sets to the controlled physical switching infrastructure. This variation of the datalog database language is referred to below as nLog. Like datalog, nLog provides a few declaratory rules and operators that allow a developer to specify different operations that are to be performed upon the occurrence of different events. In some embodiments, nLog provides a limited subset of the operators that are provided by datalog in order to increase the operational speed of nLog. For instance, in some embodiments, nLog only allows the AND operator to be used in any of the declaratory rules.
[0113] The declaratory rules and operations that are specified through nLog are then compiled into a much larger set of rules by an nLog compiler. In some embodiments, this compiler translates each rule that is meant to address an event into several sets of database join operations. Collectively the larger set of rules forms the table mapping, rules engine that is referred to below as the nLog engine. The nLog mapping techniques of some embodiments is further described below.
[0114] In some embodiments, the nLog virtualization engine provides feedback (e.g., from one or more of the output tables or from NIB records that are updated to reflect values stored in the output tables) to the user in order to provide the user with state information about the logical data path set that he or she created. In this manner, the updates that the user gets are expressed in terms of the logical space that the user understands and not in terms of the underlying switching element states, which is the user does not understand.
[0115] The use of nLog serves as a significant distinction between Type I virtualized control systems and Type II virtualized control systems, even for Type II systems that store user specified logical data path sets in the NIB. This is because nLog provides a machine-generated rules engine that addresses the mapping between the logical and physical domains in a more robust, comprehensive manner than the hand-coded approach used for Type I virtualized control systems. In the Type I control systems, the application developers need to have a detailed understanding of the NIB structure and need to use this detailed understanding to write code that addresses all possible conditions that the control system would encounter at runtime. On the other hand, in Type II control systems, the application developers only need to produce applications that express the user-specified logical data path sets in terms of one or more tables, which are then automatically mapped to output tables whose content are in turn transferred to the NIB. This approach allows the Type II virtualized systems not to maintain the data regarding the logical data path sets in the NIB. However, some embodiments maintain this data in the NIB in order to distribute this data among other NOS instances, as further described below.
[0116] C. Edge and Non-Edge Switch Controls
[0117] As mentioned above, the NIB in some embodiments stores data regarding each switching element within the network infrastructure of a system, while in other embodiments, the NIB stores state information about only switching elements at the edge of a network infrastructure. FIGS. 6 and 7 illustrate an example that differentiates the two differing approaches. Specifically, FIG. 6 illustrates the switch infrastructure of a multi-tenant server hosting system. In this system, six switching elements are employed to interconnect six computing devices of two users A and B. Four of these switches 605-620 are edge switches that have direct connections with the computing devices 635-660 of the users A and B, while two of the switches 625 and 630 are interior switches (i.e., non-edge switches) that interconnect the edge switches and connect to each other.
[0118] FIG. 7 illustrates a virtualized network control system 700 that manages the edge switches 605-620. As shown in this figure, the system 700 includes a NOS 110 that creates and maintains a NIB 115, which contains data records regarding only the four edge switching elements 605-620. In addition, the applications 705 running on top of the NOS 110 allow the users A and B to modify their switch element configurations for the edge switches that they use. The NOS then propagates these modifications if needed to the edge switching elements. Specifically, in this example, two edge switches 605 and 620 are used by computing devices of both users A and B, while edge switch 610 is only used by the computing device 645 of the user A and edge switch 615 is only used by the computing device 650 of the user B. Accordingly, FIG. 7 illustrates the NOS modifying users A and B records in switches 605 and 620, but only updating user A records in switch element 610 and only user B records in switch element 615.
[0119] The system of some embodiments only controls edge switches (i.e., only maintains data in the NIB regarding edge switches) for several reasons. Controlling edge switches provides the system with a sufficient mechanism for maintaining isolation between computing devices, which is needed, as opposed to maintaining isolation between all switch elements, which is not needed. The interior switches forward data packets between switching elements. The edge switches forward data packets between computing devices and other network elements (e.g., other switching elements). Thus, the system can maintain user isolation simply by controlling the edge switch because the edge switch is the last switch in line to forward packets to a host.
[0120] Controlling only edge switches also allows the system to be deployed independent of concerns about the hardware vendor of the non-edge switches, because deploying at the edge allows the edge switches to treat the internal nodes of the network as simply a collection of elements that moves packets without considering the hardware makeup of these internal nodes. Also, controlling only edge switches makes distributing switching logic computationally easier. Controlling only edge switches also enables non-disruptive deployment of the system because edge-switching solutions can be added as top of rack switches without disrupting the configuration of the non-edge switches.
[0121] In addition to controlling edge switches, the network control system of some embodiments also utilizes and controls non-edge switches that are inserted in the switch network hierarchy to simplify and/or facilitate the operation of the controlled edge switches. For instance, in some embodiments, the control system requires the switches that it controls to be interconnected in a hierarchical switching architecture that has several edge switches as the leaf nodes and one or more non-edge switches as the non-leaf nodes. In some such embodiments, each edge switch connects to one or more of the non-leaf switches, and uses such non-leaf switches to facilitate its communication with other edge switches. Examples of functions that a non-leaf switch of some embodiments may provide to facilitate such communications between edge switch in some embodiments include (1) routing of a packet with an unknown destination address (e.g., unknown MAC address) to the non-leaf switch so that this switch can route this packet to the appropriate edge switch, (2) routing a multicast or broadcast packet to the non-leaf switch so that this switch can convert this packet to a series of unicast packets to the desired destinations, (3) bridging remote managed networks that are separated by one or more networks, and (4) bridging a managed network with an unmanaged network.
[0122] Some embodiments employ one level of non-leaf (non-edge) switches that connect to edge switches and in some cases to other non-leaf switches. Other embodiments, on the other hand, employ multiple levels of non-leaf switches, with each level of non-leaf switch after the first level serving as a mechanism to facilitate communication between lower level non-leaf switches and leaf switches. In some embodiments, the non-leaf switches are software switches that are implemented by storing the switching tables in the memory of a standalone computer instead of an off the shelf switch. In some embodiments, the standalone computer may also be executing in some cases a hypervisor and one or more virtual machines on top of that hypervisor. Irrespective of the manner by which the leaf and non-leaf switches are implemented, the NIB of the control system of some embodiments stores switching state information regarding the leaf and non-leaf switches.
[0123] The above discussion relates to the control of edge switches and non-edge switches by a network control system of some embodiments. In some embodiments, edge switches and non-edge switches (leaf and non-leaf nodes) may be referred to as managed switches. This is because these switches are managed by the network control system (as opposed to unmanaged switches, which are not managed by the network control system, in the network) in order to implement logical data path sets through the managed switches.
[0124] D. Secondary Storage Structure
[0125] In addition to using the NIB to store switching-element data, the virtualized network-control system of some embodiments also stores other storage structures to store data regarding the switching elements of the network. These other storage structures are secondary storage structures that supplement the storage functions of the NIB, which is the primary storage structure of the system while the system operates. In some embodiments, the primary purpose for one or more of the secondary storage structures is to back up the data in the NIB. In these or other embodiments, one or more of the secondary storage structures serves a purpose other than backing up the data in the NIB (e.g., for storing data that are not in the NIB).
[0126] In some embodiments, the NIB is stored in system memory (e.g., RAM) while the system operates. This allows for the fast access of the NIB records. In some embodiments, one or more of the secondary storage structures, on the other hand, are stored on disk or other non-volatile memories that are slower to access. Such non-volatile disk or other storages, however, improve the resiliency of the system as they allow the data to be stored in a persistent manner.
[0127] FIG. 8 illustrates an example of a virtualized system 800 that employs secondary storage structures that supplement the NIB's storage operations. This system is similar to the systems 400 and 500 of FIGS. 4 and 5 , except that it also includes secondary storage structures 805. In this example, these structures include a persistent transactional database (PTD) 810, a persistent non-transactional database (PNTD) 815, and a hash table 820. In some embodiments, these three types of secondary storage structures store different types of data, store data in different manners, and/or provide different query interfaces that handle different types of queries.
[0128] In some embodiments, the PTD 810 is a database that is stored on disk or other non-volatile memory. In some embodiments, the PTD is a commonly available database, such as MySQL or SQLite. The PTD of some embodiments can handle complex transactional queries. As a transactional database, the PTD can undo a series of prior query operations that it has performed as part of a transaction when one of the subsequent query operations of the transaction fails. Moreover, some embodiments define a transactional guard processing (TGP) layer before the PTD in order to allow the PTD to execute conditional sets of database transactions. The TGP layer allows the PTD to avoid unnecessary later database operations when conditions of earlier operations are not met.
[0129] The PTD in some embodiments stores the exact replica of the data that are stored in the NIB, while in other embodiments it stores only a subset of the data that are stored in the NIB. Some or all of the data in the NIB are stored in the PTD in order to ensure that the NIB data will not be lost in the event of a crash of the NOS or the NIB.
[0130] The PNTD 815 is another persistent database that is stored on disk or other non-volatile memory. Some embodiments use this database to store data (e.g., statistics, computations, etc.) regarding one or more switch element attributes or operations. For instance, this database is used in some embodiment to store the number of packets routed through a particular port of a particular switching element. Other examples of types of data stored in the database 815 include error messages, log files, warning messages, and billing data. Also, in some embodiments, the PNTD stores the results of operations performed by the application(s) 830 running on top of the NOS, while the PTD and hash table store only values generated by the NOS.
[0131] The PNTD in some embodiments has a database query manager that can process database queries, but as it is not a transactional database, this query manager cannot handle complex conditional transactional queries. In some embodiments, accesses to the PNTD are faster than accesses to the PTD but slower than accesses to the hash table 820.
[0132] Unlike the databases 810 and 815, the hash table 820 is not a database that is stored on disk or other non-volatile memory. Instead, it is a storage structure that is stored in volatile system memory (e.g., RAM). It uses hashing techniques that use hashed indices to quickly identify records that are stored in the table. This structure combined with the hash table's placement in the system memory allows this table to be accessed very quickly. To facilitate this quick access, a simplified query interface is used in some embodiments. For instance, in some embodiments, the hash table has just two queries: a Put query for writing values to the table and a Get query for retrieving values from the table. Some embodiments use the hash table to store data that change quickly. Examples of such quick-changing data include network entity status, statistics, state, uptime, link arrangement, and packet handling information. Furthermore, in some embodiments, the NOS uses the hash tables as a cache to store information that is repeatedly queried for, such as flow entries that will be written to multiple nodes. Some embodiments employ a hash structure in the NIB in order to quickly access records in the NIB. Accordingly, in some of these embodiments, the hash table 820 is part of the NIB data structure.
[0133] The PTD and the PNTD improve the resiliency of the NOS system by preserving network data on hard disks. If a NOS system fails, network configuration data will be preserved on disk in the PTD and log file information will be preserved on disk in the PNTD.
[0134] E. Multi-Instance Control System
[0135] Using a single NOS instance to control a network can lead to scaling and reliability issues. As the number of network elements increases, the processing power and/or memory capacity that are required by those elements will saturate a single node. Some embodiments further improve the resiliency of the control system by having multiple instances of NOS running on one or more computers, with each instance of NOS containing one or more of the secondary storage structures described above. The control applications in some embodiments partition the workload between the different instances in order to reduce each instance's workload. Also, in some embodiments, the multiple instances of NOS communicate the information stored in their storage layers to enable each instance of NOS to cover for the others in the event of a NOS instance failing.
[0136] FIG. 9 illustrates a multi-instance, distributed network control system 900 of some embodiments. This distributed system controls multiple switching elements 990 with three instances 905, 910, and 915. In some embodiments, the distributed system 900 allows different controller instances to control the operations of the same switch or of different switches.
[0137] As shown in FIG. 9 , each instance includes a NOS 925, a virtualization application 930, one or more control applications 935, and a coordination manager (CM) 920. For the embodiments illustrated in this figure, each NOS in the system 900 is shown to include a NIB 940 and three secondary storage structures, i.e., a PTD 945, a distributed hash table (DHT) instance 950, and a persistent non-transaction database (PNTD) 955. Other embodiments may not tightly couple the NIB and/or each of the secondary storage structures within the NOS. Also, other embodiments might not include each of the three secondary storage structures (i.e., the PTD, DHT instance, and PNTD) in each instance 905, 910, or 915. For example, one NOS instance 905 may have all three data structures whereas another NOS instance may only have the DHT instance.
[0138] In some embodiments, the system 900 maintains the same switch element data records in the NIB of each instance, while in other embodiments, the system 900 allows NIBs of different instances to store different sets of switch element data records. FIGS. 10-12 illustrate three different approaches that different embodiments employ to maintain the NIB records. In each of these three examples, two instances 1005 and 1010 are used to manage several switching elements having numerous attributes that are stored collectively in the NIB instances. This collection of the switch element data in the NIB instances is referred to as the global NIB data structure 1015 in FIGS. 10-12 .
[0139] FIG. 10 illustrates the approach of maintaining the entire global NIB data structure 1015 in each NOS instance 1005 and 1010. FIG. 11 illustrates an alternative approach of dividing the global NIB 1015 into two separate portions 1020 and 1025, and storing each of these portions in a different NOS instance (e.g., storing portion 1020 in controller instance 1005 while storing portion 1025 in controller instance 1010). FIG. 12 illustrates yet another alternative approach. In this example, the global NIB 1015 is divided into two separate, but overlapping portions 1030 and 1035, which are then stored separately by the two different instances (with instance 1005 storing portion 1030 and instance 1010 storing portion 1035). In the systems of some embodiments that store different portions of the NIB in different instances, one controller instance is allowed to query another controller instance to obtain a NIB record. Other systems of such embodiments, however, do not allow one controller instance to query another controller instance for a portion of the NIB data that is not maintained by the controller itself. Still others allow such queries to be made, but allow restrictions to be specified that would restrict access to some or all portions of the NIB.
[0140] The system 900 of some embodiments also replicates each NIB record in each instance in the PTD 945 of that instance in order to maintain the records of the NIB in a persistent manner. Also, in some embodiments, the system 900 replicates each NIB record in the PTDs of all the controller instances 905, 910, or 915, in order to protect against failures of individual controller instances (e.g., of an entire controller instance or a portion of the controller instance). Other embodiments, however, do not replicate each NIB record in each PTD and/or do not replicate the PTD records across all the PTDs. For instance, some embodiments only replicate a part but not all of the NIB data records of one controller instance in the PTD storage layer of that controller instance, and then replicate only this replicated portion of the NIB in all of the NIBs and PTDs of all other controller instances. Some embodiments also store a subset of the NIB records in another one of the secondary storage records, such as the DHT instance 950.
[0141] In some embodiments, the DHT instances (DHTI) 950 of all controller instances collectively store one set of records that are indexed based on hashed indices for quick access. These records are distributed across the different controller instances to minimize the size of the records within each instance and to allow the size of the DHT to be increased by adding additional DHT instances. According to this scheme, one DHT record is not stored in each controller instance. In fact, in some embodiments, each DHT record is stored in at most one controller instance. To improve the system's resiliency, some embodiments, however, allow one DHT record to be stored in more than one controller instance, so that in case one DHT record is no longer accessible because of one instance failure, that DHT record can be accessed from another instance. Some embodiments store in the DHT only the type of data that can be quickly re-generated, and therefore do not allow for replication of records across different DHT instances or allow only a small amount of such records to be replicated.
[0142] The PNTD 955 is another distributed data structure of the system 900 of some embodiments. For example, in some embodiments, each instance's PNTD stores the records generated by the NOS 925 or applications 930 or 935 of that instance or another instance. Each instance's PNTD records can be locally accessed or remotely accessed by other controller instances whenever the controller instances need these records. This distributed nature of the PNTD allows the PNTD to be scalable as additional controller instances are added to the control system 900. In other words, addition of other controller instances increases the overall size of the PNTD storage layer.
[0143] The PNTD in some embodiments is replicated partially across different instances. In other embodiments, the PNTD is replicated fully across different instances. Also, in some embodiments, the PNTD 955 within each instance is accessible only by the application(s) that run on top of the NOS of that instance. In other embodiments, the NOS can also access (e.g., read and/or write) to the PNTD 955. In yet other embodiments, the PNTD 955 of one instance is only accessible by the NOS of that instance.
[0144] By allowing different NOS instances to store the same or overlapping NIB records, and/or secondary storage structure records, the system improves its overall resiliency by guarding against the loss of data due to the failure of any NOS or secondary storage structure instance. In some embodiments, each of the three storages of the secondary storage layer uses a different distribution technique to improve the resiliency of a multiple NOS instance system. For instance, as mentioned above, the system 900 of some embodiments replicates the PTD across NOS instances so that every NOS has a full copy of the PTD to enable a failed NOS instance to quickly reload its PTD from another instance. In some embodiments, the system 900 distributes the PNTD with overlapping distributions of data across the NOS instances to reduce the damage of a failure. The system 900 in some embodiments also distributes the DHT fully or with minimal overlap across multiple controller instances in order to maintain the DHT instance within each instance small and to allow the size of the DHT to be increased by adding additional DHT instances.
[0145] For some or all of the communications between the distributed instances, the system 900 uses the CMs 920. The CM 920 in each instance allows the instance to coordinate certain activities with the other instances. Different embodiments use the CM to coordinate the different sets of activities between the instances. Examples of such activities include writing to the NIB, writing to the PTD, writing to the DHT, controlling the switching elements, facilitating intra-controller communication related to fault tolerance of controller instances, etc.
[0146] As mentioned above, different controller instances of the system 900 can control the operations of the same switching elements or of different switching elements. By distributing the control of these operations over several instances, the system can more easily scale up to handle additional switching elements. Specifically, the system can distribute the management of different switching elements and/or different portions of the NIB to different NOS instances in order to enjoy the benefit of efficiencies that can be realized by using multiple NOS instances. In such a distributed system, each NOS instance can have a reduced number of switches or reduce portion of the NIB under management, thereby reducing the number of computations each controller needs to perform to distribute flow entries across the switches and/or to manage the NIB. In other embodiments, the use of multiple NOS instances enables the creation of a scale-out network management system. The computation of how best to distribute network flow tables in large networks is a CPU intensive task. By splitting the processing over NOS instances, the system 900 can use a set of more numerous but less powerful computer systems to create a scale-out network management system capable of handling large networks.
[0147] To distribute the workload and to avoid conflicting operations from different controller instances, the system 900 of some embodiments designates one controller instance (e.g., 905) within the system 900 as the master of any particular NIB portion and/or any given switching element (e.g., 990c). Even with one master controller, different controller instance (e.g., 910 and 915) can request changes to different NIB portions and/or to different switching elements (e.g., 990c) controlled by the master (e.g., 905). If allowed, the master instance then effectuates this change and writes to the desired NIB portion and/or switching element. Otherwise, the master rejects the request.
[0148] FIG. 13 illustrates an example of specifying a master controller instance for a switch in a distributed system 1300 that is similar to the system 900 of FIG. 9 . In this example, two controllers 1305 and 1310 control three switching elements S1, S2 and S3, for two different users A and B. Through two control applications 1315 and 1320, the two users specify two different sets of logical data paths 1325 and 1330, which are translated into numerous records that are identically stored in two NIBs 1355 and 1360 of the two controller instances 1305 and 1310 by NOS instances 1345 and 1350 of the controllers.
[0149] In the example illustrated in FIG. 13 , both control applications 1315 and 1320 of both controllers 1305 and 1310 can modify records of the switching element S2 for both users A and B, but only controller 1305 is the master of this switching element. This example illustrates two different scenarios. The first scenario involves the controller 1305 updating the record S2b1 in switching element S2 for the user B. The second scenario involves the controller 1305 updating the records S2a1 in switching element S2 after the control application 1320 updates a NIB record S2a1 for switching element S2 and user A in NIB 1360. In the example illustrated in FIG. 13 , this update is routed from NIB 1360 of the controller 1310 to the NIB 1355 of the controller 1305, and subsequently routed to switching element S2.
[0150] Different embodiments use different techniques to propagate changes to the NIB 1360 of controller instance 1310 to the NIB 1355 of the controller instance 1305. For instance, to propagate changes, the system 1300 in some embodiments uses the secondary storage structures (not shown) of the controller instances 1305 and 1310. More generally, the distributed control system of some embodiments uses the secondary storage structures as communication channels between the different controller instances. Because of the differing properties of the secondary storage structures, these structures provide the controller instances with different mechanisms for communicating with each other. For instance, in some embodiments, different DHT instances can be different, and each DHT instance is used as a bulletin board for one or more instances to store data so that they or other instances can retrieve this data later. In some of these embodiments, the PTDs are replicated across all instances, and some or all of the NIB changes are pushed from one controller instance to another through the PTD storage layer. Accordingly, in the example illustrated in FIG. 13 , the change to the NIB 1360 could be replicated to the PTD of the controller 1310, and from there it could be replicated in the PTD of the controller 1305 and the NIB 1355.
[0151] Instead of propagating the NIB changes through the secondary storages, the system 1300 of some embodiments uses other techniques to change the record S2a1 in the switch S2 in response to the request from control application 1320. For instance, to propagate this update, the NOS 1350 of the controller 1310 in some embodiments sends an update command to the NOS 1345 of the controller 1305 (with the requisite NIB update parameters that identify the record and one or more new values for the record) to direct the NOS 1345 to modify the record in the NIB 1355 or in the switch S2. In response, the NOS 1345 would make the changes to the NIB 1355 and the switch S2 (if such a change is allowed). After this change, the controller instance 1310 would change the corresponding record in its NIB 1360 once it receives notification (from controller 1305 or through another notification mechanism) that the record in the NIB 1355 and/or switch S2 has changed.
[0152] Other variations to the sequence of operations shown in FIG. 13 could exist because some embodiments designate one controller instance as a master of a portion of the NIB, in addition to designating a controller instance as a master of a switching element. In some embodiments, different controller instances can be masters of a switch and a corresponding record for that switch in the NIB, while other embodiments require the controller instance to be master of the switch and all records for that switch in the NIB.
[0153] In the embodiments where the system 1300 allows for the designation of masters for switching elements and NIB records, the example illustrated in FIG. 13 illustrates a case where the controller instance 1310 is the master of the NIB record S2a1, while the controller instance 1305 is the master for the switch S2. If a controller instance other than the controller instance 1305 and 1310 was the master of the NIB record S2a1, then the request for the NIB record modification from the control application 1320 would have had to be propagated to this other controller instance. This other controller instance would then modify the NIB record and this modification would then cause the NIB 1355, the NIB 1360 and the switch S2 to update their records once the controller instances 1305 and 1310 are notified of this modification through any number of mechanisms that would propagate this modification to the controller instances 1305 and 1310.
[0154] In other embodiments, the controller instance 1305 might be the master of the NIB record S2a1, or the controller instance might be the master of switch S2 and all the records of its NIB. In these embodiments, the request for the NIB record modification from the control application 1320 would have to be propagated to the controller instance 1305, which would then modify the records in the NIB 1355 and the switch S2. Once this modification is made, the NIB 1360 would modify its record S2a1 once the controller instance 1310 is notified of this modification through any number of mechanisms that would propagate this modification to the controller instance 1310.
[0155] As mentioned above, different embodiments employ different techniques to facilitate communication between different controller instances. In addition, different embodiments implement the controller instances differently. For instance, in some embodiments, the stack of the control application(s) (e.g., 935 or 1315 in FIGS. 9 and 13 ), the virtualization application (e.g., 930 or 1335), and the NOS (e.g., 925 or 1345) is installed and runs on a single computer. Also, in some embodiments, multiple controller instances can be installed and run in parallel on a single computer. In some embodiments, a controller instance can also have its stack of components divided amongst several computers. For example, within one instance, the control application (e.g., 935 or 1315) can be on a first physical or virtual computer, the virtualization application (e.g., 930 or 1335) can be on a second physical or virtual computer, and the NOS (e.g., 925 or 1350) can be on a third physical or virtual computer.
[0156] FIG. 14 illustrates a particular distributed network control system 1400 of some embodiments of the invention. In several manners, this control system 1400 is similar to the control system 900 of FIG. 9 . For instance, it uses several different controller instances to control the operations of the same switching elements or of different switching elements. In the example illustrated in FIG. 14 , three instances 1405, 1410 and 1415 are illustrated. However, one of ordinary skill in the art will understand that the control system 1400 can have any number of controller instances.
[0157] Also, like the control system 900, each controller instance includes a NOS 1425, a virtualization application 1430, one or more control applications 1435, and a coordination manager (CM) 1420. Each NOS in the system 1400 includes a NIB 1440 and at least two secondary storage structures, e.g., a distributed hash table (DHT) 1450 and a PNTD 1455.
[0158] However, as illustrated in FIG. 14 , the control system 1400 has several additional and/or different features than the control system 900. These features include a NIB notification module 1470, NIB transfer modules 1475, a CM interface 1460, PTD triggers 1480, DHT triggers 1485, and master/slave PTDs 1445/1447.
[0159] In some embodiments, the notification module 1470 in each controller instance allows applications (e.g., a control application) that run on top of the NOS to register for callbacks when changes occur within the NIB. This module in some embodiments has two components, which include a notification processor and a notification registry. The notification registry stores the list of applications that need to be notified for each NIB record that the module 1470 tracks, while the notification processor reviews the registry and processes the notifications upon detecting a change in a NIB record that it tracks. The notification module as well as its notification registry and notification processor are a conceptual representation of the NIB-application layer notification components of some embodiments, as the system of these embodiments provides a separate notification function and registry within each NIB object that can be tracked by the application layer.
[0160] The transfer modules 1475 include one or more modules that allow data to be exchanged between the NIB 1440 on one hand, and the PTD or DHT storage layers in each controller instance on the other hand. In some embodiments, the transfer modules 1475 include an import module for importing changes from the PTD/DHT storage layers into the NIB, and an export module for exporting changes in the NIB to the PTD/DHT storage layers.
[0161] Unlike the control system 900 that has the same type of PTD in each instance, the control system 1400 only has PTDs in some of the NOS instances, and of these PTDs, one of them serves as master PTD 1445, while the rest serve as slave PTDs 1447. In some embodiments, NIB changes within a controller instance that has a slave PTD are first propagated to the master PTD 1445, which then direct the controller instance's slave PTD to record the NIB change. The master PTD 1445 similarly receives NIB changes from controller instances that do not have either master or slave PTDs.
[0162] In the control system 1400, the coordination manager 1420 includes the CM interface 1460 to facilitate communication between the NIB storage layer and the PTD storage layer. The CM interface also maintains the PTD trigger list 1480, which identifies the modules of the system 1400 to callback whenever the CM interface 1460 is notified of a PTD record change. A similar trigger list 1485 for handling DHT callbacks is maintained by the DHT instance 1450. The CM 1420 also has a DHT range identifier (not shown) that allows the DHT instances of different controller instances to store different DHT records in different DHT instances.
[0163] Also, in the control system 1400, the PNTD is not placed underneath the NIB storage layer. This placement is to signify that the PNTD in the control system 1400 does not exchange data directly with the NIB storage layer, but rather is accessible solely by the application(s) (e.g., the control application) running on top of the NOS 1425 as well as other applications of other controller instances. This placement is in contrast to the placement of the PTD storage layer 1445/1447 and DHT storage layers 1450, which are shown to be underneath the NIB storage layer because the PTD and DHT are not directly accessible by the application(s) running on top of the NOS 1425. Rather, in the control system 1400, data are exchanged between the NIB storage layer and the PTD/DHT storage layers of the same or different instances.
[0164] The control system 1400 uses the PTD, DHT and PNTD storage layers to facilitate communication between the different controller instances. In some embodiments, each of the three storages of the secondary storage layer uses a different storage and distribution technique to improve the resiliency of the distributed, multi-instance system 1400. For instance, the system 1400 of some embodiments replicates the PTD across NOS instances so that every NOS has a full copy of the PTD to enable a failed NOS instance to quickly reload its PTD from another instance. On the other hand, the system 1400 in some embodiments distributes the PNTD with partial overlapping distributions of data across the NOS instances to reduce the damage of a failure. Similarly, the system 1400 in some embodiments distributes the DHT fully or with minimal overlap across multiple controller instances in order to maintain the DHT instance within each instance small. Also, using this approach, allows the system to increase the size of the DHT by adding additional DHT instances in order to make the system more scalable.
[0165] One of the advantages of this system is that it can be configured in any number of ways. In some embodiments, this system provides great flexibility to specify the configurations for the components of the system in order to customize its storage and data distribution scheme to achieve the best tradeoff of scalability and speed on one hand, and reliability and consistency on the other hand. Attributes of the storage structures that affect scalability, speed, reliability and consistency considerations include the speed of the storage (e.g., RAM versus disk access speed), the reliability of the storage (e.g., persistent non-volatile storage of disk versus volatile storage of RAM), the query interface of the storage (e.g., simple Put/Get query interface of DHT versus more robust transactional database queries of PTD in some embodiments), and the number of points of failures in the system (e.g., a single point of failure for a DHT record versus multiple points of failure for a PTD record in some embodiments).
[0166] Through the configurations of its components, the system can be configured (1) on how to distribute the data records between the NIB and the secondary storage structures within one instance (e.g., which secondary storage should store which NIB record), (2) on how to distribute the data records between the NIBs of different instances (e.g., which NIB records should be replicated across different controller instances), (3) on how to distribute the data records between the secondary storage structures within one instance (e.g., which secondary storage records contain which records), (4) on how to distribute the data records between the secondary storage structures of different instances (e.g., which secondary storage records are replicated across different controller instances), (5) on how to distribute secondary storage instances across controller instances (e.g., whether to put a PTD, a DHT, or a Stats database instances within each controller or whether to put different subset of these storages within different instances), and (6) on how to replicate data records in the distributed secondary storage structures (e.g., whether to replicated PTD fully across all instances, whether to replicate some or all DHT records across more than one instance, etc.). The system also allows the coordination between the different controller instances as to the master control over different switching elements or different portions of the NIB to be configured differently. In some embodiments, some or all of these configurations can be specified by applications (e.g., a control application or a virtualization application) that run on top of the NOS.
[0167] In some embodiments, as noted above, the CMs facilitate intra-controller communication related to fault tolerance of controller instances. For instance, the CMs implement the intra-controller communication through the secondary storage layers described above. A controller instance in the control system may fail due to any number of reasons. (e.g., hardware failure, software failure, network failure, etc.). Different embodiments may use different techniques for determining whether a controller instance has failed. In some embodiments, Paxos protocol is used to determine whether a controller instance in the control system has failed. While some of these embodiments may use Apache Zookeeper to implement the Paxos protocols, other embodiments may implement Paxos protocol in other ways.
[0168] Some embodiments of the CM 1420 may utilize defined timeouts to determine whether a controller instance has failed. For instance, if a CM of a controller instance does not respond to a communication (e.g., sent from another CM of another controller instance in the control system) within an amount of time (i.e., a defined timeout amount), the non-responsive controller instance is determined to have failed. Other techniques may be utilized to determine whether a controller instance has failed in other embodiments.
[0169] When a master controller instance fails, a new master for the logical data path sets and the switching elements needs to be determined. Some embodiments of the CM 1420 make such determination by performing a master election process that elects a master controller instance (e.g., for partitioning management of logical data path sets and/or partitioning management of switching elements). The CM 1420 of some embodiments may perform a master election process for electing a new master controller instance for both the logical data path sets and the switching elements of which the failed controller instance was a master. However, the CM 1420 of other embodiments may perform (1) a master election process for electing a new master controller instance for the logical data path sets of which the failed controller instance was a master and (2) another master election process for electing a new master controller instance for the switching elements of which the failed controller instance was a master. In these cases, the CM 1420 may determine two different controller instances as new controller instances: one for the logical data path sets of which the failed controller instance was a master and another for the switching elements of which the failed controller instance was a master.
[0170] In some embodiments, the master election process is further for partitioning management of logical data path sets and/or management of switching elements when a controller instance is added to the control system. In particular, some embodiments of the CM 1420 perform the master election process when the control system 1400 detects a change in membership of the controller instances in the control system 1400. For instance, the CM 1420 may perform the master election process to redistribute a portion of the management of the logical data path sets and/or the management of the switching elements from the existing controller instances to the new controller instance when the control system 1400 detects that a new network controller has been added to the control system 1400. However, in other embodiments, redistribution of a portion of the management of the logical data path sets and/or the management of the switching elements from the existing controller instances to the new controller instance does not occur when the control system 1400 detects that a new network controller has been added to the control system 1400. Instead, the control system 1400 in these embodiments assigns unassigned logical data path sets and/or switching elements (e.g., new logical data path sets and/or switching elements or logical data path sets and/or switching elements from a failed network controller) to the new controller instance when the control system 1400 detects the unassigned logical data path sets and/or switching elements.
II. Single NOS Instance
[0171] FIG. 15 conceptually illustrates a single NOS instance 1500 of some embodiments. This instance can be used as a single NOS instance in the distributed control system 1400 that employs multiple NOS instances in multiple controller instances. Alternatively, with slight modifications, this instance can be used as a single NOS instance in a centralized control system that utilizes only a single controller instance with a single NOS instance. The NOS instance 1500 supports a wide range of control scenarios. For instance, in some embodiments, this instance allows an application running on top of it (e.g., a control or virtualization application) to customize the NIB data model and have control over the placement and consistency of each element of the network infrastructure.
[0172] Also, in some embodiments, the NOS instance 1500 provides multiple methods for applications to gain access to network entities. For instance, in some embodiments, it maintains an index of all of its entities based on the entity identifier, allowing for direct querying of a specific entity. The NOS instance of some embodiments also supports registration for notifications on state changes or the addition/deletion of an entity. In some embodiments, the applications may further extend the querying capabilities by listening for notifications of entity arrival and maintaining their own indices. In some embodiments, the control for a typical application is fairly straightforward. It can register to be notified on some state change (e.g., the addition of new switches and ports), and once notified, it can manipulate the network state by modifying the NIB data tuple(s) (e.g., key-value pairs) of the affected entities.
[0173] As shown in FIG. 15 , the NOS 1500 includes an application interface 1505, a notification processor 1510, a notification registry 1515, a NIB 1520, a hash table 1524, a NOS controller 1522, a switch controller 1525, transfer modules 1530, a CM 1535, a PTD 1540, a CM interface 1542, a PNTD 1545, a DHT instance 1550, switch interface 1555, and NIB request list 1560.
[0174] The application interface 1505 is a conceptual illustration of the interface between the NOS and the applications (e.g., control and virtualization applications) that can run on top of the NOS. The interface 1505 includes the NOS APIs that the applications (e.g., control or virtualization application) running on top of the NOS use to communicate with the NOS. In some embodiments, these communications include registrations for receiving notifications of certain changes in the NIB 1520, queries to read certain NIB attributes, queries to write to certain NIB attributes, requests to create or destroy NIB entities, instructions for configuring the NOS instance (e.g., instructions regarding how to import or export state), requests to import or export entities on demand, and requests to synchronize NIB entities with switching elements or other NOS instances.
[0175] The switch interface 1555 is a conceptual illustration of the interface between the NOS and the switching elements that run below the NOS instance 1500. In some embodiments, the NOS accesses the switching elements by using the OpenFlow or OVS APIs provided by the switching elements. Accordingly, in some embodiments, the switch interface 1555 includes the set of APIs provided by the OpenFlow and/or OVS protocols.
[0176] The NIB 1520 is the data storage structure that stores data regarding the switching elements that the NOS instance 1500 is controlling. In some embodiments, the NIB just stores data attributes regarding these switching elements, while in other embodiments, the NIB also stores data attributes for the logical data path sets defined by the user. Also, in some embodiments, the NIB is a hierarchical object data structure (such as the ones described above) in which some or all of the NIB objects not only include data attributes (e.g., data tuples regarding the switching elements) but also include functions to perform certain functionalities of the NIB. For these embodiments, one or more of the NOS functionalities that are shown in modular form in FIG. 15 are conceptual representations of the functions performed by the NIB objects.
[0177] The hash table 1524 is a table that stores a hash value for each NIB object and a reference to each NIB object. Specifically, each time an object is created in the NIB, the object's identifier is hashed to generate a hash value, and this hash value is stored in the hash table along with a reference (e.g., a pointer) to the object. The hash table 1524 is used to quickly access an object in the NIB each time a data attribute or function of the object is requested (e.g., by an application or secondary storage). Upon receiving such requests, the NIB hashes the identifier of the requested object to generate a hash value, and then uses that hash value to quickly identify in the hash table a reference to the object in the NIB. In some cases, a request for a NIB object might not provide the identity of the NIB object but instead might be based on non-entity name keys (e.g., might be a request for all entities that have a particular port). For these cases, the NIB includes an iterator that iterates through all entities looking for the key specified in the request.
[0178] The notification processor 1510 interacts with the application interface 1505 to receive NIB notification registrations from applications running on top of the NOS and other modules of the NOS (e.g., such as an export module within the transfer modules 1530). Upon receiving these registrations, the notification processor 1510 stores notification requests in the notification registry 1515 that identifies each requesting party and the NIB data tuple(s) that the requesting party is tracking
[0179] As mentioned above, the system of some embodiments embeds in each NIB object a function for handling notification registrations for changes in the value(s) of that NIB object. For these embodiments, the notification processor 1510 is a conceptual illustration of the amalgamation of all the NIB object notification functions. Other embodiments, however, do not provide notification functions in some or all of the NIB objects. The NOS of some of these embodiments therefore provides an actual separate module to serve as the notification processor for some or all of the NIB objects.
[0180] When some or all of the NIB objects have notification functions in some embodiments, the notification registry for such NIB objects are typically kept with the objects themselves. Accordingly, for some of these embodiments, the notification registry 1515 is a conceptual illustration of the amalgamation of the different sets of registered requestors maintained by the NIB objects. Alternatively, when some or all of the NIB objects do not have notification functions and notification services are needed for these objects, some embodiments use a separate notification registry 1515 for the notification processor 1510 to use to keep track of the notification requests for such objects.
[0181] The notification process serves as only one manner for accessing the data in the NIB. Other mechanisms are needed in some embodiments for accessing the NIB. For instance, the secondary storage structures (e.g., the PTD 1540 and the DHT instance 1550) also need to be able to import data from and export data to the NIB. For these operations, the NOS 1500 uses the transfer modules 1530 to exchange data between the NIB and the secondary storage structure.
[0182] In some embodiments, the transfer modules include a NIB import module and a NIB export module. These two modules in some embodiments are configured through the NOS controller 1522, which processes configuration instructions that it receives through the interfaces 1505 from the applications above the NOS. The NOS controller 1522 also performs several other operations. As with the notification processor, some or all of the operations performed by the NOS controller are performed by one or more functions of NIB objects, in some of the embodiments that implement one or more of the NOS 1500 operations through the NIB object functions. Accordingly, for these embodiments, the NOS controller 1522 is a conceptual amalgamation of several NOS operations, some of which are performed by NIB object functions.
[0183] Other than configuration requests, the NOS controller 1522 of some embodiments handles some of the other types of requests directed at the NOS instance 1500. Examples of such other requests include queries to read certain NIB attributes, queries to write to certain NIB attributes, requests to create or destroy NIB entities, requests to import or export entities on demand, and requests to synchronize NIB entities with switching elements or other NOS instances.
[0184] In some embodiments, the NOS controller stores requests to change the NIB on the NIB request list 1560. Like the notification registry, the NIB request list in some embodiments is a conceptual representation of a set of distributed requests that are stored in a distributed manner with the objects in the NIB. Alternatively, for embodiments in which some or all of the NIB objects do not maintain their modification requests locally, the request list is a separate list maintained by the NOS 1500. The system of some of these embodiments that maintains the request list as a separate list, stores this list in the NIB in order to allow for its replication across the different controller instances through the PTD storage layer and/or the DHT storage layer. This replication allows the distributed controller instances to process in a uniform manner a request that is received from an application operating on one of the controller instances.
[0185] Synchronization requests are used to maintain consistency in NIB data in some embodiments that employ multiple NIB instances in a distributed control system. For instance, the NIB of some embodiments provides a mechanism to request and release exclusive access to the NIB data structure of the local instance. As such, an application running on top of the NOS instance(s) is only assured that no other thread is updating the NIB within the same controller instance. The application therefore needs to implement mechanisms external to the NIB to coordinate an effort with other controller instances to control access to the NIB. In some embodiments, this coordination is static and requires control logic involvement during failure conditions.
[0186] Also, in some embodiments, all NIB operations are asynchronous, meaning that updating a network entity only guarantees that the update will eventually be pushed to the corresponding switching element and/or other NOS instances. While this has the potential to simplify the application logic and make multiple modifications more efficient, often it is useful to know when an update has successfully completed. For instance, to minimize disruption to network traffic, the application logic of some embodiments requires the updating of forwarding state on multiple switches to happen in a particular order (to minimize, for example, packet drops). For this purpose, the API of some embodiments provides the synchronization request primitive that calls back one or more applications running on top of the NOS once the state has been pushed for an entity. After receiving the callback, the control application of some embodiments will then inspect the content of the NIB and determine whether its state is still as originally intended. Alternatively, in some embodiments, the control application can simply rely on NIB notifications to react to failures in modifications as they would react to any other network state changes.
[0187] The NOS controller 1522 is also responsible for pushing the changes in its corresponding NIB to switching elements for which the NOS 1500 is the master. To facilitate writing such data to the switching element, the NOS controller 1522 uses the switch controller 1525. It also uses the switch controller 1525 to read values from a switching element. To access a switching element, the switch controller 1525 uses the switch interface 1555, which as mentioned above uses OpenFlow or OVS, or other known set of APIs in some embodiments.
[0188] Like the PTD and DHT storage structures 1445 and 1450 of the control system 1400 of FIG. 14 , the PTD and DHT storage structures 1540 and 1550 of FIG. 15 interface with the NIB and not the application layer. In other words, some embodiments only limit PTD and DHT layers to communicate between the NIB layer and these two storage layers, and to communicate between the PTD/DHT storages of one instance and PTD/DHT storages of other instances. Other embodiments, however, allow the application layer (e.g., the control application) within one instance to access the PTD and DHT storages directly or through the transfer modules 1530. These embodiments might provide PTD and DHT access handles (e.g., APIs to DHT, PTD or CM interface) as part of the application interface 1505, or might provide handles to the transfer modules that interact with the PTD layer (e.g., the CM interface 1542) and DHT layers, so that the applications can directly interact with the PTD and DHT storage layers.
[0189] Also, like structures 1445 and 1450, the PTD 1540 and DHT instance 1550 have corresponding lists of triggers that are respectively maintained in the CM interface 1542 and the DHT instance 1550. Also, like the PNTD 1455 of the control system 1400, the PNTD 1545 of FIG. 15 does not interface with the NIB 1520. Instead, it interfaces with the application layer through the application interface 1505. Through this interface, the applications running on top of the NOS can store data in and retrieve data from the PNTD. Also, applications of other controller instances can access the PNTD 1545, as shown in FIG. 15 .
III. Control Data Pipeline
[0190] FIG. 16 further elaborates on the propagation of the instructions to control a managed switch through the various processing layers of the controller instances of some embodiments of the invention. This figure illustrates a control data pipeline 1600 that translates and propagates control plane data through three processing layers of the same or different controller instances to a managed switch 1625. These three layers are the control application 1605, the virtualization application 1610, and the NOS 1615. In some embodiments, these three layers are in the same controller instance. However, other arrangements of these layers exist in other embodiments. For instance, in other embodiments, only the control and virtualization applications 1605 and 1610 and the NIB that initially stores the output of the virtualization application 1610 are in the same controller instance, but the functionality to propagate the generated physical control plane data reside in a NOS of another controller instance (not shown). In these other embodiments, the physical control plane data is transferred from the initial NIB to the NIB of a NOS of the other controller instance, before this other NOS pushes the control plane data to the managed switch.
[0191] As shown in FIG. 16 , the control application 1605 in some embodiments has two logical planes 1630 and 1635 that can be used to express the input and output to this application. In some embodiments, the first logical plane 1630 is a logical control plane that includes a collection of higher-level constructs that allow the control application and its users to specify one or more logical data path sets within the logical control plane for one or more users. The second logical plane 1635 in some embodiments is the logical forwarding plane, which represents the logical data path sets of the users in a format that can be processed by the virtualization application 1610. In this manner, the two logical planes 1630 and 1635 are virtualization space analogs of the control and forwarding planes 1655 and 1660 that are typically can be found in a typical managed switch 1625, as shown in FIG. 16 .
[0192] In some embodiments, the control application 1605 defines and exposes the logical control plane constructs with which the application itself or users of the application define different logical data path sets within the logical control plane. For instance, in some embodiments, the logical control plane data 1630 includes logical ACL data, etc. Some of this data (e.g., logical ACL data) can be specified by the user, while other such data (e.g., the logical L2 or L3 records) are generated by the control application and may not be specified by the user. In some embodiments, the control application 1605 generates and/or specifies such data in response to certain changes to the NIB (which indicate changes to the managed switches and the managed data path sets) that the control application 1605 detects.
[0193] In some embodiments, the logical control plane data (i.e., the LDPS data that is expressed in terms of the control plane constructs) can be initially specified without consideration of current operational data from the managed switches and without consideration of the manner by which this control plane data will be translated to physical control plane data. For instance, the logical control plane data might specify control data for one logical switch that connects five computers, even though this control plane data might later be translated to physical control data for three managed switches that implement the desired switching between the five computers.
[0194] The control application includes a set of modules for converting any logical data path set within the logical control plane to a logical data path set in the logical forwarding plane 1635. In some embodiments, the control application 1605 uses the nLog table mapping engine to perform this conversion. The control application's use of the nLog table mapping engine to perform this conversion is further described below and is also further described in U.S. patent application Ser. No. 13/177,532, entitled “Network Control Apparatus and Method”, filed concurrently with this application, now published as US2013/0058339, which is incorporated by reference in this application. The control application also includes a set of modules for pushing the LDPS from the logical forwarding plane 1635 of the control application 1605 to a logical forwarding plane 1640 of the virtualization application 1610.
[0195] The logical forwarding plane 1640 includes one or more logical data path sets of one or more users. The logical forwarding plane 1640 in some embodiments includes logical forwarding data for one or more logical data path sets of one or more users. Some of this data is pushed to the logical forwarding plane 1640 by the control application, while other such data are pushed to the logical forwarding plane by the virtualization application detecting events in the NIB 1620 as further described below for some embodiments.
[0196] In addition to the logical forwarding plane 1640, the virtualization application 1610 includes the physical control plane 1645. The physical control plane 1645 includes one or more physical control path sets of one or more users. The virtualization application includes a set of modules for converting any LDPS within the logical forwarding plane 1640 to a physical control data path set in the physical control plane 1645. In some embodiments, the virtualization application 1610 uses the nLog table mapping engine to perform this conversion. The virtualization application also includes a set of modules (not shown) for pushing the physical control plane data from the physical control plane 1645 of the virtualization application 1610 into the NIB 1620 of the NOS 1615.
[0197] From the NIB, the physical control plane data is later pushed into the managed switch 1625, as shown in FIG. 16 . As mentioned above, the physical control plane data in some instances of some embodiments is pushed to the managed switch by the NOS of the same controller instance that has the control application 1605 and virtualization application 1610, but in other instance is pushed to the managed switch by the NOS of another controller instance (not shown). The managed switch 1625 then converts this physical control plane data to physical forwarding plane data that specifies the forwarding behavior of the managed switch.
[0198] In some embodiments, the physical control plane data that is propagated to the managed switch 1650 allows this switch to perform the logical data processing on data packets that it processes in order to effectuate the processing of the logical data path sets specified by the control application. In some such embodiments, physical control planes include control plane data for operating in the physical domain and control plane data for operating in the logical domain. In other words, the physical control planes of these embodiments include control plane data for processing network data (e.g., packets) through managed switches to implement physical switching and control plane data for processing network data through managed switches in order to implement the logical switching. In this manner, the physical control plane facilitates implementing logical switches across managed switches. The use of the propagated physical control plane to implement logical data processing in the managed switches is further described in U.S. patent application Ser. No. 13/177,535, entitled “Hierarchical Managed Switch Architecture,” filed concurrently herewith, now published as US2013/0058250. US2013/0058250 is incorporated by reference in this application.
[0199] In addition to pushing physical control plane data to the NIB 1620, the control and virtualization applications 1605 and 1610 also store logical control plane data and logical forwarding plane data in the NIB. These embodiments store such data in the NIB for a variety of reasons. For instance, in some embodiments, the NIB 1620 serves as a medium for communications between different controller instances, and the storage of such data in the NOB facilitates the relaying of such data across different controller instances.
[0200] FIG. 16 illustrates the control data pipeline 1600 through three processing layers of the same or different controller instances to a managed switch 1625. However, in some embodiments, the control data pipeline 1600 may have two processing layers instead of three with the upper layer being a single application that performs the functionalities of both the control application 1605 and the virtual application 1610. The dashed box encompassing the two applications indicates that a single virtualization application (also called network hypervisor) may replace these two applications 1605 and 1610 in some embodiments. In such embodiments, the control application 1605 would form the front end of this network hypervisor, and would create and populate the logical data path sets. The virtualization application 1610 in these embodiments would form the back end of the network hypervisor, and would convert the logical data path sets to physical data path sets that are defined in the physical control plane.
[0201] FIG. 17 illustrates another perspective on the operation of the control, virtualization, and NOS applications of some embodiments. The perspective provided in this figure is meant to emphasize that one or more controller instances can execute these applications in a distributed manner in parallel. Specifically, this figure replaces the control application 1605, the virtualization application 1610, and the NOS 1615 of FIG. 16 , with a control layer 1705, a virtualization layer 1710, and a NOS layer 1715. Each of these layers represents one or more applications that can be executing in parallel on one or more controller instances. Collectively these three layers represent a control system that can be operated as a single controller instance, or can be operated in a distributed manner by several controller instances.
[0202] FIG. 17 also provides an example of logical data path sets that are created by the control applications of some embodiments, and the mapping of the created logical data path sets to the resources of the managed switches. In this example, the logical data path sets are several logical switches 1770 that are specified by the control application layer 1705. A logical switch in some embodiments is a simulated/conceptual switch that is defined (e.g., by a user) to conceptually describe a set of switching behaviors for a switch. The control system of some embodiments (such as the system illustrated in FIG. 17 ) implements this logical switch across one or more physical switches, which as mentioned above may be hardware switches, software switches, or virtual switches defined on top of other switches.
[0203] Each logical switch has two logical planes 1730 and 1735 that can be used to express the input and output to the logical switch. In some embodiments, the logical plane 1730 is a logical control plane (denoted by “LCP” in the figure) that includes a collection of higher-level constructs that allow the control application layer and its user to specify one or more logical data path sets within the logical control plane for the user. The second logical plane 1735 in some embodiments is the logical forwarding plane (denoted by “LFP” in the figure), which represents the logical data path sets of the user in a format that can be processed by the virtualization application layer 1710. Because of these two logical planes 1730 and 1735, the logical switches appear as virtualization space analogs of the control and forwarding planes 1755 and 1760 that typically can be found in managed switches, as shown in FIG. 17 .
[0204] This figure then illustrates that through the virtualization application layer 1710 and the NOS layer 1715, the logical switches 1770 can be implemented in three managed switches 1725. The number of logical switches 1770 may be less or more than three. That is, the number of logical switches 1770 in some embodiments does not have to match to the number of managed switches that implement the logical switches. To implement the logical switches 1770 in the three managed switches, the virtualization application layer 1710 converts the logical forwarding plane data of the logical switches into physical control plane data, and the NOS layer 1715 pushes this data to the managed switches 1725. As mentioned above, the pushed physical control plane data allows the managed switches to perform physical switching operations in both the physical and logical data processing domains.
IV. Virtualization Application
[0205] As mentioned above, the virtualization application of some embodiments specifies the manner by which different LDPS' of different users of a network control system can be implemented by the switching elements managed by the network control system. In some embodiments, the virtualization application specifies the implementation of the LDPS' within the managed switching element infrastructure by performing conversion operations. These conversion operations convert the LDPS' data records (also called data tuples below) to the control data records (e.g., physical control plane data) that are initially stored within the managed switching elements and then used by the switching elements to produce forwarding plane data (e.g., flow entries) for defining forwarding behaviors of the switches. The conversion operations also produce other data (e.g., in tables) that specify network constructs (e.g., tunnels, queues, queue collections, etc.) that should be defined within and between the managed switching elements. As described in the above-mentioned U.S. patent application Ser. No. 13/177,535, now published as US2013/0058250, entitled “Hierarchical Managed Switch Architecture,” the network constructs also include managed software switching elements that are dynamically deployed or pre-configured managed software switching elements that are dynamically added to the set of managed switching elements.
[0206] FIG. 18 conceptually illustrates an example of such conversion operations that the virtualization application of some embodiments performs. This figure conceptually illustrates a process 1800 that the virtualization application performs to generate data tuples based on input event data. As shown in FIG. 18 , the process 1800 initially receives (at 1805) data regarding an input event. The input event data may be logical forwarding plane data that the control application generates in some embodiments from the logical control plane data. The input event data in some embodiments may also be physical forwarding plane data or physical control plane data received from the NIB. In some embodiments, the process 1800 receives the physical forwarding data from a NIB monitor that monitors the NIB to detect a change in the NIB that reflects a change in one or more managed switching elements.
[0207] At 1810, the process 1800 then performs a filtering operation to determine whether this instance of the virtualization application is responsible for the input event data. As described above, several instances of the virtualization application may operate in parallel to control multiple sets of logical data paths in some embodiments. In these embodiments, each virtualization application uses the filtering operation to filter out input data that does not relate to the virtualization application's logical data path set. To perform this filtering operation, the virtualization application of some embodiments includes a filter module. This module in some embodiments is a standalone module, while in other embodiments it is implemented by a table mapping engine (e.g., implemented by the join operations performed by the table mapping engine) that maps records between input tables and output tables of the virtualization application, as further described below.
[0208] Next, at 1815, the process determines whether the filtering operation has filtered out the received input event data. The filtering operation filters out the input event data in some embodiments when the input event data does not fall within one of the logical data path sets that are the responsibility of the virtualization application. When the process determines (at 1815) that the filtering operation has filtered out the input event the process ends. Otherwise, the process 1800 transitions to 1820.
[0209] At 1820, a converter of the virtualization application generates one or more sets of data tuples based on the received input event data. In some embodiments, the converter is a table mapping engine that performs a series of table mapping operations on the input event data to map the input event data to other data tuples. As mentioned above, this table mapping engine also performs the filtering operation in some embodiments. One example of such a table mapping engine is an nLog table-mapping engine which will be described bellow.
[0210] In some embodiments, the data tuples that the process 1800 generates may include data (e.g., physical control plane data) that the process has to push down to the NIB. Accordingly, at 1825, the process publishes to the NIB any data tuples that it has generated if such publication is necessary. After 1825, the process ends.
[0211] The virtualization application in some embodiments performs its mapping operations by using the nLog table mapping engine, which, as described above, is a variation of the datalog table mapping technique. Datalog is used in the field of database management to map one set of tables to another set of tables. Datalog is not a suitable tool for performing table mapping operations in a virtualization application of a network control system as its current implementations are often slow. Accordingly, the nLog engine of some embodiments is custom designed to operate quickly so that it can perform the real time mapping of the LDPS data tuples to the data tuples of the managed switching elements. This custom design is based on several custom design choices. For instance, some embodiments compile the nLog table mapping engine from a set of high level declaratory rules that are expressed by an application developer (e.g., by a developer of a control application). In some of these embodiments, one custom design choice that is made for the nLog engine is to allow the application developer to use only the AND operator to express the declaratory rules. By preventing the developer from using other operators (such as ORs, XORs, etc.), these embodiments ensure that the resulting rules of the nLog engine are expressed in terms of AND operations that are faster to execute at run time.
[0212] Another custom design choice relates to the join operations performed by the nLog engine. Join operations are common database operations for creating association between records of different tables. In some embodiments, the nLog engine limits its join operations to inner join operations (also called as internal join operations) because performing outer join operations (also called as external join operations) can be time consuming and therefore impractical for real time operation of the engine.
[0213] Yet another custom design choice is to implement the nLog engine as a distributed table mapping engine that is executed by several different virtualization applications. Some embodiments implement the nLog engine in a distributed manner by partitioning management of logical data path sets. Each logical data path set includes logical data paths that are specified for a single user of the control system. Partitioning management of the logical data path sets involves specifying for each particular logical data path set only one controller instance as the instance responsible for specifying the NIB records associated with that particular logical data path set. For instance, when the control system uses three switching elements to specify five logical data path sets for five different users with two different controller instances, one controller instance can be the master for NIB records relating to two of the logical data path sets while the other controller instance can be the master for the NIB records for the other three logical data path sets. Partitioning management of logical data path sets ensures that conflicting values for the same logical data path sets are not written to the NIB by two different controller instances, and thereby alleviates the applications running on top of NOS from guarding against the writing of such conflicting values.
[0214] Partitioning management of the LDPS' also assigns in some embodiments the table mapping operations for each LDPS to the nLog engine of the controller instance responsible for the LDPS. The distribution of the nLog table mapping operations across several nLog instances reduces the load on each nLog instance and thereby increases the speed by which each nLog instance can complete its mapping operations. Also, this distribution reduces the memory size requirement on each machine that executes a controller instance. As further described below, some embodiments partition the nLog table mapping operations across the different instances by designating the first join operation that is performed by each nLog instance to be based on the LDPS parameter. This designation ensures that each nLog instance's join operations fail and terminate immediately when the instance has started a set of join operations that relate to a LDPS that is not managed by the nLog instance.
[0215] A more detailed example of the nLog mapping engine and the virtualization application is described in sub-sections A-E below. Sub-section A initially describes the software architecture of the virtualization application of some embodiments. Sub-section B then describes further the parallel, distributed management of the LDPS. Sub-section C next describes one manner for designing the nLog mapping engine. Sub-section D then describes the nLog engine's table mapping operations in response to an external event from the NIB or an internal event that is generated by the nLog engine. Lastly, sub-section E provides code-based examples that describe how a portion of the nLog engine is specified and how this portion later operates to perform its mapping operations.
[0216] A. Architecture
[0217] FIG. 19 illustrates a virtualization application 1900 of some embodiments of the invention. This application 1900 is used in some embodiments as the virtualization application 1430 of FIG. 14 . The virtualization application 1900 uses an nLog table mapping engine to map input tables that contain LDPS data tuples to data tuples for defining managed switching elements, attributes of the managed switching elements, and flow entries for the managed switching elements. This application resides between a control application 1905 that generates LDPS data tuples, and a NOS 1965 that contains a NIB 1960 that stores the data tuples generated by the nLog table mapping engine. More specifically, the control application 1905 allows different users to define different logical data path sets (LDPS), which specify the desired switching configurations of the users. The control application 1905 also reacts to changes in the NIB to modify the LDPS'. The virtualization application 1900 through its mapping operations converts each of the LDPS of each user into a set of data tuples to populate the NIB. The virtualization application then populates the NIB 1960 through the NIB Publisher 1955 with the generated sets of data tuples. When the NOS 1965 subsequently propagates the NIB data tuples for a particular user to the switching element(s), the NOS completes the deployment of the user's switching configuration to one or more switching elements. In some embodiments, the virtualization application is executed on the same machine with the control application and the NOS. However, the virtual application, the control application, and the NOS do not have to run on the same machine in other embodiments. That is, one of these applications or each of these applications may run on a different computer.
[0218] As shown in FIG. 19 , the virtualization application 1900 includes a set of rule-engine input tables 1910, a set of function and constant tables 1915, a query manager 1920, a rules engine 1925, a set of rule-engine output tables 1945, a NIB monitor 1950, a NIB publisher 1955, and a compiler 1935. The compiler 1935 is one component of the application that operates at a different instance in time than the application's other components. The compiler operates when a developer needs to specify the rules engine for a particular control application and/or virtualized environment, whereas the rest of the application's modules operate at run time when the application interfaces with the control application and the NOS to deploy and monitor logical data path sets specified by one or more users.
[0219] In some embodiments, the compiler 1935 takes a relatively small set (e.g., few hundred lines) of declarative instructions 1940 that are specified in a declarative language and converts these into a large set (e.g., thousands of lines) of code that specify the operation of the rules engine 1925, which performs the application's table mapping as further described below. As such, the compiler greatly simplifies the virtualization application developer's process of defining and updating the virtualization application. This is because the compiler allows the developer to use a high level programming language that allows a compact definition of the virtualization application's complex mapping operation and to subsequently update this mapping operation in response to any number of changes (e.g., changes in the networking functions supported by the virtualization application, changes to desired behavior of the virtualization application, etc.).
[0220] In some embodiments, the rule-engine (RE) input tables 1910 include tables with logical data and/or switching configurations (e.g., access control list configurations, private virtual network configurations, port security configurations, etc.) specified by the user and/or the virtualization application. They also include in some embodiments tables that contain physical data (i.e., non-logical data) from the switching elements managed by the virtualized control system. In some embodiments, such physical data includes data regarding the managed switching elements (e.g., physical control plane data) and other data regarding network configuration employed by the virtualized control system to deploy the different LDPS' of the different users.
[0221] The RE input tables 1910 are partially populated by the LDPS data (e.g., by logical forwarding plane data) provided by the control application 1905. The control application generates part of the LDPS data based on user input regarding the logical data path sets. It also generates part of the LDPS data by monitoring the NIB to identify changes in the managed switching element infrastructure that would require modification to the LDPS data. The control application's generation of LDPS data based on the monitoring of the NIB is further described below and further described in the above-mentioned U.S. patent application Ser. No. 13/177,532, now published as US2013/0058339, entitled “Network Control Apparatus and Method.” In addition to the control application 1905, the NIB monitor 1950 partially populates the RE input tables 1910 with some or all of the data that the NIB monitor collects from the NIB 1960. The operation of the NIB monitor will be further described below.
[0222] In addition to the RE input tables 1910, the virtualization application 1900 includes other miscellaneous tables 1915 that the rules engine 1925 uses to gather inputs for its table mapping operations. These tables 1915 include constant tables that store defined values for constants that the rules engine 1925 needs to perform its table mapping operations. For instance, constant tables 1915 may include a constant “zero” that is defined as the value 0, a constant “dispatch_port_no” as the value 4000, a constant “broadcast_MAC_addr” as the value 0xFF:FF:FF:FF:FF:FF. (A dispatch port in some embodiments is a port that specifies that the managed switch should reprocess the packet based on another flow entry. Examples of such dispatch ports are provided in the above-mentioned U.S. patent application Ser. No. 13/177,535, now published as US2013/0058250, entitled “Hierarchical Managed Switch Architecture.”)
[0223] When the rules engine 1925 references constants, the corresponding value defined for the constants are actually retrieved and used. In addition, the values defined for constants in the constant table 1915 may be modified and/or updated. In this manner, the constant table 1915 provides the ability to modify the value defined for constants that the rules engine 1925 references without the need to rewrite or recompile code that specifies the operation of the rules engine 1925.
[0224] The tables 1915 further include function tables that store functions that the rules engine 1925 needs to use to calculate values needed to populate the output tables 1945. One example of such a function is a hash function that the rules engine uses to compute hash values for distributing DHT operations as well as load balancing traffic between lower level switches and higher level switches in a hierarchical switching architecture. U.S. patent application Ser. No. 13/177,529, now published as US2013/0058356, entitled “Method and Apparatus for Using a Network Information Base to Control a Plurality of Shared Network Infrastructure Switching Elements,” and filed concurrently with the present application, describes the use of hash tables for distributing DHT operations, while the above-identified U.S. patent application Ser. No. 13/177,535, now published as US2013/0058250, entitled “Hierarchical Managed Switch Architecture,” describes the use of hash tables to load balance traffic in a hierarchical switching architecture. U.S. patent application Ser. No. 13/177,529, now published as US2013/0058356, entitled “Method and Apparatus for Using a Network Information Base to Control a Plurality of Shared Network Infrastructure Switching Elements,” and filed concurrently with the present application is incorporated herein by reference. U.S. patent application Ser. No. 13/177,529, now published as US2013/0058356, entitled “Method and Apparatus for Using a Network Information Base to Control a Plurality of Shared Network Infrastructure Switching Elements,” also described the above-mentioned request list processing, which allows one control instance to request modifications to a LDPS managed by another controller instance.
[0225] The rules engine 1925 performs table mapping operations that specify one manner for implementing the LDPS' within the managed switching element infrastructure. Whenever one of the RE input tables is modified, the rules engine performs a set of table mapping operations that may result in the modification of one or more data tuples in one or more RE output tables. The modification of the output table data tuples, in turn, may cause the NIB to be modified in order to establish and/or modify the implementation of a particular user's LDPS in the managed switching element infrastructure.
[0226] As shown in FIG. 19 , the rules engine 1925 includes an event processor 1922, several query plans 1927, and a table processor 1930. In some embodiments, each query plan is a set of join operations that are to be performed upon the occurrence of a modification to one of the RE input table. Such a modification is referred to below as an input table event. As further described below, each query plan is generated by the compiler 1935 from one declaratory rule in the set of declarations 1940. In some embodiments, the query plans are defined by using the nLog declaratory language.
[0227] In some embodiments, the compiler 1935 does not just statically generate query plans but rather dynamically generates query plans based on performance data it gathers. The complier 1935 in these embodiments generates an initial set of query plans and let the rules engine operate with the initial set of query plans. The virtualization application gathers the performance data or receives performance feedbacks (e.g., from the rules engine). Based on this data, the compiler is modified so that the virtualization application or a user of this application can have the modified compiler modify the query plans while the rules engine is not operating or during the operation of the rules engine.
[0228] For instance, the order of the join operations in a query plan may result in different execution times depending on the number of tables the rules engine has to select to perform each join operation. The compiler in these embodiments can be re-specified in order to re-order the join operations in a particular query plan when a certain order of the join operations in the particular query plan has resulted in a long execution time to perform the join operations.
[0229] The event processor 1922 of the rules engine 1925 detects the occurrence of each input table event. The event processor of different embodiments detects the occurrence of an input table event differently. In some embodiments, the event processor registers for callbacks with the RE input tables for notification of changes to the records of the RE input tables. In such embodiments, the event processor 1922 detects an input table event when it receives notification from a RE input table that one of its records has changed.
[0230] In response to a detected input table event, the event processor 1922 (1) selects the appropriate query plan for the detected table event, and (2) directs the table processor 1930 to execute the query plan. To execute the query plan, the table processor 1930 in some embodiments performs the join operations specified by the query plan to produce one or more records that represent one or more sets of data values from one or more input and miscellaneous tables 1910 and 1915. The table processor 1930 of some embodiments then (1) performs a select operation to select a subset of the data values from the record(s) produced by the join operations, and (2) writes the selected subset of data values in one or more RE output tables 1945.
[0231] In some embodiments, the RE output tables 1945 store both logical and physical network element data attributes. The tables 1945 are called RE output tables as they store the output of the table mapping operations of the rules engine 1925. In some embodiments, the RE output tables can be grouped in several different categories. For instance, in some embodiments, these tables can be RE input tables and/or virtualization-application (VA) output tables. A table is a RE input table when a change in the table causes the rules engine to detect an input event that requires the execution of a query plan. A RE output table 1945 can also be a RE input table 1910 that generates an event that causes the rules engine to perform another query plan after it is modified by the rules engine. Such an event is referred to as an internal input event, and it is to be contrasted with an external input event, which is an event that is caused by a RE input table modification made by the control application 1905 or the NIB monitor 1950.
[0232] A table is a virtualization-application output table when a change in the table causes the NIB publisher 1955 to publish a change to the NIB 1960, as further described below. As shown in FIG. 20 , a table in the RE output tables 1945 can be a RE input table 1910, a VA output table 2005, or both a RE input table 1910 and a VA output table 2005.
[0233] The NIB publisher 1955 detects changes to the VA output tables 2005 of the RE output tables 1945. The NIB publisher of different embodiments detects the occurrence of a VA output table event differently. In some embodiments, the NIB publisher registers for callbacks with the VA output tables for notification of changes to the records of the VA output tables. In such embodiments, the NIB publisher 1955 detects an output table event when it receives notification from a VA output table that one of its records has changed.
[0234] In response to a detected output table event, the NIB publisher 1955 takes each modified data tuple in the modified VA output tables and propagates this modified data tuple into the NIB 1960 through the APIs provided by the NOS 1965. After a new data tuple is propagated to the NIB by the NIB publisher 1955, the NOS 1965 propagates, if needed, a NIB data tuple that was modified because of the propagated VA output table data tuple to one or more of the managed switching elements. In doing this, the NOS completes the deployment of the LDPS (e.g., one or more logical switching configurations) to one or more managed switching elements as specified by the NIB records.
[0235] As the VA output tables store both logical and physical network element data attributes in some embodiments, the NIB 1960 in some embodiments stores both logical and physical network element attributes that are identical or derived from the logical and physical network element data attributes in the output tables 1945. In other embodiments, however, the NIB only stores physical network element attributes that are identical or derived from the physical network element data attributes in the output tables 1945.
[0236] The NIB monitor 1950 interfaces with the NIB 1960 to receive notifications regarding changes to the NIB. The NIB monitor of different embodiments detects the occurrence of a change in the NIB differently. In some embodiments, the NIB monitor registers for callbacks with the NIB for notification of changes to one or more records in the NIB. In such embodiments, the NIB monitor 1950 detects NIB change event when it receives notification from the NIB that one of its records has changed. In response to a detected NIB change event, the NIB monitor 1950 may modify one or more RE input tables 1910, which, in turn, may cause one or more RE input table event to occur that then initiates the execution of one or more query plans by the rules engine. In other words, the NIB monitor writes some or all of the information that it receives from the NIB into the input tables 1910, so that the state and configuration of the managed switching elements can be accounted for while generating the NIB data tuples through the mapping operations. Each time the managed switching configuration or underlying managed switching element state changes, the NIB monitor 1950 may update the input table records 1910 so that the generated NIB data tuples can be updated to reflect the modified switching configuration or underlying switching element state.
[0237] In some embodiments, the NIB monitor 1950 is a collection of input objects (or functions) associated with the RE input tables. Each input object in some embodiments is associated with one RE input table and is responsible for modifying its associated input table in response to a change in the NIB. Each input object in some embodiments registers with one or more NIB objects for callback notifications upon the occurrence of changes to the NIB object(s). Similarly, in some embodiments, the NIB publisher 1955 is a collection of output objects (or functions) associated with the VA output tables. Each output object in some embodiments is associated with one VA output table and is responsible for propagating changes in its associated output table to the NIB. As such, in some embodiments, the NIB monitor is a conceptual representation of the input and output objects that register with the NIB for callbacks.
[0238] The query manager 1920 interfaces with the control application 1905 to receive queries regarding LDPS data. As shown in FIG. 19 , the manager 1920 of some embodiments also interfaces with the NIB 1960 in order to query the NIB to provide the control application state information regarding the network elements in the LDPS' for the different user. In other embodiments, however, the query manager 1920 queries the output tables 1945 to obtain LDPS data for the control application.
[0239] B. Designing the nLog Table Mapping Engine
[0240] In some embodiments, the virtualization application 1900 uses a variation of the datalog database language, called nLog, to create the table mapping engine that maps input tables containing logical data path data and switching element attributes to the output tables. Like datalog, nLog provides a few declaratory rules and operators that allow a developer to specify different operations that are to be performed upon the occurrence of different events. In some embodiments, nLog provides a smaller subset of the operators that are provided by datalog in order to increase the operational speed of nLog. For instance, in some embodiments, nLog only allows the AND operator to be used in any of the declaratory rules.
[0241] The declaratory rules and operations that are specified through nLog are then compiled into a much larger set of rules by an nLog compiler. In some embodiments, this compiler translates each rule that is meant to respond to an event into several sets of database join operations. Collectively the larger set of rules forms the table mapping, rules engine that is referred to below as the nLog engine.
[0242] FIG. 21 illustrates a development process 2100 that some embodiments employ to develop the rules engine 1925 of the virtualization application 1900. As shown in this figure, this process uses a declaration toolkit 2105 and a compiler 2110. The toolkit 2105 allows a developer (e.g., a developer of a control application 1905 that operates on top of the virtualization application 1900) to specify different sets of rules to perform different operations upon occurrence of different sets of conditions.
[0243] One example 2115 of such a rule is illustrated in FIG. 21 . This example is a multi-conditional rule that specifies that an Action X has to be taken if four conditions A, B, C, and D are true. The expression of each condition as true in this example is not meant to convey that all embodiments express each condition for each rule as True or False. For some embodiments, this expression is meant to convey the concept of the existence of a condition, which may or may not be true. For example, in some such embodiments, the condition “A=True” might be expressed as “Is variable Z=A?” In other words, A in this example is the value of a parameter Z, and the condition is true when Z has a value A.
[0244] Irrespective of how the conditions are expressed, a multi-conditional rule in some embodiments specifies the taking of an action when certain conditions in the network are met. Examples of such actions include creation or deletion of new packet flow entries, creation or deletion of new network constructs, modification to use of existing network constructs, etc. In the virtualization application 1900 these actions are often implemented by the rules engine 1925 by creating, deleting, or modifying records in the output tables, which are then propagated to the NIB by the NIB publisher 1955.
[0245] As shown in FIG. 21 , the multi-conditional rule 2115 uses only the AND operator to express the rule. In other words, each of the conditions A, B, C and D has to be true before the Action X is to be taken. In some embodiments, the declaration toolkit 2105 only allows the developers to utilize the AND operator because excluding the other operators (such as ORs, XORs, etc.) that are allowed by datalog allows nLog to operate faster than datalog.
[0246] The compiler 2110 converts each rule specified by the declaration toolkit 2105 into a query plan 2120 of the rules engine. FIG. 21 illustrates the creation of three query plans 2120a-2120c for three rules 2115a-2115c. Each query plan includes one or more sets of join operations. Each set of join operations specifies one or more join operations that are to be performed upon the occurrence of a particular event in a particular RE input table, where the particular event might correspond to the addition, deletion or modification of an entry in the particular RE input table.
[0247] In some embodiments, the compiler 2110 converts each multi-conditional rule into several sets of join operations, with each set of join operations being specified for execution upon the detection of the occurrence of one of the conditions. Under this approach, the event for which the set of join operations is specified is one of the conditions of the multi-conditional rule. Given that the multi-conditional rule has multiple conditions, the compiler in these embodiments specifies multiple sets of join operations to address the occurrence of each of the conditions.
[0248] FIG. 21 illustrates this conversion of a multi-conditional rule into several sets of join operations. Specifically, it illustrates the conversion of the four-condition rule 2115 into the query plan 2120a, which has four sets of join operations. In this example, one join-operation set 2125 is to be performed when condition A occurs, one join-operation set 2130 is to be performed when condition B occurs, one join-operation set 2135 is to be performed when condition C occurs, and one join-operation set 2140 is to be performed when condition D occurs.
[0249] These four sets of operations collectively represent the query plan 2120a that the rules engine 1925 performs upon the occurrence of a RE input table event relating to any of the parameters A, B, C, or D. When the input table event relates to one of these parameters (e.g., parameter B) but one of the other parameters (e.g., parameters A, C, and D) is not true, then the set of join operations fails and no output table is modified. But, when the input table event relates to one of these parameters (e.g., parameter B) and all of the other parameters (e.g., parameters A, C, and D) are true, then the set of join operations does not fail and an output table is modified to perform the action X. In some embodiments, these join operations are internal join operations. In the example illustrated in FIG. 21 , each set of join operations terminates with a select command that selects entries in the record(s) resulting from the set of join operations to output to one or more output tables.
[0250] To implement the nLog engine in a distributed manner, some embodiments partition management of logical data path sets by assigning the management of each logical data path set to one controller instance. This partition management of the LDPS is also referred to as serialization of management of the LDPS. The rules engine 1925 of some embodiments implements this partitioned management of the LDPS by having a join to the LDPS entry be the first join in each set of join operations that is not triggered by an event in a LDPS input table.
[0251] FIG. 22 illustrates one such approach. Specifically, for the same four-condition rule 2115a illustrated in FIG. 21 , it generates a different query plan 2220a. This query plan is part of three query plans 2220a-2220c that this figure shows the compiler 2210 generating for the three rules 2115a-2115c specified through the declaration toolkit 2105. Like the query plan 2120a that has four sets of join operations 2125, 2130, 2135 and 2140 for the four-condition rule 2115a, the query plan 2220a also has four sets of join operations 2230, 2235, 2240 and 2245 for this rule 2115a.
[0252] The four sets of join operations 2230, 2235, 2240 and 2245 are operational sets that are each to be performed upon the occurrence of one of the conditions A, B, C, and D. The first join operations in each of these four sets 2230, 2235, 2240 and 2245 is a join with the LDPS table managed by the virtualization application instance. Accordingly, even when the input table event relates to one of these four parameters (e.g., parameter B) and all of the other parameters (e.g., parameters A, C, and D) are true, the set of join operations may fail if the event has occurred for a LDPS that is not managed by this virtualization application instance. The set of join operations does not fail and an output table is modified to perform the desire action only when (1) the input table event relates to one of these four parameters (e.g., parameter B), all of the other parameters (e.g., parameters A, C, and D) are true, and (3) the event relates to a LDPS that is managed by this virtualization application instance. Sub-section D below further describes how the insertion of the join operation to the LDPS table allows the virtualization application to partition management of the LDPS'.
[0253] C. Table Mapping Operations Upon Occurrence of Event
[0254] FIG. 23 conceptually illustrates a process 2300 that the virtualization application 1900 performs in some embodiments each time a record in a RE input table changes. This change may be a change made through the control application 1905. Alternatively, it may be a change that is made by the NIB monitor 1950 after it receives from the NIB a notification regarding a change in the NIB. The change to the RE input table record can entail the addition, deletion or modification of the record.
[0255] As shown in FIG. 23 , the process 2300 initially detects (at 2305) a change in a RE input table 1910. In some embodiments, the event processor 1922 is the module that detects this change. Next, at 2310, the process 2300 identifies the query plan associated with the detected RE input table event. As mentioned above, each query plan in some embodiments specifies a set of join operations that are to be performed upon the occurrence of an input table event. In some embodiments, the event processor 1922 is also the module that performs this operation (i.e., is the module that identifies the query plan).
[0256] At 2315, the process 2300 executes the query plan for the detected input table event. In some embodiments, the event processor 1922 directs the table processor 1930 to execute the query plan. To execute a query plan that is specified in terms of a set of join operations, the table processor 1930 in some embodiments performs the set of join operations specified by the query plan to produce one or more records that represent one or more sets of data values from one or more input and miscellaneous tables 1910 and 1915.
[0257] FIG. 24 illustrates an example of a set of join operations 2405. This set of join operations is performed when an event is detected with respect to record 2410 of an input table 2415. The join operations in this set specify that the modified record 2410 in table 2415 should be joined with the matching record(s) in table 2420. This joined record should then be joined with the matching record(s) in table 2425, and this resulting joined record should finally be joined with the matching record(s) in table 2430.
[0258] Two records in two tables “match” when values of a common key (e.g., a primary key and a foreign key) that the two tables share are the same, in some embodiments. In the example in FIG. 24 , the records 2410 and 2435 in tables 2415 and 2420 match because the values C in these records match. Similarly, the records 2435 and 2440 in tables 2420 and 2425 match because the values F in these records match. Finally, the records 2440 and 2445 in tables 2425 and 2430 match because the values R in these records match. The joining of the records 2410, 2435, 2440, and 2445 results in the combined record 2450. In the example shown in FIG. 24 , the result of a join operation between two tables (e.g., tables 2415 and 2420) is a single record (e.g., ABCDFGH). However, in some cases, the result of a join operation between two tables may be multiple records.
[0259] Even though in the example illustrated in FIG. 24 a record is produced as the result of the set of join operations, the set of join operations in some cases might result in a null record. For instance, as further described in sub-section D below, a null record results when the set of join operations terminates on the first join because the detected event relates to a LDPS not managed by a particular instance of the virtualization application. Accordingly, at 2320, the process determines whether the query plan has failed (e.g., whether the set of join operations resulted in a null record). If so, the process ends. In some embodiments, the operation 2320 is implicitly performed by the table processor when it terminates its operations upon the failure of one of the join operations.
[0260] When the process 2300 determines (at 2320) that the query plan has not failed, it stores (at 2325) the output resulting from the execution of the query plan in one or more of the output tables. In some embodiments, the table processor 1930 performs this operation by (1) performing a select operation to select a subset of the data values from the record(s) produced by the join operations, and (2) writing the selected subset of data values in one or more RE output tables 1945. FIG. 24 illustrates an example of this selection operation. Specifically, it illustrates the selection of values B, F, P and S from the combined record 2450 and the writing of these values into a record 2465 of an output table 2460.
[0261] As mentioned above, the RE output tables can be categorized in some embodiments as (1) a RE input table only, (2) a VA output table only, or (3) both a RE input table and a VA output table. When the execution of the query plan results in the modification a VA output table, the process 2300 publishes (at 2330) the changes to this output table to the NIB. In some embodiments, the NIB publisher 1955 detects changes to the VA output tables 2005 of the RE output tables 1945, and in response, it propagates the modified data tuple in the modified VA output table into the NIB 1960 through the APIs provided by the NOS 1965. After a new data tuple is propagated to the NIB by the NIB monitor, the NOS 1965 propagates, if needed, a NIB data tuple that was modified because on the propagated VA output table data tuple to one or more of the managed switching elements. In doing this, the NOS completes the deployment of the LDPS (e.g., one or more logical switching configurations) to one or more managed switching elements as specified by the NIB records.
[0262] At 2335, the process determines whether the execution of the query plan resulted in the modification of the RE input table. This operation is implicitly performed in some embodiments when the event processor 1922 determines that the output table that was modified previously at 2325 modified a RE input table. As mentioned above, a RE output table 1945 can also be a RE input table 1910 that generates an event that causes the rules engine to perform another query plan after it is modified by the rules engine. Such an event is referred to as an internal input event, and it is to be contrasted with an external input event, which is an event that is caused by a RE input table modification made by the control application 1905 or the NIB monitor 1950. When the process determines (at 2330) that an internal input event was created, it returns to 2310 to perform operations 2310-2335 for this new internal input event. The process terminates when it determines (at 2335) that the execution of the query plan at 2335 did not result in an internal input event.
[0263] One of ordinary skill in the art will recognize that process 2300 is a conceptual representation of the operations used to map a change in one or more input tables to one or more output tables. The specific operations of process 2300 may not be performed in the exact order shown and described. The specific operations may not be performed in one continuous series of operations, and different specific operations may be performed in different embodiments. For instance, the process 2300 in some embodiments batches up a set of changes in RE input tables 1910 and identifies (at 2310) a query plan associated with the set of detected RE input table events. The process in these embodiments executes (at 2320) the query plan for the whole set of the RE input table events rather than for a single RE input table event. Batching up the RE input table events in some embodiments results in better performance of the table mapping operations. For example, batching the RE input table events improves performance because it reduces the number of instance that the process 2300 will produce additional RE input table events that would cause it to start another iteration of itself.
[0264] D. Parallel, Distributed Management of LDPS′
[0265] As mentioned above, some embodiments implement the nLog engine as a distributed table mapping engine that is executed by different virtualization applications of different controller instances. To implement the nLog engine in a distributed manner, some embodiments partition the management of the logical data path sets by specifying for each particular logical data path set only one controller instance as the instance responsible for specifying the NIB records associated with that particular logical data path set. Partitioning the management of the LDPS' also assigns in some embodiments the table mapping operations for each LDPS to the nLog engine of the controller instance responsible for the LDPS.
[0266] As described above by reference to FIG. 20 , some embodiments partition the nLog table mapping operations across the different instances by designating the first join operation that is performed by each nLog instance to be based on the LDPS parameter. This designation ensures that each nLog instance's join operations fail and terminate immediately when the instance has started a set of join operations that relate to a LDPS that is not managed by the nLog instance.
[0267] FIG. 25 illustrates an example of a set of join operations failing when they relate to a LDPS that does not relate to an input table event that has occurred. Specifically, this figure illustrates four query plans 2505, 2510, 2515 and 2520 of a rules engine 2525 of a particular virtualization application instance 2530. Two of these query plans 2510 and 2515 specify two sets of join operations that should be performed upon occurrence of input table events B and W respectively, while two of the query plans 2505 and 2520 specify two sets of join operations that should be performed upon occurrence of input table event A.
[0268] In the example illustrated in FIG. 25 , the two query plans 2510 and 2515 are not executed because an input table event A has occurred for a LDPS 2 and these two plans are not associated with such an event. Instead, the two query plans 2505 and 2520 are executed because they are associated with the input table event A that has occurred. As shown in this figure, the occurrence of this event results in two sets of join operations being performed to execute the two query plans 2505 and 2520. The first set of join operations 2540 for the query plan 2505 fails because the query plan 2505 is specified for a LDPS 1, which is a LDPS not managed by the virtualization application instance 2530. This set of join operations fails on the first join operation 2535 because it is a join with the LDPS table, which for the virtualization application instance 2530 does not contain a record for the LDPS 1. In some embodiments, even though the first join operation 2535 has failed, the remaining join operations (not shown) of the query plan 2540 will still be performed and fail. In other embodiments, the remaining join operations of the query plan 2540 will not be performed as shown.
[0269] The second set of join operations 2545 does not fail, however, because it is for the LDPS 2, which is a LDPS managed by the virtualization application instance 2530 and therefore has a record in the LDPS table of this application instance. This set of join operations has four stages that each performs one join operation. Also, as shown in FIG. 25 , the set of join operations terminates with a selection operation that selects a portion of the combined record produced through the join operations.
[0270] The distribution of the nLog table mapping operations across several nLog instances reduces the load on each nLog instance and thereby increases the speed by which each nLog instance can complete its mapping operations. FIG. 26 illustrates an example that describes this reduction in workload. Specifically, it illustrates an example where two controller instances 2605 and 2610 are responsible for the virtualization application functionality of two different LDPS' A and B for different tenants A and B of a multi-tenant computing environment. The two controller instances manage two sets of managed switches 2615 and 2620. Each of the two sets of managed switches manages a set of machines 2625 or 2630, which may be host machines running on dedicated machines, or may be virtual machines running on shared machines.
[0271] In four stages, this figure illustrates the results of the table mapping operations that are performed by the virtualization applications of these two different controller instances. The first stage 2601 shows that no machines have been deployed in the managed system for either tenant A or tenant B. The second stage 2602 shows the computing environment with several machines that have been deployed for tenant A in the two sets of machines 2625 and 2630. It also shows the VA output table 2640 of the virtualization application of the controller instance 2605 with flow entries for the LDPS A that were specified by this instance's virtualization application. The second stage further shows the NIB 2645 of the controller instance 2605 containing the flow entries for the LDPS A. At this stage, the NIB 2645 also contains LDPS data relating to LDPS A in some embodiments, but this data is not shown in FIG. 26 .
[0272] The third stage 2603 in FIG. 26 shows that the flow entries for the LDPS A have migrated to the NIB 2655 of the controller instance 2610. This migration occurs because of the NIB replication across the controller instances. Also, this replication causes LDPS data relating to LDPS A to be copied to the NIB 2655. The third stage 2603 further shows the computing environment with several machines that have been deployed for tenant B in the two sets of machines 2625 and 2630. It also shows the VA output table 2650 of the virtualization application of the controller instance 2610 with flow entries for the LDPS B that were specified by this instance's virtualization application. The third stage further shows the NIB 2655 of the controller instance 2610 containing the flow entries for the LDPS B. At this stage, the NIB 2655 also contains LDPS data relating to LDPS B in some embodiments, but this data is not shown in FIG. 26 .
[0273] The fourth stage 2604 shows that the flow entries for the LDPS B have migrated to the NIB 2645 of the controller instance 2605. This migration occurs because of the NIB replication across the controller instances. This replication also causes LDPS data relating to LDPS B to be copied to the NIB 2645. As shown at the stage 2604, the NIBs 2645 and 2655 have LDPS data relating to both LDPS A and LDPS B. However, the VA output tables of one controller instance do not store flow entries for the LDPS of another controller instance. That is, in this example, the VA output tables 2640 of controller instance A do not store the flow entries for the LDPS B and the VA output tables 2650 of controller instance B do not store the flow entries for the LDPS A. This depiction is meant to illustrate that some embodiments partition the storage of the logical state data across several controller instances. This allows these embodiments to keep the size of tables (e.g., the input or output tables) small in order to increase the speed by which each nLog instance can complete its mapping operations as described above.
[0274] While the input and output tables of each controller instance in some embodiments only store or practically only store logical state data for only the LDPS' for which the controller instance is responsible, the NIB for each controller instance in some of these embodiments contains all or practically all of the logical state data (e.g., except some logical port statistics that are stored in the DHTs of controller instances that are not replicated across) for all LDPS of all controller instances. However, other embodiments will partition the logical state data for the LDPS's across the NIBs of different controller instances.
[0275] E. NIB Monitor
[0276] FIG. 27 illustrates additional details regarding the operation of the NIB monitor 1950 of the virtualization application 1900 of some embodiments of the invention. For simplicity of discussion, FIG. 27 does not illustrate the control application 1905, the query manager 1920, the miscellaneous tables 1915, the declarative rules 1940, the complier 1935, and the inner makeups of the rules engine 1925.
[0277] As described above, the NIB monitor 1950 interfaces with the NIB 1960 to receive notifications regarding changes to the NIB 1960. In the examples described above, the NIB monitor 1950 may modify one or more RE input tables 1910 when it receives a record change notification from the NIB. The rules engine 1925 then performs a series of mapping operations to map the modified RE input tables to the RE output tables 1945, which may include RE input tables 1910, VA output tables 2005 of FIG. 20 and tables that serve as both RE input tables and VA output tables.
[0278] In addition to modifying the RE input tables 1910, the NIB monitor 1950 of some embodiments may also modify one or more VA output tables when it receives a NIB change notification. That is, the NIB monitor in these embodiments directly modifies the VA output tables for some NIB change notifications, such as notification relating to some of the changes to the state and configuration of the managed switching elements. By directly writing such data to the VA output tables, the NIB 1960 keeps the VA output tables updated with the current state and configuration of the managed switching elements.
[0279] FIG. 27 conceptually illustrates that some of the VA output tables 1945 conceptually include two representations 2710 and 2715 of the state and configuration of the managed switching elements. The first representation 2710 in some embodiments includes data that specify the desired state and configuration of the managed switching elements, while the second representation 2715 includes data specifying the current state and configuration of the managed switches. The data of the first representation 2710 is the result of table mapping operations performed by the rules engine 1925. Thus, in some embodiments, the data of the first representation 2710 is physical control plane data produced by the rules engine 1925 based on changes in logical forwarding data stored in the RE input tables 1910. On the other hand, the data of the second representation 2715 is retrieved from the NIB 1960. This data is also physical control plane data in some embodiments. The data of the first representation and the data of the second representation do not always match because, for example, a failure of a managed switching element that is reflected in the second representation may not have been reflected in the first representation yet.
[0280] As shown, the virtualization application 1900 conceptually includes a difference assessor 2705. The difference assessor 2705 detects a change in the first representation 2710 or in the second representation 2715. A change in the first representation may occur when the rules engine 1925 puts the result of its mapping operations in the VA output tables 2005 of FIG. 20 . A change in the second representation may occur when the NIB updates the VA output tables 2005 when it is notified of a change in the NIB. Upon detecting a change in the VA output tables, the difference assessor 2705 in some embodiments examines both the first representation 2710 and the second representation 2715 to find out the difference, if any, between these two representations.
[0281] When there is no difference between these two representations, the difference assessor 2705 takes no further action because the current state and configuration of the managed switching elements are already what they should be. However, when there is a difference, the different assessor 2705 may have the NIB publisher 1955 publish the difference (e.g., data tuples) to the NIB 1960. When the NIB publisher published the difference to the NIB 1960, the difference will be propagated to the managed switching elements by the NOS 1965 and the state and configuration of the managed switching elements will be the state and configuration specified by the first representation 2710. Also, when the difference assessor detects a difference between the two representations, the difference assessor in some embodiments may call the input tables of the control or virtualization application to initiate additional table mapping operations to reconcile the difference between the desired and current values. Alternatively, in other embodiments, the NIB monitor will end up updating the input tables based on the changes in the NIB at the same time it updates the output tables and these will trigger the nLog operations that might update the output table.
[0282] In some embodiments, the virtualization application 1900 does not store the desired and current representations 2710 and 2715 of the physical control plane data, and does not use a difference assessor 2705 to assess whether two corresponding representations are identical. Instead, the virtualization application 1900 stores each set of physical control plane data in a format that identifies differences between the desired data value and the current data value. When the difference between the desired and current values is significant, the virtualization application 1900 of some embodiments may have the NIB publisher push a data tuple change to the NIB, or may call the input tables of the control or virtualization application to initiate additional table mapping operations to reconcile the difference between the desired and current values.
[0283] The operation of the virtualization application 1900 will now be described with an example network event (i.e., a change in the network switching elements). In this example, the switching elements managed by the virtualization application include a pool node. A pool node and other network constructs associated with the pool node are described in the above-identified U.S. patent application Ser. No. 13/177,535, now published as US2013/0058250, entitled “Hierarchical Managed Switch Architecture.” The pool node has a root bridge and a patch bridge. The pool node shuts down for some reason (e.g., by hardware or software failure) and the two bridges of the pool node get shut down together with the pool node. This results in an update in the NIB 1960 which will indicate the pool node and its bridges being down. The NIB monitor 1950 in this example is then notified of this update in the NIB and subsequently writes information to both the RE input tables 1910 and the VA output tables (specifically, the second representation 2715). The rules engine 1925 performs mapping operations upon detecting the change in the RE input tables 1910 but the mapping result (i.e., the first representation 2710) in this example will not change the desired data value regarding the pool node and its bridges. That is, the desired data value would still indicate that the pool node and the two bridges should exist in the configuration of the system. The second representation 2715 would also indicate the presence of the pool node and its bridges in the configuration.
[0284] The NOS 1965 then restarts the pool node but the root bridge and the patch bridge do not come back up in this example. The NIB 1960 will indicate that the pool node is back up and the NIB monitor 1950 updates the RE input tables 1910 and the second representation 2715 of the VA output tables accordingly. The rules engine 1925 performs mapping operations on the RE input tables 1910 but the resulting desired data value would still not change because there was no change as to the existence of the pool node in the configuration of the system. However, the current data value in the second representation 2715 would indicate at this point that the pool node has come back up but not the bridges. The difference assessor 2705 detects the changes in the first and second representations and compares the desired and current data values regarding the pool node and its bridges. The difference assessor 2705 determines the difference, which is the existence of the two bridges in the pool node. The difference assessor 2705 notifies the NIB publisher 1955 of this difference. The NIB publisher 1955 publishes this difference in the NIB 1960. The NOS 1965 propagates this information to the pool node so that the pool node creates the root and patch bridges in it.
[0285] F. Code Based Examples
[0286] 1. nLog and Datalog Declarations
[0287] As discussed above, nLog in some embodiments is a variation of the datalog database language for declaring logic that controls how the virtualization application 1900 will map input tables to the output tables by performing mapping operations on the information contained in the input tables. In some embodiments, the input tables contain information comprising logical data path sets and switching element attributes. In some embodiments, the output tables contain physical control plane data. In the Type I virtualized control system in some embodiments, declaring logic for governing how a control application requires extensive use cases and conditions in C++ or an equivalent programmatic language. In some embodiments, the nLog language expresses the same control logic as a programming language such as C++, but in high-level declarations that are easily modified and extended. In some embodiments of the invention, the nLog declarations are compiled into a code in a programming language for use by a run time process by the nLog compiler.
[0288] As discussed above, nLog is a variation of the Datalog language selected for its speed and applicability to distributing logical data path sets. The Datalog language is a query and rule language for deductive databases. The Datalog language is stated using rule declarations. In some embodiments, nLog uses the “JOIN”, “SELECT”, and “AND” operators from Datalog. “JOIN” performs an inner join of tables on a specified join-predicate. Inner join creates a new result table by combining column values of two tables based on the specified join-predicate. Inner join compares each row of the joined tables to find all pairs of rows that satisfy the join-predicate. When the join-predicate is satisfied, column values for each matched pair of rows of the joined table are combined into a result row. “SELECT” returns column or row entries from tables based on a specified result set. “AND” returns true where all inputs to the “AND” function are true. This set of operators is sufficient to implement the distribution of logical data path sets of some embodiments of the invention. Other operators, such as the “XOR” and “OR” operators, are not used for some embodiments of nLog because (1) their implementation may complicate the development of the nLog compiler, (2) their function can be emulated using only the “AND” operator, and/or (3) their performance is less than that of the “JOIN”, “SELECT”, and “AND” operators.
[0289] In some embodiments nLog uses the syntactic structure of Datalog rule declarations. For instance, nLog rule declarations are of the form “<head>:-<body1>, <body2>.” The rule declaration “<head>:-<body1>, <body2>” can be understood as “<head> if it is known that <body1> and <body2>.” The “:-” symbol demarcates the head from the body of a rule declaration. The text prior to the “:-” symbol is the head of a rule declaration. The text following the “:-” symbol is the body of a rule declaration. The head of the rule declaration receives parameters and defines the action the rules engine will take when the conditions specified in the body clauses of the rule declaration are satisfied. One of the ordinary skill in the art will realize that the rule declarations do not have to be in this specific form. That is, any equivalent forms may be used to define these rule declarations.
[0290] Similar to the head of a rule declaration, the body contains actions and parameters. In the previous example, clauses <body1> and <body2> comprised the body of the rule declaration. As shown in the previous example, a rule declaration may have more than one body clause. However, clauses in the body portion of a rule declaration are not used to create, modify, or destroy network constructs. Rather, in some embodiments, clauses in the body portion of a rule declaration are used as conditions for performing the action of the head portion of a rule declaration.
[0291] The head and body clauses of rule declarations can accept parameters. Parameters are inputs to the actions contained in either the head or the body clauses of rules declarations. For example, the parameters of a rule declaration that creates a new network construct typically indicate the location and identity of the new network construct to be created. Parameters will be described in more detail in the example rule declaration described below.
[0292] 2. Pool Node Rule Declaration
[0293] In order to illustrate the structure of an nLog rule declaration of some embodiments of the invention, an example nLog rule declaration will be discussed in detail. This rule declaration will be referred to as the “pool_node” rule declaration.
[0294]
| pool_node(zone_id, phys_chassis_id) :- | |
| log_zone(_, zone_id, _), | |
| stt_connector(zone_id, phys_chassis_id, _), | |
| phys_chassis_forwarding_enabled(phys_chassis_id), | |
| phys_chassis_connected(phys_chassis_id); | |
[0295] In some embodiments, STT stands for stateless transport layer tunneling. Tunneling is encapsulating messages formatted in one communication protocol (i.e., messages having a header of one protocol) with a header of another communication protocol. The messages are encapsulated at one end of a communication link that uses the latter protocol and de-capsulated at another end of the communication link. This form of tunnel is described in U.S. Provisional Patent Applications 61/471,897, 61/479,680, and 61/501,433.
[0296] The “pool_node” rule declaration specifies when the rules engine of a virtualization application should create a pool node. A rules engine can support multiple rule declarations indicating when to create a pool node, but this discussion will be limited to this specific example. The “pool_node” rule declaration can be understood as: “create a pool node in this zone and this chassis if it is known that this chassis in this zone supports STT connectors, has forwarding enabled, is in a valid logical zone, and is connected.” A pool node is a hierarchical switching structure that assists managed switching elements in forwarding packets. A zone is a logical zone containing logical switches, pool nodes, managed switching elements, and extenders. An extender is a hierarchical switching structure that assists pool nodes in forwarding packets to remote locations or unmanaged switching elements. A chassis is a node, an x86 box, a hypervisor, a pool node, or an extender. A node is switch that can forward packets. A pool node, a zone, an extender, a chassis, and a node are described in detail in the above-identified U.S. patent application Ser. No. 13/177,535, now published as US2013/0058250, entitled “Hierarchical Managed Switch Architecture.”
[0297] The head of the “pool_node” rule declaration above reads “pool_node(zone_id, phys_chassis_id)”. The head of the declaration is the action preceding the “:-” symbol. The head indicates that this rule, if it is known that all the clauses of the body are true, will call for the creation of a pool node. The head contains the parameters “zone_id” and “phys_chassis_id”. “Zone_id” corresponds to the logical zone of the pool node that will be created if the conditions of the body of the rule declaration are satisfied. “Chassis_id” corresponds to the machine that will host the pool node that will be created if the conditions of the body of the rule declaration are satisfied. The parameters for the head and the parameters for the body clauses are the same. For example, the “zone_id” parameter in the “pool_node” action in the head of the rule declaration is the same “zone_id” in the “stt_connector” clause in the body of the rule declaration.
[0298] The body of the “pool_node” declaration above is all the clauses following the “:-” symbol. The “pool_node” declaration above contains four clauses: “log_zone”, “stt_connector”, “phys_chassis forwarding_enabled”, and “phys_chassis_connected”. The body clause “log_zone(_, zone_id,)” tests whether the zone indicated by “zone_id” is a valid logical zone. The underscores before and after “zone_id,” indicate masked parameters that are not relevant to the “pool_node” declaration. The body clause “stt_connector(zone_id, phys_chassis_id,)” tests whether the zone indicated by “zone_id” and the physical chassis indicated by “phys_chassis_id” supports STT tunnels. The underscore after “phys_chassis_id,” indicates a masked parameter that is not relevant to the “pool_node” declaration. The body clause “phys_chassis forwarding_enabled(phys_chassis_id)” tests whether the physical chassis indicated by “phys_chassis_id” has forwarding_enabled. The body clause “phys_chassis_connected(phys_chassis_id)” tests whether the physical chassis indicated by “phys_chassis_id” is connected to the network. Once compiled, the “pool_node” declaration above will define how the rules engine will react to events corresponding to “log_zone”, “stt_connector”, “phys_chassis_forwarding_enabled”, and “phys_chassis_connected”. Based on the C++ code compiled from the “pool_node” rule declaration, the rules engine may order the creation of a new pool node.
[0299] 3. Compiling Rule Declarations
[0300] As discussed above, in some embodiments nLog rule declarations 1940 are compiled into C++ code using the nLog compiler 1935. The nLog compiler 1935 produces C++ code that may be executed by the rules engine 1925. The rules engine 1925 executes C++ code to map input tables containing logical data path sets and switching element attributes to the output tables containing physical control plane data by performing mapping operations on logical data path sets. Compilation of rule declarations by the nLog compiler takes place at developer time. Execution of compiled rule declarations by the rules engine takes place at run time when the network controller instance is managing the managed switching elements. The nLog compiler reduces the complexity of writing code to define how the rules engine 1925 will distribute logical data path sets by allowing the distribution logic to be declared in the higher-level nLog language instead of C++.
[0301] In some embodiments, four sets of rule declarations of the form <head>:-<body1>, <body2>, <body3>, <body4> can produce hundreds of lines (e.g., 700 lines) of C++ code once compiled. Each <bodyX> clause is compiled into a query plan defining how the rules engine will handle an event associated with the body clause. The “pool_node” rule declaration above will compile into four query plans, one query plan for each clause in the body of the “pool_node” rule declaration. Each body clause action will serve as an event that is associated with one of the compiled query plans.
[0302] In some embodiments, a query plan defines the operations the rules engine will perform when the rules engine detects an event associated with the query plan. When the rules engine receives an event, the rules engine queries the input tables 1910 based on the query plan or query plans associated with the received event.
[0303] As discussed above, events are network occurrences that have a corresponding query plan in the rules engine in some embodiments. Events indicate that one of the body clauses of the rule declaration from which the query plan was compiled is true. Examples of events include a dispatch port being enabled, a physical chassis being connected to the network, or STT tunnel being enabled on a chassis. When such an event occurs, the rules engine computes how logical data path sets and switching element attributes in the input tables will be distributed as physical control plane data in the output tables.
[0304] One event may trigger multiple query plans compiled from multiple rule declarations. For example, the “dispatch_port_req” rule declaration includes a body clause “phys_chassis_connected” and the “pool_node” rule declaration includes a body clause “phys_chassis_connected”. If a rules engine contains the compiled query plans for both the “dispatch_port_req” and “pool_node” rule declarations, and if the rules engine receives an event associated with “phys_chassis_connected”, then the rules engine will execute the query plans for “phys_chassis_connected” compiled from both the “dispatch_port_req” and “pool_node” rule declarations.
[0305] In some embodiments, a query plan consists of N−1 JOIN operations and one SELECTION operation, where N is equal to the number of body clauses in the rule declaration from which the query plan was compiled. If a rules engine receives an event associated with a query plan, the query plan will join the input tables 1910 of the N−1 body clauses of the rule declaration from which the query plan was compiled. Then the query plan will select the head action parameters from the joined tables. If the JOIN operations pass an AND test, and the SELECTION operation yields valid values, then the rules engine will execute the head action.
[0306] 4. Compiled “Pool_Node” Query Plan
[0307] The query plans compiled from the “pool_node” rule declaration above will now be discussed as a specific example of a set of query plans. In the discussion below, the rules engine has the query plans compiled from the “pool_node” rule declaration.
[0308] The “pool_node” rule declaration will compile to four query plans. Each of the four query plans consists of three JOIN operations and one SELECTION operation. If the rules engine receives an event corresponding to “log_zone C, zone_id,)”, “stt_connector (zone_id, phys_chassis_id, _)”, “phys_chassis_forwarding_enabled (phys_chassis_id)”, or “phys_chassis_connected (phys_chassis_id)”, then the rules engine will run the associated query plan. A “log_zone (_, zone_id, _)” event occurs when a logical zone is instantiated. An “stt_connector (zone_id, phys_chassis_id, _)” event occurs when STT tunneling is enabled on a physical chassis for a specific zone. A “phys_chassis_forwarding_enabled (phys_chassis_id)” event occurs when a physical chassis enables forwarding. A “phys_chassis_connected (phys_chassis_id)” event occurs when a physical chassis is connected to the network. The compiled “phys_chassis_connected (phys_chassis_id)” query plan will now be shown:
[0309]
| static void get_plan12(Runner& runner, Runner::Queries* queries) { | ||
| // global_plan_id: 0x846fd20b1488481b | ||
| // head: pool_node(V(zone_id), V(phys_chassis_id)) | ||
| // rank: 2 | ||
| // event: phys_chassis_connected(V(phys_chassis_id)) | ||
| // query_plan: | ||
| // 0) 100000, phys_chassis_forwarding_enabled(V(phys_chassis_id)), | ||
| // | Join, mapping: [(0, 0)] new columns: [ ] new mappings: [ ], | |
| // | drop_columns: [ ], index: phys_chassis_forwarding_enabled(0) | |
| // 1) 100001, stt_connector(V(zone_id), V(phys_chassis_id), | ||
| // | V(_)), Join, mapping: [(1, 0)] new columns: [u‘zone_id’] new mappings: | |
| // | [0], drop_columns: [ ], index: stt_connector(1) | |
| // 2) 100000, log_zone(V(_), V(zone_id), V(_)), Join, mapping: | ||
| // | [(1, 1)] new columns: [ ] new mappings: [ ], drop_columns: [ ], index: | |
| // | log_zone(1) | |
| // 3) 100000, pool_node(V(zone_id), V(phys_chassis_id)), | ||
| // | Selection, mapping: [(0, 1), (1, 0)] new columns: [ ] new mappings: [ ], | |
| // | drop_columns: [ ], index: None | |
| Operators operators; | ||
| append_operator(runner, JOIN, | ||
| 1, ((const int[ ][2]) {{0, 0}}), | ||
| 0, ((const int[ ]) {−1}), | ||
| 0, ((const int[ ]) {−1}), | ||
| 0, ((const int[ ][2]) {{−1,−1}}), | ||
| “phys_chassis_forwarding_enabled”, | ||
| runner.index(“phys_chassis_forwarding_enabled_0”), &operators); | ||
| append_operator(runner, JOIN, | ||
| 1, ((const int[ ][2]) {{1, 0}}), | ||
| 1, ((const int[ ]) {0}), | ||
| 0, ((const int[ ]) {−1}), | ||
| 0, ((const int[ ][2]) {{−1,−1}}), | ||
| “stt_connector”, runner.index(“stt_connector_1”), &operators); | ||
| append_operator(runner, JOIN, | ||
| 1, ((const int[ ][2]) {{1, 1}}), | ||
| 0, ((const int[ ]) {−1}), | ||
| 0, ((const int[ ]) {−1}), | ||
| 0, ((const int[ ][2]) {{−1,−1}}), | ||
| “log_zone”, runner.index(“log_zone_1”), &operators); | ||
| append_operator(runner, SELECTION, | ||
| 2, ((const int[ ][2]) {{0, 1},{1, 0}}), | ||
| 0, ((const int[ ]) {−1}), | ||
| 0, ((const int[ ]) {−1}), | ||
| 0, ((const int[ ][2]) {{−1,−1}}), | ||
| “pool_node”, NULL, &operators); | ||
| queries−>push_back(new Query( | ||
| runner.table(“pool_node”), | ||
| runner.table(“phys_chassis_connected”), | ||
| operators, | ||
| 0x846fd20b1488481b)); | ||
| } | ||
[0310] If a “phys_chassis_connected” event occurs, then the rules engine will access the query plan for “phys_chassis_connected” shown above. The access occurs on the first line where the code says “static void get_plan12(Runner& runner, Runner::Queries* queries)”. In this case, a “phys_chassis_connected” event is associated with “plan12”. The fifth line, “// event: phys_chassis_connected(V(phys_chassis_id))” is a comment that indicates that this plan is associated with the “phys_chassis_connected” event.
[0311] Below the commented portion, the section starting with “Operators operators;” indicates that three JOIN operations and one SELECTION operation will be appended to a runner object. The runner object is indicated to the left of each JOIN or SELECTION operator where the code says “append_operator(runner, JOIN,” or “append_operator(runner, SELECTION,”. After all operations have been appended, the runner object executes the JOIN operations and the SELECTION operation. The lines “queries-> push back(newQuery(runner.table(“pool node”), runner.table(“phys_chassis_connected”), operators” indicate that the runner object will be pushed as a new query. Execution of the JOIN and SELECTION operations occurs after the runner object has been pushed as a new query.
[0312] The first three operators are JOIN operations on various columns and indices. The fourth operator is a SELECTION operation. The first JOIN operator joins columns [0,0] on the index “phys_chassis_forwarding_enabled(0)”. The second JOIN operator joins columns [1,0] on the index “stt_connector(1)”. The third JOIN operator joins columns [1,1] on the index “log_zone(1)”. The SELECTION operator selects columns [01],[1,0] on no index. This query plan will be executed in the rules engine of the virtualization application processes notification from a network operating system. During execution the rules engine will access the input tables 1910 to retrieve the information necessary to perform the JOIN and SELECTION operations as described above.
[0313] 5. Rules Engine Execution of “Pool_Node” Query Plan
[0314] In order to illustrate the operation of the rules engine, a specific example of an execution of a query plan will now be discussed using the “phys_chassis_connected(phys_chassis_id)” query plan shown above. The execution process begins when the event processor 1922 receives notification of a physical chassis being connected. Upon notification of a physical chassis being connected, the event processor 1922 looks up the query plans 1927 associated with a physical chassis being connected. In some embodiments, multiple query plans may exist for a single event and those multiple query plans would all be executed. In this case, only a single query plan “phys_chassis_connected(phys_chassis_id)” will be found. The event processor 1922 then executes the query plan. The process begins with appending JOIN operators and SELECT operators to a runner object. This can be seen in the code above where the code has 3 “append_operator(runner, JOIN,” blocks followed by a “append_operator(runner,SELECTION” block. The event processor 1922 executes each operation in the order in which it was appended to the runner object. The JOIN operations will perform inner join operations on the input tables 1910 associated with the body clauses on predicates based on the values shown in each “append_operator(runner, JOIN,” code block. The SELECTION operator will select on columns to retrieve a result set, if any, based on the values shown in the “append_operator(runner,SELECTION” code block.
[0315] Once all operators of a query plan are appended to the runner object, the event processor 1922 sends the runner object to the table processor 1930 to execute the operations appended to the runner object. The JOIN and SELECTION operations take place on data tuples in the input tables 1910, and in some embodiments, on function and constant tables 1915 that are not contained in the input tables 1910. If the JOIN and SELECTION operations are successful, then the table processor 1930 will return a “phys_chassis_id” and a “zone_id” to the event processor 1922 to be used in creating a new pool node. If any of the JOIN and SELECTION operations fail, then a NULL result will be returned in all parameters and the operations terminated in some embodiments. A NULL result in any parameter will result in a failure of the query plan. Upon successful return of parameters “phys_chassis_id” and “zone_id”, the event processor 1922 will submit the parameters to the input tables 1910 as output entries.
[0316] 6. Input Tables
[0317] As discussed above, input tables 1910 contain information that the rules engine maps to the output tables as physical control plane data. In some embodiments, the information contained in the input tables 1910 includes: logical data path sets, data corresponding to external events, and supplemental network data used by the rules engine during computation of the distribution of logical data path sets. The input tables 1910 receive notifications from the network operating system regarding state changes in the network. The input tables 1910 also translate those notifications from the network operating system into data tuples and events to be used by the rules engine to compute how to distribute input table information across the output tables.
[0318] In some embodiments, input tables 1910 share a basic set of methods and attributes. The basic set of attributes includes: an entity input table, an export interface, and an export registry for the export interface. The basic set of methods includes: methods for accessing the export registry through the export interface, input table instantiation functions, and registration and un-registration methods for the namesake entity of the input table class. E.g., the physical forwarding engine input table class has methods for registering and un-registering physical forwarding engines.
[0319] In some embodiments, input tables 1910 are programmatic objects stored as a database in computer memory that correspond to types of logical and physical network elements. Examples of input table classes include: physical forwarding engine input tables, logical forwarding engine input tables, logical port input tables, and physical port input tables.
[0320] 7. Physical Forwarding Engine Input Table
[0321] The physical forwarding engine input table class stores data tuples regarding physical forwarding engines that the rules engine uses in performing mapping operations. In some embodiments, physical forwarding engine input tables store data tuples corresponding to physical switches, software switches, and virtual switches. To illustrate the operation of the input tables 1910, the physical forwarding engine input table class will be discussed in detail as an example. The physical forwarding engine input table class contains the following member classes: entity input table and forwarding engine export interface. The physical forwarding engine input table class contains the following attributes: a name, an export registry for the export interface, and a network ID. The entity input table receives entity data from the NIB and uses the export interface to load the export registry with data received from the NIB through the NIB monitor 1950. The entity input table also alerts the rules engine of changes to the data tuples in the input tables 1910. The export registry contains data tuples to be used by the rules engine. The entity input table is defined as an attribute of the class PhysicalForwardingEngineInputTable:
[0322]
| class PhysicalForwardingEngineInputTable : | |
| public EntityInputTable, | |
| public ForwardingEngineExportInterface { | |
| public:PhysicalForwardingEngineInputTable( | |
| const std::string& name, | |
| ForwardingEngineExportRegistry* fe_reg, | |
| const NetworkId& physical_network); | |
| void start( ); | |
| ... | |
[0323] The entity input table is implemented in physical forwarding engine input table.cc:
[0324]
| PhysicalForwardingEngineInputTable:: | |
| PhysicalForwardingEngineInputTable( | |
| const std::string& name, | |
| ForwardingEngineExportRegistry* fe_registry, | |
| const NetworkId& physical_network) | |
| : EntityInputTable(name), fe_registry_(fe_registry), | |
| physical_network_id_(physical_network) { } | |
| ... | |
[0325] The entity input table receives notifications and data tuples from the NIB monitor 1950. The entity input table uses the export interface to load the export registry with data tuples received from the NIB monitor as shown above. For example, if the NIB monitor 1950 sends a notification that a forwarding engine has a new port, then the entity input table will use the “PortAdd” export interface method to add a port to the export registry.
[0326] The export interface defines the methods of changing the values of the data in the export registry. These methods include: register forwarding engine, un-register forwarding engine, change in connection state of forwarding engine, data path change, address add, address remove, port add, port remove, forwarding table add, forwarding table remove, forwarding engine bind, forwarding engine unbind, transmit buffer, transmit packet, receive buffer, and receive packet. The export registry contains the data associated with the export interface.
[0327] The forwarding engine input table class further includes functions to instantiate a physical forwarding input table object's export registry, start a physical forwarding input table object, register a forwarding engine, and unregister a forwarding engine.
[0328] Returning to the “PortAdd” example above, after the entity input table has used the export interface to load the export registry with a new port, the entity input table notifies the rules engine of the new port. The rules engine handles this notification by looking up a query plan to handle a “PortAdd” event. If a rule declaration has been compiled into a query plan to handle “PortAdd”, then the rules engine will execute the associated query plan or plans. However, in some embodiments, not all changes to the input table export registry will have an associated query plan in the rules engine. For example, if the rules engine developer did not provide a rule declaration for handling “PortAdd”, then the rules engine would not respond to notification of a “PortAdd” event.
[0329] 8. Physical Forwarding Engine Output Table
[0330] As discussed above, the output tables 1945 store data tuples to be distributed across the NIB. In some embodiments, the output tables 1945 also reconcile differences between the output tables 1945 and the NIB by re-pushing state information to the NIB when the NIB does not match data in the output tables 1945. For example, if a pool node creation was pushed to the NIB by the output tables 1945, and the pool node creation failed, then the output tables 1945 would push the pool node creation again. In some embodiments, the output tables 1945 also register the input tables 1910 and the output tables 1945 for notification of state changes in the NIB.
[0331] To illustrate the operation of the output tables 1945, the physical forwarding engine output table class will be discussed in detail as an example. The physical forwarding engine output table class stores data tuples regarding physical forwarding engines to be distributed across the NIB. The physical forwarding engine output table class “PhysicalForwardingEngineOutputTable” can export data tuples for the following forwarding engines: forwarding engine chassis, forwarding nodes, and forwarding engines. The physical forwarding engine output table class contains the following member classes: external output table (“public ExternalOutputTable”), chassis export interface (“public ChassisExportInterface”), node export interface (“public NodeExportInterface”), Forwarding Engine export interface (“ForwardingEngineExportInterface”), and attribute reference manager (“AttributeRefManager”). The physical forwarding engine output table class contains the following attributes: table name (“table_name”), engine name (“engine_name”), NIB (“NIB* nib”), chassis export registry (“ChassisExportRegistry* chassis_registry”), node export registry (“NodeExportRegistry* node_registry”), Forwarding Engine export registry (“ForwardingEngineExportRegistry* engine_registry”), network ID (“const NetworkId& physical_network”), controller ID (“const UUID& controller_id”), and an OpenFlow configuration exporter to Open Virtual Switch databases (“OFConfigExportOVSDB* exporter”).
[0332] In order to elucidate the member classes and attributes of the physical forwarding engine output table class, an example of a physical forwarding engine output table object will be described below in conjunction with its code:
[0333]
| class PhysicalForwardingEngineOutputTable | |
| : public ExternalOutputTable<EntityId, ForwardingEngine>, | |
| public ChassisExportInterface, | |
| public NodeExportInterface, | |
| public ForwardingEngineExportInterface, | |
| public AttributeRefManager<ForwardingEngine> { | |
| public: | |
| PhysicalForwardingEngineOutputTable(const std::string& table_name, | |
| const std::string& engine_name, | |
| NIB* nib, | |
| ChassisExportRegistry* chassis_registry, | |
| NodeExportRegistry* node_registry, | |
| ForwardingEngineExportRegistry* engine_registry, | |
| const NetworkId& physical_network, | |
| const UUID& controller_id, | |
| OFConfigExportOVSDB* exporter); | |
| void start( ); | |
[0334] The attributes of the physical forwarding engine output table class define a physical forwarding engine output table object. The physical forwarding engine output table object pushes state changes to objects in the NIB according to the output of the rules engine. The physical forwarding engine output table object is further for monitoring the NIB for inconsistencies with the output of the rules engine.
[0335] The attributes that define a physical forwarding engine output table object can be seen above below “PhysicalForwardingEngineOutputTable”. The table name (“table_name”) defines the name of the object in order to identify the table. The engine name (“engine_name”) defines which physical forwarding engine in the output table object is to be populated by the object. The NIB pointer (“NIB* nib”) defines what NIB the object will export data tuples to. In some embodiments, there are multiple NIBs.
[0336] The export registry pointers are pointers to registry objects to the NIB identified by the NIB pointer. The pointers serve as a means to pass NIB state data back to the physical forwarding engine output table object. When the output of the rules engine does not match the NIB state data in the export registries, the physical forwarding engine output table object will push the output of the rules engine down to the NIB to correct the inconsistency. The physical forwarding engine output table object is notified of changes to NIB state using events as described above. In this manner, the physical forwarding engine output table object enforces the physical network configuration defined by the output of the rules engine.
[0337] The chassis export registry pointer (“ChassisExportRegistry* chassis_registry”) points to a NIB object that contains data tuples for physical chassis. In some embodiments, changes in the operational status of a chassis constitute an event for the chassis export registry. The node export registry pointer (“NodeExportRegistry* node_registry”) points to a NIB object that contains data tuples for nodes. The Forwarding Engine export registry pointer (“ForwardingEngineExportRegistry* engine_registry”) points to a NIB object that contains the data tuples the object stores for forwarding engines. In some embodiments, changes in the state of the forwarding engines constitute events for the Forwarding Engine export registry.
[0338] The network ID (“const NetworkId& physical_network”) defines the identity of a group of physical network items in the NIB that is relevant to the physical forwarding engine output table object. In some embodiments, the group of items relevant to the physical forwarding engine output table object is the entirety of the physical forwarding elements of the network. In some embodiments of the NIB, the NIB stores network IDs that identify groups of logical forwarding elements.
[0339] The controller ID (“const UUID& controller_id”) defines what controller instance the object is exporting from. In some embodiments, controller instances are grouped into clusters to pool processing power. In those embodiments, the controller ID identifies which controller in the controller cluster has made changes to NIB data. The OpenFlow configuration exporter pointer (“OFConfigExportOVSDB* exporter”) points to the OVS database exporter object in the NIB that the exports NIB state data to network elements.
[0340] The object's member classes serve as the object's means of receiving information from the NIB, storing the information in the object's registries, and sending data tuples to the output tables. The attribute reference manager (“AttributeRefManager”) receives information from the NIB and writes data tuples to the export registries using the export interfaces. The export interfaces (“ChassisExportInterface”, “NodeExportInterface”, and “ForwardingEngineExportInterface”) provide interfaces to allow the registries to be written to by the attribute reference manager. The external output table (“ExternalOutputTable”) sends data tuples to the output tables from the export registries using the exporter handle described above. The export interfaces are shown in this code sample:
[0341]
| // ChassisExportInterface implementation. | |
| void Register(const EntityPtr<Chassis>&) { } | |
| void Unregister(const EntityPtr<Chassis>&) { } | |
| void ConnectionStateChange(const EntityPtr<Chassis>&, | |
| const Chassis::ConnectionState&) { } | |
| void AddressAdd(const EntityPtr<Chassis>&, const Address&) { } | |
| void AddressRemove(const EntityPtr<Chassis>&, const Address&) { } | |
| void ForwardingEngineAdd(const EntityPtr<Chassis>&, | |
| const EntityPtr<ForwardingEngine>&); | |
| void ForwardingEngineRemove(const EntityPtr<Chassis>&, | |
| const EntityPtr<ForwardingEngine>&); | |
| // NodeExportInterface implementation. | |
| void Register(const EntityPtr<Node>&) { } | |
| void Unregister(const EntityPtr<Node>&) { } | |
| void AddressAdd(const EntityPtr<Node>&, const Address&) { } | |
| void AddressRemove(const EntityPtr<Node>&, const Address&) { } | |
| void PortAdd(const EntityPtr<Node>&, const EntityPtr<Port>&) { } | |
| void PortRemove(const EntityPtr<Node>&, const EntityPtr<Port>&) { } | |
| void UpdateStatistics(const EntityPtr<Node>&) { } | |
| void StatisticsUpdated(const EntityPtr<Node>&) { } | |
| void NameChange(const EntityPtr<Node>&, const std::string&); | |
| // ForwardingEngineExportInterface implementation | |
| void Register(const EntityPtr<ForwardingEngine>&); | |
| void Unregister(const EntityPtr<ForwardingEngine>&); | |
| void SubtypeChange(const EntityPtr<ForwardingEngine>&, const | |
| NetEntity::TypeIdParamType) { } | |
| void NameChange(const EntityPtr<ForwardingEngine>&,const std::string&) { } | |
| void NetworkUUIDsChange(const EntityPtr<ForwardingEngine>&, const std::string&) | |
| { } | |
[0342] void BridgeIDChange(const EntityPtr<ForwardingEngine>&, const std::string&) { }
[0343] There are three types of export interfaces. The export interfaces types include a physical forwarding chassis interface, a physical forwarding nodes interface, and a Forwarding Engine interface. The physical forwarding chassis interface consists of functions for changing the state of forwarding chassis in the output tables. The physical forwarding nodes interface consists of functions for changing the state of physical forwarding nodes in the output tables. In some embodiments, physical forwarding chassis and physical forwarding nodes include: x86 boxes, hypervisor boxes, hosts, pool nodes, extenders, and transport nodes. The Forwarding Engine interface consists of functions for changing the state of forwarding engines in the output tables. In some embodiments, forwarding engines (i.e., forwarding elements) include: physical switches, software switches, and virtual switches. The export interfaces provide a means of setting export registry data. The export interfaces support methods such as “register”, “unregister”, “AddressAdd” and “NameChange”. After data tuples are added to the export registries through the export interfaces, the external output table brings in said data tuples. The external output table's implementation can be seen in this code snippet:
[0344]
| // Implementations for the abstract methods of the ExternalOutputTable. |
| Tuple key(const Tuple& tuple); |
| key_type create(const Tuple& value, bool& error); |
| key_type modify(const key_type& id, const Tuple& value, bool& error); |
| bool destroy(const key_type& id); |
| void check_validity(const key_type& id); |
[0345] As shown above, the external output table entries can be created, modified, destroyed, or checked the validity of The output tables receive information from the NIB through the attribute reference manager. The attribute reference manager stores that information as data tuples in the export registries using the export interfaces, and the data tuples from the NIB is pushed to the external output table.
V. Control Application
[0346] As mentioned above, the control application of some embodiments converts control data records (also called data tuples) to forwarding plane data records (e.g., logical forwarding plane data) by performing conversion operations. Specifically, in some embodiments, the control application populates the logical data path tables (e.g., the logical forwarding tables) that are created by the virtualization application with logical data path sets.
[0347] FIG. 28 conceptually illustrates an example of such conversion operations that an instance of a control application of some embodiments performs. This figure conceptually illustrates a process 2800 that the control application performs to generate logical forwarding plane data based on input event data that specifies the logical control plane data. As described above, the generated logical forwarding plane data is transmitted to the virtualization application, which subsequently generate physical control plane data from the logical forwarding plane data. The physical control plane data is propagated to the managed switching elements, which in turn will produce forwarding plane data (e.g., flow entries) for defining forwarding behaviors of the switches.
[0348] As shown in FIG. 28 , the process 2800 initially receives (at 2805) data regarding an input event. The input event data may be logical data supplied by the user in some embodiments. As described in the above-identified U.S. patent application Ser. No. 13/177,532, now published as US2013/0058339, entitled “Network Control Apparatus and Method,” some embodiments provide the user with an interface that the user can use to specify input event data. An example of user-supplied data could be logical control plane data including access control list data for a logical switch that the user manages. The input event data may also be logical forwarding plane data that the control application generates in some embodiments from the logical control plane data. The input event data in some embodiments may also be physical forwarding plane data or physical control plane data received from the NIB. In some embodiments, the process 2800 receives the physical forwarding data from a NIB monitor that monitors the NIB to detect a change in the NIB that reflects a change in one or more managed switching elements.
[0349] At 2810, the process 2800 then performs a filtering operation to determine whether this instance of the control application is responsible for the input event data. As described above, several instances of the control application may operate in parallel to control multiple sets of logical data paths in some embodiments. In these embodiments, each control application uses the filtering operation to filter out input data that does not relate to the control application's logical data path set. To perform this filtering operation, the control application of some embodiments includes a filter module. This module in some embodiments is a standalone module, while in other embodiments it is implemented by a table mapping engine (e.g., implemented by the join operations performed by the table mapping engine) that maps records between input tables and output tables of the virtualization application, as further described below.
[0350] Next, at 2815, the process determines whether the filtering operation has filtered out the input event data. The filtering operation filters out the input event data in some embodiments when the input event data does not fall within one of the logical data path sets that are the responsibility of the control application. When the process determines (at 2815) that the filtering operation has filtered out the input event data, the process ends. Otherwise, the process 2800 transitions to 2820.
[0351] At 2820, a converter of the virtualization application generates one or more sets of data tuples based on the received input event data. In some embodiments, the converter is a table mapping engine that performs a series of table mapping operations on the input event data to map the input event data to other data tuples. As mentioned above, this table mapping engine also performs the filtering operation in some embodiments. One example of such a table mapping engine is an nLog table-mapping engine which will be described bellow.
[0352] In some embodiments, the data tuples that the process 2800 generates may include data (e.g., logical forwarding plane data) that the process has to push down to the NIB. Accordingly, at 2825, the process publishes to the NIB any data tuples that it has generated if such publication is necessary. After 2825, the process ends.
[0353] The control application in some embodiments performs its mapping operations by using the nLog table mapping engine, which, as described above, is a variation of the datalog table mapping technique. FIG. 29 illustrates a control application 2900 of some embodiments of the invention. This application 2900 uses an nLog table mapping engine to map input tables that contain input data tuples to LDPS data tuples. This application resides on top of a virtualization application 2905 that receives the LDPS data tuples from the control application 2900. The virtualization application 2905 maps the LDPS data tuples to data tuples for defining managed switching elements, attributes of the managed switching elements, and flow entries for the managed switching elements. The virtual application 2905 resides on top of a NOS 2965 that contains a NIB 2960 that stores the data tuples generated by the virtualization application 2905.
[0354] More specifically, the control application 2900 allows different users to define different logical data path sets (LDPS), which specify the desired switching configurations of the users. The control application 2900 also reacts to changes in the NIB to modify the LDPS'. The virtualization application 2905 through its mapping operations converts each of the LDPS of each user into a set of data tuples to populate to the NIB. The virtualization application 2905 then populates the NIB 2960 with the generated sets of data tuples. When the NOS 2965 subsequently propagates the NIB data tuples for a particular user to the switching element(s), the NOS completes the deployment of the user's switching configuration to one or more switching elements. In some embodiments, the control application is executed on the same machine with the virtualization application and the NOS. However, the control application, the virtualization application, and the NOS do not have to run on the same machine in other embodiments. That is, one of these applications or each of these applications may run on a different computer.
[0355] As shown in FIG. 29 , the control application 2900 includes a set of rule-engine input tables 2910, a set of function and constant tables 2915, a query manager 2920, a rules engine 2925, a set of rule-engine output tables 2945, a NIB monitor 2950, a publisher 2955, and a compiler 2935. The compiler 2935 is one component of the application that operates at a different instance in time than the application's other components. The compiler operates when a developer needs to specify the rules engine for a particular control application and/or virtualized environment, whereas the rest of the application's modules operate at run time when the application interfaces with the control application and the NOS to deploy and monitor logical data path sets specified by one or more users.
[0356] In some embodiments, the compiler 2935 takes a relatively small set (e.g., few hundred lines) of declarative instructions 2940 that are specified in a declarative language and converts these into a large set (e.g., thousands of lines) of code that specify the operation of the rules engine 2925, which performs the application's table mapping. As such, the compiler greatly simplifies the control application developer's process of defining and updating the control application. This is because the compiler allows the developer to use a high level programming language that allows a compact definition of the control application's complex mapping operation and to subsequently update this mapping operation in response to any number of changes (e.g., changes in the logical networking functions supported by the control application, changes to desired behavior of the control application, etc.).
[0357] In some embodiments, the rule-engine (RE) input tables 2910 include tables with logical data and/or switching configurations (e.g., access control list configurations, private virtual network configurations, port security configurations, etc.) specified by the user and/or the control application. They also include in some embodiments tables that contain physical data (i.e., non-logical data) from the switching elements managed by the virtualized control system. In some embodiments, such physical data includes data regarding the managed switching elements (e.g., physical control plane data) and other data regarding network configuration employed by the virtualized control system to deploy the different LDPS' of the different users.
[0358] The RE input tables 2910 are partially populated by the LDPS data (e.g., logical control plane data) provided by the user. It also generates part of the LDPS data (e.g., logical forwarding plane data) and physical (i.e., non-logical) data (e.g., physical control plane data) by monitoring the NIB to identify changes in the managed switching element infrastructure that would require modification to the LDPS data and/or the physical data.
[0359] In addition to the RE input tables 2910, the control application 2900 includes other miscellaneous tables 2915 that the rules engine 2925 uses to gather inputs for its table mapping operations. These tables 2915 include constant tables that store defined values for constants that the rules engine 2925 needs to perform its table mapping operations.
[0360] When the rules engine 2925 references constants, the corresponding value defined for the constants are actually retrieved and used. In addition, the values defined for constants in the constant table 2915 may be modified and/or updated. In this manner, the constant table 2915 provides the ability to modify the value defined for constants that the rules engine 2925 references without the need to rewrite or recompile code that specifies the operation of the rules engine 2925.
[0361] The tables 2915 further include function tables that store functions that the rules engine 2925 needs to use to calculate values needed to populate the output tables 2945. One example of such a function is a hash function that the rules engine uses to compute hash values for distributing distributed hash table (DHT) operations as well as load balancing traffic between lower level switches and higher level switches in a hierarchical switching architecture.
[0362] The rules engine 2925 performs table mapping operations that specify one manner for converting any logical data path set within the logical control plane to a logical data path set in the logical forwarding plane. Whenever one of the rule-engine (RE) input tables is modified, the rules engine performs a set of table mapping operations that may result in the modification of one or more data tuples in one or more RE output tables. The modification of the output table data tuples, in turn, through the virtualization application 2905, may cause the NIB to be modified in order to establish and/or modify the implementation of a particular user's LDPS in the managed switching element infrastructure.
[0363] As shown in FIG. 29 , the rules engine 2925 includes an event processor 2922, several query plans 2927, and a table processor 2930. Each query plan is a set of rules that specify a set of join operations that are to be performed upon the occurrence of a modification to one of the RE input table. Such a modification is referred to below as an input table event. As described above, each query plan is generated by the compiler 2935 from one declaratory rule in the set of declarations 2940. In some embodiments, the query plans are defined by using the nLog declaratory language.
[0364] In some embodiments, the compiler 2935 does not just statically generate query plans but rather dynamically generates query plans based on performance data it gathers. The complier 2935 in these embodiments generates an initial set of query plans and let the rules engine operate with the initial set of query plans. The control application gathers the performance data or receives performance feedbacks (e.g., from the rules engine). Based on this data, the compiler is modified so that the control application or a user of this application can have the modified compiler modify the query plans while the rules engine is not operating or during the operation of the rules engine.
[0365] For instance, the order of the join operations in a query plan may result in different execution times depending on the number of tables the rules engine has to select to perform each join operation. The compiler in these embodiments can be re-specified in order to re-order the join operations in a particular query plan when a certain order of the join operations in the particular query plan has resulted in a long execution time to perform the join operations.
[0366] The event processor 2922 of the rules engine 2925 detects the occurrence of each input table event. The event processor of different embodiments detects the occurrence of an input table event differently. In some embodiments, the event processor registers for callbacks with the RE input tables for notification of changes to the records of the RE input tables. In such embodiments, the event processor 2922 detects an input table event when it receives notification from a RE input table that one of its records has changed.
[0367] In response to a detected input table event, the event processor 2922 (1) selects the appropriate query plan for the detected table event, and (2) directs the table processor 2930 to execute the query plan. To execute the query plan, the table processor 2930 in some embodiments performs the join operations specified by the query plan to produce one or more records that represent one or more sets of data values from one or more input and miscellaneous tables 2910 and 2915. The table processor 2930 of some embodiments then (1) performs a select operation to select a subset of the data values from the record(s) produced by the join operations, and (2) writes the selected subset of data values in one or more RE output tables 2945.
[0368] In some embodiments, the RE output tables 2945 store both logical and physical network element data attributes. The tables 2945 are called RE output tables as they store the output of the table mapping operations of the rules engine 2925. In some embodiments, the RE output tables can be grouped in several different categories. For instance, in some embodiments, these tables can be RE input tables and/or control-application (CA) output tables. A table is a RE input table when a change in the table causes the rules engine to detect an input event that requires the execution of a query plan. A RE output table 2945 can also be a RE input table 2910 that generates an event that causes the rules engine to perform another query plan. Such an event is referred to as an internal input event, and it is to be contrasted with an external input event, which is an event that is caused by a RE input table modification made by the control application 2900 or the NIB monitor 2950.
[0369] A table is a control-application output table when a change in the table causes the publisher 2955 to publish a change to the virtualization application 2905 and/or to the NIB, as further described below. A table in the RE output tables 2945 can be a RE input table, a CA output table, or both a RE input table and a CA output table.
[0370] The publisher 2955 detects changes to the CA output tables of the RE output tables 2945. The publisher of different embodiments detects the occurrence of a CA output table event differently. In some embodiments, the publisher registers for callbacks with the CA output tables for notification of changes to the records of the CA output tables. In such embodiments, the publisher 2955 detects an output table event when it receives notification from a CA output table that one of its records has changed.
[0371] In response to a detected output table event, the publisher 2955 takes some or all of modified data tuples in the modified CA output tables and propagates this modified data tuple(s) to the input tables (not shown) of the virtualization application 2905. In some embodiments, instead of the publisher 2955 pushing the data tuples to the virtualization application, the virtualization application 2905 pulls the data tuples from the CA output tables 2945 into the input tables of the virtualization application. Alternatively, in some embodiments, the publisher 2955 publishes changes to the modified CA output tables to the NIB, and the virtualization application 2905 retrieves these changes from the NIB and based on them, modifies its input tables. In some embodiments, the CA output tables 2945 of the control application 2900 and the input tables of the virtualization 2905 may be identical. In yet other embodiments, the control and virtualization applications use one set of tables, so that the CA output tables are essentially VA input tables.
[0372] Moreover, the publisher 2955 in some embodiments takes some or all of modified data tuples in the modified CA output tables and propagates this modified data tuple into the NIB 2960 through the APIs provided by the NOS 2965. Also, the publisher may push down logical data (e.g., logical control plane data, logical forwarding plane data, etc.) processed and maintained by the control application 2900 to the NIB 2960. This is because, in some embodiments, the NIB 2960 serves as a medium for all communications between the control application, the virtualization application, and the NOS of different controller instances as described above.
[0373] As the CA output tables store both logical and physical network element data attributes in some embodiments, the NIB 2960 in some embodiments stores both logical and physical network element attributes that are identical or derived by the virtualization application 2905 from the logical and physical network element data attributes in the output tables 2945. In other embodiments, however, the NIB only stores physical network element attributes that are identical or derived by the virtualization application 2905 from the physical network element data attributes in the output tables 2945.
[0374] The NIB monitor 2950 interfaces with the NIB 2960 to receive notifications regarding changes to the NIB. The NIB monitor of different embodiments detects the occurrence of a change in the NIB differently. In some embodiments, the NIB monitor registers for callbacks with the NIB for notification of changes to one or more records in the NIB. In such embodiments, the NIB monitor 2950 detects NIB change event when it receives notification from the NIB that one of its records has changed. In response to a detected NIB change event, the NIB monitor 2950 may modify one or more RE input tables 2910, which, in turn, may cause one or more RE input table event to occur that then initiates the execution of one or more query plans by the rules engine. In other words, the NIB monitor writes some or all of the information that it receives from the NIB into the input tables 2910, so that the state and configuration of the managed switching elements can be accounted for while generating the NIB data tuples through the mapping operations. Each time the managed switching configuration or underlying managed switching element state changes, the NIB monitor 2950 may update the input table records 2910 so that the generated NIB data tuples can be updated to reflect the modified switching configuration or underlying switching element state.
[0375] In some embodiments, the NIB monitor 2950 is a collection of input objects (or functions) associated with the RE input tables. Each input object in some embodiments is associated with one RE input table and is responsible for modifying its associated RE input table in response to a change in the NIB. Each input object in some embodiments registers with one or more NIB objects for callback notifications upon the occurrence of changes to the NIB object(s). Similarly, in some embodiments, the publisher 2955 is a collection of output objects (or functions) associated with the CA output tables. Each output object in some embodiments is associated with one CA output table and is responsible for propagating changes in its associated output table to the virtualization application 2905. As such, in some embodiments, the NIB monitor is a conceptual representation of the input and output objects that register with the NIB for callbacks.
[0376] The query manager 2920 interfaces with the control application 2900 to receive queries regarding LDPS data. As shown in FIG. 29 , the query manager 2920 of some embodiments also interfaces with the NIB 2960 in order to query the NIB to provide the control application state information regarding the network elements in the LDPS' for the different user. In other embodiments, however, the query manager 2920 queries the output tables 2945 to obtain LDPS data for the control application.
[0377] FIG. 30 illustrates a simplified view of the table mapping operations of the control and virtualization applications of some embodiments of the invention. As indicated in the top half of this figure, the control application 3005 maps logical control plane data to logical forwarding plane data, which the virtualization application 3010 then maps to physical control plane data. The bottom half of this figure illustrates the table mapping operations of the control application and the virtualization application. As shown in this half, the control application's input tables 3015 store logical control plane (LCP) data, logical forwarding plane (LFP) data and physical control plane (PCP) data, as the collection of all these data along with data in the constant and function tables (not shown) is used by the control application's nLog engine 3020 in some embodiments to generate logical forwarding plane data from the input logical control plane data.
[0378] This figure further shows the NIB publisher 3030 receiving some or all of the input table records and publishing these records to the NIB 3040. As further shown, the NIB monitor 3050 receives NIB change notifications (e.g., notifications of managed switch changes detected by the NOS or notification of NIB changes pushed by the other controller instances) in some embodiments and in response to such notifications it may update input and output tables 3015 and 3025 of the control application. In some embodiments, the NIB monitor 3050 may write LCP, LFP, or PCP data to the input tables 3015 in response to NIB modification notifications.
[0379] The bottom half of FIG. 30 also illustrates the table mapping operations of the virtualization application 3010. As shown, the virtualization application's input tables 3055 store logical forwarding plane data and physical control plane data, as the collection of all these data along with data in the constant and function tables (not shown) is used by the virtualization application's nLog engine 3060 in some embodiments to generate physical control plane data from the input logical forwarding plane data.
[0380] This figure further shows the NIB publisher 3070 receiving some or all of the input table records and publishing these records to the NIB 3040. As further shown, the NIB monitor 3075 receives NIB change notifications in some embodiments and in response to such notifications it may update input and output tables 3055 and 3065 of the virtualization application. In some embodiments, the NIB monitor 3075 may write LFP or PCP data to the input tables 3055 in response to NIB modification notifications.
[0381] As mentioned above, some of the logical or physical data that a NIB monitor pushes to the input tables of the control or virtualization application relates to data that is generated by other controller instances and passed to the NIB monitor's particular NIB (e.g., through the secondary storage layer). For instance, in some embodiments, the logical data regarding logical constructs that relates to multiple LDPS' might change, and the NIB monitor may write this change to the input tables. Another example of such logical data that is produced by another controller instance in a multi controller instance environment occurs when a user provides logical control plane data for a LDPS on a first controller instance that is not responsible for the LDPS. This change requests is added to the NIB request list (such as the NIB request list 1560 described above by reference to FIG. 15 ) of the first controller instance. This request list is then propagated across the NIBs of other controller instances by replication processes described above. The NOS of a second controller instance, which is the master of the LDPS, eventually makes the change to the NIB of the second controller instance based on the propagated request list. The NIB monitor of the second controller instance then writes the change to the one of the application's input tables (e.g., the control application's input table). Accordingly, in such cases, the logical data that the NIB monitor writes to the input tables in some cases may originate from the NIB of another controller instance.
[0382] As mentioned above, the control application 3005 and the virtualization application 3010 are two separate applications that operate on the same machine or different machines in some embodiments. Other embodiments, however, implement these two applications as two modules of one integrated application, with the control application module 3005 generating LDPS in the logical forwarding plane and the virtualization application generating physical data path sets in the physical control plane.
[0383] Still other embodiments integrate the control and virtualization operations of these two applications within one integrated application, without separating these operations into two separate modules. FIG. 31 illustrates an example of such an integrated application 3105. This application 3105 uses an nLog table mapping engine 3110 to map data from an input set of tables 3115 to an output set of tables 3120, which like the above described embodiments, may include one or more tables in the input set of tables. The input set of tables in this integrated application may include LCP data that need to be mapped to LFP data, or it may include LFP data that need to be mapped to PCP data.
[0384] In this integrated control and virtualization application 3105, a NIB publisher 3125 publishes input table records and output table records to the NIB 3135. A NIB monitor 3130 then receives notification of changes from the NIB 3135 (e.g., managed switch changes detected by the NOS or NIB changes pushed by the other controller instances), and for some notifications (e.g., those relating to the LDPS' for which the application is the master), pushes changes to the input and/or tables 3115 and 3120.
VI. Electronic System
[0385] Many of the above-described features and applications are implemented as software processes that are specified as a set of instructions recorded on a computer readable storage medium (also referred to as computer readable medium). When these instructions are executed by one or more processing unit(s) (e.g., one or more processors, cores of processors, or other processing units), they cause the processing unit(s) to perform the actions indicated in the instructions. Examples of computer readable media include, but are not limited to, CD-ROMs, flash drives, RAM chips, hard drives, EPROMs, etc. The computer readable media does not include carrier waves and electronic signals passing wirelessly or over wired connections.
[0386] In this specification, the term “software” is meant to include firmware residing in read-only memory or applications stored in magnetic storage, which can be read into memory for processing by a processor. Also, in some embodiments, multiple software inventions can be implemented as sub-parts of a larger program while remaining distinct software inventions. In some embodiments, multiple software inventions can also be implemented as separate programs. Finally, any combination of separate programs that together implement a software invention described here is within the scope of the invention. In some embodiments, the software programs, when installed to operate on one or more electronic systems, define one or more specific machine implementations that execute and perform the operations of the software programs.
[0387] FIG. 32 conceptually illustrates an electronic system 3200 with which some embodiments of the invention are implemented. The electronic system 3200 can be used to execute any of the control, virtualization, or operating system applications described above. The electronic system 3200 may be a computer (e.g., a desktop computer, personal computer, tablet computer, server computer, mainframe, a blade computer etc.), phone, PDA, or any other sort of electronic device. Such an electronic system includes various types of computer readable media and interfaces for various other types of computer readable media. Electronic system 3200 includes a bus 3205, processing unit(s) 3210, a system memory 3225, a read-only memory 3230, a permanent storage device 3235, input devices 3240, and output devices 3245.
[0388] The bus 3205 collectively represents all system, peripheral, and chipset buses that communicatively connect the numerous internal devices of the electronic system 3200. For instance, the bus 3205 communicatively connects the processing unit(s) 3210 with the read-only memory 3230, the system memory 3225, and the permanent storage device 3235.
[0389] From these various memory units, the processing unit(s) 3210 retrieve instructions to execute and data to process in order to execute the processes of the invention. The processing unit(s) may be a single processor or a multi-core processor in different embodiments.
[0390] The read-only-memory (ROM) 3230 stores static data and instructions that are needed by the processing unit(s) 3210 and other modules of the electronic system. The permanent storage device 3235, on the other hand, is a read-and-write memory device. This device is a non-volatile memory unit that stores instructions and data even when the electronic system 3200 is off. Some embodiments of the invention use a mass-storage device (such as a magnetic or optical disk and its corresponding disk drive) as the permanent storage device 3235.
[0391] Other embodiments use a removable storage device (such as a floppy disk, flash drive, etc.) as the permanent storage device. Like the permanent storage device 3235, the system memory 3225 is a read-and-write memory device. However, unlike storage device 3235, the system memory is a volatile read-and-write memory, such a random access memory. The system memory stores some of the instructions and data that the processor needs at runtime. In some embodiments, the invention's processes are stored in the system memory 3225, the permanent storage device 3235, and/or the read-only memory 3230. For example, the various memory units include instructions for implementing the processes in accordance with some embodiments. From these various memory units, the processing unit(s) 3210 retrieve instructions to execute and data to process in order to execute the processes of some embodiments.
[0392] The bus 3205 also connects to the input and output devices 3240 and 3245. The input devices enable the user to communicate information and select commands to the electronic system. The input devices 3240 include alphanumeric keyboards and pointing devices (also called “cursor control devices”). The output devices 3245 display images generated by the electronic system. The output devices include printers and display devices, such as cathode ray tubes (CRT) or liquid crystal displays (LCD). Some embodiments include devices such as a touchscreen that function as both input and output devices.
[0393] Finally, as shown in FIG. 32 , bus 3205 also couples electronic system 3200 to a network 3265 through a network adapter (not shown). In this manner, the computer can be a part of a network of computers (such as a local area network (“LAN”), a wide area network (“WAN”), or an Intranet, or a network of networks, such as the Internet. Any or all components of electronic system 3200 may be used in conjunction with the invention.
[0394] Some embodiments include electronic components, such as microprocessors, storage and memory that store computer program instructions in a machine-readable or computer-readable medium (alternatively referred to as computer-readable storage media, machine-readable media, or machine-readable storage media). Some examples of such computer-readable media include RAM, ROM, read-only compact discs (CD-ROM), recordable compact discs (CD-R), rewritable compact discs (CD-RW), read-only digital versatile discs (e.g., DVD-ROM, dual-layer DVD-ROM), a variety of recordable/rewritable DVDs (e.g., DVD-RAM, DVD-RW, DVD+RW, etc.), flash memory (e.g., SD cards, mini-SD cards, micro-SD cards, etc.), magnetic and/or solid state hard drives, read-only and recordable Blu-Ray® discs, ultra density optical discs, any other optical or magnetic media, and floppy disks. The computer-readable media may store a computer program that is executable by at least one processing unit and includes sets of instructions for performing various operations. Examples of computer programs or computer code include machine code, such as is produced by a compiler, and files including higher-level code that are executed by a computer, an electronic component, or a microprocessor using an interpreter.
[0395] While the above discussion primarily refers to microprocessor or multi-core processors that execute software, some embodiments are performed by one or more integrated circuits, such as application specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs). In some embodiments, such integrated circuits execute instructions that are stored on the circuit itself.
[0396] As used in this specification, the terms “computer”, “server”, “processor”, and “memory” all refer to electronic or other technological devices. These terms exclude people or groups of people. For the purposes of the specification, the terms display or displaying means displaying on an electronic device. As used in this specification, the terms “computer readable medium,” “computer readable media,” and “machine readable medium” are entirely restricted to tangible, physical objects that store information in a form that is readable by a computer. These terms exclude any wireless signals, wired download signals, and any other ephemeral signals.
[0397] While the invention has been described with reference to numerous specific details, one of ordinary skill in the art will recognize that the invention can be embodied in other specific forms without departing from the spirit of the invention. For instance, a number of the figures (including FIGS. 18 , 23 and 28) conceptually illustrate processes. The specific operations of these processes may not be performed in the exact order shown and described. The specific operations may not be performed in one continuous series of operations, and different specific operations may be performed in different embodiments. Furthermore, the process could be implemented using several sub-processes, or as part of a larger macro process.
[0398] Also, several embodiments were described above in which a user provides logical data path sets in terms of logical control plane data. In other embodiments, however, a user may provide logical data path sets in terms of logical forwarding plane data. In addition, several embodiments were described above in which a controller instance provides physical control plane data to a switching element in order to manage the switching element. In other embodiments, however, the controller instance may provide the switching element with physical forwarding plane data. In such embodiments, the NIB would store physical forwarding plane data and the virtualization application would generate such data.
[0399] Furthermore, in several examples above, a user specifies one or more logic switches. In some embodiments, the user can provide physical switch configurations along with such logic switch configurations. Also, even though controller instances are described that in some embodiments are individually formed by several application layers that execute on one computing device, one of ordinary skill will realize that such instances are formed by dedicated computing devices or other machines in some embodiments that perform one or more layers of their operations.
[0400] Also, several examples described above show that a logical data path set is associated with one user. One of the ordinary skill in the art will recognize that then a user may be associated with one or more sets of logical data paths in some embodiments. That is, the relationship between a logical data path set is not always a one-to-one relationship as a user may be associated with multiple logical data path sets. Thus, one of ordinary skill in the art would understand that the invention is not to be limited by the foregoing illustrative details.
Claims
What is claimed is:
1. A virtualization application for managing a plurality of managed switching elements that forward data through a network, the virtualization application comprising:
a first set of tables for storing input logical forwarding plane data tuples that define a logical data path set as a plurality of logical flow entries;
a second set of tables for storing output physical control plane data tuples that define rules for the managed switching elements to follow in order to implement the logical data path set when processing data packets; and
a table mapping engine for mapping the input logical forwarding plane data tuples in the first set of tables to output physical control plane data tuples in the second set of tables by performing a set of database join operations on the input logical forwarding plane data tuples in the first set of tables,
wherein at least a portion of the physical control plane data tuples are for propagation to a set of managed switching elements for subsequent translation by the managed switching elements into physical forwarding behaviors that direct the forwarding of data by the managed switching elements in order to effectuate the logical data path set.
2. The virtualization application of claim 1, wherein the table mapping engine comprises:
a plurality of different query plans for specifying different sets of database join operations to execute upon occurrence of different input data events; and
a table processor for executing a particular set of database join operations associated with a particular query plan upon occurrence of a particular input data event.
3. The virtualization application of claim 2, wherein the table mapping engine further comprises an event processor that (i) detects occurrence of an input data event, (ii) identifies a query plan associated with the detected input data event, and (iii) directs the table processor to execute a set of join operations associated with the identified query plan.
4. The virtualization application of claim 1, wherein the input logical forwarding plane data tuples are at least partially based on data supplied by at least one user.
5. The virtualization application of claim 1 further comprising a monitor for (i) monitoring a network data structure that stores a state of the managed switching elements and (ii) supplying the first set of tables with input logical forwarding plane data tuples based on the state of the managed switching elements.
6. The virtualization application of claim 1, wherein the first set of tables are further for storing input physical control plane data tuples, the virtualization application further comprising a monitor for monitoring a state of the managed switching elements and supplying the first set of tables with input physical control plane data tuples based on the state of the managed switching elements.
7. The virtualization application of claim 6, wherein the monitor is further for monitoring the managed switching elements and supplying the first set of tables with input logical forwarding plane data tuples based on the state of the managed switching elements.
8. The virtualization application of claim 1, wherein the first set of tables comprises at least one table for storing constant values necessary for the join operations.
9. The virtualization application of claim 1, wherein the first set of tables comprise at least one table for storing functions necessary for the join operations.
10. The virtualization application of claim 1 further comprising a publisher for publishing data from the second set of tables to a data storage structure for storing the physical control plane data.
11. The virtualization application of claim 1, wherein the set of database join operations includes inner join operations and does not include outer join operations.
12. The virtualization application of claim 1, wherein the virtualization application receives at least a portion of the input logical forwarding plane data tuples from a control application that converts input logical control plane data tuples, that defines the logical data path set at least partially as specified by a user, to logical forwarding plane data tuples.
13. The virtualization application of claim 12, wherein the virtualization application and the control application execute on a same computer.
14. The virtualization application of claim 12, wherein the virtualization application and the control application execute on two different computers.
15. The virtualization application of claim 1, wherein the output physical control plane data comprises a set of logical flow entries in at least one logical forwarding table that is not accessible for input by a source of input of the logical forwarding plane data.
16. The virtualization application of claim 15, wherein a plurality of the logical flow entries specify at least one of Layer 2 forwarding rules for forwarding of data between logical Media Access Control (MAC) addresses and Layer 3 forwarding rules for forwarding of data between logical Internet Protocol (IP) addresses of logical switching elements.
17. The virtualization application of claim 1, wherein the table mapping engine is for mapping records in the first set of tables to records in the second set of tables, wherein a plurality of the records in the second set of tables contain the output physical control plane data tuples, wherein the second set of tables includes tables that have records that upon changing cause the table mapping engine to perform additional join operations to produce output physical control plane data.
18. A non-transitory computer readable medium storing a program which when executed by at least one processing unit generates physical control plane data from logical forwarding plane data, the program comprising sets of instructions for:
detecting a change in input logical forwarding plane data tuples that define a logical data path set as a plurality of logical flow entries;
selecting, upon detecting the change, a query plan from a plurality of different query plans for the input logical forwarding plane data tuples based on the change, the selected query plan comprising a set of database join operations; and
executing the selected query plan on the input logical forwarding plane data tuples to generate output physical control plane data tuples that define rules for a set of managed switching elements to follow in order to effectuate processing of the logical data path set.
19. The non-transitory computer readable medium of claim 18, wherein the input logical forwarding plane data tuples are stored in a first set of tables and the output physical control plane data tuples are stored in a second set of tables.
20. The non-transitory computer readable medium of claim 18, wherein the program further comprises a set of instructions for publishing the output physical control plane data tuples for distribution to the set of managed switching elements.
21. A method for managing a network comprising a plurality of network elements, the network elements comprising a plurality of managed switching elements that forward data among the network elements, the method comprising:
receiving input logical forwarding plane data tuples from a user, the logical forwarding plane data tuples defining a logical data path set as a plurality of logical flow entries;
storing the received input logical forwarding plane data tuples in a first set of tables;
mapping the input logical forwarding plane data tuples to output physical control plane data tuples by performing a set of database join operations on the input logical forwarding plane data tuples, wherein the output physical control plane data tuples define rules for the managed switching elements to follow in order to implement the logical data path set when processing data packets;
storing the output physical control plane data tuples in a second set of tables, wherein the stored output physical control plane data tuples are for subsequent distribution to the managed switching elements for translation by the managed switching elements into a set of physical data paths that defines forwarding behaviors of the managed switching elements.
22. The method of claim 21 further comprising publishing the stored output physical control plane data tuples to a data storage structure that stores network state information.
23. The method of claim 22, wherein the output physical control plane data tuples are distributed to the managed switching elements from the data storage structure.
Patent Citations (218)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4961139(A) | 1990-10-01 | Hong et al. | Examiner |
| US5265092(A) | 1993-11-01 | Soloway et al. | Applicant |
| US5504921(A) | 1996-04-01 | Dev et al. | Applicant |
| US5729685(A) | 1998-03-01 | Chatwani et al. | Applicant |
| US5751967(A) | 1998-05-01 | Raab et al. | Applicant |
| US5796936(A) | 1998-08-01 | Watabe et al. | Applicant |
| US5832222(A) | 1998-11-01 | Dziadosz et al. | Applicant |
| US5926463(A) | 1999-07-01 | Ahearn et al. | Applicant |
| US6006275(A) | 1999-12-01 | Picazo, Jr. et al. | Applicant |
| US6055243(A) | 2000-04-01 | Vincent et al. | Applicant |
| US6104699(A) | 2000-08-01 | Holender et al. | Applicant |
| US6104700(A) | 2000-08-01 | Haddock et al. | Applicant |
| US6219699(B1) | 2001-04-01 | McCloghrie et al. | Applicant |
| US6324275(B1) | 2001-11-01 | Yagel et al. | Applicant |
| US6366657(B1) | 2002-04-01 | Yagel et al. | Applicant |
| US6512745(B1) | 2003-01-01 | Abe et al. | Applicant |
| US6680934(B1) | 2004-01-01 | Cain | Applicant |
| US6697338(B1) | 2004-02-01 | Breitbart et al. | Applicant |
| US6735602(B2) | 2004-05-01 | Childress et al. | Applicant |
| US6785843(B1) | 2004-08-01 | McRae et al. | Examiner |
| US6894983(B1) | 2005-05-01 | Lederman et al. | Applicant |
| US6912221(B1) | 2005-06-01 | Zadikian et al. | Applicant |
| US6959002(B2) | 2005-10-01 | Wynne et al. | Applicant |
| US6963585(B1) | 2005-11-01 | Le Pennec et al. | Applicant |
| US7042912(B2) | 2006-05-01 | Ashwood Smith et al. | Applicant |
| US7046630(B2) | 2006-05-01 | Abe et al. | Applicant |
| US7126923(B1) | 2006-10-01 | Yang et al. | Applicant |
| US7158972(B2) | 2007-01-01 | Marsland | Applicant |
| US7197561(B1) | 2007-03-01 | Lovy et al. | Applicant |
| US7209439(B2) | 2007-04-01 | Rawlins et al. | Applicant |
| US7263290(B2) | 2007-08-01 | Fortin et al. | Examiner |
| US7283473(B2) | 2007-10-01 | Arndt et al. | Applicant |
| US7286490(B2) | 2007-10-01 | Saleh et al. | Applicant |
| US7342916(B2) | 2008-03-01 | Das et al. | Examiner |
| US7343410(B2) | 2008-03-01 | Mercier et al. | Applicant |
| US7359971(B2) | 2008-04-01 | Jorgensen | Applicant |
| US7450598(B2) | 2008-11-01 | Chen et al. | Applicant |
| US7478173(B1) | 2009-01-01 | Delco | Applicant |
| US7555002(B2) | 2009-06-01 | Arndt et al. | Applicant |
| US7587492(B2) | 2009-09-01 | Dyck et al. | Applicant |
| US7590669(B2) | 2009-09-01 | Yip et al. | Applicant |
| US7606260(B2) | 2009-10-01 | Oguchi et al. | Applicant |
| US7649851(B2) | 2010-01-01 | Takashige et al. | Applicant |
| US7710874(B2) | 2010-05-01 | Balakrishnan et al. | Applicant |
| US7764599(B2) | 2010-07-01 | Doi et al. | Applicant |
| US7783856(B2) | 2010-08-01 | Hashimoto et al. | Applicant |
| US7802251(B2) | 2010-09-01 | Kitamura | Applicant |
| US7826482(B1) | 2010-11-01 | Minei et al. | Applicant |
| US7856549(B2) | 2010-12-01 | Wheeler | Applicant |
| US7912955(B1) | 2011-03-01 | Machiraju et al. | Applicant |
| US7925661(B2) | 2011-04-01 | Broussard et al. | Applicant |
| US7936770(B1) | 2011-05-01 | Frattura et al. | Applicant |
| US7945658(B1) | 2011-05-01 | Nucci et al. | Applicant |
| US7948986(B1) | 2011-05-01 | Ghosh et al. | Applicant |
| US7970917(B2) | 2011-06-01 | Nakano et al. | Applicant |
| US7995483(B1) | 2011-08-01 | Bayar et al. | Applicant |
| US8027354(B1) | 2011-09-01 | Portolani et al. | Applicant |
| US8031633(B2) | 2011-10-01 | Bueno et al. | Applicant |
| US8032899(B2) | 2011-10-01 | Archer et al. | Applicant |
| US8060875(B1) | 2011-11-01 | Lambeth | Applicant |
| US8089871(B2) | 2012-01-01 | Iloglu et al. | Applicant |
| US8130648(B2) | 2012-03-01 | Kwan et al. | Applicant |
| US8155028(B2) | 2012-04-01 | Abu-Hamdeh et al. | Applicant |
| US8161152(B2) | 2012-04-01 | Ogielski et al. | Applicant |
| US8199750(B1) | 2012-06-01 | Schultz et al. | Applicant |
| US8223668(B2) | 2012-07-01 | Allan et al. | Applicant |
| US8265075(B2) | 2012-09-01 | Pandey | Applicant |
| US8339959(B1) | 2012-12-01 | Moisand et al. | Applicant |
| US8339994(B2) | 2012-12-01 | Gnanasekaran et al. | Applicant |
| US2001/0043614(A1) | 2001-11-01 | Viswanadham et al. | Applicant |
| US2002/0034189(A1) | 2002-03-01 | Haddock et al. | Applicant |
| US2002/0093952(A1) | 2002-07-01 | Gonda | Examiner |
| US2002/0194369(A1) | 2002-12-01 | Rawlins et al. | Applicant |
| US2003/0009552(A1) | 2003-01-01 | Benfield et al. | Applicant |
| US2003/0058850(A1) | 2003-03-01 | Rangarajan et al. | Applicant |
| US2003/0204768(A1) | 2003-10-01 | Fee | Applicant |
| US2004/0054680(A1) | 2004-03-01 | Kelley et al. | Applicant |
| US2004/0054793(A1) | 2004-03-01 | Coleman | Applicant |
| US2004/0073659(A1) | 2004-04-01 | Rajsic et al. | Applicant |
| US2004/0098505(A1) | 2004-05-01 | Clemmensen | Applicant |
| US2004/0210889(A1) | 2004-10-01 | Childress et al. | Applicant |
| US2004/0267866(A1) | 2004-12-01 | Carollo et al. | Applicant |
| US2004/0267897(A1) | 2004-12-01 | Hill et al. | Applicant |
| US2005/0018669(A1) | 2005-01-01 | Arndt et al. | Applicant |
| US2005/0021683(A1) | 2005-01-01 | Newton et al. | Applicant |
| US2005/0027881(A1) | 2005-02-01 | Figueira et al. | Applicant |
| US2005/0050377(A1) | 2005-03-01 | Chan et al. | Applicant |
| US2005/0120160(A1) | 2005-06-01 | Plouffe et al. | Applicant |
| US2005/0132044(A1) | 2005-06-01 | Guingo et al. | Applicant |
| US2005/0201398(A1) | 2005-09-01 | Naik et al. | Applicant |
| US2005/0232230(A1) | 2005-10-01 | Nagami et al. | Applicant |
| US2006/0026225(A1) | 2006-02-01 | Canali et al. | Applicant |
| US2006/0028999(A1) | 2006-02-01 | Iakobashvili et al. | Applicant |
| US2006/0037075(A1) | 2006-02-01 | Frattura et al. | Applicant |
| US2006/0092976(A1) | 2006-05-01 | Lakshman et al. | Applicant |
| US2006/0174087(A1) | 2006-08-01 | Hashimoto et al. | Applicant |
| US2006/0178898(A1) | 2006-08-01 | Habibi | Applicant |
| US2006/0184653(A1) | 2006-08-01 | van Riel | Applicant |
| US2006/0184937(A1) | 2006-08-01 | Abels et al. | Applicant |
| US2006/0193266(A1) | 2006-08-01 | Siddha et al. | Applicant |
| US2006/0221961(A1) | 2006-10-01 | Basso et al. | Applicant |
| US2006/0248179(A1) | 2006-11-01 | Short et al. | Applicant |
| US2006/0282895(A1) | 2006-12-01 | Rentzis et al. | Applicant |
| US2007/0028239(A1) | 2007-02-01 | Dyck et al. | Applicant |
| US2007/0043860(A1) | 2007-02-01 | Pabari | Applicant |
| US2007/0050763(A1) | 2007-03-01 | Kagan et al. | Applicant |
| US2007/0156919(A1) | 2007-07-01 | Potti et al. | Applicant |
| US2007/0174429(A1) | 2007-07-01 | Mazzaferri et al. | Applicant |
| US2007/0220358(A1) | 2007-09-01 | Goodill et al. | Applicant |
| US2007/0234302(A1) | 2007-10-01 | Suzuki et al. | Applicant |
| US2007/0239987(A1) | 2007-10-01 | Hoole et al. | Applicant |
| US2007/0240160(A1) | 2007-10-01 | Paterson-Jones et al. | Applicant |
| US2007/0245082(A1) | 2007-10-01 | Margolus et al. | Applicant |
| US2007/0250608(A1) | 2007-10-01 | Watt | Applicant |
| US2007/0260721(A1) | 2007-11-01 | Bose et al. | Applicant |
| US2007/0266433(A1) | 2007-11-01 | Moore | Applicant |
| US2007/0286185(A1) | 2007-12-01 | Eriksson et al. | Applicant |
| US2007/0297428(A1) | 2007-12-01 | Bose et al. | Applicant |
| US2008/0002579(A1) | 2008-01-01 | Lindholm et al. | Applicant |
| US2008/0002683(A1) | 2008-01-01 | Droux et al. | Applicant |
| US2008/0034249(A1) | 2008-02-01 | Husain et al. | Applicant |
| US2008/0040467(A1) | 2008-02-01 | Mendiratta et al. | Applicant |
| US2008/0049614(A1) | 2008-02-01 | Briscoe et al. | Applicant |
| US2008/0049621(A1) | 2008-02-01 | McGuire et al. | Applicant |
| US2008/0052206(A1) | 2008-02-01 | Edwards et al. | Applicant |
| US2008/0059556(A1) | 2008-03-01 | Greenspan et al. | Applicant |
| US2008/0163207(A1) | 2008-07-01 | Reumann et al. | Applicant |
| US2008/0189769(A1) | 2008-08-01 | Casado et al. | Applicant |
| US2008/0196100(A1) | 2008-08-01 | Madhavan et al. | Applicant |
| US2008/0212963(A1) | 2008-09-01 | Fortin et al. | Applicant |
| US2008/0225780(A1) | 2008-09-01 | McCormick et al. | Applicant |
| US2008/0225853(A1) | 2008-09-01 | Melman et al. | Applicant |
| US2008/0291910(A1) | 2008-11-01 | Tadimeti et al. | Applicant |
| US2009/0031041(A1) | 2009-01-01 | Clemmensen | Applicant |
| US2009/0043823(A1) | 2009-02-01 | Iftode et al. | Examiner |
| US2009/0083445(A1) | 2009-03-01 | Ganga | Applicant |
| US2009/0089625(A1) | 2009-04-01 | Kannappan et al. | Applicant |
| US2009/0097495(A1) | 2009-04-01 | Palacharla et al. | Applicant |
| US2009/0122710(A1) | 2009-05-01 | Bar-Tor et al. | Applicant |
| US2009/0138577(A1) | 2009-05-01 | Casado et al. | Applicant |
| US2009/0144220(A1) | 2009-06-01 | Feng et al. | Applicant |
| US2009/0150527(A1) | 2009-06-01 | Tripathi et al. | Applicant |
| US2009/0161547(A1) | 2009-06-01 | Riddle et al. | Applicant |
| US2009/0222924(A1) | 2009-09-01 | Droz et al. | Applicant |
| US2009/0276661(A1) | 2009-11-01 | Deguchi et al. | Applicant |
| US2009/0279536(A1) | 2009-11-01 | Unbehagen et al. | Applicant |
| US2009/0292858(A1) | 2009-11-01 | Lambeth et al. | Applicant |
| US2009/0303880(A1) | 2009-12-01 | Maltz et al. | Applicant |
| US2010/0046531(A1) | 2010-02-01 | Louati et al. | Applicant |
| US2010/0061231(A1) | 2010-03-01 | Harmatos et al. | Applicant |
| US2010/0082799(A1) | 2010-04-01 | DeHaan et al. | Applicant |
| US2010/0115101(A1) | 2010-05-01 | Lain et al. | Applicant |
| US2010/0131636(A1) | 2010-05-01 | Suri et al. | Applicant |
| US2010/0153554(A1) | 2010-06-01 | Anschutz et al. | Applicant |
| US2010/0165877(A1) | 2010-07-01 | Shukla et al. | Applicant |
| US2010/0169467(A1) | 2010-07-01 | Shukla et al. | Applicant |
| US2010/0191612(A1) | 2010-07-01 | Raleigh | Applicant |
| US2010/0191846(A1) | 2010-07-01 | Raleigh | Applicant |
| US2010/0192207(A1) | 2010-07-01 | Raleigh | Applicant |
| US2010/0192225(A1) | 2010-07-01 | Ma et al. | Examiner |
| US2010/0205479(A1) | 2010-08-01 | Akutsu et al. | Applicant |
| US2010/0214949(A1) | 2010-08-01 | Smith et al. | Applicant |
| US2010/0257263(A1) | 2010-10-01 | Casado et al. | Applicant |
| US2010/0275199(A1) | 2010-10-01 | Smith et al. | Applicant |
| US2010/0290485(A1) | 2010-11-01 | Martini et al. | Applicant |
| US2011/0004913(A1) | 2011-01-01 | Nagarajan et al. | Applicant |
| US2011/0010578(A1) | 2011-01-01 | Dominguez et al. | Applicant |
| US2011/0016215(A1) | 2011-01-01 | Wang | Applicant |
| US2011/0026521(A1) | 2011-02-01 | Gamage et al. | Applicant |
| US2011/0032830(A1) | 2011-02-01 | Merwe et al. | Applicant |
| US2011/0075664(A1) | 2011-03-01 | Lambeth et al. | Applicant |
| US2011/0085557(A1) | 2011-04-01 | Gnanasekaran et al. | Applicant |
| US2011/0085559(A1) | 2011-04-01 | Chung et al. | Applicant |
| US2011/0119748(A1) | 2011-05-01 | Edwards et al. | Applicant |
| US2011/0134931(A1) | 2011-06-01 | Merwe et al. | Examiner |
| US2012/0120964(A1) | 2012-05-01 | Koponen et al. | Applicant |
| US2012/0147898(A1) | 2012-06-01 | Koponen et al. | Applicant |
| US2013/0058208(A1) | 2013-03-01 | Pfaff et al. | Applicant |
| US2013/0058225(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058226(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058228(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0058229(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058250(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058251(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0058252(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058255(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058331(A1) | 2013-03-01 | Thakkar et al. | Applicant |
| US2013/0058334(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0058335(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0058339(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058340(A1) | 2013-03-01 | Lambeth et al. | Applicant |
| US2013/0058341(A1) | 2013-03-01 | Fulton et al. | Applicant |
| US2013/0058342(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058343(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058344(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058348(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0058350(A1) | 2013-03-01 | Fulton | Applicant |
| US2013/0058351(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058353(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0058354(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0058356(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0058357(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0058358(A1) | 2013-03-01 | Fulton et al. | Applicant |
| US2013/0060736(A1) | 2013-03-01 | Casado et al. | Applicant |
| US2013/0060737(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0060738(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0060817(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0060818(A1) | 2013-03-01 | Lambeth et al. | Applicant |
| US2013/0060819(A1) | 2013-03-01 | Lambeth et al. | Applicant |
| US2013/0060922(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0060929(A1) | 2013-03-01 | Koponen et al. | Applicant |
| US2013/0060940(A1) | 2013-03-01 | Koponen et al. | Applicant |
| JP2002-141905 | 2002-05-01 | Applicant | |
| WO95/06989 | 1995-03-01 | Applicant | |
| WO2005/112390 | 2005-11-01 | Applicant | |
| WO2008/095010 | 2008-08-01 | Applicant | |
| WO2009/042919 | 2009-04-01 | Applicant | |
| WO2010/115060 | 2010-07-01 | Applicant |
Non-Patent Literature (107)
- Portions of prosecution history of commonly owned U.S. Appl. No. 12/286,098, including action(s) dated Nov. 7, 2012, Feb. 21, 2012, Nov. 8, 2011, Jun. 22, 2011, Mar. 24, 2011, Aug. 18, 2010, and May 5, 2010; and response(s)/amendment(s) filed Jun. 21, 2012, Oct. 24, 2011, Apr. 14, 2011, Mar. 14, 2011, 02-182011, Jun. 4, 2010, and Sep. 24, 2009 (177 pages).Applicant
- Portions of prosecution history of commonly owned U.S. Appl. No. 12/753,044, including action(s) dated Sep. 24, 2012, Jan. 24, 2012, and Nov. 8, 2011; and response(s)/amendment(s) filed Jul. 24, 2012, Dec. 8, 2011, and Mar. 31, 2011 (108 pages).Applicant
- Adya, Atul, et al., “Cooperative Task Management without Manual Stack Management,” Jun., 2002, 14 pages, Proceedings of the Usenix Annual Technical Conference, Monterey, CA, USA.Applicant
- Andersen, David, et al., “Resilient Overlay Networks,” Oct. 2001, 15 pages, 18th ACM Symp. On Operating Systems Principles (SOSP), Banff, Canada, ACM.Applicant
- Anderson, Thomas, et al., “Overcoming the Internet Impasse through Virtualization,” Apr. 2005, pp. 34-41, IEEE Computer Society.Applicant
- Anhalt, Fabienne, et al., “Analysis and evaluation of a XEN based virtual router,” Sep. 2008, pp. 1-60, Unite de recherché INRA Phone-Alpes, Montbonnot Saint-Ismier, France.Applicant
- Anwer, Muhammad Bilal, et al., “Building A Fast, Virtualized Data Plane with Programmable Hardware,” Aug. 17, 2009, pp. 1-8, VISA'09, Barcelona, Spain, ACM.Applicant
- Author Unknown , “Cisco Nexis 1000V Series Switches,” Date Unknown but prior to Jul. 29, 2010, 2 pages, Cisco Systems, Inc., http://web.archive.org/web/20100729045626/http://www.cisco.com/en/US/Products/ps9902/index.html.Applicant
- Author Unknown , “Cisco VN-Link: Virtualization-Aware Networking,” Month Unknown, 2009, 10 pages, Cisco Systems, Inc.Applicant
- Author Unknown , “Citrix Launches New XenServer Release as Market Share Growth Continues,” Oct. 6, 2010, 3pages, Citrix Systems, Inc. (http://www.citrix.com/English/ne/news/news.asp?newsID=2304355).Applicant
- Author Unknown, “HP OpenView Enterprise Management Starter Solution,” Jun. 2006, p. 1-4, Hewlett-Packard Development Company, HP.Applicant
- Author Unknown, “HP OpenView Operations 8.0 for UNIX Developer's Toolkit,” Month Unlknown, 2004, pp. 1-4, Hewlett-Packard Development Company, HP.Applicant
- Author Unknown , “HP Web Jetadmin Integration into HP OpenView Network Node Manager,” Feb. 2004, pp. 1-12, HP.Applicant
- Author Unknown , “IEEE Standard for Local and metropolitan area networks—Virtual Bridged Local Area Networks, Amendment 5: Connectivity Fault Management,” IEEE Std 802.1ag, Dec. 17, 2007, 260 pages, IEEE, New York, NY, USA.Applicant
- Author Unknown, “Intel 82599 10 Gigabit Ethernet Controller: Datasheet, Revision: 2.73,” Dec. 2011, 930 pages, Intel Corporation.Applicant
- Author Unknown , “Introduction to VMware Infrastructure: ESX Server 3.5, ESX Server 3i version 3.5, VirtualCenter 2.5,” Revision Dec. 13, 2007, pp. 1-46, VMware, Inc., Palo Alto, California, USA.Applicant
- Author Unknown , “iSCSI SAN Configuration Guide: ESX Server 3.5, ESX Server 3i version 3.5, VirtualCenter 2.5,” Revision Nov. 29, 2007, pp. 1-132, VMware, Inc., Palo Alto, CA, USA.Applicant
- Author Unknown , “Open vSwitch, An Open Virtual Switch,” Date Unknown but prior to Dec. 30, 2010, 2 pages, http://www.openvswitch.org/, Open vSwitch.Applicant
- Author Unknown, “OpenFlow Switch Specification, Version 0.9.0 (Wire Protocol 0x98),” Jul. 20, 2009, pp. 1-36, Open Networking Foundation.Applicant
- Author Unknown, OpenFlow Switch Specification, Version 1.0.0 (Wire Protocol Ox01), Dec. 31, 2009, pp. 1-42, Open Networking Foundation.Applicant
- Author Unknown, “Private Network-Network Interface Specification Version 1.1 (PNNI 1.1),” The ATM Forum Technical Committee, Apr. 2002, 536 pages, The ATM Forum.Applicant
- Author Unknown , “Single Root I/O Virtualization and Sharing Specification, Revision 1.0,” Sep. 11, 2007, pp. 1-84, PCI-SIG.Applicant
- Author Unknown, “Virtual Machine Device Queues,” White Paper, Month Unknown, 2007, pp. 1-4, Intel Corporation.Applicant
- Author Unknown , “VMare for Linus Networking Support,” Date Unknown but prior to Nov. 17, 1999, pp. 1-5, VMWare, Inc.Applicant
- Ballani, Hitesh, et al., “Making Routers Last Longer with ViAggre,” NSDI'09: 6th USENIX Symposium on Networked Systems Design and Implementation, Apr. 2009, pp. 453-466, USENIX Association.Applicant
- Barham, Paul, et al., “Xen and the Art of Virtualization,” Oct. 19-22, 2003, pp. 1-14, SOSP'03, Bolton Landing New York, USA.Applicant
- Bavier, Andy, et. al., “In VINI Veritas: Realistic and Controlled Network Experimentation,” SIGCOMM'06, Sep., 2006, pp. 1-14, Pisa, Italy.Applicant
- Bhatia, Sapan, et al., “Trellis: A Platform for Building Flexible, Fast Virtual Networks on Commodity Hardware,” ROADS'08, Dec. 9, 2008, pp. 1-6, Madrid, Spain, ACM.Applicant
- Caesar, Matthew, et al., “Design and Implementation of a Routing Control Platform,” NSDI '05: 2nd Symposium on Networked Systems Design & Implementation , Apr. 2005, pp. 15-28, Usenix Association.Applicant
- Cai, Zheng, et al., “The Preliminary Design and Implementation of the Maestro Network Control Platform,” Oct. 1, 2008, pp. 1-17, NSF.Applicant
- Casado, Martin, et al. “Ethane: Taking Control of the Enterprise,” SIGCOMM'07, Aug. 27-31, 2007, pp. 1-12, ACM, Kyoto, Japan.Applicant
- Casado, Martin, et al., “Rethinking Packet Forwarding Hardware,” Seventh ACM SIGCOMM' HotNets Workshop, Nov. 2008, pp. 1-6, ACM.Applicant
- Casado, Martin, et al., “SANE: A Protection Architecture for Enterprise Networks,” In proceedings of Usenix Security, Aug. 2006, pp. 1-15.Applicant
- Casado, Martin, et al., “Virtualizing the Network Forwarding Plane,” Dec. 2010, pp. 1-6.Applicant
- Congdon, Paul, “Virtual Ethernet Port Aggregator Standards body Discussion,” Nov. 10, 2008, pp. 1-26, HP.Applicant
- Cooper, Brian F., et al., “PNUTS: Yahoo!'s Hosted Data Serving Platform,” VLDB'08, Aug. 24-30, 2008, pp. 1-12, ACM , Auckland, New Zealand.Applicant
- Davoli, Renzo, “VDE: Virtual Distributed Ethernet,” TRIDENTCOM'05, Feb. 23-25, 2005, pp. 1-8, IEEE Computer Society.Applicant
- Dixon, Colin, et al., “An End to the Middle,” Proceedings of the 12th conference on Hot topics in operating systems USENIX Association, May 2009, pp. 1-5, Berkeley, CA, USA.Applicant
- Dobrescu, Mihai, et al., “RouteBricks: Exploiting Parallelism to Scale Software Routers,” SOSP'09, Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, Oct. 2009, pp. 1-17, ACM New York, NY.Applicant
- Enns, R., “NETCONF Configuration Protocol,” Dec. 2006, pp. 1-96, IETF Trust (RFC 4741).Applicant
- Farinacci, D., et al., “Generic Routing Encapsulation (GRE),” Mar. 2000, pp. 1-9, The Internet Society (RFC 2784).Applicant
- Farrel, A., “A Path Computation Element (PCS)—Based Architecture,” Aug. 2006, pp. 1-41, RFC 4655.Applicant
- Fischer, Anna, “[PATCH][RFC] net/bridge: add basic VEPA support,” Jun. 2009, pp. 1-5, GMANE Org.Applicant
- Garfinkel, Tal, et al., “A Virtual Machine Introspection Based Architecture for Intrusion Detection,” In Proc. Network and Distributed Systems Security Symposium, Feb. 2003, pp. 1-16.Applicant
- Godfrey, P. Brighten, et al., “Pathlet Routing,” SIGCOMM, Aug. 2009, pp. 1-6, ACM.Applicant
- Greenberg, Albert, et al., “A Clean Slate 4D Approach to Network Control and Management,” ACM SIGCOMM Computer Communication Review, Oct. 2005, 12 pages, vol. 35, No. 5.Applicant
- Greenberg, Albert, et al., “VL2: A Scalable and Flexible Data Center Network,” SIGCOMM'09, Aug. 17-21, 2009, pp. 51-62, ACM, Barcelona, Spain.Applicant
- Greenhalgh, Adam, et al., “Flow Processing and The Rise of Commodity Network Hardware,” ACM SIGCOMM Computer Communication Review, Apr. 2009, pp. 21-26, vol. 39, No. 2.Applicant
- Gude, Natasha, et al., “NOX: Towards an Operating System for Networks,” ACM SIGCOMM Computer communication Review, Jul. 2008, pp. 105-110, vol. 38, No. 3.Applicant
- Guo, Chanxiong, et al., “BCube: A High Performance, Server-centric Network Architecture for Modular Data Centers,” SIGCOMM'09, Aug. 17-21, 2009, pp. 1-12, ACM Barcelona, Spain.Applicant
- Hamilton, James, et al., “Datacenter Networks Are In My Way,” Principals of Amazon Series, Oct. 28, 2010, pp. 1-14.Applicant
- Handley, Mark, et al., “Designing Extensible IP Router Software,” Proc. Of NSDI, May 2005, pp. 1-14.Applicant
- Hinrichs, Timothy L., et al., “Practical Declarative Network Management,” WREN'09, Aug. 21, 2009, pp. 1-10, Barcelona, Spain.Applicant
- Hunt, Patrick, et al., “ZooKeeper: Wait-free Coordination for Internet-Scale Systems,” Proc. Of Usenix Annual Technical Conference, Month Unknown, 2010, pp. 1-14.Applicant
- Ioannidis, Sotiris, et al., “Implementing a Distributed Firewall,” CCS'00, Month Unknown, 2000, pp. 1-10, ACM, Athens, Greece.Applicant
- John, John P., et al., “Consensus Routing: The Internet as a Distributed System,” Proc. Of NSDI , Apr. 2008, pp. 1-14.Applicant
- Kamath, Daya, et. al., “Edge virtual Bridge Proposal, Version 0. Rev. 0.1,” Apr. 23, 2010, pp. 1-72, IEEE.Applicant
- Katz, D., et. al, “Bidirectional Forwarding Detection, draft-ietf-bfd-base-11.txt,” Month Unknown, 2009, pp. 1-51, IETF Trust.Applicant
- Keller, Eric, et al., “The ‘Platform as a Service’ Model for Networking,” Month Unknown, 2010, pp. 1-6.Applicant
- Kim, Changhoon, et al., “Floodless in Seattle: A Scalable Ethernet Architecture for Large Enterprises,” SIGCOMM'08, Aug. 17-22, 2008, pp. 3-14, ACM, Seattle, Washington, USA.Applicant
- Kohler, Eddie, et al., “The Click Modular Router,” ACM Trans. On Computer Systems, Aug. 2000, 34 pages, vol. 18, No. 3.Applicant
- Koponen, Teemu, et al., “Onix: A Distributed Control Platform for Large-scale Production Networks,” In Proc. OSDI, Oct. 2010, pp. 1-14.Applicant
- Labovitz, Craig, et al., “Delayed Internet Routing Convergence,” SIGCOMM '00, Month Unknown, 2000, pp. 175-187, Stockholm, Sweden.Applicant
- Labovitz, Craig, et al., “Internet Routing Instability,” ACM SIGCOMM '97, Month Unknown, 1997, pp. 1-12, Association for Computing Machinery, Inc.Applicant
- Lakshminarayanan, Karthik, et al., “Routing as a Service,” Month Unknown, 2004, pp. 1-15, Berkeley, California.Applicant
- Luo, Jianying, et al., “Prototyping Fast, Simple, Secure Switches for Ethane,” Month Unknown, 2007, pp. 1-6.Applicant
- Maltz, David A., et al., “Routing Design in Operational Networks: A Look from the Inside,” SIGCOMM'04, Aug. 30-Sep. 3, 2004, pp. 1-14, ACM, Portland, Oregon, USA.Applicant
- McKeown, Nick, et al., “OpenFlow: Enabling Innovation in Campus Networks,” ACS SIGCOMM Computer communication Review, Apr. 2008, pp. 69-74, vol. 38, No. 2.Applicant
- Mogul, Jeffrey C., et al., “API Design Challenges for Open Router Platforms on Proprietary Hardware,” Oct. 2008, pp. 1-6.Applicant
- Mysore, Radhka Niranjan, et al., “PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric,” Proc. Of SIGCOMM, Aug. 17-21, 2009, pp. 1-12.Applicant
- Partridge, Craig, et al., “A 50-Gb/s IP Router,” IEEE/ACM Transactions on Networking Jun. 1998, pp. 237-248.Applicant
- Pelissier, Joe, “Network Interface Virtualization Review,” Jan. 2009, pp. 1-38.Applicant
- Pelissier, Joe, “VNTag 101,” May 2008, pp. 1-87.Applicant
- Peterson, Larry L., et al., “OS Support for General-Purpose Routers,” Month Unknown, 1999, 6 pages.Applicant
- Pettit, Justin, et al., “Virtual Switching in an Era of Advanced Edges,” Sep. 2010, 7 pages.Applicant
- Pfaff, Ben., et al., “Extending Networking into the Virtualization Layer,” Proc. Of HotNets, Oct. 2009, pp. 1-6.Applicant
- Phan, Doantam, et al., “Visual Analysis of Network Flow Data with Timelines and Event Plots,” Month Unknown, 2007, pp. 1-16, VizSEC.Applicant
- Rosen, E., et al., “Applicant Statement for BGP/MPLS IP Virtual Private Networks (VPNs),” The Internet Society, RFC 4365, Feb. 2006, pp. 1-32.Applicant
- Sherwood, Rob, et al., “Can the Production Network Be the Testbed?,” Month Unknown, 2010, pp. 1-14.Applicant
- Sherwood, Rob, et al., “Carving Research Slices Out of Your Production Networks with OpenFlow,” ACM SIGCOMM Computer Communications Review, Jan. 2010, pp. 129-130, vol. 40, No. 1.Applicant
- Sherwood, Rob, et al., “FlowVisor: A Network Virtualization Layer,” Oct. 14, 2009, pp. 1-14, OPENFLOW-TR-2009-1.Applicant
- Spalink, Tammo, et al., “Building a Robust Software-Based Router Using Network Processors,” Month Unknown, 2001, pp. 216-229, ACM, Banff, CA.Applicant
- Tavakoli, Arsalan, et al., “Applying NOX to the Datacenter,” Proc. HotNets, Month Unknown, 2009, 6 pages.Applicant
- Touch, J., et al., “Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement,” May 2009, pp. 1-17, IETF Trust, RFC 5556.Applicant
- Turner, Jon, et al., “Supercharging PlanetLab—High Performance, Multi-Application Overlay Network Platform,” SIGCOMM-07, Aug. 27-31, 2007, 12 pages, ACM, Koyoto, Japan.Applicant
- Turner, Jonathan S., “A Proposed Architecture for the GENI Backbone Platform,” ANCS'06, Dec. 3-5, 2006, 10 pages, ACM, San Jose, California, USA.Applicant
- Wang, Yi, et al., “Virtual Routers on the Move: Live Router Migration as a Network-management Primitive,” SIGCOMM 08, Aug. 17-22, 2008, 12 pages, ACM, Seattle, Washington, USA.Applicant
- Xie, Geoffrey G., et al., “On Static Reachability Analysis of IP Networks,” Month Unknown, 2005, pp. 1-14.Applicant
- Yang, L., et al., “Forwarding and Control Element Separation (ForCES) Framework,” Apr. 2004, pp. 1-40, The Internet Society.Applicant
- Yu, Minlan, et al., “Scalable Flow-Based Networking with DIFANE,” In Proc. SIGCOMM Aug. 2010, 16 pages.Applicant
- Updated portions of prosecution history of U.S. Appl. No. 12/286,098, May 7, 2013, Casado, Martin, et al.Applicant
- Updated portions of prosecution history of U.S. Appl. No. 12/753,044, Feb. 19, 2013, Casado, Martin, et al.Applicant
- Updated portions of prosecution history of U.S. Appl. No. 13/177,529, May 31, 2013, Koponen, Teemu, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,531, May 2, 2013, Koponen, Teemu, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,532, Mar. 15, 2013, Casado, Martin, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,533, May 31, 2013, Koponen, Teemu, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,534, Apr. 9, 2013, Casado, Martin, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,535, Jan. 17, 2013, Casado, Martin, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,536, May 15, 2012, Koponen, Teemu, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,537, May 20, 2013, Koponen, Teemu, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,538, May 28, 2013, Koponen, Teemu, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,539, May 31, 2013, Casado, Martin, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,540, Mar. 15, 2013, Lambeth, W. Andrew, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,543, Apr. 22, 2013, Koponen, Teemu, et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,545, May 31, 2013, Fulton, Bryan J., et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/177,546, Sep. 26, 2011, Fulton, Bryan J., et al.Applicant
- Portions of prosecution history of U.S. Appl. No. 13/218,433, Apr. 22, 2013, Koponen, Teemu, et al.Applicant