Locating mobile objects in a distributed computer system

• US 5,325,524 A
• Filed: 04/06/1992
• Issued: 06/28/1994
• Est. Priority Date: 04/06/1989
• Status: Expired due to Fees

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Artsy, Yeshayahu, Black, Andrew P.
• Primary Examiner(s): Shaw, Gareth D.
• Assistant Examiner(s): KATBAB, ABDOLLAH
• Application Number:
  US07/864,371
• Time in Patent Office: 813 Days
• Field of Search: 364/DIG. 1, 364/241.1, 364/242.94
• US Class Current: 1/1
• CPC Class Codes: G06F 2209/462 Lookup
• CPC Class Codes: G06F 9/465 Distributed object oriented systems remote method invocation [RMI] G06F9/548
• CPC Class Codes: G06F 9/548 Object oriented; Remote method invocation [RMI] non-remote method invocation G06F9/449
• CPC Class Codes: H04L 61/4553 Object oriented directories, e.g. common object request broker architecture [CORBA] name server
• CPC Class Codes: H04L 67/133 Protocols for remote procedure calls [RPC]
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing

Abstract

A system and method are disclosed for locating mobile objects in a distributed network having a large number of nodes connected by a communication network, each object supported by a stable storage server. The system uses either a two level or three level method to provide reliable and economical location of objects. The levels are increasingly expensive, but increasingly reliable. In the first level, address descriptors or forwarding addresses are used to retrace the mobile object'"'"'s movements from node to node, each node ideally having an address descriptor indicating the location of the next node to which the object moved. If this strategy fails, the second level (which is more expensive and more reliable than the first) is used and includes accessing stable storage to find a current address descriptor for the object. If the object still cannot be located, the most expensive and most reliable level is used, i.e., a universal name service.

Claims

1. In a system comprising a distributed plurality of computer nodes linked by a communication medium, wherein the system includes objects located on nodes and wherein each of said objects is supported by one or more stable storage servers, a method for invoking an object comprising the following steps, each step being performed with reference to one of the nodes, referred to (in the context of said step) as the current node:

(a) first generating, at an invoking node, an invocation directed to the object, the invoking node being the current node;

(b) thereafter performing the invocation if the object is located at the current node and otherwise proceeding to step (c);

(c) determining if the current node has an address descriptor for the object;

if so and if either (i) the current node'"'"'s address descriptor is newer than the address descriptor used to select this as the current node for this step (c) or (ii) no address descriptor was used to select this as the current node for this step (c), proceeding to step (d);

otherwise, proceeding to step (e);

(d) sending the invocation to the node identified in the address descriptor, the identified node becoming the current node, and proceeding to step (b);

(e) attempting to locate an address descriptor corresponding to the object in a first stable storage server supporting the object;

(f) then sending the invocation to the node identified in the address descriptor, if one was located in the step performed before this step is performed, the identified node becoming the current node; and

then

(g) if the object is located at the current node, performing the invocation, and otherwise, proceeding to step (c).

2. The method of claim 1 wherein step (e) further comprises the step of attempting to locate an address descriptor corresponding to the object stored in a second stable storage server supporting the object if the first stable storage server does not contain an address descriptor corresponding to the object, and then proceeding to step (f) if an address descriptor is located.

3. The method of claim 2 further comprising the step of:

(h) placing on the first stable storage server a pointer to the second stable storage server every time an object is moved from the first storage server to the second storage server.

4. The method of claim 3 wherein said first stable storage server maintains each pointer for at least a predetermined period of time.

5. The method of claim 3 wherein the system further includes a universal name service for storing attributes for uniquely named entities and wherein every object has a unique name, the method of claim 3 wherein step (e) further comprises the step of determining the location of the object through the universal name service if the first stable storage server does not contain either an address descriptor for the object or a pointer to a different stable storage server for the object.

6. The method of claim 5 wherein the universal name service provides the location of a stable storage server that has an address descriptor for the object.

7. The method of claim 1 wherein the address descriptors are temporal address descriptors.

8. The method of claim 7 wherein each temporal address descriptor has an age determined by the number of times its associated object has moved from one node to another node.

9. The method of claim 1 wherein steps (b) and (g) further comprise returning any results of the invocation to the invoking node.

10. The method of claim 1 wherein steps (b) and (g) further comprise returning an address descriptor to the invoking node if the object is located at the current node and the current node is not the invoking node.

11. The method of claim 1 wherein if one of the objects moves from a first node to a second node, a message is sent by one of the two nodes to the stable storage server supporting said one of the objects indicating the address of said second node.

12. The method of claim 1 wherein step (g) further comprises:

if the current node (identified in the address descriptor located in the first stable storage server) does not contain the object, attempting to locate an address descriptor corresponding to the object in a stable storage server and if one is found proceeding to step (f).

13. The method of claim 12 wherein in step (g) the attempting to locate an address descriptor is directed to the second stable storage server.

14. The method of claim 13 wherein in step (g) the attempting to locate some address descriptor comprises the step of seeking in the first stable storage server a pointer to the second stable storage server.