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 mapping data objects within a computer system to service level objectives and to service providers that are capable of providing those services.
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 assigning service level objectives to data objects stored within a computer system. The computer system includes an information management server for providing customized services to data objects residing in the computer system. One exemplary method identifies a data object, such as a file, folder, database, and the like, that has been categorized according to at least one property associated with the data object. The method also identifies service level objectives that may be requested by the data objects. Service level objectives may include any type of service area, service level, or information management actions that can be provided to a data object, including data backup, data retention, data indexing, lifecycle management, and the like, as is described in further detail herein. The data object is then associated with one or more of the service level objectives for requesting that one or more services be provided to the data object.
In an alternative embodiment, the data objects are further assigned to one or more service packages that are capable of providing the services level objectives requested by each data object.
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. 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.
1. Introduction to Information Management Services
Embodiments of the invention relate to information or data management. Information management enables the orchestration of services such as data protection, data placement, corporate compliance, and others based on the needs of the underlying data and the value of the data to the owner of the data. Embodiments of the invention enable the data to be classified in an automated fashion and provides various levels of granularity that can be adjusted as needed. Using the techniques described herein, an entity can be assured that its data is receiving the services that are actually required. The following introduction provides context for the present invention, which focuses on service level mapping used for facilitating the orchestration of customized service levels.
Information management is scalable and can be implemented in a variety of different computer or computing systems. A computer system, by way of example only, may refer to a single computer, to multiple computers (including clients and/or server computers, and other devices) that are connected with a network. The objects of a computer system can include servers, applications, services, data, file, and the like or any combination thereof.
Referring to
An information management service 102 may be configured to provide various services, including but not limited to, an information discovery and classification module 122, an environment discovery and classification module 104, a service level mapping module 126, and the like. The information residing in the computer system 100 is discovered and classified by the information discovery and classification module 122. The environment components 110, 114 and 118 that exist within the computer system 100 are discovered and classified by the environment discovery and classification module 104. The service level mapping module 126 is then used for matching the discovered data objects to their service needs, and for the matching their service needs to the appropriate service provider (i.e., environment component) that is capable of providing those needs. Each of the modules 104, 122 and 126 will be described in further detail below, with particular emphasis placed on the service level mapping module 126.
As described previously, the environment discovery and classification module 104 is provided for discovering and for classifying the environment components 110, 114, and 118 that exist within the computer system 100. Although only three environment components are illustrated in
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. Information Discovery and Classification
A large variety of data objects may be stored within the computer system 100. The data objects may be discovered by the information discovery and classification module 122. The discovered data objects may have a variety of service needs. 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 discovery and classification module 122. In general, the information discovery and 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.
b. Environment Discovery and Classification
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.
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. 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 one 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 distributed computer system may include three primary storage locations. The distributed 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.
2. Service Level Mapping
Once the system environment and the data objects residing in the system have been discovered and classified, the service level mapping module 126 can perform the tasks of selecting service level objectives for each data object and selecting service packages and service providers that are capable of providing the service level objectives.
A variety of different service level objectives may be offered to the files contained within the categories 202, 204 and 206. By way of example, the service level objectives that may be offered to the categories 202, 204 and 206 may include CDP backup 208, where every change to the data object is recorded in the CDP engine, data indexing 210, where the content of each file is indexed, seven year retention 212, where the data is stored for at least seven years prior to deletion, three year retention 214, where the data is stored for least three years prior to deletion, daily backup 216, where the files are stored to a backup location on a daily basis, tier 1 storage 224, tier 2 storage 226, and the like. As will be appreciated by one of ordinary skill in the art, many other service level objectives may be offered in addition to those illustrated in
After assessing the categories 202, 204 and 206 and the available service level objectives 208, 210, 212, 214, 216, 224 and 226, the service level mapping module 126 maps each of the categories to one or more service level objectives for defining the types of services that will be requested by each category. The mappings are depicted by the arrows drawn from the categories 202, 204 and 206 to the service level objectives 208, 210, 212, 214, 216, 224 and 226. For example, Category 1 (202) is mapped to the CDP backup 208, data indexing 210 and seven year retention 212 service level objectives. Category 2 (204) is mapped to the seven year retention 212, daily backup 216 and tier 1 storage 224 service level objectives. Category 3 (206) is mapped to the three year retention 214, daily backup 216 and tier 2 storage 226 service level objectives. The generated service level mappings between the categories 202, 204 and 206 and the service level objectives 208, 210, 212, 214, 216, 224 and 226 may be stored, for example, in the form of metadata, in the mapping data structure 128.
As illustrated in
The creation of the service level mappings 200 can be done manually, by the user, or automatically through various programmatic methods, or some combination of manual and automatic methods. For example, in one embodiment, a user manually creates the service level mappings 200 for each category 202, 204 and 206 via a user interface by selecting from the service level objectives 208, 210, 212, 214, 216, 224 and 226 provided by the system. In another exemplary embodiment, a user may establish a rule set for defining service level objectives that will be assigned to particular files and categories having one or more categories. When new files are discovered and classified, as described previously, the rule set is automatically applied to the files and/or categories in order to generate the appropriate service level mappings.
In one embodiment, priorities may be assigned to each of the service level mappings between the categories 202, 204 and 206 and the service level objectives 208, 210, 212, 214, 216, 224 and 226. The priorities may be used in order to resolve any conflicts that may arise between the various service level objectives that may be requested by a single file. In the example illustrated in
One example service level conflict results in the service level mappings for the categories 204 and 206, which both contain ‘File 1’. For example, the category 204 may include files that exceed two gigabytes in size, and the category 206 may include files whose content includes private information, such as the social security numbers of customers of the company, wherein ‘File 1’ falls within both of these categories. According to the service level mappings, files exceeding 2 GB in size (i.e., Category 204) should be retained for seven years, in accordance with service level 3 (212). However, files containing private information (i.e., Category 206) should only be retained for three years. In order to resolve this conflict, the priority levels of each service level mapping are compared with one another. Because the priority level of the service level mapping requesting seven year retention is a ‘1’, the seven year retention service is deemed to have a “higher” priority than the three year retention service. Therefore, the service level mapping module 126 selects that ‘File 1’ be retained for seven years, in accordance with service level 3 (212).
In addition to assigning priority levels for the service level mappings between the categories 202, 204 and 206 and the service level objectives 208, 210, 212, 214, 216, 224 and 226, global rules 218 may also be provided and prioritized. Global rules may include, for example, rules that apply to all data objects regardless of which domain or line of business contains the data objects. For example, one of the rules 220 may include a stipulation that files larger than 2 GB should not be indexed due to the cost of the indexing large files. In order to ensure that this rule does not trump other service mappings that are of more important, it is assigned a low priority level 222 of ‘2’. Referring again to the above example, where the first category 202 includes files originating from accounting and second category 204 includes files that exceed two GB in size, a conflict arises when analyzing ‘File 4.’ As illustrated, ‘File 4’ exceeds 2 GB in size (category 204). Therefore, the global rule 220 that files larger than 2 GB in size should not be indexed applies to ‘File 4’. However, ‘File 4’ also belongs to the accounting group (category 202), which includes a service level mapping to the service level 2 (210), which provides that the files included within the category 202 should be indexed. Because a conflict exists, the priority of the global rule 220 is compared to the priority of the service level mapping to the service level 210. Because the global rule 220 only has a priority level of ‘2’, while the service level mapping to service level 210 as a priority of ‘1’, the request that ‘File 4’ be indexed takes precedence over the global rule 220.
In some circumstances, a file may not be included within any category 202, 204 or 206, or may include insufficient properties to categorize or to map the file to a service level. In these situations, it may be necessary to infer the proper service level for the uncategorized file based on other factors. In one embodiment, where a file contains insufficient properties to properly perform service level mapping, the service level mapping module 126 determines the mapping for the file based on its associations with other files. For example, the service level mapping module 126 may identify where the uncategorized file is located. Then, the service level mapping module 126 identifies the other files stored at the same location and the services that the other files are mapped to. The uncategorized file may then be assigned to the same service level objectives that are associated with the other files that are stored at the same location, based on the presumption that many files sharing a common location may also share common attributes and service level needs. This embodiment is only one exemplary technique for inferring service level objectives for uncategorized data objects. As will be appreciated by one of ordinary skill in the art, other techniques may also be employed for assigning service level objectives to uncategorized data objects.
In the
After performing service level mapping to select the service level objectives for each category 202, 204 and 206, as illustrated in
Each target service package 402, 410 and 418 may be associated with multiple files, wherein all files contained within a single service package have requested the same group of service level objectives 406, 414 and 422. For example, the target service package 402 includes ‘File 1’, ‘File 2’ and ‘File 3’ (404), each of which has requested CDP backup and data indexing 406. The service level objectives 406, 414 and 422 included within each of the target service packages 402, 410 and 418, respectively, are provided by way of example, and do not necessarily reflect the service level mappings 200 illustrated in
The service packages 426, 428 and 430 may include a bundle of services offered by one or more environment components to the data objects stored within the computer system. The number of service packages 426, 428 and 430 and the combination of services they each provide may be determined by a data center that specializes in information management services. The services contained in each of the service packages 426, 428 and 430 illustrated in
The service level mapping module 126 maps each target service package 402, 410 and 418 to one or more service packages 426, 428 and 430 that are best able to provide the service level objectives 406, 414 and 422 of each of the service packages. In one embodiment, the service providers that provide the services offered in the service packages 426, 428 and 430 include environment components that have been classified in accordance with the environment classification techniques provided by the environment discovery and classification module 104 of
In one embodiment, the service packages 426, 428 and 430 offered by the data center are sufficient in number to provide any combination of service level objectives 406, 414 and 422 that may exist. In this case, the step of mapping target service packages 402, 410 and 418 to the offered service packages 426, 428 and 430 may be unnecessary, and the target service packages may be mapped directly to the service providers capable of providing the necessary service level objectives 406, 414 and 422. However, in another embodiment, only a finite number of service packages 426, 428 and 430 are offered by the data center. Therefore, in some circumstances, the service packages 426, 428 and 430 offered by the data center may not be able to provide every combination of service level objectives 406, 414 and 422 contained in the target service packages 402, 410 and 418. In this embodiment, user configurable logic may be employed for determining which of the service level objectives 406, 414, and 422 to retain in the event that the data center has elected not to offer service bundles that exactly match the target service packages 402, 410 and 418.
For example, priority levels 408, 416 and 424 may be assigned to each of the service level objectives 406, 414 and 422, respectively. When no service package is available that it is capable providing all the service level objectives 406, 414 or 422 of a target service package 404, 410 or 418, the service package that is able to provide the service level objectives having the highest priority levels is identified. Alternatively, multiple service packages 426, 4428 and 430 may be identified, wherein the combination of the service packages is capable of providing the service level objectives having the highest priority levels.
By way of example, suppose that service package 1 (426) is capable of providing seven year retention and data indexing, while service package 2 (428) is capable of providing continuous data protection backup and daily backup services. Because service package 1 (426) is capable of providing the service level objectives having the highest two priority levels (i.e., seven year retention and data indexing) of target service package 2 (410), while the service package 2 (428) is only capable of providing the service level objective having the lowest priority level (i.e., daily backup), target service package 2 will be mapped to service package 1 (426) in order to meet its highest-priority needs. Likewise, because service package 2 (428) is capable of providing all of the service level objectives of target service package 1 (402), while service package 1 (426) is only capable of providing the service level objective having the lowest priority level (i.e., data indexing), target service package 1 (402) is mapped to service package 2 (428). The above scenario is merely provided by way of example. In some embodiments, a service level objective can be met regardless of which service package 426, 428 or 430 it is mapped to. For example, in one embodiment, data indexing can be delivered to any data object regardless of which service package it is mapped to and regardless of where the data object is stored.
By way of example, the service level objectives 506 of target service package 1 (502) include CDP backup and tier 2 storage. The service level adjustment policies 508 associated with the service level objectives 506 include a ‘fixed’ requirement for CDP backup and a promotable option for the tier 2 storage service level objective. Therefore, if none of the service packages 526, 528 and 530 provide CDP backup and tier 2 storage, but service package 2 (528) provides CDP backup and tier 1 storage, the original request for tier 2 storage is promoted to tier 1 storage, and the target service package 1 (502) may be mapped to service package 2. As illustrated in the target service package 3 (518) service level adjustment policies 524, the ‘3 year retention’ service level objective is both promotable and demotable. Therefore, by way of example, instead of requiring three year retention service, the data objects 520 within target service package 3 (518) may instead request one year retention or seven year retention if three year retention is not provided in combination with the other service level objectives 522.
Referring once again to
The data object is then associated 606 with one or more of the service level objectives for requesting that the services associated with the service level objectives be provided to the data object. Thus, as illustrated in the
In another embodiment, the method 600 may also include assigning a priority level to each of the service level objectives that the data object is associated with. The priority level will determine which of the service level objectives is retained in the event that conflicting service level objectives have been selected for a data object.
In one embodiment, the method may also include steps for handling data objects that have insufficient properties to be categorized or associated with an information management level. Once it is determined that a data object does not contain insufficient properties to be categorized, the storage location containing the data object is identified. Then, the information management levels that are associated with a substantial portion of the other data objects located within the same storage location are identified. Finally, the uncategorized data object is associated with the information management levels that are associated with the other data objects located within the storage location.
In one embodiment, the method may further include identifying 608 a service provider and/or service package that is capable of providing at least one of the service level objectives associated with the data object. Once the appropriate service provider and/or service bundle is identified, the data object is associated with the identified service provider.
In one embodiment, the data object is associated with a lifecycle service level objective. In this situation, the method may further include identifying aging characteristics of the data object based on access patterns of the data object, such as the amount of time since the data object was created, the amount of time since the data object was last accessed, the amount of time since the data object was last modified, the frequency at which the data object is accessed or modified, and the like and combinations thereof. Then, the data object is associated with the service level objective that is designated for providing services to data objects having the aging characteristics of the data object.
Referring now to
The method 700 identifies 702 a data object associated with at least one service level objective. The method 700 also identifies 704 a service package that is capable of providing at least one of the service level objectives associated with the data object. The identified service package is then associated 706 with the data object.
As described previously, a priority level may be assigned to each of the service level objectives that the data object is associated with. In one embodiment, identifying 704 the service package may further include identifying a service package that is capable of providing the service level objectives having the highest priority levels.
In another embodiment, each of the service level objectives associated with a data object is assigned an adjustment policy. The adjustment policy defines the adaptability of the service level objectives in the event that the service package is unable to provide all of the service level objectives. By way of example, the adjustment policy may be selected from the following options: 1) a fixed option; 2) a promotable option; and 3) a demotable option, as described in reference to
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 |
---|---|---|---|
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 |
6865728 | Branson et al. | Mar 2005 | B1 |
7185073 | Gai et al. | Feb 2007 | B1 |
7240076 | McCauley et al. | Jul 2007 | B2 |
7278156 | Mei et al. | Oct 2007 | B2 |
7363292 | Chaboche | Apr 2008 | B2 |
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 |
7725570 | Lewis | May 2010 | B1 |
7725571 | Lewis | May 2010 | B1 |
7730172 | Lewis | Jun 2010 | B1 |
7734765 | Musman et al. | Jun 2010 | B2 |
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 |
20020016800 | Spivak et al. | Feb 2002 | A1 |
20020091746 | Umberger et al. | Jul 2002 | A1 |
20020120685 | Srivastava et al. | Aug 2002 | A1 |
20020161883 | Matheny et al. | Oct 2002 | A1 |
20030023587 | Dennis et al. | Jan 2003 | A1 |
20030023712 | Zhao et al. | Jan 2003 | A1 |
20030036886 | Stone | Feb 2003 | A1 |
20030041050 | Smith et al. | Feb 2003 | A1 |
20030093528 | Rolia | May 2003 | A1 |
20030140009 | Namba et al. | Jul 2003 | A1 |
20030167180 | Chung et al. | Sep 2003 | A1 |
20030196108 | Kung | Oct 2003 | A1 |
20030212778 | Collomb | Nov 2003 | A1 |
20030225829 | Pena et al. | Dec 2003 | A1 |
20030233391 | Crawford 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 |
20040215650 | Shaji et al. | Oct 2004 | A1 |
20040236660 | Thomas et al. | Nov 2004 | A1 |
20040243699 | Koclanes et al. | Dec 2004 | A1 |
20050060662 | Soares et al. | Mar 2005 | A1 |
20050071182 | Aikens et al. | Mar 2005 | A1 |
20050102297 | Lloyd et al. | May 2005 | A1 |
20050125768 | Wong et al. | Jun 2005 | A1 |
20050131982 | Yamasaki et al. | Jun 2005 | A1 |
20050132034 | Iglesia et al. | Jun 2005 | A1 |
20050177545 | Buco et al. | Aug 2005 | A1 |
20050197852 | Gebhard et al. | Sep 2005 | A1 |
20050251533 | Harken et al. | Nov 2005 | A1 |
20050262097 | Sim-Tang 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 |
20060101084 | Kishi et al. | May 2006 | A1 |
20060106782 | Blumenau et al. | May 2006 | A1 |
20060112108 | Eklund et al. | May 2006 | A1 |
20060114832 | Hamilton et al. | Jun 2006 | A1 |
20060129974 | Brendle et al. | Jun 2006 | A1 |
20060179143 | Walker et al. | Aug 2006 | A1 |
20060236061 | Koclanes | Oct 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 |
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 |
20070226228 | Her et al. | 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 |
20080071727 | Nair et al. | Mar 2008 | A1 |
20080071813 | Nair et al. | Mar 2008 | A1 |
20080071908 | 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 |
20080301760 | Lim | Dec 2008 | A1 |
20090077210 | Musman et al. | Mar 2009 | A1 |
20090150431 | Schmidt et al. | Jun 2009 | A1 |
20090157881 | Kavuri 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/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. 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/528,898, Sep. 5, 2008, Pre-Interview First Office Action. |
U.S. Appl. No. 11/528,783, Feb. 24, 2009, Office Action. |
U.S. Appl. No. 11/528,898, Feb. 9, 2009, First Action Interview. |
U.S. Appl. No. 11/528,898, Apr. 3, 2009, Office Action. |
U.S. Appl. No. 11/528,900, Jan. 23, 2009, First 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. 11/528,772, Jun. 3, 2009, Final Office Action. |
U.S. Appl. No. 11/528,783, Jun. 25, 2009, Final Office Action. |
U.S. Appl. No. 11/528,900, Aug. 25, 2009, Notice of Allowance. |
U.S. Appl. No. 11/692,058, Jul. 9, 2009, Office Action. |
U.S. Appl. No. 11/692,051, Aug. 26, 2009, Office Action. |
U.S. Appl. No. 11/772,179, Aug. 19, 2009, Office Action. |
U.S. Appl. No. 11/528,898, Oct. 7, 2009, Final Office Action. |
U.S. Appl. No. 11/694,753, Nov. 18, 2009, Final 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/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, Aug. 10, 2010, Final Office Action. |
U.S. Appl. No. 11/528,783, Sep. 1, 2010, Final Office Action. |
U.S. Appl. No. 11/692,058, Jul. 6, 2010, Office Action. |
U.S. Appl. No. 11/694,753, Oct. 5, 2010, Final Office Action. |
U.S. Appl. No. 11/694,764, Aug. 4, 2010, Final Office Action. |
U.S. Appl. No. 11/772,192, Oct. 29, 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,605, Nov. 4, 2010, Office Action. |
U.S. Appl. No. 11/864,760, Jul. 27, 2010, Office Action. |
U.S. Appl. No. 11/864,770, Nov. 3, 2010, Office Action. |
U.S. Appl. No. 11/694,753, Jun. 17, 2011, Final Office Action. |
U.S. Appl. No. 11/528,772, Mar. 3, 2011, 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,770, Apr. 19, 2011, Final Office Action. |
U.S. Appl. No. 11/864,764, Jan. 27, 2011, Office Action. |
U.S. Appl. No. 11/864,774, May 11, 2011, Office Action. |
U.S. Appl. No. 13/414,512, filed Mar. 7, 2012, Nair et al. |
U.S. Appl. No. 11/528,772, Oct. 27, 2011, Notice of Allowance. |
U.S. Appl. No. 11/528,783, Feb. 14, 2012, Office Action. |
U.S. Appl. No. 11/528,898, Mar. 1, 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,179, Mar. 29, 2012, 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,764, May 3, 2012, Office Action. |
U.S. Appl. No. 11/864,774, Dec. 9, 2011, Final Office Action. |
U.S. Appl. No. 11/528,783, Aug. 15, 2012, Final Office Action. |
U.S. Appl. No. 11/528,898, Oct. 2, 2012, Final Office Action. |
U.S. Appl. No. 11/694,753, Aug. 31, 2012, Notice of Allowance. |
U.S. Appl. No. 11/694,764, Aug. 1, 2012, Office Action. |
U.S. Appl. No. 11/772,179, Nov. 13, 2012, Final 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/864,605, Nov. 8, 2012, Final Office Action. |
U.S. Appl. No. 11/694,764, Nov. 29, 2012, Final Office Action. |
U.S. Appl. No. 11/864,770, Feb. 4, 2013, Office Action. |
U.S. Appl. No. 11/864,764, Dec. 10, 2012, Final Office Action. |
Office Action dated Oct. 11, 2013 from U.S. Appl. No. 11/772,179, filed Jun. 30, 2007. |
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/694,764, May 21, 2013, Notice of Allowance. |
U.S. Appl. No. 11/772,192, Aug. 12, 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. 13/414,512, Aug. 1, 2013, 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/864,774, Apr. 15, 2013, Notice of Allowance. |
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. 13/972,089, Mailing date Apr. 16, 2014, Notice of Allowance. |
Number | Date | Country | |
---|---|---|---|
20080077682 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 |