1. The Field of the Invention
The present invention relates generally to information management services. More specifically, the present invention relates to methods and systems for classifying the environment components of a computer system for use in assigning service areas and service level objectives to data objects residing within the computer system.
2. The Relevant Technology
Modern computer systems allow for the interchange of data and resources through network environments. For example, a modern computer network may include a number of interconnected client computers. The computer network may further include resources. Such resources may be, for example and not limited to, file servers for storing data accessible by the clients, print servers for providing access to printers to the clients, and shared stores on client computers for storing data to be made available to other clients and resources on the network.
In this society where many personal and business interactions are data driven, the ability to provide protection, retention, recovery, security, and other services to data have become important features of computer networks. Establishing a system to provide these services can be costly, both in terms of the equipment and applications necessary to perform the services and particularly in terms of the time required to configure and manage the system. As the amount of data stored by a system increases and the storage systems become more complex, the ability to customize the services provided to each data file is of greater importance.
The subject matter claimed herein is not limited to embodiments that solve any disadvantages or that operate only in environments such as those described above. Rather, this background is only provided to illustrate one exemplary technology area where some embodiments described herein may be practiced.
To further clarify the features of the present invention, a more particular description of the invention will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. It is appreciated that these drawings depict only typical embodiments of the invention and are therefore not to be considered limiting of its scope. The invention will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:
In the following detailed description of the preferred embodiments, reference is made to the accompanying drawings which form a part hereof, and in which are shown by way of illustration specific embodiments in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.
Embodiments of the present invention relate to methods and systems for classifying environment components within a computer system. The computer system includes an information management service for defining services to be provided to data objects residing in the computer system. One exemplary method identifies environment components, such as servers, storage locations, databases, applications, and the like, within the computer system. The service level capabilities of each of the environment components are then identified. The service level capabilities may describe, for example, the service areas and service levels that each of the environment components is able to provide to data objects within the computer system. The environment components are then classified in accordance with their identified service level capabilities. By categorizing the environment components in accordance with their service level capabilities, the service requests of data objects residing in the system can efficiently be matched to the environment components that are capable of providing the requested services.
As used herein, the terms “data” and “data object” may include, but are not limited to, files, directories (e.g., volumes, file systems, and the like), user data, system data, applications, services, operating systems, instructions, and the like, that can be stored on one or more storage devices of a computer. Backing up or recovering the data may include backing up or recovering any of the data herein defined or understood by those of skill in the art. Data may be organized in logical directories that do not necessarily correspond to a particular storage device. The term “directory” can be used interchangeably with the term “volume” or “file system” to refer to any means of logically organizing data on a computer.
Certain embodiments described herein will involve electronic communication between a client computer system (hereinafter referred to as a “client”) requesting access to a network service at a server computer system (hereinafter referred to as a “server”). Accordingly, the client sends a request to the server for particular access to its system resources, wherein if the client is authorized and validated, the server responds with a response message providing the desired information. Of course, other messaging patterns between client and server are available, as are well known in the art.
It should be appreciated that the present invention can be implemented in numerous ways, including as a process, an apparatus, a system, a device, a method, or a computer readable medium such as a computer-readable storage medium or a computer network wherein program instructions are sent over optical or electronic communication links. A general purpose computer system such as an Intel-based processor running Microsoft Windows or Linux may be used, or a specialized appliance may be used.
Referring now to
The environment components 110, 114, and 118 may provide a variety of services to the computer system 100 and to the data residing therein. For example, the server 110 may act as a storage server, retention server, data migration server, backup server, recovery server, data protection server, and the like or any combination thereof. The database 114, for example, may act as an exchange database, a payroll database, and the like or any combination thereof. The application 118 may include, for example, a data indexer, a data miner, a data transport, a security application, and the like or any combination thereof.
A large variety of data objects may be stored within the computer system 100. The data objects stored within the computer system 100 may have a variety of service level objectives. The service level objectives requested by a data object may be characterized by set of a service areas and a set of service levels. Service areas include generalized areas of service that may be performed on a data object, including data protection (e.g., frequency of backup, redundancy of data, and the like), data retention, data security (e.g., encryption, access control, and the like), data migration, data indexing, and the like. Service levels define the extent at which a service area is provided to the data object. For example, a service area may include data backup. Data backup may include various service levels, including an hourly backup, a daily backup, a weekly backup, a monthly backup, and the like.
The services required by each of the data objects may be imposed by the system administrator, governmental standards and regulations, company guidelines, and the like or any combination thereof. A single data object typically requires multiple services from more than one service area. The combination of services requested by a single data object is referred to herein as a “target service package.”
A large computer system, such as an enterprise network, may include a large variety of data objects having various unique properties. Consequently, the data objects within a computer system may also request many different service level objectives. By way of example, certain data objects must be retained for one year, while other types of data objects must be retained indefinitely. Likewise, certain data objects must be indexed, while indexing is not necessary or may be overly expensive or may waste valuable resources when performed for other types of data objects. In addition, certain data objects must be saved to a backup location at least once per day, while other types of data objects only need to be saved to the backup location once every week. Within a company or enterprise network, documents created by one division within the company may require a higher level of service than documents created by another division within the company. Furthermore, documents containing predefined words, phrases, or data patterns may require higher levels of service than other types of documents. Other examples of differing service areas and differing service levels required by data within the system will also be evident to one of ordinary skill in the art.
In order to efficiently determine the service level objectives of each data object residing in the computer system 100, the data objects may be classified using the information classification module 122. In general, the information classification module 122 may perform an automated classification process, which may classify the data objects in accordance with a predefined set of rules. The data objects may be classified based on a number of factors, including the content contained within each data object, the organization, group or individual that created the data object, the metadata associated with each data object, and the like and any combination thereof. The metadata may be used to determine the date of last use of the data object, owner of the data object, date of creation, file size, file type, disposition date, content of the object, and the like.
Once the data objects within the computer system 100 are classified using the information classification module 122, it is necessary to match the service level objectives of each data object to a service provider (i.e., environment component 110, 114, or 118) that is capable of providing those services level objectives. However, environment components 110, 114, or 118 are often limited as to the service areas and service levels that they are capable of providing. For example, the server 110 may be capable of providing a low level of security services for certain data files that do not require a high level of security, but the server 110 may be incapable of providing high level security services to highly confidential files. Therefore, it may be advantageous to classify the environment components in accordance with the service areas and service levels that each environment component is capable of providing.
Classifying the environment of the computer system 100 may be performed by the environment discovery and classification module 104 as a two step process. First, the system environment is discovered, and second, the discovered environment components are classified in accordance with their service level capabilities. In general, the environment discovery module 106 may create a detailed diagram of each environment component 110, 114, 118 contained within the computer system 100, as well as the manner in which each environment component interfaces with the other environment components and subsystems within the computer system 100. In order to create a detailed diagram, the environment discovery module 104 may rely on adapters 112, 116, and 120 that are specifically configured to communicate with and gather information from specific environment components 110, 114, and 118, respectively.
The environment discovery process may be performed, for example, by searching all IP addresses on the network in order to discover the environment components 110, 114, and 118 that are located on the network 124, analyzing the specific details of each of the environment components, for example, by employing the adapters 112, 116, 120, and determining the service areas and service level capabilities of each of the environment components by analyzing the settings and properties of the environment components.
In order to classify the environment components 110, 114 and 118, the environment classification module 108 first identifies the environment components compiled by the environment discovery module 106. The environment classification module 108 analyzes the system environment data 106 in order to identify the service level capabilities of the environment components 110, 114 and 118. As described previously, the service level capabilities include the service areas and service levels that each of the environment components 110, 114 and 118 is able to provide to the data objects and other environment components located within the computer system 100.
The environment classification module 108 can then classify the environment components based on their service level capabilities. In one embodiment, the classification procedure includes generating a detailed list of all service areas and service levels that each of the environment components 110, 114 and 118 is capable of performing. In another embodiment, the classification procedure includes assigning a generic descriptor to each environment component 110, 114 and 118 for classifying the environment in accordance with the service areas and service levels that can be provided. For example, storage servers may generically be classified as “tier 1 storage”, “tier 2 storage”, and the like, in accordance with the quality and type of storage that the storage server is capable of providing. Tier 1 storage servers may include high-speed reliable storage devices, while lower tiered storage servers may include slower storage devices that may have lower redundancy and reliability and are less costly than the high-speed devices.
In one embodiment, the environment classification module 109 uses a predefined set of rules when classifying the environment components 110, 114 and 118. The set of rules can be applied to the discovered system environment data in order to efficiently and automatically classify the environment components 110, 114 and 118 in accordance with their service level capabilities.
In one embodiment, the environment classification module 108 analyses the metadata affiliated with each environment component 110, 114 and 118 while performing environment classification. The metadata associated with each environment component 110, 114 and 118 may identify features of the environment such as the name and version number of the environment component, a system identifier, service level capabilities, and the like and combinations thereof.
In one embodiment, the environment classification module 108 may generate metadata for each of the environment components for describing the manner in which they were classified. The creation of the metadata can be done manually, by the user, or automatically through various programmatic methods, or some combination of manual and automatic methods. The generated metadata may be stored as environment classification data 109. The generated metadata can be accessed at a later time, for example, when the service level objectives of each data object are matched to the environment components that are capable of providing the service level objectives.
In one embodiment, environment components are classified based on the service areas and service levels that the applications are capable of providing. For example, a first backup server may provide a particular class of information protection service, such as daily backups, and a second backup server may provide a different class of information protection service, such as continuous data protection (CDP).
In another embodiment, storage locations are classified based on the service levels that can be provided to the data objects stored at each of the storage locations. In some instances, the services that can be provided to data objects are location-dependant. In other words, the services that are available in a computer system can often only be performed if a data object is located at a specific location. For example, a computer system may include three primary storage locations. The computer system may further include a data indexer that is only capable of indexing data that is located on two of the three primary storage locations. Therefore, when the three primary storage locations are categorized, the categorization will be performed in accordance with whether the data objects stored at the primary storage locations can be indexed by the data indexer, among other factors.
In another embodiment, storage locations are classified based on the data protection services that the storage location requires in order to provide sufficient protection to the data objects it contains. For example, a first storage location containing data of high importance may be classified such that a snapshot engine will perform a snapshot backup of the storage location once every hour, while a second storage location containing data of low importance may be classified such that the snapshot engine will only perform a snapshot backup once every week.
In another embodiment, environment components are classified based on the locations within the computer system that the service applications are capable of providing services to. For example, continuing with the above example where a computer system includes three primary storage locations and a data indexer that is only capable of indexing data that is located on two of the three primary storage locations, the ability to provide services to two of the three primary storage locations will be taken into consideration when classifying the data indexer application.
In one embodiment, the adapters 112, 116 and 120 are further utilized by the environment classification module 108 in order to gather additional information that may be relevant to the classification of the environment components 110, 114 and 118. As described previously, each adapter 112, 116 and 120 may be customized for communicating with and gathering information from each of the environment components 110, 114 and 118.
The data objects (i.e., files 1-8) have also been organized in accordance with the combination of service level objectives requested by each file. The combination of service level objectives is referred to herein as a “target service package.” For example, “Target Service Package 1” 212 may include files that require hourly backup, data indexing, and seven year retention. “Target Service Package 2” 214 may include files that require weekly backup, one year retention, and a high level of security. “Target Service Package 3” 216 may include files that require protection using CDP technology.
In order for the files 1-8 to obtain their requested services as defined by the target service packages 212, 214 and 216, a mapping procedure 218 takes place that matches the service level objectives of the files to the appropriate environment components that are capable of providing those services. In the absence of environment classification 202 and information classification 210, the process of mapping 218 the files to the appropriate environment components could be a tedious process that involves comparing the service needs of each individual file to each individual environment component to determine if the environment component could provide the services needed by the individual files. This process could become particularly complex when considering that each individual file may have multiple service needs.
However, because each of the files have previously been categorized into target service packages 212, 214 and 216, and because each of the environment components have previously been categorized into classes 204, 206 and 208, as described herein, the process of mapping 218 the service level objectives of each of the files to the appropriate environment components becomes much more efficient. When mapping 218 using the environment and information classification described herein, the mapping function can automatically match the files belonging to a target service package 204, 206 or 208 to an environment component belonging to an environment class 204, 206 or 208 that is known to provide the appropriate target service package.
The method 300 then identifies 304 service level capabilities of each of the environment components. The service level capabilities may describe, for example, the service areas and service levels that each of the environment components is able to provide to data objects within the computer system. The identification of service level capabilities may be accomplished, for example, by accessing metadata associated with each of the environment components.
The method 300 then classifies 306 each of the environment components in accordance with their identified service level capabilities. In one embodiment, a predefined set of rules is applied to the environment components in order to place each of the environment components into an appropriate category. By categorizing the environment components, the service requests of data objects residing in the system can efficiently be matched to the environment components that are capable of providing the requested services.
Referring now to
The method 400 includes identifying 402 environment components within a computer system. The method 400 further identifies 404 service level capabilities of each of the environment components. As explained previously, the service level capabilities may describe the service areas and service levels that each of the environment components is able to provide to data objects within the computer system. The method 400 also identifies 406 a rule set that has been provided for classifying the environment components.
The rule set is applied 408 to the environment components in order to classify each of the environment components in accordance with their identified service level capabilities. The classification of the environment components is performed so that the service requests of each data object residing in the computer system can be efficiently matched to the appropriate environment component.
Embodiments herein may comprise a special purpose or general-purpose computer including various computer hardware. Embodiments may also include computer-readable media for carrying or having computer-executable instructions or data structures stored thereon. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a computer-readable medium. Thus, any such connection is properly termed a computer-readable medium. Combinations of the above should also be included within the scope of computer-readable media.
Computer-executable instructions comprise, for example, instructions and data which cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
The present invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.
This application claims the benefit of: U.S. Provisional Application Ser. No. 60/826,072, filed Sep. 18, 2006 and entitled “INFORMATION MANAGEMENT”;U.S. Provisional Application Ser. No. 60/826,073, filed Sep. 18, 2006 and entitled “CASCADED DISCOVERY OF INFORMATION ENVIRONMENT”;U.S. Provisional Application Ser. No. 60/826,053, filed Sep. 18, 2006, entitled “ENVIRONMENT CLASSIFICATION”;U.S. Provisional Application Ser. No. 60/826,074, filed Sep. 18, 2006 and entitled “INFORMATION CLASSIFICATION”; andU.S. Provisional Application No. 60/826,042, filed Sep. 18, 2006, entitled “SERVICE LEVEL MAPPING METHOD”;which applications are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
5678044 | Pastilha et al. | Oct 1997 | A |
6003040 | Mital et al. | Dec 1999 | A |
6167445 | Gai et al. | Dec 2000 | A |
6308216 | Goldszmidt et al. | Oct 2001 | B1 |
6349297 | Shaw et al. | Feb 2002 | B1 |
6363053 | Schuster et al. | Mar 2002 | B1 |
6430613 | Brunet et al. | Aug 2002 | B1 |
6591300 | Yurkovic | Jul 2003 | B1 |
6633312 | Rochford et al. | Oct 2003 | B1 |
6862594 | Saulpaugh et al. | Mar 2005 | B1 |
6865728 | Branson et al. | Mar 2005 | B1 |
6970869 | Slaughter et al. | Nov 2005 | B1 |
7028312 | Merrick et al. | Apr 2006 | B1 |
7185073 | Gai et al. | Feb 2007 | B1 |
7240076 | McCauley et al. | Jul 2007 | B2 |
7278156 | Mei et al. | Oct 2007 | B2 |
7412518 | Duigou et al. | Aug 2008 | B1 |
7433304 | Galloway et al. | Oct 2008 | B1 |
7543020 | Walker et al. | Jun 2009 | B2 |
7548915 | Ramer et al. | Jun 2009 | B2 |
7565324 | Vincent | Jul 2009 | B2 |
7580357 | Chang et al. | Aug 2009 | B2 |
7613806 | Wright et al. | Nov 2009 | B2 |
7616642 | Anke et al. | Nov 2009 | B2 |
7676798 | Snover et al. | Mar 2010 | B2 |
7720950 | Joanovic et al. | May 2010 | B2 |
7725570 | Lewis | May 2010 | B1 |
7725571 | Lewis | May 2010 | B1 |
7730172 | Lewis | Jun 2010 | B1 |
7734765 | Musman et al. | Jun 2010 | B2 |
7739239 | Cormie et al. | Jun 2010 | B1 |
7895220 | Evans et al. | Feb 2011 | B2 |
7953740 | Vadon et al. | May 2011 | B1 |
8069435 | Lai | Nov 2011 | B1 |
8104080 | Burns et al. | Jan 2012 | B2 |
8548964 | Nair et al. | Oct 2013 | B1 |
8620724 | Adhiraju et al. | Dec 2013 | B2 |
20020016800 | Spivak et al. | Feb 2002 | A1 |
20020038307 | Obradovic et al. | Mar 2002 | A1 |
20020091746 | Umberger et al. | Jul 2002 | A1 |
20020109713 | Carchidi et al. | Aug 2002 | A1 |
20020120685 | Srivastava et al. | Aug 2002 | A1 |
20020161883 | Matheny et al. | Oct 2002 | A1 |
20030023712 | Zhao et al. | Jan 2003 | A1 |
20030036886 | Stone | Feb 2003 | A1 |
20030041050 | Smith et al. | Feb 2003 | A1 |
20030140009 | Namba et al. | Jul 2003 | A1 |
20030167180 | Chung et al. | Sep 2003 | A1 |
20030196108 | Kung | Oct 2003 | A1 |
20030225829 | Pena et al. | Dec 2003 | A1 |
20030233464 | Walpole et al. | Dec 2003 | A1 |
20030236904 | Walpole et al. | Dec 2003 | A1 |
20040060002 | Lucovsky et al. | Mar 2004 | A1 |
20040098415 | Bone et al. | May 2004 | A1 |
20040133876 | Sproule | Jul 2004 | A1 |
20040210601 | Takayama | Oct 2004 | A1 |
20040236660 | Thomas et al. | Nov 2004 | A1 |
20040243699 | Koclanes et al. | Dec 2004 | A1 |
20050060662 | Soares et al. | Mar 2005 | A1 |
20050102297 | Lloyd et al. | May 2005 | A1 |
20050131982 | Yamasaki et al. | Jun 2005 | A1 |
20050132034 | Iglesia et al. | Jun 2005 | A1 |
20050177545 | Buco et al. | Aug 2005 | A1 |
20050235342 | Ene-Pietrosanu et al. | Oct 2005 | A1 |
20050251533 | Harken et al. | Nov 2005 | A1 |
20050273451 | Clark et al. | Dec 2005 | A1 |
20050289216 | Myka et al. | Dec 2005 | A1 |
20060015388 | Flockhart et al. | Jan 2006 | A1 |
20060036463 | Patrick et al. | Feb 2006 | A1 |
20060039364 | Wright | Feb 2006 | A1 |
20060092861 | Corday et al. | May 2006 | A1 |
20060095543 | Ito et al. | May 2006 | A1 |
20060095570 | O'Sullivan | May 2006 | A1 |
20060106782 | Blumenau et al. | May 2006 | A1 |
20060112108 | Eklund et al. | May 2006 | A1 |
20060114832 | Hamilton et al. | Jun 2006 | A1 |
20060123030 | Musteata et al. | Jun 2006 | A1 |
20060129415 | Thukral et al. | Jun 2006 | A1 |
20060129974 | Brendle et al. | Jun 2006 | A1 |
20060179143 | Walker et al. | Aug 2006 | A1 |
20060248165 | Sridhar et al. | Nov 2006 | A1 |
20060248187 | Thorpe et al. | Nov 2006 | A1 |
20070038683 | Dixon et al. | Feb 2007 | A1 |
20070055689 | Rhoads et al. | Mar 2007 | A1 |
20070058632 | Back et al. | Mar 2007 | A1 |
20070061363 | Ramer et al. | Mar 2007 | A1 |
20070070894 | Wang et al. | Mar 2007 | A1 |
20070083875 | Jennings | Apr 2007 | A1 |
20070094392 | Stone et al. | Apr 2007 | A1 |
20070103984 | Kavuri et al. | May 2007 | A1 |
20070104208 | Svensson | May 2007 | A1 |
20070127370 | Chang et al. | Jun 2007 | A1 |
20070153802 | Anke et al. | Jul 2007 | A1 |
20070162749 | Lim | Jul 2007 | A1 |
20070192352 | Levy | Aug 2007 | A1 |
20070208751 | Cowan et al. | Sep 2007 | A1 |
20070214208 | Balachandran | Sep 2007 | A1 |
20070260640 | Hamilton et al. | Nov 2007 | A1 |
20070294406 | Suer et al. | Dec 2007 | A1 |
20070299828 | Lewis et al. | Dec 2007 | A1 |
20080002678 | Klessig et al. | Jan 2008 | A1 |
20080005086 | Moore | Jan 2008 | A1 |
20080021850 | Irle et al. | Jan 2008 | A1 |
20080049642 | Gudipudi et al. | Feb 2008 | A1 |
20080059387 | Vaidhyanathan et al. | Mar 2008 | A1 |
20080071726 | Nair et al. | Mar 2008 | A1 |
20080071813 | Nair et al. | Mar 2008 | A1 |
20080071908 | Nair et al. | Mar 2008 | A1 |
20080077682 | Nair et al. | Mar 2008 | A1 |
20080077995 | Curnyn et al. | Mar 2008 | A1 |
20080097923 | Kim et al. | Apr 2008 | A1 |
20080114725 | Indeck et al. | May 2008 | A1 |
20080134043 | Georgis et al. | Jun 2008 | A1 |
20080177994 | Mayer | Jul 2008 | A1 |
20080243900 | Yohanan et al. | Oct 2008 | A1 |
20080301760 | Lim | Dec 2008 | A1 |
20090064185 | Araujo | Mar 2009 | A1 |
20090077210 | Musman et al. | Mar 2009 | A1 |
20090106100 | Mashinsky | Apr 2009 | A1 |
20090150431 | Schmidt et al. | Jun 2009 | A1 |
20100250497 | Redich et al. | Sep 2010 | A1 |
20130110840 | Nair et al. | May 2013 | A1 |
Number | Date | Country |
---|---|---|
1855218 | Nov 2007 | EP |
WO 2008036621 | Mar 2008 | WO |
Entry |
---|
U.S. Appl. No. 11/528,783, Feb. 4, 2015, Office Action. |
U.S. Appl. No. 11/772,179, Jul. 3, 2014, Final Office Action. |
U.S. Appl. No. 11/864,596, Jun. 16, 2014, Notice of Allowance. |
U.S. Appl. No. 11/864,760, Jan. 28, 2015, Decision on Appeal. |
U.S. Appl. No. 11/864,770, May 16, 2014, Final Office Action. |
U.S. Appl. No. 11/864,770, Dec. 5, 2014, Office Action. |
U.S. Appl. No. 11/864,764, Jun. 25, 2014, Final Office Action. |
U.S. Appl. No. 11/864,764, Jan. 16, 2015, Office Action. |
U.S. Appl. No. 13/414,512, Sep. 30, 2014, Notice of Allowance. |
U.S. Appl. No. 11/528,783, Aug. 15, 2012, Final Office Action. |
U.S. Appl. No. 11/528,790, Jul. 18, 2012, Final Office Action. |
U.S. Appl. No. 11/694,753, Nov. 30, 2012, Notice of Allowance. |
U.S. Appl. No. 11/694,764, Aug. 1, 2012, Office Action. |
U.S. Appl. No. 11/772,192, Jun. 12, 2012, Final Office Action. |
U.S. Appl. No. 11/864,605, Jul. 3, 2012, Office Action. |
U.S. Appl. No. 11/528,772, Aug. 10, 2010, Final Office Action. |
U.S. Appl. No. 11/528,783, Sep. 1, 2010, Final Office Action. |
U.S. Appl. No. 11/528,790, Jul. 12, 2010, Office Action. |
U.S. Appl. No. 11/692,058, Jul. 6, 2010, Office Action. |
U.S. Appl. No. 11/694,764, Aug. 4, 2010, Final Office Action. |
U.S. Appl. No. 11/864,596, May 26, 2010, Final Office Action. |
U.S. Appl. No. 11/864,605, May 28, 2010, Final Office Action. |
U.S. Appl. No. 11/864,760, Jul. 27, 2010, Office Action. |
U.S. Appl. No. 11/528,772, Mar. 3, 2011, Office Action. |
U.S. Appl. No. 11/528,790, Jan. 13, 2011, Final Office Action. |
U.S. Appl. No. 11/692,058, Jan. 24, 2011, Notice of Allowance. |
U.S. Appl. No. 11/694,753, Jan. 19, 2011, Office Action. |
U.S. Appl. No. 11/694,764, Mar. 17, 2011, Office Action. |
U.S. Appl. No. 11/864,596, Mar. 11, 2011, Office Action. |
U.S. Appl. No. 11/864,605, Mar. 9, 2011, Final Office Action. |
U.S. Appl. No. 11/864,760, Jan. 27, 2011, Final Office Action. |
U.S. Appl. No. 11/864,764, Jan. 27, 2011, Office Action. |
U.S. Appl. No. 11/528,772, Jan. 28, 2010, Office Action. |
U.S. Appl. No. 11/694,753, Mar. 29, 2010, Office Action. |
U.S. Appl. No. 11/692,051, Feb. 19, 2010, Notice of Allowance. |
U.S. Appl. No. 11/692,051, Mar. 31, 2010, Notice of Allowance. |
U.S. Appl. No. 11/694,764, Jan. 28, 2010, Office Action. |
U.S. Appl. No. 11/772,179, Feb. 23, 2010, Final Office Action. |
U.S. Appl. No. 11/864,770, Apr. 21, 2010, Final Office Action. |
U.S. Appl. No. 11/772,192, Apr. 15, 2010, Office Action. |
U.S. Appl. No. 11/864,760, Apr. 7, 2010, Final Office Action. |
U.S. Appl. No. 11/528,772, Oct. 27, 2011, Notice of Allowance. |
U.S. Appl. No. 11/528,790, Jan. 23, 2012, Office Action. |
U.S. Appl. No. 11/694,753, Jan. 26, 2012, Office Action. |
U.S. Appl. No. 11/694,764, Sep. 26, 2011, Final Office Action. |
U.S. Appl. No. 11/772,192, Jan. 5, 2012, Office Action. |
U.S. Appl. No. 11/864,596, Oct. 7, 2011, Final Office Action. |
U.S. Appl. No. 11/864,764, Aug. 29, 2011, Final Office Action. |
U.S. Appl. No. 11/864,774, Dec. 9, 2011, Final Office Action. |
U.S. Appl. No. 11/772,179, Oct. 11, 2013, Office Action. |
U.S. Appl. No. 11/772,192, Aug. 12, 2013, Notice of Allowance. |
U.S. Appl. No. 11/528,783, Feb. 24, 2009, Office Action. |
U.S. Appl. No. 11/528,900, Jan. 23, 2009, Final Office Action. |
U.S. Appl. No. 11/694,753, Mar. 25, 2009, Office Action. |
U.S. Appl. No. 11/694,783, Feb. 6, 2009, Office Action. |
U.S. Appl. No. 13/414,512, Mar. 14, 2014, Final Office Action. |
U.S. Appl. No. 13/719,084, Jul. 26, 2013, Office Action. |
U.S. Appl. No. 13/719,084, Jan. 6, 2014, Notice of Allowance. |
U.S. Appl. No. 13/972,089, filed Aug. 21, 2013, Nair et al. |
Gasser et al., “An Architecture for Practical Delegation in a Distributed System”, 1990 IEEE Computer Society Symposium, May 7-9, 1990, pp. 20-30. |
U.S. Appl. No. 11/528,790, May 8, 2014, Notice of Allowance. |
U.S. Appl. No. 13/972,089, Apr. 16, 2014, Notice of Allowance. |
U.S. Appl. No. 11/528,790, Jan. 10, 2014, Final Office Action. |
U.S. Appl. No. 11/864,770, Nov. 26, 2013, Office Action. |
U.S. Appl. No. 11/864,764, Nov. 20, 2013, Office Action. |
U.S. Appl. No. 11/528,772, Sep. 12, 2008, Pre-Interview First Office Action. |
U.S. Appl. No. 11/528,783, Nov. 7, 2008, Pre-Interview First Office Action. |
U.S. Appl. No. 11/694,753, Jun. 17, 2011, Final Office Action. |
U.S. Appl. No. 11/864,770, Apr. 19, 2011, Final Office Action. |
U.S. Appl. No. 11/864,774, May 11, 2011, Office Action. |
U.S. Appl. No. 11/694,753, Nov. 18, 2009, Final Office Action. |
U.S. Appl. No. 11/692,051, filed Mar. 27, 2007, Perrin et al. |
U.S. Appl. No. 11/692,058, filed Mar. 27, 2007, Perrin et al. |
U.S. Appl. No. 11/694,753, filed Mar. 30, 2007, Nair et al. |
U.S. Appl. No. 11/694,764, filed Mar. 30, 2007, Nair et al. |
U.S. Appl. No. 11/694,783, filed Mar. 30, 2007, Perrin et al. |
U.S. Appl. No. 11/772,179, filed Jun. 30, 2007, John Philip Bell, II. |
U.S. Appl. No. 11/772,192, filed Jun. 30, 2007, Nair et al. |
U.S. Appl. No. 11/528,900, Jun. 9, 2008, Office Action. |
U.S. Appl. No. 13/414,512, filed Mar. 7, 2012, Nair et al. |
U.S. Appl. No. 11/528,783, Feb. 14, 2012, Office Action. |
U.S. Appl. No. 11/772,179, Mar. 29, 2012, Office Action. |
U.S. Appl. No. 11/864,764, May 3, 2012, Office Action. |
U.S. Appl. No. 11/864,770, Feb. 4, 2013, Office Action. |
Ben-Ghorbel-Talbi et al.; “An Extended Role-Based Access Control Model for Delegating Obligations”; Springer-Verlag Berline Heidelberg 2009. |
Belokosztolszki et al.; “Meta-Policies for Distributed Role-Based Access Control Systems”; 2002 IEEE. |
U.S. Appl. No. 11/528,790, Jun. 17, 2013, Office Action. |
U.S. Appl. No. 11/694,764, May 21, 2013, Notice of Allowance. |
U.S. Appl. No. 11/864,605, May 24, 2013, Notice of Allowance. |
U.S. Appl. No. 11/864,770, Jun. 13, 2013, Final Office Action. |
U.S. Appl. No. 11/864,774, Apr. 15, 2013, Notice of Allowance. |
U.S. Appl. No. 13/414,512, Aug. 1, 2013, Office Action. |
U.S. Appl. No. 11/864,596, filed Sep. 28, 2007, Nair et al. |
U.S. Appl. No. 11/864,605, filed Sep. 28, 2007, Nair et al. |
U.S. Appl. No. 11/864,770, filed Sep. 28, 2007, Nair et al. |
U.S. Appl. No. 11/864,774, filed Sep. 28, 2007, Nair et al. |
U.S. Appl. No. 11/864,760, filed Sep. 28, 2007, Nair et al. |
U.S. Appl. No. 11/864,764, filed Sep. 28, 2007, Nair et al. |
U.S. Appl. No. 11/528,783, Jan. 15, 2010, Office Action. |
U.S. Appl. No. 11/692,058, Jan. 8, 2010, Final Office Action. |
U.S. Appl. No. 11/864,596, Nov. 12, 2009, Office Action. |
U.S. Appl. No. 11/864,770, Nov. 27, 2009, Office Action. |
U.S. Appl. No. 11/864,760, Nov. 24, 2009, Office Action. |
U.S. Appl. No. 11/864,605, Jan. 14, 2010, Office Action. |
U.S. Appl. No. 11/694,753, Oct. 5, 2010, Final Office Action. |
U.S. Appl. No. 11/772,192, Oct. 29, 2010, Final Office Action. |
U.S. Appl. No. 11/864,605, Nov. 4, 2010, Office Action. |
U.S. Appl. No. 11/864,770, Nov. 3, 2010, Office Action. |
U.S. Appl. No. 11/694,753, Aug. 31, 2012, Notice of Allowance. |
U.S. Appl. No. 11/694,764, Nov. 29, 2012, Final Office Action. |
U.S. Appl. No. 11/772,179, Nov. 13, 2012, Final Office Action. |
U.S. Appl. No. 11/864,605, Nov. 8, 2012, Final Office Action. |
U.S. Appl. No. 11/864,764, Dec. 10, 2012, Final Office Action. |
Number | Date | Country | |
---|---|---|---|
20080071727 A1 | Mar 2008 | US |
Number | Date | Country | |
---|---|---|---|
60826072 | Sep 2006 | US | |
60826073 | Sep 2006 | US | |
60826053 | Sep 2006 | US | |
60826074 | Sep 2006 | US | |
60826042 | Sep 2006 | US |