Multiple workloads often run on a single hypervisor on a host computing machine. A distributed firewall may be distributed across the multiple workloads on the host and enforce rules close to the source of traffic for the workloads. Each individual workload may have its own copy of firewall rules that are stored in the hypervisor kernel to enforce different policies, such as a security policy. Often, multiple workloads on the same hypervisor have some common firewall rules in their own copy of the rules. This may be because the workloads are executing similar functionality on the same hypervisor. For example, a company may put workloads that are performing the same or similar functions on a single host. Even though there are common firewall rules, the distributed firewall stores a separate set of firewall rules for each workload. This consumes a large amount of memory in the hypervisor, which may limit the number of firewall rules that a hypervisor can support.
In the following description, for purposes of explanation, numerous examples and specific details are set forth in order to provide a thorough understanding of embodiments of the present disclosure. Some embodiments as expressed in the claims may include some or all of the features in these examples, alone or in combination with other features described below, and may further include modifications and equivalents of the features and concepts described herein.
A hypervisor on a host computing device receives a copy of firewall rules for a group of workloads running on that hypervisor. The hypervisor may store a single copy of the firewall rules in the hypervisor for the group. Each workload may have an associated set of firewall rules where different workloads may apply a different set of firewall rules. Instead of storing a distinct copy of the firewall rules for each workload, the hypervisor stores a list of references to the firewall rules in an index table for each workload. The index table includes references to rules in a rules table. For example, a first index table for a first workload may include a first set of references that reference a first set of rules in the rules table and a second index table for a second workload may include a second set of references that reference a second set of rules in the rules table. The first set of references and the second set of references may include different references to rules, such as the first set of references may reference rules R1, R2, and R3, and the second set of references may reference rules R1, R3, and R5.
The use of the index tables allows the hypervisor to save memory. For example, storing only a single copy of the rules for the firewall rules used by the group of workloads eliminates the memory needed to store a distinct copy of firewall rules for each workload. Storing an index table for each workload may use a much smaller amount of memory than storing the distinct copy of rules for each workload. Using less memory provides some advantages, such as the use of less memory to store distinct copies of rules for each workload may allow the hypervisor to store a larger amount of rules in the rules table.
Workloads 106-1 to 106-N may send and receive packets through virtual network interface cards (VNIC) 116-1 to 116-N. The packets may be sent through a virtual switch 112 in hypervisor 104 to a physical network interface card (PNIC) in hardware 114. Then, packets are routed through physical network 120. Also, packets are received from physical network 120 at the PNIC, and sent through virtual switch 112 to VNICs 116 of workloads 106.
Management platform 118 may be a platform that manages the virtual networks on host computing machines 102. For example, management platform 118 may centrally manage firewall rules that are distributed to different hosts 102.
A local controller plane (LCP) 120 may be a process that is running on hypervisor 104. LCP 120 receives the firewall rules for workloads 106 from management platform 118. For example, LCP 120 interacts with management platform 118 to retrieve the firewall rules. In some embodiments, LCP 120 is running in the user space of hypervisor 104; however, the implementation of LCP 120 may be different. LCP 120 processes the firewall rules to build rules table 124 and index tables 126-1 to 126-N, the processing of which will be described in more detail below.
Firewall manager 122 manages the configuration of the distributed firewall in hypervisor 104. For example, firewall manager 122 stores a central copy of all firewall rules in the memory of hypervisor 104, such as in a rules table 124. The structure and use of rules table 124 will be described in more detail below. Although LCP 120 and firewall manager 122 are described as being separate components, other configurations may be used, such as functions of both may be combined or distributed to other entities.
Instances of firewalls 110-1 to 110-N are configured for each respective workload 106-1 to 106-N. For example, each instance of distributed firewall 110 may be enforced in between VNIC 116 and virtual switch 112. However, firewall 110 may be situated at any point in a path of packets, such as at VNIC 116, or anywhere in between workload 106 and virtual switch 112. Firewall 110 intercepts packets sent from VNIC 116 before they reach virtual switch 112 and also intercepts packets from virtual switch 112 before they reach VNIC 116. Each respective workload 106 may have an associated firewall situated between VNIC 116 and virtual switch 112 although firewalls 110 may be placed at other positions.
Firewalls 110-1 to 110-N store index tables 126-1 to 126-N, respectively. Each index table 126 references specific firewall rules that apply to the respective workload 106. Those references are used to retrieve rules in rules table 124 when enforcing policies at firewalls 110. The structure of index table 126 and enforcement of policies will be described in more detail below.
Management platform 118 may distribute a copy of firewall rules for a group of workloads 106 running on hypervisor 104 of a host 102. In some embodiments, the copy of firewall rules is for all workloads 106 running on hypervisor 104. However, management platform 118 may provide different groups of firewall rules for groups of workloads 106 that are running on hypervisor 104. For example, a first group of workloads 106 on host 102 may have an associated first copy of firewall rules and a second group of workloads 106 on host 102 may have a second copy of firewall rules.
LCP 120 receives and processes the firewall rules for workloads 106 from management platform 118. LCP 120 reviews the rules and can generate index tables that reference each rule that is associated with a specific workload 106.
Referring back to
At 212, LCP 120 determines if another rule is found in the set of rules. If so, the process reiterates to 206 where another firewall rule is selected. The process continues to determine workloads associated with the new rule. LCP 120 then adds a reference to the rule to the respective index tables for the workloads. Once finished, each index table 126 may include a set of references that reference a set of rules in rules table 124. Accordingly, when there are no more rules to analyze, at 214, LCP 120 sends rules table 124 and index tables 126-1 to 126-N to firewall manager 122.
Firewall manager 122 may be running in the kernel space of hypervisor 104. Once receiving rules table 124 from LCP 120, firewall manager 122 stores a copy of rules table 124 in the memory of hypervisor 104. In some embodiments, firewall manager 122 stores a single copy of rules table 124 in hypervisor 104 for the group of workloads 106.
Firewall manager 122 then stores a copy of each respective index table 126 in a respective firewall 110 for each respective workload 106. Each index table 126-1 to 126-N may identify a specific workload 106-1 to 106-N. For example, each index table 126 may reference a VNIC identifier for a respective workload 106. Firewall manager 122 uses the VNIC identifier for an index table 126 to store the index table for that firewall 110. Each firewall 110 then has an associated index table 126. For example, firewall 110-1 includes an index table 126-1, firewall 110-2 includes an index table 126-2, and so on. In some examples, logic for firewall 110 may be instantiated between VNIC 116 and a port of virtual switch 112. The rules are stored with the instantiation of firewall 110 between VNIC 116 and the port of virtual switch 112.
Once index tables 126 and rules table 124 have been stored, firewalls 110 may process packets for workloads 106.
At 406, firewall 110 uses the references for the rules in index table 126 to access to the rules from rules table 124 and compares the attributes to the applicable rules in index table 126 to determine a rule that applies to the packet. For example, for workload 106-1, firewall 110 retrieves references #1, #2, and #3 to rules R1, R2, and R3. Firewall 110 uses the references to access rules R1, R2, and R3 in rules table 124. For example, information for rules R1, R2, and R3 are accessed at indices #1, #2, and #3 in rules table 124.
Firewall 110 may access rules from rules table 124 in different ways. In some examples, firewall 110 communicates with firewall manager 122 by sending the reference to firewall manager 122, which retrieves the rule and sends information for the rule to firewall 110. In other examples, firewall 110 uses the reference to retrieve the applicable rule from rules table 124 without communicating with firewall manager 122.
Firewall 110 may use different methods to perform the comparison. In some examples, firewall 110 enforces the rules from a top to bottom ordering. For each packet, firewall 110 checks the top rule listed in index table 126 before moving down to the subsequent rules listed in index table 126. The first rule listed in index table 126 that matches the attributes is enforced using this policy. The last rule that is listed at the bottom of index table 126 may be a default rule that is enforced on the packet if no other rule has attributes that match the attributes of the packet. The default rule may not specify any particular attributes so that the default rule can match all packets. Although this top to bottom ordering policy is described, other methods may be used. For example, firewall 110 may determine all the rules that match the attributes and then select the one of the rules based on a ranking system.
Using the above process, firewall 110 may start with a first rule R1 listed in index table 126, access rule R1 in rules table 124 using the reference #1, and then compare the attributes of the packet to the attributes listed for rule R1. In some embodiments, firewall 110 may access a source and destination from columns in rules table 124, and compare the source and destination of the packet to the source and destination of the rule. If the attributes listed for rule R1 do not match the attributes of the packet, then firewall 110 proceeds to determine if attributes for rule R2 match the attributes of the packet. If the attributes for rule R2 do not match the attributes of the packet, then rule R3 is enforced as the default rule.
At 408, once firewall 110 determines the applicable rule for the packets, firewall 110 determines an action for the rule. For example, the rule may list an action to perform, such as an action of allow the packet or block the packet. Then, at 410, firewall 110 performs the action on the packet, which could route the packet to workload 106 or to virtual switch 112 if the packet is allowed, or just block the packet from being sent from or to workload 106.
To improve the speed of filtering packets, firewall 110 may use a connection table together with the firewall rules. A connection table may store network connections in a fast lookup data structure such like hash table. Each network connection may be a unique identifier, such as a 5-tuple, based on packet attributes. If the first packet of a connection is allowed by the firewall rules, firewall 110 inserts an instance of the connection into the connection table. The following packets in the same connection may be allowed as well. Firewall 110 may look up packets in the connection table before attempting to match the firewall rules. When a packet does not match any existing connections in the connection table, firewall 110 then compares the packet to the firewall rules in index table 126.
Accordingly, hypervisor 104 uses less memory to store the rules. For example, hypervisor 104 may only store one copy of firewall rules R1 to R5, which uses memory to store five rules. However, workloads 106-1 to 106-N may each have three applicable rules that are used totaling nine rules. If an individual copy of each rule is stored for workloads 106-1 to 106-N, memory is used to store nine rules, which uses more memory than storing five rules. Thus, some embodiments eliminate the storage requirement for four rules in this example. For example, rule R1 does not need to be stored three times for workload 106-1, 106-2, and 106-N. Similarly, multiple copies of rule R2 do not need to be stored for workload 106-1, 106-N, and multiple copies of rule R3 do not need to be stored for workloads 106-1 and 106-2. The storage of individual copies of rules for each workload 106 is replaced by index tables and the storage of index tables 126 use significantly less space than the storage for individual sets of the rules for each workload 106 because storing the indices to rules uses less storage than the content of the rules themselves.
At some points, management platform 118 may update the firewall rules. LCP 120 receives a new copy of all the firewall rules for a group of workloads 106 that are running on hypervisor 104. Then, LCP 120 recomputes index tables 126-1 to 126-N for each workload 106-1 to 106-N. Additionally, LCP 120 computes a new rules table 124. LCP 120 then sends the new index tables 126 and new rules table 124 to firewall manager 122. While LCP 120 generated the new index tables 126 and new rules table 124, firewall manager 122 still uses existing index tables 126-1 to 126-N and the existing rules table 124. LCP 120 creates a new set of index tables 126 and rule table 124 to allow the distributed firewall to operate while the update is taking place. When the new index tables 126 and new rule table 124 are ready, firewall manager 122 can switch from using the previous index tables to new index tables and from the previous rules table to the new rules table.
Many variations, modifications, additions, and improvements are possible, regardless the degree of virtualization. The virtualization software can therefore include components of a host, console, or guest operating system that performs virtualization functions. Plural instances may be provided for components, operations or structures described herein as a single instance. Finally, boundaries between various components, operations and data stores are somewhat arbitrary, and particular operations are illustrated in the context of specific illustrative configurations. Other allocations of functionality are envisioned and may fall within the scope of the disclosure(s). In general, structures and functionality presented as separate components in exemplary configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components.
Some embodiments described herein can employ various computer-implemented operations involving data stored in computer systems. For example, these operations can require physical manipulation of physical quantities—usually, though not necessarily, these quantities take the form of electrical or magnetic signals, where they (or representations of them) are capable of being stored, transferred, combined, compared, or otherwise manipulated. Such manipulations are often referred to in terms such as producing, identifying, determining, comparing, etc. Any operations described herein that form part of one or more embodiments can be useful machine operations.
Further, one or more embodiments can relate to a device or an apparatus for performing the foregoing operations. The apparatus can be specially constructed for specific required purposes, or it can be a general purpose computer system selectively activated or configured by program code stored in the computer system. In particular, various general purpose machines may be used with computer programs written in accordance with the teachings herein, or it may be more convenient to construct a more specialized apparatus to perform the required operations. The various embodiments described herein can be practiced with other computer system configurations including handheld devices, microprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like.
Yet further, one or more embodiments can be implemented as one or more computer programs or as one or more computer program modules embodied in one or more non-transitory computer readable storage media. The term non-transitory computer readable storage medium refers to any data storage device that can store data which can thereafter be input to a computer system. The non-transitory computer readable media may be based on any existing or subsequently developed technology for embodying computer programs in a manner that enables them to be read by a computer system. Examples of non-transitory computer readable media include a hard drive, network attached storage (NAS), read-only memory, random-access memory, flash-based nonvolatile memory (e.g., a flash memory card or a solid state disk), a CD (Compact Disc) (e.g., CD-ROM, CD-R, CD-RW, etc.), a DVD (Digital Versatile Disc), a magnetic tape, and other optical and non-optical data storage devices. The non-transitory computer readable media can also be distributed over a network coupled computer system so that the computer readable code is stored and executed in a distributed fashion.
These and other variations, modifications, additions, and improvements may fall within the scope of the appended claims(s). As used in the description herein and throughout the claims that follow, “a”, “an”, and “the” includes plural references unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.
The above description illustrates various embodiments of the present disclosure along with examples of how aspects of the present disclosure may be implemented. The above examples and embodiments should not be deemed to be the only embodiments, and are presented to illustrate the flexibility and advantages of the present disclosure as defined by the following claims. Based on the above disclosure and the following claims, other arrangements, embodiments, implementations and equivalents may be employed without departing from the scope of the disclosure as defined by the claims.
This application is a continuation application of U.S. patent application Ser. No. 16/352,577, filed Mar. 13, 2019, now published as U.S. Patent Publication 2020/0296078. U.S. patent application Ser. No. 16/352,577, now published as U.S. Patent Publication 2020/0296078, is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5581722 | Welland | Dec 1996 | A |
5968176 | Nessett et al. | Oct 1999 | A |
6098172 | Coss et al. | Aug 2000 | A |
6154775 | Coss et al. | Nov 2000 | A |
6170012 | Coss et al. | Jan 2001 | B1 |
6219786 | Cunningham et al. | Apr 2001 | B1 |
6496935 | Fink et al. | Dec 2002 | B1 |
6600744 | Carr et al. | Jul 2003 | B1 |
6708187 | Shanumgam et al. | Mar 2004 | B1 |
6880089 | Bommareddy et al. | Apr 2005 | B1 |
7032022 | Shanumgam et al. | Apr 2006 | B1 |
7055173 | Chaganty et al. | May 2006 | B1 |
7106756 | Donovan et al. | Sep 2006 | B1 |
7227842 | Ji et al. | Jun 2007 | B1 |
7349382 | Marimuthu et al. | Mar 2008 | B2 |
7657887 | Kothandaraman et al. | Feb 2010 | B2 |
7676836 | Prigent et al. | Mar 2010 | B2 |
7724740 | Wang et al. | May 2010 | B1 |
7818452 | Matthews et al. | Oct 2010 | B2 |
7831826 | Koti et al. | Nov 2010 | B2 |
7894480 | Wang et al. | Feb 2011 | B1 |
7948986 | Ghosh et al. | May 2011 | B1 |
7954143 | Aaron | May 2011 | B2 |
8032933 | Turley et al. | Oct 2011 | B2 |
8065725 | Zheng et al. | Nov 2011 | B2 |
8190767 | Maufer et al. | May 2012 | B1 |
8365294 | Ross | Jan 2013 | B2 |
8578500 | Long | Nov 2013 | B2 |
8621552 | Lotem et al. | Dec 2013 | B1 |
8660129 | Brendel et al. | Feb 2014 | B1 |
8806605 | Chickering | Aug 2014 | B1 |
8813209 | Bhattacharya et al. | Aug 2014 | B2 |
8904511 | O'Neill et al. | Dec 2014 | B1 |
9015823 | Koponen et al. | Apr 2015 | B2 |
9021546 | Banerjee | Apr 2015 | B1 |
9047109 | Wang et al. | Jun 2015 | B1 |
9130901 | Lee | Sep 2015 | B2 |
9154462 | Grimes et al. | Oct 2015 | B2 |
9215210 | Raman et al. | Dec 2015 | B2 |
9215213 | Bansal et al. | Dec 2015 | B2 |
9215214 | Bansal et al. | Dec 2015 | B2 |
9276904 | Bansal et al. | Mar 2016 | B2 |
9367257 | Hamilton et al. | Jun 2016 | B2 |
9369431 | Kirby et al. | Jun 2016 | B1 |
9479464 | Wang et al. | Oct 2016 | B1 |
9553806 | Anand | Jan 2017 | B2 |
9614748 | Battersby et al. | Apr 2017 | B1 |
9621516 | Basak et al. | Apr 2017 | B2 |
9680706 | Masurekar et al. | Jun 2017 | B2 |
9755903 | Masurekar et al. | Sep 2017 | B2 |
9774537 | Jain et al. | Sep 2017 | B2 |
9774707 | Parthasarathy et al. | Sep 2017 | B2 |
9806948 | Masurekar et al. | Oct 2017 | B2 |
9860279 | Jain et al. | Jan 2018 | B2 |
9894103 | Kwok et al. | Feb 2018 | B2 |
9906560 | Jain et al. | Feb 2018 | B2 |
9906561 | Jain et al. | Feb 2018 | B2 |
9906562 | Jain et al. | Feb 2018 | B2 |
10135727 | Gude et al. | Nov 2018 | B2 |
10148696 | Nimmagadda et al. | Dec 2018 | B2 |
10264021 | Bansal et al. | Apr 2019 | B2 |
10348685 | Chalvadi et al. | Jul 2019 | B2 |
10484334 | Lee et al. | Nov 2019 | B1 |
10701104 | Malkov | Jun 2020 | B2 |
10873595 | Oliphant et al. | Dec 2020 | B1 |
10944722 | Popuri et al. | Mar 2021 | B2 |
11005815 | Chalvadi et al. | May 2021 | B2 |
11082400 | Bansal et al. | Aug 2021 | B2 |
11088990 | Bansal et al. | Aug 2021 | B2 |
11115382 | Bansal et al. | Sep 2021 | B2 |
11122085 | Bansal et al. | Sep 2021 | B2 |
11128600 | Bansal et al. | Sep 2021 | B2 |
11171920 | Bansal et al. | Nov 2021 | B2 |
11258761 | Bansal et al. | Feb 2022 | B2 |
11310202 | Zhou et al. | Apr 2022 | B2 |
11425095 | Popuri et al. | Aug 2022 | B2 |
20020078370 | Tahan | Jun 2002 | A1 |
20030041266 | Ke et al. | Feb 2003 | A1 |
20030093481 | Mitchell et al. | May 2003 | A1 |
20030120955 | Bartal et al. | Jun 2003 | A1 |
20030126468 | Markham | Jul 2003 | A1 |
20030226027 | Marquet et al. | Dec 2003 | A1 |
20040049701 | Pennec et al. | Mar 2004 | A1 |
20040177276 | MacKinnon et al. | Sep 2004 | A1 |
20040223495 | Pachl | Nov 2004 | A1 |
20040243835 | Terzis et al. | Dec 2004 | A1 |
20040255151 | Mei et al. | Dec 2004 | A1 |
20040268150 | Aaron | Dec 2004 | A1 |
20050078601 | Moll et al. | Apr 2005 | A1 |
20050190909 | Yoneyama et al. | Sep 2005 | A1 |
20050198125 | Beck et al. | Sep 2005 | A1 |
20050210291 | Miyawaki et al. | Sep 2005 | A1 |
20050262554 | Brooks et al. | Nov 2005 | A1 |
20050276262 | Schuba et al. | Dec 2005 | A1 |
20050278431 | Goldschmidt et al. | Dec 2005 | A1 |
20060013136 | Goldschmidt et al. | Jan 2006 | A1 |
20060129808 | Koti et al. | Jun 2006 | A1 |
20060168213 | Richardson et al. | Jul 2006 | A1 |
20060195896 | Fulp et al. | Aug 2006 | A1 |
20070028291 | Brennan et al. | Feb 2007 | A1 |
20070061492 | Riel | Mar 2007 | A1 |
20070118893 | Crawford | May 2007 | A1 |
20070136813 | Wong | Jun 2007 | A1 |
20080072305 | Casado et al. | Mar 2008 | A1 |
20080082977 | Araujo et al. | Apr 2008 | A1 |
20080115190 | Aaron | May 2008 | A1 |
20080148382 | Bartholomy et al. | Jun 2008 | A1 |
20080189769 | Casado et al. | Aug 2008 | A1 |
20080215518 | Matsuda | Sep 2008 | A1 |
20080267177 | Johnson et al. | Oct 2008 | A1 |
20080289026 | Abzarian et al. | Nov 2008 | A1 |
20080289028 | Jansen et al. | Nov 2008 | A1 |
20080298274 | Takashige et al. | Dec 2008 | A1 |
20090007219 | Abzarian et al. | Jan 2009 | A1 |
20090007251 | Abzarian et al. | Jan 2009 | A1 |
20090083727 | Fu et al. | Mar 2009 | A1 |
20090129271 | Ramankutty et al. | May 2009 | A1 |
20090150521 | Tripathi | Jun 2009 | A1 |
20090172800 | Wool | Jul 2009 | A1 |
20090185568 | Cho et al. | Jul 2009 | A1 |
20090228972 | Bandi et al. | Sep 2009 | A1 |
20090235325 | Dimitrakos et al. | Sep 2009 | A1 |
20090249436 | Coles et al. | Oct 2009 | A1 |
20090249438 | Litvin et al. | Oct 2009 | A1 |
20090249470 | Litvin et al. | Oct 2009 | A1 |
20090249472 | Litvin et al. | Oct 2009 | A1 |
20090276771 | Nickolov et al. | Nov 2009 | A1 |
20090327198 | Farah | Dec 2009 | A1 |
20090327781 | Tripathi | Dec 2009 | A1 |
20100037310 | Turley et al. | Feb 2010 | A1 |
20100037311 | He et al. | Feb 2010 | A1 |
20100037331 | Blake et al. | Feb 2010 | A1 |
20100043067 | Varadhan et al. | Feb 2010 | A1 |
20100100616 | Bryson et al. | Apr 2010 | A1 |
20100100949 | Sonwane et al. | Apr 2010 | A1 |
20100125667 | Soundararajan | May 2010 | A1 |
20100180331 | Murakami et al. | Jul 2010 | A1 |
20100192215 | Yaxuan et al. | Jul 2010 | A1 |
20100333165 | Basak et al. | Dec 2010 | A1 |
20110016467 | Kane | Jan 2011 | A1 |
20110022695 | Dalal et al. | Jan 2011 | A1 |
20110055916 | Ahn | Mar 2011 | A1 |
20110072486 | Hadar et al. | Mar 2011 | A1 |
20110103259 | Aybay et al. | May 2011 | A1 |
20110113467 | Agarwal et al. | May 2011 | A1 |
20110154470 | Grimes et al. | Jun 2011 | A1 |
20110213875 | Ferris et al. | Sep 2011 | A1 |
20110246637 | Murakami | Oct 2011 | A1 |
20110302647 | Bhattacharya et al. | Dec 2011 | A1 |
20120042033 | Ayala, Jr. et al. | Feb 2012 | A1 |
20120137199 | Liu | May 2012 | A1 |
20120180104 | Gronich et al. | Jul 2012 | A1 |
20120240182 | Narayanaswamy et al. | Sep 2012 | A1 |
20120263049 | Venkatachalapathy et al. | Oct 2012 | A1 |
20120291024 | Barabash et al. | Nov 2012 | A1 |
20120314617 | Erichsen et al. | Dec 2012 | A1 |
20130007740 | Kikuchi et al. | Jan 2013 | A1 |
20130019277 | Chang et al. | Jan 2013 | A1 |
20130031544 | Sridharan et al. | Jan 2013 | A1 |
20130047151 | Sridharan et al. | Feb 2013 | A1 |
20130073743 | Ramasamy et al. | Mar 2013 | A1 |
20130074066 | Sanzgiri et al. | Mar 2013 | A1 |
20130125230 | Koponen et al. | May 2013 | A1 |
20130163594 | Sharma et al. | Jun 2013 | A1 |
20130198355 | Kalyanaraman et al. | Aug 2013 | A1 |
20130219384 | Srinivasan et al. | Aug 2013 | A1 |
20130227097 | Yasuda et al. | Aug 2013 | A1 |
20130227550 | Weinstein et al. | Aug 2013 | A1 |
20130311358 | Sethi et al. | Nov 2013 | A1 |
20130311612 | Dickinson | Nov 2013 | A1 |
20130332983 | Koorevaar et al. | Dec 2013 | A1 |
20140068602 | Gember et al. | Mar 2014 | A1 |
20140108319 | Klauser et al. | Apr 2014 | A1 |
20140115578 | Cooper et al. | Apr 2014 | A1 |
20140149794 | Shetty et al. | May 2014 | A1 |
20140195666 | Dumitriu et al. | Jul 2014 | A1 |
20140245423 | Lee | Aug 2014 | A1 |
20140281030 | Cui et al. | Sep 2014 | A1 |
20140282855 | Clark et al. | Sep 2014 | A1 |
20140282889 | Ishaya et al. | Sep 2014 | A1 |
20140297780 | Zhou et al. | Oct 2014 | A1 |
20140304387 | Bansal et al. | Oct 2014 | A1 |
20140325037 | Elisha | Oct 2014 | A1 |
20150052521 | Raghu | Feb 2015 | A1 |
20150095970 | Shetty | Apr 2015 | A1 |
20150112933 | Satapathy | Apr 2015 | A1 |
20150163200 | Chang et al. | Jun 2015 | A1 |
20150193466 | Luft | Jul 2015 | A1 |
20150200816 | Yung et al. | Jul 2015 | A1 |
20150229641 | Sun et al. | Aug 2015 | A1 |
20150237013 | Bansal et al. | Aug 2015 | A1 |
20150237014 | Bansal et al. | Aug 2015 | A1 |
20150237015 | Bansal et al. | Aug 2015 | A1 |
20150277949 | Loh et al. | Oct 2015 | A1 |
20160050117 | Voellmy et al. | Feb 2016 | A1 |
20160050141 | Wu et al. | Feb 2016 | A1 |
20160065627 | Pearl et al. | Mar 2016 | A1 |
20160094456 | Jain et al. | Mar 2016 | A1 |
20160094643 | Jain et al. | Mar 2016 | A1 |
20160105333 | Lenglet et al. | Apr 2016 | A1 |
20160112374 | Branca | Apr 2016 | A1 |
20160149863 | Walker et al. | May 2016 | A1 |
20160156591 | Zhou et al. | Jun 2016 | A1 |
20160182454 | Phonsa et al. | Jun 2016 | A1 |
20160191466 | Pernicha | Jun 2016 | A1 |
20160191570 | Bansal et al. | Jun 2016 | A1 |
20160241702 | Chandra et al. | Aug 2016 | A1 |
20170004192 | Masurekar et al. | Jan 2017 | A1 |
20170005867 | Masurekar et al. | Jan 2017 | A1 |
20170005987 | Masurekar et al. | Jan 2017 | A1 |
20170005988 | Bansal et al. | Jan 2017 | A1 |
20170026283 | Williams et al. | Jan 2017 | A1 |
20170064749 | Jain et al. | Mar 2017 | A1 |
20170104720 | Bansal et al. | Apr 2017 | A1 |
20170118173 | Arramreddy et al. | Apr 2017 | A1 |
20170134422 | Shieh et al. | May 2017 | A1 |
20170134436 | Agarwal et al. | May 2017 | A1 |
20170171362 | Bolotov et al. | Jun 2017 | A1 |
20170180319 | Nimmagadda et al. | Jun 2017 | A1 |
20170180320 | Nimmagadda et al. | Jun 2017 | A1 |
20170180321 | Nimmagadda et al. | Jun 2017 | A1 |
20170180423 | Nimmagadda et al. | Jun 2017 | A1 |
20170187679 | Basak et al. | Jun 2017 | A1 |
20170250869 | Voellmy | Aug 2017 | A1 |
20170317928 | Gude et al. | Nov 2017 | A1 |
20170317976 | Chalvadi et al. | Nov 2017 | A1 |
20170317977 | Popuri et al. | Nov 2017 | A1 |
20170317979 | Bansal et al. | Nov 2017 | A1 |
20170318055 | Popuri et al. | Nov 2017 | A1 |
20180007000 | Bansal et al. | Jan 2018 | A1 |
20180007007 | Bansal et al. | Jan 2018 | A1 |
20180007008 | Bansal et al. | Jan 2018 | A1 |
20190182213 | Saavedra | Jun 2019 | A1 |
20190207983 | Bansal et al. | Jul 2019 | A1 |
20190319925 | Chalvadi et al. | Oct 2019 | A1 |
20200296078 | Zhou et al. | Sep 2020 | A1 |
20210409453 | Kaushal et al. | Dec 2021 | A1 |
Number | Date | Country |
---|---|---|
2748750 | Jul 2014 | EP |
2003188906 | Jul 2003 | JP |
2006040274 | Feb 2006 | JP |
2009017269 | Jan 2009 | JP |
2013012865 | Jan 2013 | JP |
20080100620 | Nov 2008 | KR |
2002056562 | Jul 2002 | WO |
WO-02056562 | Jul 2002 | WO |
2008095010 | Aug 2008 | WO |
2013074828 | May 2013 | WO |
Entry |
---|
Author Unknown, “CISCO Identity-Based Firewall Security,” Month Unknown 2011, 2 pages, CISCO Systems, Inc. |
Author Unknown, “AppLogic Features,” Jul. 2007, 2 pages, 3TERA, Inc. |
Author Unknown, “Enabling Service Chaining on Cisco Nexus 1000V Series,” Month Unknown, 2012, 25 pages, CISCO. |
Author Unknown, “Next-Generation Firewalls,” Month Unknown 2013, 1 page, Palo Alto Networks. |
Basak, Debashis, et al., “Virtualizing Networking and Security in the Cloud,” Month Unknown 2010, 9 pages, VMware, Inc., Palo Alto, CA. |
Casado, Martin, et al., “SANE: A Protection Architecture for Enterprise Networks,” Proceedings of the 15th USENIX Security Symposium, Jul. 31-Aug. 4, 2006, 15 pages, USENIX, Vancouver, Canada. |
Dixon, Colin, et al., “An End to the Middle,” Proceedings of the 12th Conference on Hot Topics in Operating Systems, May 2009, 5 pages, USENIX Association, Berkeley, CA, USA. |
Dumitriu, Dan Mihai, et al., (U.S. Appl. No. 61/514,990), filed Aug. 4, 2011, 31 pages. |
Guichard, J., et al., “Network Service Chaining Problem Statement,” Network Working Group, Jun. 13, 2013, 14 pages, Cisco Systems, Inc. |
Haim, Roie Ben, “NSX Distributed Firewall Deep Dive,” Route to Cloud, Apr. 30, 2015, 52 pages. |
Herndon, Joseph, “FairWarning IP, LLC v. Iatric Systems, Inc. (Fed. Cir. 2016),” Oct. 13, 2016, 3 pages. |
Ioannidis, Sotiris, et al., “Implementing a Distributed Firewall,” CCS '00, Month Unknown 2000, 10 pages, ACM, Athens, Greece. |
Joseph, Dilip Anthony, et al., “A Policy-aware Switching Layer for Data Centers,” Jun. 24, 2008, 26 pages, Electrical Engineering and Computer Sciences, University of California, Berkeley, CA, USA. |
Mayer, Alain, et al., “Offline Firewall Analysis,” International Journal of information Security, Jun. 16, 2005, 20 pages, vol. 5, Issue 3, Springer-Verlag. |
Scarfone, Karen, et al., “Guidelines on Firewalls and Firewall Policy: Recommendations of the National Institute of Standards and Technology,” Special Publication 800-41, Revision 1, Sep. 2009, 48 pages, NIST, U.S. Department of Commerce. |
Sekar, Vyas, et al., “Design and Implementation of a Consolidated Middlebox Architecture,” 9th USENIX Symposium on Networked Systems Design and Implementation, Apr. 25-27, 2012, 14 pages, USENIX, San Jose, CA, USA. |
Sherry, Justine, et al., “Making Middleboxes Someone Else's Problem: Network Processing as a Cloud Service,” In Proc. of SIGCOMM '12, Aug. 13-17, 2012, 12 pages, Helsinki, Finland. |
Stojanovski, Nenad, et al., “Analysis of Identity Based Firewall Systems,” Jun. 2010, 9 pages. |
Stojanovski, Nenad, et al., “Architecture Of A Identity Based Firewall System,” Jul. 2011, 9 pages. |
Thames, J. Lane, et al., “A Distributed Firewall and Active Response Architecture Providing Preemptive Protection,” ACM-SE '08, Mar. 28-29, 2008, 6 pages, Auburn, AL, USA. |
Number | Date | Country | |
---|---|---|---|
20220239635 A1 | Jul 2022 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16352577 | Mar 2019 | US |
Child | 17723191 | US |