HP-UX Directory Server 8.1 deployment guide

Performing search requests using chaining The problem of replicating client entries across
servers is resolved using chaining. On a chained system, the search request would occur as
follows:
Figure 5-12 Sending a client request to a server using chaining
In the illustration above, the following steps are performed:
1. The client application binds with Server A, and Server A tries to confirm that the user name
and password are correct.
2. Server A does not contain an entry corresponding to the client application. Instead, it contains
a database link to Server B, which contains the actual entry of the client. Server A sends a
bind request to Server B.
3. Server B sends an acceptance response to Server A.
4. Server A then processes the client application's request using the database link. The database
link contacts a remote data store located on Server B to process the search operation.
In a chained system, the entry corresponding to the client application does not need to be located
on the same server as the data the client requests. For example, a system could be set up as
follows:
Figure 5-13 Authenticating a client and retrieving data using different servers
In this illustration, the following steps are performed:
5.3 About knowledge references 69