International Business Machines Corporation

David Werner Bachmann

Lorin Ullmann

Puthukode G Ramachandran

Christopher Andrew Peters

Vijay Kumar Aggarwal

John Patrick Whitfield

Craig M Lawton

Raymond Paul Pekowski

Terry L Dunkle

Uzi Hardoon

Heather Maria Hinton

Shaw-Ben Shi

Patrick Ryan Wardrop

Yi-hsiu Wei

Rodolfo Augusto Mancisidor

Larry George Fichtner

Spencer James Ainsworth

Cynthia Fleming Corn

Nicholas George Harlow

Jayakumar Nagarajarao

James Dean Wade

A method, system, and computer usable program product for token caching in a trust chain processing are provided in the illustrative embodiments. An information in a token associated with a first request is mapped. A determination is made whether a requester of the first request has provided a constraint in the first request, the constraint concerning the token, the constraint forming a client constraint. The client constraint is stored. The information and the mapped information is stored, forming stored information. The token is received in a second request. The stored information is reused if the client constraint allows reusing the stored information. A further determination may be made whether a target system receiving the mapped information has provided a server constraint, the second constraint concerning the mapped information, the second constraint forming a server constraint. The stored information may be reused if the server constraint allows reusing the stored information.

Token caching in trust chain processing

A method for deleting entries from a directory in which directory information is stored in a set of database tables begins upon a request to delete a directory entry. In response, the directory entry is tagged, preferably by setting the entry's creation time to a null value. If a search query is received thereafter, the routine excludes tagged entries from search results that would otherwise satisfy the search query. Periodically, the routine searches for tagged entries, and references to the tagged entries are then deleted throughout the set of database tables. Thus, the inventive method defers entry deletions to enable directory queries to be processed even if deleted entries have not yet been fully expunged from the directory.

Method for deferred deletion of entries for a directory service backing store

Enabling automated provisioning on a data processing network includes providing the network with access to an automated provisioning controller. The controller enables a user to specify resource allocation priorities and uses the user-specified priorities, in conjunction with a resource stabilization policy, to resolve conflicting resource requests. The resource allocation priorities include priorities for demand-based resource requests and maintenance-based resource requests. The stabilization policy includes a policy for constraining allocation of a resource based on forecasted demand and a policy for constraining allocation of a resource based on a scheduled maintenance task.

Enabling user control over automated provisioning environment

A method and software for fulfilling a resource request in a data processing network includes specifying characteristics of the requested resource responsive to detecting the resource request. A set of attributes is then derived from the specified characteristics. The specified characteristics indicate broad or general properties of the needed resource while the derived attributes preferably indicate the hardware and software components of a resource ideally suited to fulfill the resource request. Attribute information associated an available resource is then evaluated against the attributes derived from the specified characteristics. An available resource is then selected, based on the evaluation, to satisfy the resource request. The attributes of the selected resource best match the attributes derived from the specified characteristics. The requested resource may be a server resource and specifying the characteristics of the requested resource may includes specifying a server type from a constrained set of server types.

Provisioning manager for optimizing selection of available resources

A client process resides on a host computer within a distributed data processing system, and the client process requests a remote procedure call for a service procedure. A binding handle of a server process is obtained; a determination is made as to whether the binding handle of the server process points to the client process; and in response to a determination that the binding handle of the server process points to the client process, a positive indication is generated that the service procedure is provided by the client process. In response to a determination that the service procedure is provided by the client process, the service procedure is called using a local procedure call after obtaining a local address for the function within the client process by looking up the service procedure in an interface registry.

Method and system for converting a remote procedure call to a local procedure call when the service is on the same device as the calling client

A method of hierarchical LDAP searching in an LDAP directory service having a relational database management system (DBMS) as a backing store. According to the invention, entries in a naming hierarchy are mapped into first and second relational tables: a parent table, and a descendant table. These tables are used to 'filter' lists of entries returned from a search to ensure that only entries within a given search scope are retained for evaluation. Thus, for example, the parent table is used during an LDAP one level search, and the descendant table is used during an LDAP subtree search. In either case, use of the parent or descendant table obviates recursive queries through the naming directory.

Method of hierarchical LDAP searching with relational tables

Growing community of inventors

Leander, TX, United States of America

David Werner Bachmann