A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
The present invention disclosure relates to authorization and control of resources in an enterprise application.
Enterprise applications can increase the availability of goods and services to customers inside and outside of an organization. One issue that accompanies deployment of an enterprise application is authorization or access control. Both customers and system administrators need to be privileged to perform certain actions (e.g., modifying a customer account) or to gain access to certain enterprise application. Typical authorization systems can be complex and time consuming to implement and maintain, especially if they are tied closely to the business logic in an enterprise application.
The invention is illustrated by way of example and not by way of limitation in the figures of the accompanying drawings in which like references indicate similar elements. It should be noted that references to “an” or “one” embodiment in this disclosure are not necessarily to the same embodiment, and such references mean at least one.
In one embodiment, an enterprise application includes one or more resources that facilitate the performance of business, scientific or other functions and tasks. In another embodiment, an enterprise application can be a Java™ 2 Enterprise Edition (J2EE) deployment unit that bundles together Web Applications, Enterprise Java™ Beans and Resource Adaptors into a single deployable unit. The Java™ programming language and its run-time libraries and environment are available from Sun Microsystems, Inc., of Santa Clara, Calif. Enterprise applications can include software, firmware and hardware elements. Software, firmware and hardware can be arbitrarily combined or divided into separate logical components. Furthermore, it will be apparent to those skilled in the art that such components, irregardless of how they are combined or divided, can execute on the same computer or can be arbitrarily distributed among different computers connected by one or more networks.
In one embodiment, a resource can correspond to any person, place or thing, including an object or an entity (e.g., a network, a computer, a computer user, a bank account, an electronic mail message, aspects of a computer operating system such as virtual memory, threads and file storage, etc.), a method or a process (e.g., balancing a checkbook, installing a device driver, allocating virtual memory, deleting a file, etc.), the occurrence or non-occurrence of an event (e.g., an attempt by a user to logon to a computer, a change in state, etc.) and an organization or association of resources (e.g., lists, trees, maps, hierarchies, etc.).
In one embodiment, resources can be classified into a hierarchical taxonomy (which itself can be a resource). By way of a non-limiting example, in an enterprise application, it may be necessary to refer to a particular resource such as a booklet. In order to reference the booklet, one needs to know which web page it is on, which portal the web page belongs to, which web application (or “web app”) owns the web page, and which domain the web app belongs to. Each of these components is considered a resource and can be described as a resource path (e.g., a sequence of components separated by slashes):
The first resource is domain which lies at the “top” of the resource hierarchy. Working down the hierarchy, the next component is web_app. The web_app is a “child” or “descendent” of domain and domain is a “parent” of web_app. The domain is superior to web_app and web_app is inferior to domain. Likewise, portal is a child of web_app and a parent of desktop. The page is a child of desktop with booklet as its child. The depth of the resource is the number of components in its path. For example, the depth of booklet is six (assuming that we are counting from 1) and the depth of portal is three. In one embodiment, the depth of a resource can be unlimited. In one embodiment, a resource can have properties or capabilities. By way of a non-limiting example, a booklet resource could have the ability to be customized by an end-user. The capability could be appended to the hierarchy as follows:
Desktop A, Desktop B and Desktop C contain one or more views of a portal that have been customized for a particular user or group of users. Pages within each desktop can contain portlets (Portlet A, Portlet B, and Portlet C and booklets (Booklet 1 and Booklet 2). A portlet is a self-contained application that renders itself on a portal page. In one embodiment, a booklet is a collection of one or more pages or booklets. Resource Web App 1/Portal 1/Desktop A/Page 2/Booklet 1/Page A has a capability Cap 3. Likewise, Web App 1/Portal 1/Desktop A/Page 2/Booklet 1/Booklet 2 has a capability Cap 4 and Web App 1/Portal 1/Desktop A/Page 2/Booklet 1/Booklet 2/Page Y/Portlet A has capabilities Cap 1 and Cap 2.
Enterprise applications can control access to their resources and/or capabilities through the use of entitlements. In one embodiment, evaluation of an entitlement consists of determining a security policy by dynamically associating one or more roles with a principal. In one embodiment, a role can be based on rules that take into account information including knowledge about the principal, knowledge about a communication session, the current state of the system, and/or any other relevant information.
In one embodiment, a user represents a person who uses an enterprise application. A group can be an arbitrary collection of users. In one embodiment, members of a group share common traits such as job title, etc. A process can be a software or firmware computer program or portion thereof of any granularity (e.g., a task, thread, lightweight process, distributed object, Enterprise Java™ Bean, or any other computing operation). Users, groups and processes can be considered subjects. Subjects can be authenticated based on providing adequate proof (e.g., password, social security number, etc.) to an authentication system. Once authenticated, a subject can be considered a principal for purposes of evaluating entitlements. A principal is an identity assigned to a user, group or process as a result of authentication. A principal can also represent an anonymous user, group or process (e.g., a subject that has not been authenticated).
In one embodiment, a role definition contains one or more expressions that evaluate to true or false when evaluated for a given principal in a given context. In another embodiment, an expression can evaluate to a degree of certainty that access to a resource should be granted. Expressions may be nested within each other and can contain functions, arithmetic or logical operators, etc. In one embodiment contain functions, expressions are combined (e.g., with Boolean operators such as “and”, “or”, and “not”) to form a Boolean expression that evaluates to true or false. If a role evaluates to true, then the principal in question is considered to satisfy the role.
Role expressions can be dynamically evaluated against a principal attempting to access a resource in a given context. A context can contain any information relevant to making a determination of whether a principal belongs in a role. By way of a non-limiting example, a context can include any of a principal's attributes (e.g., name, age, address, etc.) and/or information about a communication session. In another embodiment, a context can include information from a hypertext transfer protocol (“HTTP”) or hypertext transfer protocol (secure) (HTTPS) request. This information can pertain to character encoding, remote user, authorization scheme, content length, server port, context path, request URI, request method, scheme, servlet path, content type, remote host, request protocol, locale, server name, remote address, query string, path information, etc. It will be apparent to those skilled in the art that a context can include any information which is relevant to evaluating an expression.
In one embodiment, expressions can include predicates. The invention disclosed herein is not limited to the present predicates discussed. A user predicate evaluates to true if the principal in question is the principal supplied as an argument to the predicate. The group predicate evaluates to true if the principal in question is a member of the specified group.
Table 1 illustrates seven exemplary roles and their accompanying expressions. In one embodiment, the role “Anonymous” is a special role that is always satisfied. In another embodiment, the role of “Anonymous” is satisfied by an unauthenticated principal. The role of “BankManager” is met by a principal that is authenticated as user “Donna”. The role of “CustomerService” is fulfilled by a principal authenticated as “Michael” or “Peter”, or belonging to group “BankTellers”. The “LoanOfficer” role is met by a principal that is a member of both the “Associate” group and the “TrainingLevel2” group, but is not “Bob”. Roles can also be dynamic. By way of a non-limiting example, a role can be date and/or time dependent. In one embodiment, a time period can be specified using the currentDate predicate. The role of “BankManager” can be fulfilled by “Donna”, but only between Oct. 14, 2002-Oct. 25, 2002 or Nov. 14, 2002-Nov. 25, 2002. It will be apparent to those skilled in the art that many such date or time predicates are possible (e.g., a predicate that is based on a date and a time, or one that is based on time only, etc.).
In addition to the predicates discussed above, a segment predicate (hereafter referred to as a “segment”) can also be included in a role definition. A segment evaluates to true if the principal in question satisfies the segment's criteria. A segment can be defined in terms of one or more expressions or conditions which can be nested and include logical operators, mathematical operations, method calls, calls to external systems, function calls, etc. In another embodiment, a segment can be specified in plain language. By way of a non-limiting example:
In this example, the segment being described is “ExperiencedJavaDeveloper”. The condition “Developer is equal to True” will evaluate to true when information contained in or referenced through a context indicates that the principal in question is a user in the software development department of an organization. Likewise, the other conditions (“Skill level is equal to ‘High’”, “Preferred language is equal to ‘Java’”) could similarly be evaluated using information from or referenced through a context. In another embodiment, a condition can pertain to information about a communication session. It will be apparent to those skilled in the art that a condition can be based on any information, whether the information is connected with a particular principal or not. If the segment as a whole evaluates to true, the principal is said to have satisfied the segment. In Table 1, by way of a non-limiting example, the role of “Software” is met by a principal that satisfies the “JavaDeveloper” segment.
By way of a further non-limiting example:
In this example, two conditions (“TimeofDay is between 12:00 am and 7:00 am” and “SystemLoad is ‘Low’”) are based on information unrelated to a particular principal. The segment evaluates to true for the principal in question if it is the middle of the night, the system is not busy, and the principal has level 5 administration skills. In Table 1, by way of a non-limiting example, the role of “SysAdmin” is met by “Donna”, but only between Oct. 14, 2002-Oct. 25, 2002 or Nov. 14, 2002-Nov. 25, 2002, or by a principal that satisfies the “SystemAdministrator” segment.
In one embodiment, a segment can be persisted in Extensible Markup Language (XML). XML is a platform independent language for representing structured documents. Retrieving information stored in an XML document can be time consuming since the text comprising the XML document must be parsed. To save time, in another embodiment once a XML document representing a segment has been parsed, the information extracted therefrom can be cached to avoid the need to parse the file again.
In
In one embodiment, a security policy (hereinafter referred to as a “policy”) is an association between a resource, a set of roles, and an optional capability. Generally, speaking, a policy grants access to the resource for all principals for which the set of roles evaluates to true. In one embodiment, a policy is satisfied if any of its roles evaluate to true for a give principal. In another embodiment, a policy is satisfied if all of its roles evaluate to true for a given principal. In another embodiment, a security policy integrity system can prevent removing or deleting roles that have policies which depend on them. Although one of skill in the art will recognize that there are many ways to implement such a system, one approach would be to keep track of the number of policies that depend on a particular role by suing a reference count. Only when the reference count is equal to zero will the particular role be eligible for removal.
In yet a further embodiment, a policy's set of roles can be an expression including Boolean operators, set operators and roles for operands. A policy can be expressed as the tuple <resource, roles, [capability]>, wherein resource specifies the name of a resource and roles specifies a set of roles, and capability is an optional capability. While a policy is predicated on one or more roles, roles are predicated on users and groups. Therefore, one of skill in the art will appreciate that policies are in essence predicated on users, groups, and/or segments. By way of illustration, there are four policies illustrated in
By way of a non-limiting illustration, assume a principal p attempts to access resource Cap 1. In order to do so, the security policy P3 on Cap 1 requires that p satisfy either role W or T. In one embodiment, all roles within the scope of Cap 1 (i.e., Anonymous, G, T, U, U, V, and W) are determined for p. If any of the roles that p satisfies match W or T, P3 is likewise satisfied and access to Cap 1 is granted for p.
By way of a further non-limiting illustration, assume principal p attempts to access capability Cap 2 for resource Portlet A. In order to do so, the security policy P4 on Cap 2 requires that p satisfy one of the roles U, G or Anonymous. In one embodiment, all roles within the scope of Portlet A (i.e., Anonymous, G, T, U, V and U) are determined for p. Note that in one embodiment, the role U associated with resource Booklet 2 is not in the scope of Portal A. Instead, the role having the same name but associated with the more “local” resource Page Y occludes it. Thus, if any of the roles that p satisfies match U, G or Anonymous, P4 is satisfied and access to Cap 2 is granted for p. However, since in one embodiment every principal satisfies the role Anonymous, P4 will always be satisfied.
By way of a further non-limiting example, assume p attempts to access capability Cap 4 associated with resource Booklet 2. This resource has no policy. In one embodiment, access will be denied. In another embodiment, access will be granted. In yet a further embodiment, access will be granted if p satisfies a policy in a parent resource of Booklet 2. Table 2 is a non-limiting illustration of a parent policy search using the resource hierarchy of
In one embodiment, the search for a policy proceeds as follows. The starting point for the search is the resource that owns the capability (i.e., Booklet 2) to which the principal is attempting to access (i.e., Cap 4). This is the current resource. If no policy exists at the current resource for the specific capability, in Step 2 we determine whether or not there is a policy merely on the resource itself. If no policy is found, in Step 3 the current resource is set equal to its parent (i.e., Booklet 1). If the current resource has no policy for Cap 4, we determine whether or not there is a policy on Booklet 1 itself. If no policy is found, in Step 5 the current resource is set equal to its parent (i.e., Page 2). If no policy is found for Cap 4 at the current resource, we determine in Step 6 whether or not there is a policy on Page 2 itself. Since this is the case, the search stops at Step 6. Web App 1/Portal 1/Desktop A/Page 2 has policy P2. Therefore if p satisfies role G, access to Cap 4 is granted for p.
In another embodiment, capabilities are associated with particular resource types. For example, booklets may have a type of capability (e.g., Cap 4) that is not compatible with or available for other resource types (e.g., pages or desktops). Therefore, when searching for a policy as in Table 2, if a capability is not compatible for the current resource, that resource can, be omitted from the search. In yet a further embodiment, if a policy is not found for a given resource type, a global library could be consulted to determine if there are any applicable global policies.
In another embodiment, roles and policies can reside in their own hierarchies, apart from the primary resource hierarchy. For applications that do not need to associate roles and/or policies with resources in the primary hierarchy, such an approach can allow for a shallow role and/or policy tree, perhaps only with a single level. Searching smaller hierarchies can potentially reduce the time it takes to find all roles within scope and locate a policy.
In one embodiment, security framework 300 is a modular security architecture having a published interface that allows for plug-in components. By way of a non-limiting example, a framework can be a library, a set of interfaces, distributed objects, or any other means for software, firmware and/or hardware components to intercommunicate. Connected to the framework are one or more role mapper components (302-306). A role mapper maps (e.g., determines which roles are appropriate) a principal to one or more roles based on a resource hierarchy and a context. Each role mapper can implement its own specialized algorithms in this regard and use information and resources beyond that which is provided by the framework. Also connected to the framework are one or more authorizers (308, 310 and 312). An authorizer is responsible for determining if access to a resource can be granted based on whether a principal satisfies a resource policy. Each authorizer can implement its own specialized algorithms in this regard and use information and resources beyond that which is provided by the framework. Finally, adjudicator 314 resolves any difference in outcome between authorization modules and returns a final result (e.g., “grant”, “deny” or “abstain”). In one embodiment, the adjudicator can take the logical “or” of the final results such that if any result is a “grant”, the outcome of adjudication is “grant”. In another embodiment, the adjudicator can take the logical “and” of the final results such that is any result is a “deny”, the outcome of adjudication is “deny”. In yet a further embodiment, the adjudicator can use a weighted average or other statistical means to determine the final outcome.
A process can interact with the framework in a number of ways which will be apparent to those skilled in the art. In one embodiment, a calling process provides a resource access request (1) to the framework 300. This request can include information about the principal, the resource to which access is requested, and any context information. In another embodiment, the request can contain references to this information. This information is then provided to one or more role mappers (2) by the framework. Each role mapper determines which roles are appropriate for the principal based on their own criteria. In another embodiment, each role mapper can implement a cache to speed up searching for roles. Rather than traversing a resource tree to find all roles within scope, each role mapper can cache roles that were previously retrieved from a resource tree based on a key comprising the resource to which access is requested and the principal. After the initial retrieval from a resource tree, subsequent roles for a given resource-principal combination can be taken directly from the cache.
A set of satisfied roles is then returned to the framework in (3). The framework can provide the information from (1) and (3) to the authorizer modules in (4). The authorization modules individually determine whether or not a policy is satisfied based on this information and their own criteria. In another embodiment, each authorizer can implement a cache to speed up searching for policies. Rather than traversing a resource tree to find a policy within scope, each authorizer can cache policies that were previously retrieved from a resource tree based on a key comprising the resource to which access is requested and the principal. After the initial retrieval from a resource tree, subsequent policies for a given resource-principal combination can be taken directly from the cache. The authorizer results (e.g., in terms of grant or deny decisions) are provided to the framework in (5) and provided to the adjudicator in (6). The adjudicator makes a final decision which it provides to the framework in (7). The framework then provides this decision to the calling process in (8).
As enterprise applications grow large and complex, so do the number of administrative tasks. One way to reduce the number of tasks that a system administrator is responsible for is to distribute the tasks among a number of administrators. Delegated administration allows a hierarchy of roles to manage administrative capabilities. By way of a non-limiting example, administrative capabilities can include the ability to manage customer accounts, the ability to delegate administrative capabilities, the ability to customize or personalize user interface elements (e.g., portals, booklets, desktops, portlets, etc.), the ability to perform administration of an enterprise application, etc. In another embodiment, any capability or property can be delegated. In one embodiment, delegation is an act whereby a principal in one role enables another hierarchically inferior role to have an administrative capability and/or further delegate an administrative capability. In one embodiment, a delegation role is identical to a role and can thusly be defined using predicates (e.g., user, group, currentDate, segment, etc.).
Referring again to
In one embodiment, a delegation can be represented by a security policy. The policy is associated with a delegated resource/capability and is based on the role to which the resource/capability was delegated.
Resource Desktop A has two capabilities, Admin and Delegate, each of which has a policy. The policy P(A_Role) attached to both indicates that a principal in the role of Admin_Role delegated to Role_A the capability to both administer Desktop A and further delegate this capability. Thus, a principal in Role_A can further delegate both the Admin and Delegate capabilities to hierarchically inferior delegation roles (i.e., C_Role, D_Role and E_Role). For example, resource Desktop B has a capability Admin that has a policy P(C_Role). This policy was put in place by a principal in the role of A_Role or Admin_Role. A principal in the role of C_Role will be able to administer Desktop B, but will not be able to further delegate this capability.
In one embodiment, a delegation to a node that is already delegated to by a principal in a hierarchically superior delegation role is not permitted. Referring to
In another embodiment, aspects of user group administration can be delegated. By way of a non-limiting example, user groups can by organized into a hierarchy by viewing them as children of an enterprise application resource. Capabilities that can be delegated include: user profile administration, the ability to view the members of group, and the ability to create, update and remove users and groups.
One embodiment may be implemented using a conventional general purpose or a specialized digital computer or microprocessor(s) programmed according to the teachings of the present disclosure, as will be apparent to those skilled in the those skilled in the software art. The invention may also be implemented by the preparation of integrated circuits or by interconnecting an appropriate network of conventional component circuits, as will be readily apparent to those skilled in the art.
One embodiment includes a computer program product which is a storage medium (media) having instructions stored thereon/in which can be used to program a computer to perform any of the features presented herein. The storage medium can include, but is not limited to, any type of disk including floppy disks, optical discs, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMS, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.
Stored on any one of the computer readable medium (media), the present invention includes software for controlling both the hardware of the general purpose/specialized computer or microprocessor, to interact with a human user or other mechanism utilizing the results of the present invention. Such software may include, but is not limited to, device drivers, operating systems, execution environments/containers, and user applications.
The foregoing description of the preferred embodiments of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations will be apparent to the practitioner skilled in the art. Embodiments were chosen and described in order to best describe the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention, the various embodiments and with various modifications that are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalents.
This Application claims priority to and is a Continuation of U.S. patent application Ser. No. 10/367,177 filed on Feb. 14, 2003, which is related to the following co-pending applications: U.S. patent application Ser. No. 10/367,462, filed on Feb. 14, 2003; U.S. patent application Ser. No. 10/367,190, filed on Feb. 14, 2003; and U.S. patent application Ser. No. 10/366,778, filed on Feb. 14, 2003, each of which is hereby incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5173939 | Abadi et al. | Dec 1992 | A |
5237614 | Weiss | Aug 1993 | A |
5335345 | Frieder et al. | Aug 1994 | A |
5341478 | Travis, Jr. et al. | Aug 1994 | A |
5347653 | Flynn et al. | Sep 1994 | A |
5355474 | Thuraisngham et al. | Oct 1994 | A |
5369702 | Shanton | Nov 1994 | A |
5426747 | Weinreb et al. | Jun 1995 | A |
5481700 | Thuraisingham | Jan 1996 | A |
5544322 | Cheng et al. | Aug 1996 | A |
5557747 | Rogers et al. | Sep 1996 | A |
5619710 | Travis, Jr. et al. | Apr 1997 | A |
5627886 | Bowman | May 1997 | A |
5757669 | Christie et al. | May 1998 | A |
5797128 | Birnbaum | Aug 1998 | A |
5825883 | Archibald et al. | Oct 1998 | A |
5826000 | Hamilton | Oct 1998 | A |
5826268 | Schaefer et al. | Oct 1998 | A |
5848396 | Gerace | Dec 1998 | A |
5867667 | Butman et al. | Feb 1999 | A |
5872928 | Lewis et al. | Feb 1999 | A |
5889953 | Thebaut et al. | Mar 1999 | A |
5911143 | Deinhart et al. | Jun 1999 | A |
5918210 | Rosenthal et al. | Jun 1999 | A |
5941947 | Brown et al. | Aug 1999 | A |
5950195 | Stockwell et al. | Sep 1999 | A |
5954798 | Shelton et al. | Sep 1999 | A |
5956400 | Chaum et al. | Sep 1999 | A |
5966707 | Van Huben et al. | Oct 1999 | A |
5987469 | Lewis et al. | Nov 1999 | A |
5987611 | Freund | Nov 1999 | A |
5991877 | Luckenbaugh | Nov 1999 | A |
6005571 | Pachauri | Dec 1999 | A |
6006194 | Merel | Dec 1999 | A |
6014666 | Helland et al. | Jan 2000 | A |
6023765 | Kuhn | Feb 2000 | A |
6029144 | Barrett et al. | Feb 2000 | A |
6029182 | Nehab et al. | Feb 2000 | A |
6029196 | Lenz | Feb 2000 | A |
6054910 | Tada et al. | Apr 2000 | A |
6055515 | Consentino et al. | Apr 2000 | A |
6055637 | Hudson et al. | Apr 2000 | A |
6058392 | Sampson et al. | May 2000 | A |
6073242 | Hardy et al. | Jun 2000 | A |
6083276 | Davidson et al. | Jul 2000 | A |
6088679 | Barkley | Jul 2000 | A |
6098173 | Elgressy et al. | Aug 2000 | A |
6108687 | Craig | Aug 2000 | A |
6122647 | Horowitz et al. | Sep 2000 | A |
6141010 | Hoyle | Oct 2000 | A |
6141686 | Jackowski et al. | Oct 2000 | A |
6148333 | Guedalia et al. | Nov 2000 | A |
6154844 | Touboul et al. | Nov 2000 | A |
6157924 | Austin | Dec 2000 | A |
6158007 | Moreh et al. | Dec 2000 | A |
6158010 | Moriconi et al. | Dec 2000 | A |
6161139 | Win et al. | Dec 2000 | A |
6167407 | Nachenberg et al. | Dec 2000 | A |
6167445 | Gai et al. | Dec 2000 | A |
6170009 | Mandal et al. | Jan 2001 | B1 |
6182226 | Reid et al. | Jan 2001 | B1 |
6182277 | DeGroot et al. | Jan 2001 | B1 |
6185587 | Bernardo et al. | Feb 2001 | B1 |
6202066 | Barkley et al. | Mar 2001 | B1 |
6202157 | Brownlie et al. | Mar 2001 | B1 |
6202207 | Donohue | Mar 2001 | B1 |
6209101 | Mitchem et al. | Mar 2001 | B1 |
6216231 | Stubblebine | Apr 2001 | B1 |
6226745 | Wiederhold | May 2001 | B1 |
6241608 | Torango | Jun 2001 | B1 |
6243747 | Lewis et al. | Jun 2001 | B1 |
6253321 | Nikander et al. | Jun 2001 | B1 |
6256741 | Stubblebine | Jul 2001 | B1 |
6260050 | Yost et al. | Jul 2001 | B1 |
6269393 | Yost et al. | Jul 2001 | B1 |
6269456 | Hodges et al. | Jul 2001 | B1 |
6275941 | Saito et al. | Aug 2001 | B1 |
6285366 | Ng et al. | Sep 2001 | B1 |
6285985 | Horstmann | Sep 2001 | B1 |
6292900 | Ngo et al. | Sep 2001 | B1 |
6295607 | Johnson | Sep 2001 | B1 |
6301613 | Ahlstrom et al. | Oct 2001 | B1 |
6304881 | Halim et al. | Oct 2001 | B1 |
6308163 | Du et al. | Oct 2001 | B1 |
6317868 | Grimm et al. | Nov 2001 | B1 |
6321336 | Applegate et al. | Nov 2001 | B1 |
6327594 | Van Huben et al. | Dec 2001 | B1 |
6327618 | Ahlstrom et al. | Dec 2001 | B1 |
6327628 | Anuff et al. | Dec 2001 | B1 |
6339423 | Sampson et al. | Jan 2002 | B1 |
6339826 | Hayes, Jr. et al. | Jan 2002 | B2 |
6341352 | Child et al. | Jan 2002 | B1 |
6353886 | Howard et al. | Mar 2002 | B1 |
6360363 | Moser et al. | Mar 2002 | B1 |
6377973 | Gideon | Apr 2002 | B2 |
6381579 | Gervais et al. | Apr 2002 | B1 |
6385627 | Cragun | May 2002 | B1 |
6393474 | Eichert et al. | May 2002 | B1 |
6397222 | Zellweger | May 2002 | B1 |
6397231 | Salisbury et al. | May 2002 | B1 |
6408336 | Schneider et al. | Jun 2002 | B1 |
6412070 | Van Dyke et al. | Jun 2002 | B1 |
6412077 | Roden et al. | Jun 2002 | B1 |
6418448 | Sarkar | Jul 2002 | B1 |
6430556 | Goldberg et al. | Aug 2002 | B1 |
6434607 | Haverstock et al. | Aug 2002 | B1 |
6446200 | Ball et al. | Sep 2002 | B1 |
6457007 | Kikuchi et al. | Sep 2002 | B1 |
6460141 | Olden | Oct 2002 | B1 |
6466239 | Ishikawa | Oct 2002 | B2 |
6466932 | Dennis et al. | Oct 2002 | B1 |
6473791 | Al-Ghosein et al. | Oct 2002 | B1 |
6477543 | Huang et al. | Nov 2002 | B1 |
6477575 | Koeppel et al. | Nov 2002 | B1 |
6484177 | Van Huben et al. | Nov 2002 | B1 |
6484261 | Wiegel | Nov 2002 | B1 |
6487594 | Bahlmann | Nov 2002 | B1 |
6510513 | Danieli | Jan 2003 | B1 |
6519647 | Howard et al. | Feb 2003 | B1 |
6530024 | Proctor | Mar 2003 | B1 |
6539375 | Kawasaki | Mar 2003 | B2 |
6542993 | Erfani | Apr 2003 | B1 |
6571247 | Danno et al. | May 2003 | B1 |
6574736 | Andrews | Jun 2003 | B1 |
6581054 | Bogrett | Jun 2003 | B1 |
6581071 | Gustman et al. | Jun 2003 | B1 |
6584454 | Hummel et al. | Jun 2003 | B1 |
6587849 | Mason et al. | Jul 2003 | B1 |
6587876 | Mahon et al. | Jul 2003 | B1 |
6615218 | Mandal et al. | Sep 2003 | B2 |
6618806 | Brown et al. | Sep 2003 | B1 |
6633538 | Tanaka et al. | Oct 2003 | B1 |
6654747 | Van Huben et al. | Nov 2003 | B1 |
6665677 | Wotring et al. | Dec 2003 | B1 |
6668354 | Chen et al. | Dec 2003 | B1 |
6671689 | Papierniak | Dec 2003 | B2 |
6684369 | Bernardo et al. | Jan 2004 | B1 |
6697805 | Choquier et al. | Feb 2004 | B1 |
6715077 | Vasudevan et al. | Mar 2004 | B1 |
6721888 | Liu et al. | Apr 2004 | B1 |
6728748 | Mangipudi et al. | Apr 2004 | B1 |
6732144 | Kizu et al. | May 2004 | B1 |
6735586 | Timmons | May 2004 | B2 |
6735701 | Jacobson | May 2004 | B1 |
6738789 | Multer et al. | May 2004 | B2 |
6751659 | Fenger et al. | Jun 2004 | B1 |
6754672 | McLauchlin | Jun 2004 | B1 |
6757698 | McBride et al. | Jun 2004 | B2 |
6757822 | Feiertag et al. | Jun 2004 | B1 |
6769095 | Brassard et al. | Jul 2004 | B1 |
6769118 | Garrison et al. | Jul 2004 | B2 |
6772332 | Boebert et al. | Aug 2004 | B1 |
6779002 | Mwaura | Aug 2004 | B1 |
6789202 | Ko et al. | Sep 2004 | B1 |
6792537 | Liu et al. | Sep 2004 | B1 |
6832313 | Parker | Dec 2004 | B1 |
6834284 | Acker et al. | Dec 2004 | B2 |
6854035 | Dunham et al. | Feb 2005 | B2 |
6856999 | Flanagin et al. | Feb 2005 | B2 |
6857012 | Sim et al. | Feb 2005 | B2 |
6865549 | Connor | Mar 2005 | B1 |
6873988 | Herrmann et al. | Mar 2005 | B2 |
6880005 | Bell et al. | Apr 2005 | B1 |
6889222 | Zhao | May 2005 | B1 |
6901403 | Bata et al. | May 2005 | B1 |
6904454 | Stickler | Jun 2005 | B2 |
6917975 | Griffin et al. | Jul 2005 | B2 |
6920457 | Pressmar | Jul 2005 | B2 |
6922695 | Skufca et al. | Jul 2005 | B2 |
6931549 | Ananda | Aug 2005 | B1 |
6934934 | Osborne, II et al. | Aug 2005 | B1 |
6957261 | Lortz | Oct 2005 | B2 |
6961897 | Peel et al. | Nov 2005 | B1 |
6965999 | Fox et al. | Nov 2005 | B2 |
6970445 | O'Neill et al. | Nov 2005 | B2 |
6970876 | Hotti et al. | Nov 2005 | B2 |
6978379 | Goh et al. | Dec 2005 | B1 |
6985915 | Somalwar et al. | Jan 2006 | B2 |
6988138 | Alcorn et al. | Jan 2006 | B1 |
7003578 | Kanada et al. | Feb 2006 | B2 |
7035879 | Shi et al. | Apr 2006 | B2 |
7035944 | Fletcher et al. | Apr 2006 | B2 |
7039176 | Borodow et al. | May 2006 | B2 |
7043685 | Azuma | May 2006 | B2 |
7047522 | Dixon, III et al. | May 2006 | B1 |
7051316 | Charisius et al. | May 2006 | B2 |
7054910 | Nordin et al. | May 2006 | B1 |
7062490 | Adya et al. | Jun 2006 | B2 |
7062511 | Poulsen | Jun 2006 | B1 |
7080000 | Cambridge | Jul 2006 | B1 |
7085755 | Bluhm et al. | Aug 2006 | B2 |
7089584 | Sharma | Aug 2006 | B1 |
7093200 | Schreiber et al. | Aug 2006 | B2 |
7093261 | Harper et al. | Aug 2006 | B1 |
7093283 | Chen et al. | Aug 2006 | B1 |
7111321 | Watts, Jr. et al. | Sep 2006 | B1 |
7124413 | Klemm et al. | Oct 2006 | B1 |
7134137 | Joshi et al. | Nov 2006 | B2 |
7174563 | Brownlie et al. | Feb 2007 | B1 |
7185010 | Morinville | Feb 2007 | B2 |
7185192 | Kahn | Feb 2007 | B1 |
7219140 | Marl et al. | May 2007 | B2 |
7251666 | Morinville | Jul 2007 | B2 |
7269664 | Hutsch et al. | Sep 2007 | B2 |
7272625 | Hannel et al. | Sep 2007 | B1 |
7591000 | Griffin | Sep 2009 | B2 |
7653930 | Griffin | Jan 2010 | B2 |
20010032128 | Kepecs | Oct 2001 | A1 |
20010034771 | Hutsch et al. | Oct 2001 | A1 |
20010039586 | Primak et al. | Nov 2001 | A1 |
20010044810 | Timmons | Nov 2001 | A1 |
20010047485 | Brown et al. | Nov 2001 | A1 |
20020005867 | Gvily | Jan 2002 | A1 |
20020010741 | Stewart et al. | Jan 2002 | A1 |
20020019827 | Shiman et al. | Feb 2002 | A1 |
20020023122 | Polizzi et al. | Feb 2002 | A1 |
20020029296 | Anuff et al. | Mar 2002 | A1 |
20020046099 | Frengut et al. | Apr 2002 | A1 |
20020059394 | Sanders | May 2002 | A1 |
20020062451 | Scheidt et al. | May 2002 | A1 |
20020067370 | Forney et al. | Jun 2002 | A1 |
20020069261 | Bellare et al. | Jun 2002 | A1 |
20020087571 | Stapel et al. | Jul 2002 | A1 |
20020103818 | Amberden | Aug 2002 | A1 |
20020104071 | Charisius et al. | Aug 2002 | A1 |
20020107913 | Rivera et al. | Aug 2002 | A1 |
20020107920 | Hotti | Aug 2002 | A1 |
20020111998 | Kim | Aug 2002 | A1 |
20020112171 | Ginter et al. | Aug 2002 | A1 |
20020120685 | Srivastava et al. | Aug 2002 | A1 |
20020123983 | Riley et al. | Sep 2002 | A1 |
20020124053 | Adams et al. | Sep 2002 | A1 |
20020135617 | Samid | Sep 2002 | A1 |
20020143819 | Han et al. | Oct 2002 | A1 |
20020147645 | Alao et al. | Oct 2002 | A1 |
20020147801 | Gullotta et al. | Oct 2002 | A1 |
20020152267 | Lennon | Oct 2002 | A1 |
20020152279 | Sollenberger et al. | Oct 2002 | A1 |
20020161903 | Besaw | Oct 2002 | A1 |
20020169893 | Chen et al. | Nov 2002 | A1 |
20020169975 | Good | Nov 2002 | A1 |
20020173971 | Stirpe et al. | Nov 2002 | A1 |
20020178119 | Griffin et al. | Nov 2002 | A1 |
20020188869 | Patrick | Dec 2002 | A1 |
20020194267 | Flesner et al. | Dec 2002 | A1 |
20030004982 | Brandon et al. | Jan 2003 | A1 |
20030014442 | Shiigi et al. | Jan 2003 | A1 |
20030032409 | Hutcheson et al. | Feb 2003 | A1 |
20030033356 | Tran | Feb 2003 | A1 |
20030046576 | High, Jr. et al. | Mar 2003 | A1 |
20030065721 | Roskind | Apr 2003 | A1 |
20030069874 | Hertzog et al. | Apr 2003 | A1 |
20030078959 | Yeung et al. | Apr 2003 | A1 |
20030078972 | Tapissier et al. | Apr 2003 | A1 |
20030088617 | Clark et al. | May 2003 | A1 |
20030110448 | Haut et al. | Jun 2003 | A1 |
20030115484 | Moriconi et al. | Jun 2003 | A1 |
20030120686 | Kim et al. | Jun 2003 | A1 |
20030126236 | Marl et al. | Jul 2003 | A1 |
20030126464 | McDaniel et al. | Jul 2003 | A1 |
20030126558 | Griffin | Jul 2003 | A1 |
20030131113 | Reeves et al. | Jul 2003 | A1 |
20030135490 | Barrett et al. | Jul 2003 | A1 |
20030140308 | Murthy et al. | Jul 2003 | A1 |
20030144389 | Andrews et al. | Jul 2003 | A1 |
20030145275 | Qian et al. | Jul 2003 | A1 |
20030146937 | Lee | Aug 2003 | A1 |
20030167315 | Chowdhry et al. | Sep 2003 | A1 |
20030167455 | Iborra et al. | Sep 2003 | A1 |
20030177389 | Albert et al. | Sep 2003 | A1 |
20030182577 | Mocek | Sep 2003 | A1 |
20030187956 | Belt et al. | Oct 2003 | A1 |
20030200350 | Kumar et al. | Oct 2003 | A1 |
20030204481 | Lau | Oct 2003 | A1 |
20030212766 | Giles et al. | Nov 2003 | A1 |
20030216938 | Shour | Nov 2003 | A1 |
20030220913 | Doganata et al. | Nov 2003 | A1 |
20030220963 | Golovinsky et al. | Nov 2003 | A1 |
20030229501 | Copeland et al. | Dec 2003 | A1 |
20030229623 | Chang et al. | Dec 2003 | A1 |
20040003071 | Mathew et al. | Jan 2004 | A1 |
20040010719 | Daenen | Jan 2004 | A1 |
20040019494 | Ridgeway et al. | Jan 2004 | A1 |
20040019650 | Auvenshine | Jan 2004 | A1 |
20040024812 | Park et al. | Feb 2004 | A1 |
20040030744 | Rubin et al. | Feb 2004 | A1 |
20040030746 | Kavacheri et al. | Feb 2004 | A1 |
20040030795 | Hesmer et al. | Feb 2004 | A1 |
20040078371 | Worrall et al. | Apr 2004 | A1 |
20040098467 | Dewey et al. | May 2004 | A1 |
20040098606 | Tan et al. | May 2004 | A1 |
20040107360 | Herrmann et al. | Jun 2004 | A1 |
20040162733 | Griffin | Aug 2004 | A1 |
20040162905 | Griffin et al. | Aug 2004 | A1 |
20040162906 | Griffin et al. | Aug 2004 | A1 |
20040167880 | Smith | Aug 2004 | A1 |
20040167899 | Patadia et al. | Aug 2004 | A1 |
20040205473 | Fisher et al. | Oct 2004 | A1 |
20040205557 | Bahrs et al. | Oct 2004 | A1 |
20040215650 | Shaji et al. | Oct 2004 | A1 |
20040230546 | Rogers | Nov 2004 | A1 |
20040236760 | Arkeketa et al. | Nov 2004 | A1 |
20040243824 | Jones | Dec 2004 | A1 |
20050021502 | Chen et al. | Jan 2005 | A1 |
20050021656 | Callegari | Jan 2005 | A1 |
20050050184 | Boden et al. | Mar 2005 | A1 |
20050060324 | Johnson et al. | Mar 2005 | A1 |
20050086206 | Balasubramanian et al. | Apr 2005 | A1 |
20050097008 | Ehring et al. | May 2005 | A1 |
20050138411 | Griffin et al. | Jun 2005 | A1 |
20050138412 | Griffin et al. | Jun 2005 | A1 |
20050188295 | Konkus et al. | Aug 2005 | A1 |
20050198617 | Kim et al. | Sep 2005 | A1 |
20050256894 | Talanis et al. | Nov 2005 | A1 |
20050257267 | Williams et al. | Nov 2005 | A1 |
20060005150 | Pankovcin | Jan 2006 | A1 |
20060059107 | Elmore et al. | Mar 2006 | A1 |
20060085412 | Johnson et al. | Apr 2006 | A1 |
20060085836 | Lyons, Jr. et al. | Apr 2006 | A1 |
20060122882 | Brown et al. | Jun 2006 | A1 |
20060167858 | Dennis et al. | Jul 2006 | A1 |
20060173999 | Rider et al. | Aug 2006 | A1 |
20060225123 | Childress et al. | Oct 2006 | A1 |
20060277594 | Chiavegatto, Jr. et al. | Dec 2006 | A1 |
20070083484 | McVeigh et al. | Apr 2007 | A1 |
20070294743 | Kaler et al. | Dec 2007 | A1 |
Number | Date | Country |
---|---|---|
1 256 889 | Nov 2002 | EP |
WO 0038078 | Jun 2000 | WO |
WO 0114962 | Mar 2001 | WO |
WO 0167285 | Sep 2001 | WO |
WO 2004074993 | Sep 2004 | WO |
WO 2004074994 | Sep 2004 | WO |
WO 2004074998 | Sep 2004 | WO |
Number | Date | Country | |
---|---|---|---|
20100037290 A1 | Feb 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10367177 | Feb 2003 | US |
Child | 12536183 | US |