Directory Algorithm for Communication Peer Networks
Original Publication Date: 1989-Mar-01
Included in the Prior Art Database: 2005-Jan-27
A technique is described for improving the performance of the directory services function in a computer network. Two concepts (resource update broadcast and limited search) are used to reduce the likelihood that a full search of the network must be performed in order to locate a resource in the network. The function of directory services in a network is to obtain information about resources without prior knowledge of their location in the network. A typical implementation of this function consists of a single directory component in each node which resolves queries for all subsystems and applications residing in that node. The directory component manages a database of information about locally owned resources and, possibly, some information about non-local resources.