Control of a company's Information Technology (IT) enterprise configuration is valuable not only for logistical reasons, but also for regulatory reasons, including in the areas of enterprise security, regulatory compliance, and change management. A significant aspect of such configuration control may include, for example, controlling what code can run, controlling what parts of the software set are allowed to change under what circumstances, and observing and logging what modifications are made to the code of one or more systems in the enterprise.
A method is described to maintain (including to generate) an inventory of a system of a plurality of containers accessible by a computer system. At least one container is considered to determine whether the container is executable in at least one of a plurality of execution environments characterizing the computer system. Each execution environment is in the group comprising a native binary execution environment configured to execute native machine language instructions and a non-native execution environment configured to execute at least one program to process non-native machine language instructions to yield native machine language instructions. The inventory is maintained based on a result of the considering step. The inventory may be used to exercise control over what executables are allowed to execute on the computer system.
In order to exercise configuration control, a preliminary step may include generating an inventory of the computer's installed software set. Once the inventory is generated, the inventory may evolve as the code configuration of the computer evolves. As configuration control is exercised, the inventory may be employed to make decisions and take resultant actions, and the inventory may be maintained in synchronization with such decisions and actions.
In this detailed description, we discuss aspects of an execution environment inventorying methodology. Before discussing the execution environment inventorying methodology in detail, it is useful to generally discuss some terminology related to an information technology (IT) enterprise environment, including related to a particular computing device and/or system in such an IT enterprise environment.
Referring to
In particular, a native “binary execution environment” is a mechanism by which execution of native binary code, comprising instructions in the native machine language of the computer system 101, is accomplished by the execution unit 102. In addition to a native binary execution environment, the computer system 101 generally is characterized by a set of other (non-native) execution environments as well. Such a non-native execution environment is a mechanism by which a program, written in a programming language (such as, but not limited to, Java, Perl, Lisp, Visual Basic, Microsoft Word/Excel Macros, etc.) is “run,” eventually resulting in the execution of some native binary code, by the execution unit 102, that corresponds to actions indicated by the program. It is noted that the set of execution environments present on a computer can generally be extended or reduced, by installing or uninstalling corresponding pieces of software.
Having generally described characteristics of execution environments, we now discuss some example execution environments. One example execution environment is the native binary execution environment provided by an operating system executing on the computer system. For example, an environment to run executable files (such as those typically designated by a file extension of “.exe”) on a Microsoft™ Windows-based computer system with an Intel™ Pentium-based processor architecture, wherein the executable files comprise native instructions for the Intel™ Pentium processor, is an example of a native binary execution environment. Other execution environments, of the non-native type, include interpreters for processing shell scripts, Perl scripts, Java source code or byte code, and Lisp source code programs and resulting in execution of native binary code that corresponds to actions indicated by the source code programs.
Yet other execution environments of the non-native type include execution environments that exist within applications. These execution environments operate to extend the functionality of the applications within which they exist. Examples of such execution environments include a Java Virtual Machine (or a front end to an external Java Virtual Machine) that operates to extend the functionality of a web browser, for example, by processing Java programs (source code or byte code). Another example includes functionality to process Structured Query Language (SQL) code, Microsoft™ Excel macros, and Database Management System (DBMS) macros.
As discussed above, a computer system may be characterized by various execution environments. As a result, there are various “types” of files that can be processed by or according to the execution environments. At a particular point in time, the set of execution environments characterizing a particular computer is determinate. As discussed below, a complete (with respect to existing execution environments) inventory of all the files that can be processed by or according to the execution environments characterizing the computer may be maintained as the configuration of the computer evolves over time, including initially generating the inventory, e.g., based on an initial static configuration.
At step 202, the file system “scan” is begun. Steps 204, 206, 208 and 210 are executed for each file accessible by the computer (or, perhaps, for some other ascertainable set of files). At step 204, a file is considered. At step 206, it is determined, based on a result of step 204, whether the file can be processed by or according to any of the execution environments characterizing the computer (i.e., in shorthand, is “executable”). If a result of the determination at step 206 is affirmative, then at step 208, an identifier of the file is added to an inventory of files. The identifier of the file may include, for example, a name and/or unique path associated with the file. In some examples, the identifier includes data that is useable to verify the integrity of the file contents, such as a hash, checksum or message digest of the file. At step 210, it is determined if all of the files have been considered. If yes, then processing completes at step 212. Otherwise, processing returns to step 206 where a next file is considered.
Having broadly discussed a method to initially generate an inventory of files, we now discuss specific examples of how to determine that a file is executable (step 206 of
It is noted that scanning a computer's file system is just one technique for identifying and locating files (which files can then be processed according to step 206), and there are a number of alternative techniques. As one example, if the computer's operating system maintains a full or partial record of the installed software (such as the records maintained by a Microsoft™ Windows OS and available via the “Add or Remove Programs” option in the “Control Panel”), this record can be queried or otherwise examined for files. As another example, if the operating system maintains a full or partial record of available services, the record can be queried or otherwise examined to reveal one or more files involved in providing the services. As another example, if the operating system maintains a full or partial record of the computer's network ports, the record can be queried (for example by using the “netstat” command on a Microsoft™ Windows or Linux-flavored operating system) or otherwise examined to reveal the files involved in listening to the ports, creating connections and/or other processing of the communications on the ports. As another example, if the operating system maintains a full or partial record of the currently loaded drivers or the currently installed drivers, this record can be queried or otherwise examined to reveal files involved in implementing the drivers. In this example, the driver files can optionally be examined to determine whether or not they are signed by their respective vendors. Optionally, files are prevented from being added to the inventory (or otherwise from being designated as “authorized to execute” on the computer, as described below) if they are not properly signed.
Optionally, an exhaustive scanning of the file system can be replaced with a combination of one or more of the alternative file locating techniques described in the previous paragraph to yield a complete and accurate inventory of the system, provided that an additional “dependency analysis” step is performed on the files that are placed into the inventory. That is, for a given file under consideration, the dependency analysis comprises examining the file and identifying other files or components referenced or otherwise used by the file, such as libraries and other executables. These identified objects can then be processed according to step 206 and added to the inventory if appropriate, as well as recursively analyzed for their own dependencies. This methodical hybrid technique can save valuable time and processing resources by eliminating the exhaustive scanning of the file system without sacrificing the completeness or accuracy of the inventory.
It is further noted that, while the discussion has been directed to files, this concept may be generalized to apply to consideration of “containers” generally that may be processed by an execution environment to result in execution of native binary code that corresponds to actions indicated by instructions within the containers. For example, and not by way of limitation, a database management system (DBMS) is an execution environment for stored-procedures (sprocs), and sprocs may be stored in the DBMS itself and not necessarily in separate files. As another example, a JAR (Java ARchive) file may contain compressed information representing one or more Java classes and associated metadata which can be part of a Java program.
Having broadly described an example of initially generating an inventory of files (“containers,” generally) accessible by a computer, with regard to execution environments, we now discuss with reference to
In some examples, the
With respect to how to detect and/or block an attempt to change an executable file, the '741 application describes methodology to intercept/detect attempts to change objects, as well as describing methodology to block the intercepted/detected change attempts. Similar methodology may be employed with regard to intercepting/detecting attempts to execute objects, as well as to block the intercepted/detected execution attempts.
Having broadly described an example of initially generating an inventory of files (“containers,” generally) accessible by a computer and using the inventory to exercise execution control, we now discuss with reference to
Referring to
Examples of detecting change attempts to a host object are described, for example, in the '741 application. Furthermore, the '741 application also discusses what may be meant by what “affects” an inventoried file. This may mean, for example, changing the object (e.g., a “write,” “rename,” “move,” or “delete” operation), as well as a change in one or more attributes of the file. In some examples, “affects” may also include “read,” “view” or “access” operations, such as in a scenario where some files indicated in the inventory are designated as requiring authorization for such operations. This will in effect allow control over what files (generally containers) can be read, viewed or accessed. In addition, examples of determining what changes are authorized are also described in the '741 application.
Other examples of determining what changes are “authorized” are discussed in greater detail below with reference to
Having discussed an example of maintaining over time the inventory of files with regard to execution environments, we return to discussing a determination of what changes are authorized, discussed relative to steps 314 and 322 of the
In another example, “signed updates” and “signed updaters” are employed, using public/private key pairs, digital signatures or other methods for the digital authentication of updates and/or updaters. In this manner, digital authentication may be processed to indicate that an update to a host is authorized. That is, the digital authentication is another way to indicate what changes are authorized.
In one example, inventory maintenance is decoupled from checking for change authorization. That is, the inventory is not used in making authorization decisions. Rather, referring to
If it is determined at step 404 that the entity attempting to make the change is not an anytime updater, then it is determined at step 408 if the system is in update mode. The system is considered to be in update mode if the change authorization policy that is in effect indicates that updates (changes to the system) are allowed by one or more sometime updaters. If it is determined at step 408 that the system is in update mode, then it is determined at step 412 if the entity attempting to make the change is a sometime updater. If it is determined at step 412 that the entity attempting to make the change is a sometime updater, then the change is authorized at step 406. Note that the determination may depend on a number of conditions (as described in the '741 patent), for example on the date and time, the particular updater, the particular nature of the change, the particular attributes of the object to be changed, etc.
If it is determined at step 408 that the system is not in update mode, or if it determined at step 412 that the entity attempting to make the change is not a sometime updater, then the change is not authorized at step 410.
There are some points of flexibility in configuring authorizations. For example, one such point of flexibility is configuring what is an anytime updater (e.g., configuring an authorization such that a change action by a particular user or program or process is always permitted). For example, an authorization may be configured such that processes executing under a particular group ID are anytime updaters. In a similar manner, an authorization may be configured such that a change action by a particular user (e.g., a process executing under a particular user ID) is permitted when the computer is in “update” mode.
Another point of flexibility in configuring authorizations includes defining the conditions, other than defining the particular user, under which a sometime updater is authorized to make changes affecting inventoried files.
Under some conditions, there is some leeway and/or ambiguity regarding the timing with which a file should be indicated in the inventory as executable and, in some circumstances, a file that is executable should nevertheless not be so indicated in the inventory at all. For example, a user may cause a “setup.exe” file to run, the result of which includes attempting to add a set of new executable files to the file system. With regard to timing, the files may be added to the inventory one by one, at each attempt to add an executable file to the disk. Another option includes adding all of the executables to the inventory in a batch.
Furthermore, it is ambiguous whether the setup.exe file itself, which is run only to install a program (including, perhaps, adding a set of new executable files to the file system, as discussed above) and will not need to remain executable beyond the update window should be indicated in the inventory. In fact, the setup.exe may only function to download another executable file, which is an installer, where it is the execution of the installer that causes the program to be “installed.” Thus, for example, an update window may be opened before the installer is downloaded. After the installer is downloaded, the installer is executed, and the installer is erased while the update window is still open.
In some examples, the installation process may be such that the operator may have to do some manual cleanup. For example, if the installation includes a “reboot,” then this may comprise keeping the update window open across the reboot and closing the update window after the post-reboot installation activities are completed.
It should be noted that the semantics of the inventory may be reduced to the point where, for example, having an entry in the inventory simply means “this container is an executable on this host,” without indicating anything about whether the executable is actually authorized to execute on the host. Thus, for example, execution authorization can be relegated to a data structure or mechanism separate from the inventory. As another example, the data structure may simply be represented by additional metadata in the inventory indicating “this executable file is (or is not) actually authorized to execute on this host.”
As alluded to above, the concept of “files,” and what files are “accessible” to be executed in an execution environment, need not be limited to the traditional notion of files (e.g., an “ordinary” file, existing within the directory structure of an operating system, and that contains either text, data or program). In addition, the “file system” need not be limited to existing on a storage device directly associated with a computer (e.g., residing in a housing that also houses a CPU).
That is, the inventory concept may be generalized as follows:
The first generalization, from “files” to “containers,” has been discussed above. That is, an executable file may contain ordinary code. However, “containers” are more general, and may include files or other “objects” that have code within them but where the files or objects themselves are not typically executed. Examples include Java code containers (such as .jar containers) and stored-procedure containers (i.e., containers of “sprocs”) which reside within databases and are managed by database management systems. In an SOA environment, code containers may be made available through distributed computing services, such as distributed services that use SOAP (Simple Object Access Protocol) as a common language for requests and responses, etc. In fact, the containers need not be files at all. For example, the containers may include objects in databases, packaged code served by SOAs, etc. While much of the description herein uses files as an example, the described methodology is generally applicable to containers that may be processed by execution environments.
With regard to distributed files, we now discuss two examples. In the first example, a code container is accessible but resides on a remote file system, such as a networked file system or a network share. In this case, in the course of generating an inventory, the remote file system is scanned, and the containers are processed in a manner similar to that discussed above (e.g., with reference to the
In another example, code containers are available for access from various repositories via an SOA or similar methodology. Thus, for a particular host (such as the host 101 in
In one example, the scanning employs the mechanism provided by the SOA to poll what types of “code containers” are available. Some of these code containers are files, while others can be “stubs” that describe or indicate a particular service that is provided remotely (e.g. remote procedure calls). In any event, the inventory is generated and/or maintained to hold an identification for each code container, similar to manner in which the identification of executable files directly stored on a locally-accessible file storage are held.
In addition to indicating the executable containers in the inventory, non-executable containers may be indicated in the inventory as a way to write-protect or even read-protect the data in the non-executable containers. Thus, for example, meta-data stored in a container (such as a file) and used in maintaining the inventory may be protected in this manner by placing an identification for the meta-data container into the inventory and designating the container as only writeable by those processes that manage the inventory, such that the meta-data cannot be changed except by executing code that is authorized to make such changes. Note that in this case the container is not designated as an executable, but as a write-protected container. Enforcing read-protection can be done in a similar fashion. Note that as a particular example, read-protection and access-protection (or more generally, read-restriction and access-restriction via authorized readers or accessors, defined in analogy with authorized updaters) can be used to control data exfiltration.
In some examples, the methodology described herein is carried out by a computing system under programmed control. In other examples, the methodology described herein is carried out by a person, or in some combination of both.
Having described how to use an inventory for execution control, we now discuss some other particular applications of the inventory aside from execution control. In a first application, enterprise computing asset management is carried out using a centralized aggregate inventory. For example, many enterprises have more (or fewer) licenses than required for particular applications. By comparing an easily generated inventory with the licenses, the licensing can be more closely matched to the actual usage.
In another example, a “gold image” inventory is generated and maintained, representing a baseline inventory for deployment onto one or more hosts. As the hosts operate over time, their own individual inventories and/or their inventory “deltas” (as measured from the gold image inventory) are maintained on the individual hosts. Thus, for example, a certain amount of delta from the gold image inventory may be considered allowable, but additional updates may be blocked if the update would cause the delta to exceed a threshold. The delta may be quantified in any number of ways, for instance as an absolute number of inventory items, as a ratio of the size of the individual inventory to the size of the gold image inventory, as a ratio of the size of the intersection of the individual and gold image inventories to the size of the gold image inventory, or as any other metric that is meaningful to the business.
In another example, efficiency is increased by creating an inventory of a remote repository (e.g., a mountable drive), and then making the ready-made inventory available to individual agents on the individual hosts that have access to the remote repository, either directly or via a central system controller. Thus, the ready-made inventory can be used on individual hosts in order to exercise execution control over the items residing on the remote repository. Note that in general a host may not have sufficient authority over maintaining the inventory of the remote repository in response to changes to the remote repository, or over blocking changes to items as described above. Therefore, it may be useful for the host to check for staleness of inventory items. For example, when a host exercising execution control is processing an attempt to execute a file residing on a remote repository, the host may examine not only that the file has an associated entry in the ready-made inventory, but also that a time stamp of the entry is at least as recent as the creation time stamp of the file. An alternative to using time stamps is using checksums for ensuring that the inventory entries pertain to the exact same file at hand.
In another example, a centrally-maintained inventory of a plurality of hosts is used to make decisions involving knowledge of the set of executable files (or other types of files) on the plurality of hosts. This aggregates information about the plurality of hosts onto a central inventory (aggregate inventory), thereby allowing a centralized analysis of the information. The analysis results can then be used to make decisions or perform actions related to one or more of the plurality of hosts. Actions can be initiated locally on a host or remotely in a way that affects the host. Actions can also be performed in a way that does not directly affect the host, but instead affects a related resource, such as an information repository or a network node, as illustrated with examples below.
One example of using a central inventory is anti-malware processing. A central inventory may be maintained which indicates a union of the executables on the plurality of hosts together with which files reside on which hosts, and this inventory is scanned by anti-virus or other anti-malware code (as opposed to doing anti-virus code-scans separately on each host). The information provided by such a central scan can then form a basis for making decisions pertaining to, or for performing actions on, one or more of the plurality of hosts, just as if the information had been gathered locally on the individual hosts. For example, if a central scan reveals the presence of a virus on a particular host, an action to remove the virus can be caused to be performed on the host. Similarly, if a central scan reveals that a particular networked host is infected with a worm, then one or more elements of a network infrastructure, such as switches, routers, or firewalls can be instructed to isolate, or otherwise monitor or respond to, the infected host, and further action can be performed on the infected host in order to disable the worm.
Another example of using a central inventory is license management. In this example, the central inventory is checked against a record of purchased licenses to perform an analysis indicating which hosts are using which licenses. Follow up steps may include purchasing additional licenses as needed, non-renewal of existing licenses if the analysis indicates unused purchased licenses, removal of software that the analysis indicates is not supposed to be residing on a host, and so on.
Another example of using a central inventory is change and configuration management. In this example, the software resident on a plurality of hosts is managed through authorized channels, such as by using a software provisioning system. Here, a central inventory can be used to indicate software resident on the plurality of hosts, and analysis may include identifying software which, while resident on one or more hosts, lacks a trail indicating its deployment onto the hosts through the authorized channels. Follow up actions may include updating records to more accurately indicate the presence of software on hosts, removal of software that is not supposed to be resident on a host, and so on.
Another example of using a central inventory relates to the above referenced co-pending U.S. patent application Ser. No. 11/182,320, wherein software resident on one or more of a plurality of hosts or other computing elements (such as network nodes, firewalls, etc.) performs some amount of local analysis or pre-processing related to inventoried containers resident on the host or computing element, and sends results of the analysis to a designated entity for further investigation and response. In such a configuration, the designated entity may maintain a central inventory of one or more containers resident on the plurality of hosts or computing elements, and use the sent results from several hosts in combination with the visibility provided by the central inventory in order to reach conclusions regarding trends in the state of the plurality of hosts and cause actions or further analyses to be performed on one or more of the plurality of hosts. For example, if a host identifies a piece of software resident on the host as malware and shares that information with the designated entity, the entity may refer to the central inventory to determine which other hosts may be harboring that piece of software, alert those hosts, and cause a removal or quarantine of the identified malware.
For the above examples using central inventories, note that the union of the inventories of the plurality of hosts (or any other construct of the individual inventories) need not be exact, since even approximate aggregates can save valuable resources as the number of hosts grows. This application of a central inventory can be generalized to any processing that is based on a scan or examination of a plurality of hosts, and the code that scans the centrally-maintained inventory may be, for example, any code for which the inventory provides useful information from which a decision for changing and/or execution may be made. This may include, for example, scanning for adware or spyware, and scanning for copyrighted/licensed material.
The foregoing described embodiments are provided as illustrations and descriptions. The invention is not intended to be limited to the precise form described. Other variations and embodiments are possible in light of above examples, and it is thus intended that the scope of the invention not be limited by this detailed description.
This Application is a continuation of (and claims the benefit of priority under 35 U.S.C. §120) of U.S. application Ser. No. 13/022,148, filed Feb. 7, 2011, entitled “Execution Environment File Inventory,” Inventor(s) Rishi Bhargava, et al., which is a continuation of U.S. application Ser. No. 11/277,596, filed Mar. 27, 2006, entitled “Execution Environment File Inventory,” Inventor(s) Rishi Bhargava, et al. The disclosure of the prior applications are considered part of (and are incorporated by reference in) the disclosure of this application. In addition, this application is related to the following, all of which are incorporated herein by reference in their entirety: co-pending U.S. patent application Ser. No. 10/651,591, entitled “Method And System For Containment of Networked Application Client Software By Explicit Human Input” and filed on Aug. 29, 2003, issued on Sep. 17, 2013, as U.S. Pat. No. 8,539,063; co-pending U.S. patent application Ser. No. 10/651,588, entitled “Damage Containment By Translation” and filed on Aug. 29, 2003, issued on Dec. 9, 2008 as U.S. Pat. No. 7,464,408; co-pending U.S. patent application Ser. No. 10/806,578, entitled “Containment Of Network Communication” and filed on Mar. 22, 2004, issued on Aug. 24, 2010 as U.S. Pat. No. 7,783,735; co-pending U.S. patent application Ser. No. 10/739,230, entitled “Method And System For Containment Of Usage Of Language Interfaces” and filed on Dec. 17, 2003, issued on Nov. 23, 2010, as U.S. Pat. No. 7,840,968; co-pending U.S. patent application Ser. No. 10/935,772, entitled “Solidifying the Executable Software Set of a Computer” and filed on Sep. 7, 2004, issued on Jan. 18, 2011, as U.S. Pat. No. 7,873,955; co-pending U.S. patent application Ser. No. 11/060,683, entitled “Distribution and Installation of Solidified Software on a Computer” and filed on Feb. 16, 2005; co-pending U.S. patent application Ser. No. 11/122,872, entitled “Piracy Prevention Using Unique Module Translation” and filed on May 4, 2005, issued on Oct. 13, 2009 as U.S. Pat. No. 7,603,552; co-pending U.S. patent application Ser. No. 11/182,320, entitled “Classification of Software on Networked Systems” and filed on Jul. 14, 2005, issued on Dec. 21, 2010, as U.S. Pat. No. 7,856,661; and co-pending U.S. patent application Ser. No. 11/346,741, entitled “Enforcing Alignment of Approved Changes and Deployed Changes in the Software Change Life-Cycle” by Rahul Roy-Chowdhury, E. John Sebes and Jay Vaishnav, filed on Feb. 2, 2006, issued on Jul. 13, 2010 as U.S. Pat. No. 7,757,269.
Number | Name | Date | Kind |
---|---|---|---|
4688169 | Joshi | Aug 1987 | A |
4982430 | Frezza et al. | Jan 1991 | A |
5155847 | Kirouac et al. | Oct 1992 | A |
5222134 | Waite et al. | Jun 1993 | A |
5390314 | Swanson | Feb 1995 | A |
5521849 | Adelson et al. | May 1996 | A |
5560008 | Johnson et al. | Sep 1996 | A |
5699513 | Feigen et al. | Dec 1997 | A |
5778226 | Adams et al. | Jul 1998 | A |
5778349 | Okonogi | Jul 1998 | A |
5787427 | Benantar et al. | Jul 1998 | A |
5842017 | Hookway et al. | Nov 1998 | A |
5873086 | Fujii et al. | Feb 1999 | A |
5884298 | Smith, II | Mar 1999 | A |
5907709 | Cantey et al. | May 1999 | A |
5907860 | Garibay et al. | May 1999 | A |
5926832 | Wing et al. | Jul 1999 | A |
5944839 | Isenberg | Aug 1999 | A |
5974149 | Leppek | Oct 1999 | A |
5987557 | Ebrahim | Nov 1999 | A |
5987610 | Franczek et al. | Nov 1999 | A |
5987611 | Freund | Nov 1999 | A |
5991881 | Conklin et al. | Nov 1999 | A |
6064815 | Hohensee et al. | May 2000 | A |
6073142 | Geiger et al. | Jun 2000 | A |
6141698 | Krishnan et al. | Oct 2000 | A |
6182142 | Win et al. | Jan 2001 | B1 |
6192401 | Modiri et al. | Feb 2001 | B1 |
6192475 | Wallace | Feb 2001 | B1 |
6256773 | Bowman-Amuah | Jul 2001 | B1 |
6275938 | Bond et al. | Aug 2001 | B1 |
6321267 | Donaldson | Nov 2001 | B1 |
6338149 | Ciccone, Jr. et al. | Jan 2002 | B1 |
6356957 | Sanchez, II et al. | Mar 2002 | B2 |
6377808 | Korneluk et al. | Apr 2002 | B1 |
6393465 | Leeds | May 2002 | B2 |
6442686 | McArdle et al. | Aug 2002 | B1 |
6449040 | Fujita | Sep 2002 | B1 |
6453468 | D'Souza | Sep 2002 | B1 |
6460050 | Pace et al. | Oct 2002 | B1 |
6496477 | Perkins et al. | Dec 2002 | B1 |
6587877 | Douglis et al. | Jul 2003 | B1 |
6611925 | Spear | Aug 2003 | B1 |
6658645 | Akuta et al. | Dec 2003 | B1 |
6662219 | Nishanov et al. | Dec 2003 | B1 |
6748534 | Gryaznov et al. | Jun 2004 | B1 |
6769008 | Kumar et al. | Jul 2004 | B1 |
6769115 | Oldman | Jul 2004 | B1 |
6795966 | Lim et al. | Sep 2004 | B1 |
6832227 | Seki et al. | Dec 2004 | B2 |
6834301 | Hanchett | Dec 2004 | B1 |
6847993 | Novaes et al. | Jan 2005 | B1 |
6907600 | Neiger et al. | Jun 2005 | B2 |
6918110 | Hundt et al. | Jul 2005 | B2 |
6930985 | Rathi et al. | Aug 2005 | B1 |
6934755 | Saulpaugh et al. | Aug 2005 | B1 |
6941470 | Jooste | Sep 2005 | B1 |
6988101 | Ham et al. | Jan 2006 | B2 |
6988124 | Douceur et al. | Jan 2006 | B2 |
7007302 | Jagger et al. | Feb 2006 | B1 |
7010796 | Strom et al. | Mar 2006 | B1 |
7024548 | O'Toole, Jr. | Apr 2006 | B1 |
7039949 | Cartmell et al. | May 2006 | B2 |
7054930 | Cheriton | May 2006 | B1 |
7065767 | Kambhammettu et al. | Jun 2006 | B2 |
7069330 | McArdle et al. | Jun 2006 | B1 |
7082456 | Mani-Meitav et al. | Jul 2006 | B2 |
7093239 | van der Made | Aug 2006 | B1 |
7096500 | Roberts et al. | Aug 2006 | B2 |
7124409 | Davis et al. | Oct 2006 | B2 |
7139916 | Billingsley et al. | Nov 2006 | B2 |
7152148 | Williams et al. | Dec 2006 | B2 |
7159036 | Hinchliffe et al. | Jan 2007 | B2 |
7177267 | Oliver et al. | Feb 2007 | B2 |
7203864 | Goin et al. | Apr 2007 | B2 |
7251655 | Kaler et al. | Jul 2007 | B2 |
7290266 | Gladstone et al. | Oct 2007 | B2 |
7302558 | Campbell et al. | Nov 2007 | B2 |
7330849 | Gerasoulis et al. | Feb 2008 | B2 |
7340684 | Ramamoorthy et al. | Mar 2008 | B2 |
7346781 | Cowle et al. | Mar 2008 | B2 |
7349931 | Horne | Mar 2008 | B2 |
7350204 | Lambert et al. | Mar 2008 | B2 |
7353501 | Tang et al. | Apr 2008 | B2 |
7360097 | Rothstein | Apr 2008 | B2 |
7363022 | Whelan et al. | Apr 2008 | B2 |
7370360 | van der Made | May 2008 | B2 |
7385938 | Beckett et al. | Jun 2008 | B1 |
7406517 | Hunt et al. | Jul 2008 | B2 |
7441265 | Staamann et al. | Oct 2008 | B2 |
7463590 | Mualem et al. | Dec 2008 | B2 |
7464408 | Shah et al. | Dec 2008 | B1 |
7506155 | Stewart et al. | Mar 2009 | B1 |
7506170 | Finnegan | Mar 2009 | B2 |
7506364 | Vayman | Mar 2009 | B2 |
7546333 | Alon et al. | Jun 2009 | B2 |
7546594 | McGuire et al. | Jun 2009 | B2 |
7552479 | Conover et al. | Jun 2009 | B1 |
7577995 | Chebolu et al. | Aug 2009 | B2 |
7603552 | Sebes et al. | Oct 2009 | B1 |
7607170 | Chesla | Oct 2009 | B2 |
7657599 | Smith | Feb 2010 | B2 |
7669195 | Qumei | Feb 2010 | B1 |
7685632 | Vayman | Mar 2010 | B2 |
7685635 | Vega et al. | Mar 2010 | B2 |
7694150 | Kirby | Apr 2010 | B1 |
7698744 | Fanton et al. | Apr 2010 | B2 |
7703090 | Napier et al. | Apr 2010 | B2 |
7739497 | Fink et al. | Jun 2010 | B1 |
7757269 | Roy-Chowdhury et al. | Jul 2010 | B1 |
7765538 | Zweifel et al. | Jul 2010 | B2 |
7783735 | Sebes et al. | Aug 2010 | B1 |
7809704 | Surendran et al. | Oct 2010 | B2 |
7814554 | Ragner | Oct 2010 | B1 |
7818377 | Whitney et al. | Oct 2010 | B2 |
7823148 | Deshpande et al. | Oct 2010 | B2 |
7836504 | Ray et al. | Nov 2010 | B2 |
7840968 | Sharma et al. | Nov 2010 | B1 |
7849507 | Bloch et al. | Dec 2010 | B1 |
7853643 | Martinez et al. | Dec 2010 | B1 |
7856661 | Sebes et al. | Dec 2010 | B1 |
7865931 | Stone et al. | Jan 2011 | B1 |
7870387 | Bhargava et al. | Jan 2011 | B1 |
7873955 | Sebes | Jan 2011 | B1 |
7895573 | Bhargava et al. | Feb 2011 | B1 |
7908653 | Brickell et al. | Mar 2011 | B2 |
7925722 | Reed et al. | Apr 2011 | B1 |
7937455 | Saha et al. | May 2011 | B2 |
7950056 | Satish et al. | May 2011 | B1 |
7966659 | Wilkinson et al. | Jun 2011 | B1 |
7996836 | McCorkendale et al. | Aug 2011 | B1 |
8015388 | Rihan et al. | Sep 2011 | B1 |
8015563 | Araujo et al. | Sep 2011 | B2 |
8028340 | Sebes et al. | Sep 2011 | B2 |
8055904 | Cato et al. | Nov 2011 | B1 |
8136143 | Hannel et al. | Mar 2012 | B2 |
8166474 | Delco et al. | Apr 2012 | B1 |
8195931 | Sharma et al. | Jun 2012 | B1 |
8205188 | Ramamoorthy et al. | Jun 2012 | B2 |
8209680 | Le et al. | Jun 2012 | B1 |
8234709 | Viljoen et al. | Jul 2012 | B2 |
8234713 | Roy-Chowdhury et al. | Jul 2012 | B2 |
8307437 | Sebes et al. | Nov 2012 | B2 |
8321932 | Bhargava et al. | Nov 2012 | B2 |
8332929 | Bhargava et al. | Dec 2012 | B1 |
8352930 | Sebes et al. | Jan 2013 | B1 |
8381284 | Dang et al. | Feb 2013 | B2 |
8387046 | Montague et al. | Feb 2013 | B1 |
8515075 | Saraf et al. | Aug 2013 | B1 |
8539063 | Sharma et al. | Sep 2013 | B1 |
8544003 | Sawhney et al. | Sep 2013 | B1 |
8549003 | Bhargava et al. | Oct 2013 | B1 |
8549546 | Sharma et al. | Oct 2013 | B2 |
8555404 | Sebes et al. | Oct 2013 | B1 |
8561051 | Sebes et al. | Oct 2013 | B2 |
8561082 | Sharma et al. | Oct 2013 | B2 |
8584199 | Chen et al. | Nov 2013 | B1 |
8701182 | Bhargava et al. | Apr 2014 | B2 |
8707422 | Bhargava et al. | Apr 2014 | B2 |
8707446 | Roy-Chowdhury et al. | Apr 2014 | B2 |
8713668 | Cooper et al. | Apr 2014 | B2 |
8726391 | Zhong et al. | May 2014 | B1 |
8739272 | Cooper et al. | May 2014 | B1 |
8762928 | Sharma et al. | Jun 2014 | B2 |
8763118 | Sebes et al. | Jun 2014 | B2 |
8793489 | Polunin et al. | Jul 2014 | B2 |
8800024 | Cooper et al. | Aug 2014 | B2 |
8843903 | Blaser et al. | Sep 2014 | B1 |
8869265 | Dang et al. | Oct 2014 | B2 |
8875292 | Bogorad et al. | Oct 2014 | B1 |
8904520 | Nachenberg et al. | Dec 2014 | B1 |
8925101 | Bhargava et al. | Dec 2014 | B2 |
8938800 | Bhargava et al. | Jan 2015 | B2 |
8952101 | Sasajima et al. | Feb 2015 | B2 |
8973146 | Ramanan et al. | Mar 2015 | B2 |
9112830 | Cooper et al. | Aug 2015 | B2 |
9134998 | Roy-Chowdhury et al. | Sep 2015 | B2 |
9356909 | Cooper et al. | May 2016 | B2 |
9413785 | Cooper et al. | Aug 2016 | B2 |
9424154 | Bhargava et al. | Aug 2016 | B2 |
20020056076 | van der Made | May 2002 | A1 |
20020069367 | Tindal et al. | Jun 2002 | A1 |
20020083175 | Afek et al. | Jun 2002 | A1 |
20020099671 | Mastin et al. | Jul 2002 | A1 |
20020114319 | Liu et al. | Aug 2002 | A1 |
20020118644 | Moir | Aug 2002 | A1 |
20030014667 | Kolichtchak | Jan 2003 | A1 |
20030023736 | Abkemeier | Jan 2003 | A1 |
20030033510 | Dice | Feb 2003 | A1 |
20030061506 | Cooper et al. | Mar 2003 | A1 |
20030065945 | Lingafelt et al. | Apr 2003 | A1 |
20030073894 | Chiang et al. | Apr 2003 | A1 |
20030074552 | Olkin et al. | Apr 2003 | A1 |
20030088680 | Nachenberg | May 2003 | A1 |
20030115222 | Oashi et al. | Jun 2003 | A1 |
20030120601 | Ouye et al. | Jun 2003 | A1 |
20030120811 | Hanson et al. | Jun 2003 | A1 |
20030120935 | Teal et al. | Jun 2003 | A1 |
20030145232 | Poletto et al. | Jul 2003 | A1 |
20030163718 | Johnson et al. | Aug 2003 | A1 |
20030167292 | Ross | Sep 2003 | A1 |
20030167399 | Audebert et al. | Sep 2003 | A1 |
20030200332 | Gupta et al. | Oct 2003 | A1 |
20030212902 | van der Made | Nov 2003 | A1 |
20030220944 | Schottland et al. | Nov 2003 | A1 |
20030221190 | Deshpande et al. | Nov 2003 | A1 |
20040003258 | Billingsley et al. | Jan 2004 | A1 |
20040015554 | Wilson | Jan 2004 | A1 |
20040051736 | Daniell | Mar 2004 | A1 |
20040054928 | Hall | Mar 2004 | A1 |
20040057454 | Hennegan et al. | Mar 2004 | A1 |
20040088398 | Barlow | May 2004 | A1 |
20040139206 | Claudatos et al. | Jul 2004 | A1 |
20040143749 | Tajali et al. | Jul 2004 | A1 |
20040153650 | Hillmer | Aug 2004 | A1 |
20040167906 | Smith et al. | Aug 2004 | A1 |
20040172551 | Fielding et al. | Sep 2004 | A1 |
20040230963 | Rothman et al. | Nov 2004 | A1 |
20040243678 | Smith et al. | Dec 2004 | A1 |
20040255161 | Cavanaugh | Dec 2004 | A1 |
20040268149 | Aaron | Dec 2004 | A1 |
20050005006 | Chauffour et al. | Jan 2005 | A1 |
20050018651 | Yan et al. | Jan 2005 | A1 |
20050022014 | Shipman | Jan 2005 | A1 |
20050050336 | Liang et al. | Mar 2005 | A1 |
20050071633 | Rothstein | Mar 2005 | A1 |
20050081053 | Aston et al. | Apr 2005 | A1 |
20050086047 | Uchimoto et al. | Apr 2005 | A1 |
20050091321 | Daniell et al. | Apr 2005 | A1 |
20050091487 | Cross | Apr 2005 | A1 |
20050108516 | Balzer et al. | May 2005 | A1 |
20050108562 | Khazan et al. | May 2005 | A1 |
20050114672 | Duncan et al. | May 2005 | A1 |
20050132346 | Tsantilis | Jun 2005 | A1 |
20050198519 | Tamura et al. | Sep 2005 | A1 |
20050228990 | Kato et al. | Oct 2005 | A1 |
20050235360 | Pearson | Oct 2005 | A1 |
20050256907 | Novik et al. | Nov 2005 | A1 |
20050257207 | Blumfield et al. | Nov 2005 | A1 |
20050257265 | Cook et al. | Nov 2005 | A1 |
20050260996 | Groenendaal | Nov 2005 | A1 |
20050262558 | Usov | Nov 2005 | A1 |
20050273858 | Zadok et al. | Dec 2005 | A1 |
20050278784 | Gupta et al. | Dec 2005 | A1 |
20050283823 | Okajo et al. | Dec 2005 | A1 |
20050289538 | Black-Ziegelbein et al. | Dec 2005 | A1 |
20060004875 | Baron et al. | Jan 2006 | A1 |
20060015501 | Sanamrad et al. | Jan 2006 | A1 |
20060037016 | Saha et al. | Feb 2006 | A1 |
20060072451 | Ross | Apr 2006 | A1 |
20060075299 | Chandramouleeswaran et al. | Apr 2006 | A1 |
20060075478 | Hyndman et al. | Apr 2006 | A1 |
20060080656 | Cain et al. | Apr 2006 | A1 |
20060085785 | Garrett | Apr 2006 | A1 |
20060101277 | Meenan et al. | May 2006 | A1 |
20060133223 | Nakamura et al. | Jun 2006 | A1 |
20060136910 | Brickell et al. | Jun 2006 | A1 |
20060136911 | Robinson et al. | Jun 2006 | A1 |
20060143713 | Challener et al. | Jun 2006 | A1 |
20060195906 | Jin et al. | Aug 2006 | A1 |
20060200863 | Ray et al. | Sep 2006 | A1 |
20060230314 | Sanjar et al. | Oct 2006 | A1 |
20060236398 | Trakic et al. | Oct 2006 | A1 |
20060259734 | Sheu et al. | Nov 2006 | A1 |
20060277603 | Kelso et al. | Dec 2006 | A1 |
20070011746 | Malpani et al. | Jan 2007 | A1 |
20070028303 | Brennan | Feb 2007 | A1 |
20070033645 | Jones | Feb 2007 | A1 |
20070039049 | Kupferman et al. | Feb 2007 | A1 |
20070050579 | Hall et al. | Mar 2007 | A1 |
20070050764 | Traut | Mar 2007 | A1 |
20070074199 | Schoenberg | Mar 2007 | A1 |
20070083522 | Nord et al. | Apr 2007 | A1 |
20070101435 | Konanka et al. | May 2007 | A1 |
20070136579 | Levy et al. | Jun 2007 | A1 |
20070143851 | Nicodemus et al. | Jun 2007 | A1 |
20070157303 | Pankratov | Jul 2007 | A1 |
20070169079 | Keller et al. | Jul 2007 | A1 |
20070192329 | Croft et al. | Aug 2007 | A1 |
20070220061 | Tirosh et al. | Sep 2007 | A1 |
20070220507 | Back et al. | Sep 2007 | A1 |
20070232265 | Park et al. | Oct 2007 | A1 |
20070253430 | Minami et al. | Nov 2007 | A1 |
20070256138 | Gadea et al. | Nov 2007 | A1 |
20070271561 | Winner et al. | Nov 2007 | A1 |
20070297333 | Zuk et al. | Dec 2007 | A1 |
20070297396 | Eldar et al. | Dec 2007 | A1 |
20070300215 | Bardsley | Dec 2007 | A1 |
20080005737 | Saha et al. | Jan 2008 | A1 |
20080005798 | Ross | Jan 2008 | A1 |
20080010304 | Vempala et al. | Jan 2008 | A1 |
20080022384 | Yee et al. | Jan 2008 | A1 |
20080034416 | Kumar et al. | Feb 2008 | A1 |
20080034418 | Venkatraman et al. | Feb 2008 | A1 |
20080052468 | Speirs et al. | Feb 2008 | A1 |
20080059123 | Estberg et al. | Mar 2008 | A1 |
20080082662 | Dandliker et al. | Apr 2008 | A1 |
20080082977 | Araujo et al. | Apr 2008 | A1 |
20080086513 | O'Brien | Apr 2008 | A1 |
20080115012 | Jann et al. | May 2008 | A1 |
20080120499 | Zimmer et al. | May 2008 | A1 |
20080141371 | Bradicich et al. | Jun 2008 | A1 |
20080155336 | Joshi et al. | Jun 2008 | A1 |
20080163207 | Reumann et al. | Jul 2008 | A1 |
20080163210 | Bowman et al. | Jul 2008 | A1 |
20080165952 | Smith et al. | Jul 2008 | A1 |
20080184373 | Traut et al. | Jul 2008 | A1 |
20080235534 | Schunter et al. | Sep 2008 | A1 |
20080282080 | Hyndman et al. | Nov 2008 | A1 |
20080294703 | Craft et al. | Nov 2008 | A1 |
20080295173 | Tsvetanov | Nov 2008 | A1 |
20080301770 | Kinder | Dec 2008 | A1 |
20080307524 | Singh et al. | Dec 2008 | A1 |
20090007100 | Field et al. | Jan 2009 | A1 |
20090038017 | Durham et al. | Feb 2009 | A1 |
20090043993 | Ford et al. | Feb 2009 | A1 |
20090055693 | Budko et al. | Feb 2009 | A1 |
20090063665 | Bagepalli et al. | Mar 2009 | A1 |
20090113110 | Chen et al. | Apr 2009 | A1 |
20090144300 | Chatley et al. | Jun 2009 | A1 |
20090150639 | Ohata | Jun 2009 | A1 |
20090178110 | Higuchi | Jul 2009 | A1 |
20090220080 | Herne et al. | Sep 2009 | A1 |
20090249053 | Zimmer et al. | Oct 2009 | A1 |
20090249438 | Litvin et al. | Oct 2009 | A1 |
20090320010 | Chow et al. | Dec 2009 | A1 |
20090320133 | Viljoen et al. | Dec 2009 | A1 |
20090320140 | Sebes et al. | Dec 2009 | A1 |
20090328144 | Sherlock et al. | Dec 2009 | A1 |
20090328185 | van der Berg et al. | Dec 2009 | A1 |
20100049973 | Chen | Feb 2010 | A1 |
20100071035 | Budko et al. | Mar 2010 | A1 |
20100100970 | Chowdhury et al. | Apr 2010 | A1 |
20100114825 | Siddegowda | May 2010 | A1 |
20100138430 | Gotou | Jun 2010 | A1 |
20100188976 | Rahman et al. | Jul 2010 | A1 |
20100250895 | Adams et al. | Sep 2010 | A1 |
20100281133 | Brendel | Nov 2010 | A1 |
20100293225 | Sebes et al. | Nov 2010 | A1 |
20100299277 | Emelo et al. | Nov 2010 | A1 |
20100332910 | Ali et al. | Dec 2010 | A1 |
20110029772 | Fanton et al. | Feb 2011 | A1 |
20110035423 | Kobayashi et al. | Feb 2011 | A1 |
20110047542 | Dang et al. | Feb 2011 | A1 |
20110047543 | Mohinder | Feb 2011 | A1 |
20110061092 | Bailloeul et al. | Mar 2011 | A1 |
20110077948 | Sharma et al. | Mar 2011 | A1 |
20110078550 | Nabutovsky | Mar 2011 | A1 |
20110093842 | Sebes | Apr 2011 | A1 |
20110093950 | Bhargava et al. | Apr 2011 | A1 |
20110113467 | Agarwal et al. | May 2011 | A1 |
20110119760 | Sebes et al. | May 2011 | A1 |
20110138461 | Bhargava et al. | Jun 2011 | A1 |
20110246753 | Thomas | Oct 2011 | A1 |
20110302647 | Bhattacharya et al. | Dec 2011 | A1 |
20120030731 | Bhargava et al. | Feb 2012 | A1 |
20120030750 | Bhargava et al. | Feb 2012 | A1 |
20120110666 | Ogilvie | May 2012 | A1 |
20120159631 | Niemela et al. | Jun 2012 | A1 |
20120216271 | Cooper et al. | Aug 2012 | A1 |
20120233611 | Voccio | Sep 2012 | A1 |
20120278853 | Chowdhury et al. | Nov 2012 | A1 |
20120290827 | Bhargava et al. | Nov 2012 | A1 |
20120290828 | Bhargava et al. | Nov 2012 | A1 |
20120297176 | Bhargava et al. | Nov 2012 | A1 |
20130024934 | Sebes et al. | Jan 2013 | A1 |
20130091318 | Bhattacharjee et al. | Apr 2013 | A1 |
20130097355 | Dang et al. | Apr 2013 | A1 |
20130097356 | Dang et al. | Apr 2013 | A1 |
20130097658 | Cooper et al. | Apr 2013 | A1 |
20130097692 | Cooper et al. | Apr 2013 | A1 |
20130117823 | Dang et al. | May 2013 | A1 |
20130179971 | Harrison | Jul 2013 | A1 |
20130227683 | Bettini et al. | Aug 2013 | A1 |
20130246044 | Sharma et al. | Sep 2013 | A1 |
20130246393 | Saraf et al. | Sep 2013 | A1 |
20130246423 | Bhargava et al. | Sep 2013 | A1 |
20130246685 | Bhargava et al. | Sep 2013 | A1 |
20130247016 | Sharma et al. | Sep 2013 | A1 |
20130247027 | Shah et al. | Sep 2013 | A1 |
20130247032 | Bhargava et al. | Sep 2013 | A1 |
20130247181 | Saraf et al. | Sep 2013 | A1 |
20130247192 | Krasser et al. | Sep 2013 | A1 |
20130247201 | Alperovitch et al. | Sep 2013 | A1 |
20130247226 | Sebes et al. | Sep 2013 | A1 |
20130268994 | Cooper et al. | Oct 2013 | A1 |
20140090061 | Avasarala et al. | Mar 2014 | A1 |
20140189859 | Ramanan et al. | Jul 2014 | A1 |
20140237584 | Cooper et al. | Aug 2014 | A1 |
20140250492 | Cooper et al. | Sep 2014 | A1 |
20140283065 | Teddy et al. | Sep 2014 | A1 |
20140283066 | Teddy et al. | Sep 2014 | A1 |
20140317592 | Roy-Chowdhury et al. | Oct 2014 | A1 |
20140351895 | Bhargava et al. | Nov 2014 | A1 |
20150121449 | Chandan et al. | Apr 2015 | A1 |
20150180884 | Bhargava et al. | Jun 2015 | A1 |
20150180997 | Ramanan et al. | Jun 2015 | A1 |
20150200968 | Bhargava et al. | Jul 2015 | A1 |
20150365380 | Cooper et al. | Dec 2015 | A1 |
20160105444 | Roy-Chowdhury et al. | Apr 2016 | A1 |
Number | Date | Country |
---|---|---|
1383295 | Dec 2002 | CN |
101147379 | Mar 2008 | CN |
101218568 | Jul 2008 | CN |
101569129 | Oct 2009 | CN |
101636998 | Jan 2010 | CN |
103283202 | Sep 2013 | CN |
1 482 394 | Dec 2004 | EP |
2 037 657 | Mar 2009 | EP |
2599026 | Jun 2013 | EP |
2599276 | Jun 2013 | EP |
2004524598 | Aug 2004 | JP |
2004-078507 | Nov 2004 | JP |
2005-202523 | Jul 2005 | JP |
2005-275839 | Oct 2005 | JP |
2006-59217 | Mar 2006 | JP |
2006-270894 | May 2006 | JP |
2006-302292 | Nov 2006 | JP |
2007-500396 | Jan 2007 | JP |
2008-506303 | Feb 2008 | JP |
2008-217306 | Sep 2008 | JP |
2008-546060 | Dec 2008 | JP |
2009-510858 | Mar 2009 | JP |
2010-16834 | Jan 2010 | JP |
WO 9844404 | Oct 1998 | WO |
WO 0184285 | Nov 2001 | WO |
WO 2006012197 | Feb 2006 | WO |
WO 2006124832 | Nov 2006 | WO |
WO 2007016478 | Feb 2007 | WO |
WO 2008054997 | May 2008 | WO |
WO 2011003958 | Jan 2011 | WO |
WO 2011059877 | May 2011 | WO |
WO 2012015485 | Feb 2012 | WO |
WO 2012015489 | Feb 2012 | WO |
WO 2012116098 | Aug 2012 | WO |
WO 2013058940 | Apr 2013 | WO |
WO 2013058944 | Apr 2013 | WO |
WO 2014105308 | Jul 2014 | WO |
WO 2015060857 | Apr 2015 | WO |
Entry |
---|
International Search Report and Written Opinion, International Application No. PCT/US2012/057153, mailed Dec. 26, 2012, 8 pages. |
U.S. Appl. No. 13/437,900, filed Apr. 2, 2012, entitled “System and Method for Interlocking a Host and a Gateway,” Inventors: Geoffrey Howard Cooper, et al. |
Narten et al., RFC 4861, “Neighbor Discovery for IP version 6 (IPv6)”, Sep. 2007, retrieved from http://tools.ietf.org/html/rfc4861, 194 pages, Parts 1, 2 3. |
International Preliminary Report on Patentability, International Application No. PCT/US2012/026169, mailed Aug. 27, 2013, 8 pages. |
USPTO Aug. 14, 2013 Notice of Allowance from U.S. Appl. No. 13/540,448. |
USPTO Office Action received for U.S. Appl. No. 13/558,181, mailed on Aug. 7, 2013, 13 pages. |
USPTO Office Action received for U.S. Appl. No. 13/558,181, mailed on May 8, 2013, 13 pages. |
USPTO Office Action received for U.S. Appl. No. 13/558,227, mailed on Aug. 6, 2013, 13 pages. |
USPTO Office Action received for U.S. Appl. No. 13/558,227, mailed on May 8, 2013, 22 pages. |
USPTO Office Action received for U.S. Appl. No. 13/558,277, mailed on Oct. 3, 2013, 11 pages. |
USPTO Office Action received for U.S. Appl. No. 13/558,277, mailed on May 10, 2013, 22 pages. |
USPTO Office Action received for U.S. Appl. No. 12/291,232, mailed on Oct. 18, 2011, 17 pages. |
USPTO Office Action received for U.S. Appl. No. 12/291,232, mailed on Apr. 25, 2011, 23 pages. |
PCT Application Serial No. PCT/US13/66690, filed Oct. 24, 2013, entitled “Agent Assisted Malicious Application Blocking in a Network Environment,”, 67 pages. |
Patent Examination Report No. 1, Australian Application No. 2011283160, mailed Oct. 30, 2013. |
PCT Application Serial No. PCT/US13/71327, filed Nov. 21, 2013, entitled “Herd Based Scan Avoidance System in a Network Environment,”, 46 pages. |
USPTO Dec. 6, 2013 Notice of Allowance received for U.S. Appl. No. 13/558,181, 10 pages. |
USPTO Dec. 6, 2013 Notice of Allowance from U.S. Appl. No. 13/540,448, 7 pages. |
USPTO Dec. 16, 2013 Notice of Allowance received for U.S. Appl. No. 13/558,227, 10 pages. |
U.S. Appl. No. 14/127,395, entitled “Agent Assisted Malicious Application Blocking in a Network Environment,” filed Dec. 18, 2013, Inventors: Chandan CP et al. |
“Xen Architecture Overview,” Xen, dated Feb. 13, 2008, Version 1.2, http://wiki.xensource.com/xenwiki/XenArchitecture?action=AttachFile&do=get&target=Xen+architecture—Q1+2008.pdf, printed Aug. 18, 2009 (9 pages). |
Eli M. Dow, et al., “The Xen Hypervisor,” INFORMIT, dated Apr. 10, 2008, http://www.informit.com/articles/printerfriendly.aspx?p=1187966, printed Aug. 11, 2009 (13 pages). |
Desktop Management and Control, Website: http://www.vmware.com/solutions/desktop/, printed Oct. 12, 2009, 1 page. |
Secure Mobile Computing, Website: http://www.vmware.com/solutions/desktop/mobile.html, printed Oct. 12, 2009, 2 pages. |
Barrantes et al., “Randomized Instruction Set Emulation to Dispurt Binary Code Injection Attacks,” Oct. 27-31, 2003, ACM, pp. 281-289. |
Gaurav et al., “Countering Code-Injection Attacks with Instruction-Set Randomization,” Oct. 27-31, 2003, ACM, pp. 272-280. |
Check Point Software Technologies Ltd.: “ZoneAlarm Security Software User Guide Version 9”, Aug. 24, 2009, XP002634548, 259 pages, retrieved from Internet: URL:http://download.zonealarm.com/bin/media/pdf/zaclient91—user—manual.pdf. |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority (1 page), International Search Report (4 pages), and Written Opinion (3 pages), mailed Mar. 2, 2011, International Application No. PCT/US2010/055520. |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration (1 page), International Search Report (6 pages), and Written Opinion of the International Searching Authority (10 pages) for International Application No. PCT/US2011/020677 mailed Jul. 22, 2011. |
Notification of Transmittal of the International Search Report and Written Opinion of the International Searching Authority, or the Declaration (1 page), International Search Report (3 pages), and Written Opinion of the International Search Authority (6 pages) for International Application No. PCT/US2011/024869 mailed Jul. 14, 2011. |
Tal Garfinkel, et al., “Terra: A Virtual Machine-Based Platform for Trusted Computing,” XP-002340992, SOSP'03, Oct. 19-22, 2003, 14 pages. |
IA-32 Intel® Architecture Software Developer's Manual, vol. 3B; Jun. 2006; pp. 13, 15, 22 and 145-146. |
Notification of International Preliminary Report on Patentability and Written Opinion mailed May 24, 2012 for International Application No. PCT/US2010/055520, 5 pages. |
Sailer et al., sHype: Secure Hypervisor Approach to Trusted Virtualized Systems, IBM research Report, Feb. 2, 2005, 13 pages. |
Kurt Gutzmann, “Access Control and Session Management in the HTTP Environment,” Jan./Feb. 2001, pp. 26-35, IEEE Internet Computing. |
Myung-Sup Kim et al., “A load cluster management system using SNMP and web”, [Online], May 2002, pp. 367-378, [Retrieved from Internet on Oct. 24, 2012], <http://onlinelibrary.wiley.com/doi/10.1002/nem.453/pdf>. |
G. Pruett et al., “BladeCenter systems management software”, [Online], Nov. 2005, pp. 963-975, [Retrieved from Internet on Oct. 24, 2012], <http://citeseerx.lst.psu.edu/viewdoc/download?doi=10.1.1.91.5091&rep=rep1&type=pdf>. |
Philip M. Papadopoulos et al., “NPACI Rocks: tools and techniques for easily deploying manageable Linux clusters” [Online], Aug. 2002, pp. 707-725, [Retrieved from internet on Oct. 24, 2012], <http://onlinelibrary.wiley.com/doi/10.1002/cpe.722/pdf>. |
Thomas Staub et al., “Secure Remote Management and Software Distribution for Wireless Mesh Networks”, [Online], Sep. 2007, pp. 1-8, [Retrieved from Internet on Oct. 24, 2012], <http://cds.unibe.ch/research/pub—files/B07.pdf>. |
“What's New: McAfee VirusScan Enterprise, 8.8,” copyright 2010, retrieved on Nov. 23, 2012 at https://kc.mcafee.com/resources/sites/MCAFEE/content/live/PRODUCT—DOCUMENTATION/22000/PD22973/en—US/VSE%208.8%20-%20What's%20New.pdf, 4 pages. |
“McAfee Management for Optimized Virtual Environments,” copyright 2012, retrieved on Nov. 26, 2012 at AntiVirushttp://www.mcafee.com/us/resources/data-sheets/ds-move-anti-virus.pdf, 2 pages. |
Rivest, R., “The MD5 Message-Digest Algorithm”, RFC 1321, Apr. 1992, retrieved on Dec. 14, 2012 from http://www.ietf.org/rfc/rfc1321.txt, 21 pages. |
Hinden, R. and B. Haberman, “Unique Local IPv6 Unicast Addresses”, RFC 4193, Oct. 2005, retrieved on Nov. 20, 2012 from http://tools.ietf.org/pdf/rfc4193.pdf, 17 pages. |
“Secure Hash Standard (SHS)”, Federal Information Processing Standards Publication, FIPS PUB 180-4, Mar. 2012, retrieved on Dec. 14, 2012 from http://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf, 35 pages. |
U.S. Appl. No. 13/728,705, filed Dec. 27, 2012, entitled “Herd Based Scan Avoidance System in a Network Environment,” Inventors Venkata Ramanan, et al. |
An Analysis of Address Space Layout Randomization on Windows Vista™, Symantec Advanced Threat Research, copyright 2007 Symantec Corporation, available at http://www.symantec.com/avcenter/reference/Address—Space—Layout—Randomization.pdf, 19 pages. |
Bhatkar, et al., “Efficient Techniques for Comprehensive Protection from Memory Error Exploits,” USENIX Association, 14th USENIX Security Symposium, Aug. 1-5, 2005, Baltimore, MD, 16 pages. |
Dewan, et al., “A Hypervisor-Based System for Protecting Software Runtime Memory and Persistent Storage,” Spring Simulation Multiconference 2008, Apr. 14-17, 2008, Ottawa, Canada, (available at website: www.vodun.org/papers/2008—secure—locker—submit—v1-1.pdf, printed Oct. 11, 2011), 8 pages. |
Shacham, et al., “On the Effectiveness of Address-Space Randomization,” CCS'04, Oct. 25-29, 2004, Washington, D.C., Copyright 2004, 10 pages. |
International Search Report and Written Opinion mailed Dec. 14, 2012 for International Application No. PCT/US2012/055674, 9 pages. |
International Preliminary Report on Patentability and Written Opinion issued Jan. 29, 2013 for International Application No. PCT/US2011/020677 (9 pages). |
international Preliminary Report on Patentability and Written Opinion issued Jan. 29, 2013 for International Application No. PCT/US2011/024869 (6 pages). |
Datagram Transport Layer Security Request for Comments 4347, E. Rescorla, et al., Stanford University, Apr. 2006, retrieved and printed on Oct. 17, 2011 from http://tools.ietf.org/pdf/rfc4347.pdf, 26 pages. |
Internet Control Message Protocol Request for Comments 792, J. Postel, ISI, Sep. 1981, retrieved and printed on Oct. 17, 2011 from http://tools.ietf.org/html/rfc792, 22 pages. |
Mathew J. Schwartz, “Palo Alto Introduces Security for Cloud, Mobile Users,” retrieved Feb. 9, 2011 from http://www.informationweek.com/news/security/perimeter/showArticle.jhtml?articleID-22, 4 pages. |
Requirements for IV Version 4 Routers Request for Comments 1812, F. Baker, Cisco Systems, Jun. 1995, retrieved and printed on Oct. 17, 2011 from http://tools.ietf.org/pdf/rfc1812.pdf, 176 pages. |
The Keyed-Hash Message Authentication Code (HMAC), FIPS PUB 198, Issued Mar. 6, 2002, Federal Information Processing Standards Publication, retrieved and printed on Oct. 17, 2011 from http://csrc.nist.gov/publications/fips/fips198/fips-198a.pdf, 20 pages. |
Zhen Chen et al., “Application Level Network Access Control System Based on TNC Architecture for Enterprise Network,” In: Wireless communications Networking and Information Security (WCNIS), 2010 IEEE International Conference, Jun. 25-27, 2010 (5 pages). |
International Search Report and Written Opinion, International Application No. PCT/US2012/026169, mailed Jun. 18, 2012, 11 pages. |
International Search Report and Written Opinion, International Application No. PCT/US2012/057312, mailed Jan. 31, 2013, 10 pages. |
USPTO Office Action received for U.S. Appl. No. 13/540,448, mailed on Apr. 10, 2013, 20 pages. |
Patent Examination Report No. 1, Australian Application No. 2011283164, mailed Jan. 14, 2014, 6 pages. |
International Search Report and Written Opinion, International Application No. PCT/US2013/071327, mailed Mar. 7, 2014, 12 pages. |
International Preliminary Report on Patentability in International Application No. PCT/US2012/057312, mailed Apr. 22, 2014, 5 pages. |
International Preliminary Report on Patentability in International Application No. PCT/US2012/057153, mailed Apr. 22, 2014, 4 pages. |
USPTO Feb. 21, 2014 Nonfinal Office Action from U.S. Appl. No. 13/229,502, 22 pages. |
“Optical stateful security filtering approach based on code words,” Sliti, M.; Boudriga, N., 2013 IEEE Symposium on Computers and Communications (ISCC), 10 pages. |
Rothenberg, et al., “A Review of Policy-Based Resource and Admission Control Functions in Evolving Access and Next Generation Networks,” Journal of Network and Systems Management, 16.1 (2008) 14-45, 32 pages. |
USPTO Sep. 10, 2014 Final Office Action from U.S. Appl. No. 13/229,502, 18 pages. |
USPTO Oct. 2, 2014 Nonfinal Rejection from U.S. Appl. No. 14/257,770, 8 pages. |
Muttik, Igor, and Chris Barton, “Cloud security technologies,” Information security technical report 14.1 (2009), 1-6, 6 pages. |
USPTO Nonfinal Rejection received for U.S. Appl. No. 12/291,232, mailed on Jan. 14, 2015, 45 pages. |
USPTO Feb. 12, 2015 Final Rejection from U.S. Appl. No. 14/257,770, 6 pages. |
Baba, Tatsuya, et al., “A Proposal of an Integrated Worm Countermeasure System Based on Dynamic VLAN Control,” Journal of Information Processing Society of Japan, Japan, Information Processing Society of Japan, Aug. 15, 2006, vol. 47, No. 8, pp. 2449-2511, 14 pages, English language Abstract only. |
Fujita, Keisuke, et al., “Proposal of DF system with boot control function against unauthorized programs,” Transactions of Computer Security Symposium 2007, Japan, Information Processing Society of Japan, Oct. 31, 2007, vol. 2007, No. 10, pp. 501-506, 7 pages, English language Abstract only. |
Ashiwa, Takashi, “IT Keyword too late to ask: Bot,” Nikkei Computer, Japan, Nikkei Business Publications, Oct. 30, 2006, No. 664, pp. 244-249, 7 pages [no English language translation]. |
USPTO Apr. 28, 2015 Notice of Allowance from U.S. Appl. No. 14/257,770, 8 pages. |
Cheneau, Tony, et al., “Significantly improved performances of the cryptographically generated addresses thanks to ECC and GPGPU,” Computers & Security, vol. 29, No. 4, Jun. 2010, pp. 419-431, 13 pages. |
USPTO Jul. 20, 2015 Nonfinal Rejection from U.S. Appl. No. 14/251,009, 40 pages. |
USPTO Final Rejection received for U.S. Appl. No. 12/291,232, mailed on Aug. 5, 2015, 25 pages. |
USPTO Aug. 21, 2015 Notice of Allowance from U.S. Appl. No. 13/229,502, 22 pages. |
U.S. Appl. No. 14/848,522, entitled “Enforcing Alignment of Approved Changes and Deployed Changes in the Software Change Life-Cycle,” filed Sep. 9, 2015, Inventors: Rahul Roy-Chowdhury et al. 41 pages. |
U.S. Appl. No. 12/946,344, filed Nov. 15, 2010. |
U.S. Appl. No. 11/060,683, filed Feb. 16, 2005, now abandoned. |
U.S. Appl. No. 13/558,277, filed Jul. 25, 2012, now abandoned. |
U.S. Appl. No. 14/848,522, filed Sep. 9, 2015. |
U.S. Appl. No. 14/251,009, filed Apr. 11, 2014. |
U.S. Appl. No. 12/291,232, filed Nov. 7, 2008. |
U.S. Appl. No. 14/583,509, filed Dec. 26, 2014. |
U.S. Appl. No. 14/599,811, filed Jan. 19, 2015. |
U.S. Appl. No. 13/229,502, filed Sep. 9, 2011. |
U.S. Appl. No. 14/827,396, filed Aug. 17, 2015. |
U.S. Appl. No. 14/263,164, filed Apr. 25, 2014. |
U.S. Appl. No. 14/277,954, filed May 15, 2014. |
U.S. Appl. No. 14/635,096, filed Mar. 2, 2015. |
U.S. Appl. No. 14/127,395, filed Dec. 18, 2013. |
USPTO Nov. 10, 2015 Final Rejection from U.S. Appl. No. 14/251,009, 13 pages. |
USPTO Mar. 15, 2016 Nonfinal Rejection from U.S. Appl. No. 14/251,009, 30 pages. |
USPTO Apr. 11, 2016 Notice of Allowance from U.S. Appl. No. 12/291,232, 14 pages. |
USPTO Jun. 2, 2016 Nonfinal Rejection from U.S. Appl. No. 14/848,522, 10 pages. |
USPTO Jun. 24, 2016 Final Rejection from U.S. Appl. No. 14/251,009, 16 pages. |
USPTO Sep. 30, 2016 Advisory Action from U.S. Appl. No. 14/251,009, 5 pages. |
Number | Date | Country | |
---|---|---|---|
20140101783 A1 | Apr 2014 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13022148 | Feb 2011 | US |
Child | 14045208 | US | |
Parent | 11277596 | Mar 2006 | US |
Child | 13022148 | US |