DYNAMIC DIRECTORY SERVICE

• US 20080256090A1
• Filed: 06/23/2008
• Published: 10/16/2008
• Est. Priority Date: 11/22/1996
• Status: Abandoned Application

• Current Assignee: Google Inc. (Alphabet Inc.)
• Original Assignee: ManageSoft Corporation (Flexera Software LLC)
• Inventors: Dietterich, Daniel J., Abraham, William, Carter, John B., Phillips, Robert S., Frank, Steven J., Davis, Scott H.
• Application Number:
  US12/144,508
• Publication Number:
  US 20080256090A1
• Time in Patent Office: Days
• US Class Current: 707/10
• CPC Class Codes: G06F 11/0724 in a multiprocessor or a multi-core unit multiprocessors per se G06F15/80
• CPC Class Codes: G06F 11/0757 by exceeding a time limit, i.e. time-out, e.g. watchdogs
• CPC Class Codes: G06F 11/1425 by reconfiguration of node membership
• CPC Class Codes: G06F 11/1435 using file system or storage system metadata
• CPC Class Codes: G06F 11/1666 where the redundant component is memory or memory area
• CPC Class Codes: G06F 11/182 based on mutual exchange of the output between redundant processing components
• CPC Class Codes: G06F 11/2043 where the redundant components share a common memory address space
• CPC Class Codes: G06F 11/2094 Redundant storage or storage space G06F11/2056 takes precedence
• CPC Class Codes: G06F 12/0813 with a network or matrix configuration
• CPC Class Codes: G06F 12/1072 Decentralised address translation, e.g. in distributed shared memory systems
• CPC Class Codes: G06F 15/167 using a common memory, e.g. mailbox
• CPC Class Codes: G06F 16/9574 of access to content, e.g. by caching
• CPC Class Codes: G06F 9/5016 the resource being the memory
• CPC Class Codes: G06Q 30/0641 Shopping interfaces
• CPC Class Codes: H04L 67/00 Network arrangements or protocols for supporting network services or applications user-to-user messaging H04L51/00; network arrangements, protocols or services for supporting real-time applications in data packet communications networks H04L65/00
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/75 Indicating network or usage conditions on the user display
• CPC Class Codes: H04L 69/24 : Negotiation of communication capabilities
• CPC Class Codes: H04L 69/329 : in the application layer [OSI layer 7]
• CPC Class Codes: H04L 69/40 : for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection management of faults, events, alarms or notifications in data switching networks H04L41/06
• CPC Class Codes: H04L 9/40 : Network security protocols
• CPC Class Codes: Y10S 707/966 : Distributed
• CPC Class Codes: Y10S 707/99943 : Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 : Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99953 : Recoverability

Abstract

In a network of computer nodes, a directory service provides both the physical location of directory information around the network and the directory information itself in a single data structure. This single data structure is distributed throughout the network, and continuously redistributed, so as to create a directory service that is both more flexible, and more robust, than prior art directory services.

Claims

1-10. -10. (canceled)

11. At least one computer-readable medium containing a set of executable instructions for causing programmable apparatus to perform a method of obtaining directory information, said method being operable on a plurality of nodes interconnected by a network, said method comprising the steps of:

providing a distributed directory service on the network by installing on each of the nodes a directory service program that allows directory parts to be selectively and dynamically migrated between ones of said plurality of nodes, without requiring restructuring the directory, storing on said plurality of nodes the directory that includes both the directory information and information about the location of the directory information on the network, such that said directory is not statically replicated to all nodes of said plurality of nodes; and

obtaining both the location information and the directory information by accessing the distributed directory service.

12. The at least one computer-readable medium of claim 11 wherein the directory service providing step further comprises the step of utilizing the directory service program on each of the plurality of nodes to replicate said directory parts.

13. The at least one computer-readable medium of claim 12 wherein the directory service providing step further comprises the step of utilizing the directory service program on each of the plurality of nodes to selectively and dynamically replicate said directory parts based on the number of accesses of the directory service by each of said nodes.

14. The at least one computer-readable medium of claim 12 wherein the directory service providing step further comprises the step of utilizing the directory service program on each of the plurality of nodes to selectively and dynamically replicate said directory parts based on available resources on the network.

15. The at least one computer-readable medium of claim 11 wherein the distributed directory service providing step further comprises the step of utilizing the directory service program on each of the plurality of nodes to selectively and dynamically migrate said directory parts based on the number of accesses of the distributed directory service by the nodes.

16. The at least one computer-readable medium of claim 11 wherein the distributed directory service providing step further comprises the step of utilizing the directory service program on each of the plurality of nodes to selectively and dynamically migrate said directory parts based on available resources on the network.