Recovery of distributed hierarchical data access routing system upon detected failure of communication between nodes

• US 5,941,955 A
• Filed: 03/24/1997
• Issued: 08/24/1999
• Est. Priority Date: 08/12/1994
• Status: Expired due to Term

• Current Assignee: British Telecommunications PLC (BT Group PLC)
• Original Assignee: British Telecommunications PLC (BT Group PLC)
• Inventors: Wilby, Mark, Quintela, Maria Paula
• Primary Examiner(s): Maung, Zarni
• Assistant Examiner(s): CALDWELL, ANDREW T
• Application Number:
  US08/776,791
• Time in Patent Office: 883 Days
• Field of Search: 395/181, 395/182.01, 395/182.02, 395/200.68, 395/200.69, 395/200.72, 395/200.73, 370/254, 370/255, 370/256, 370/210, 370/211, 714/2, 714/3, 714/22, 709/238-239, 709/242-243, 707/10, 707/104, 707/202
• US Class Current: 709/242
• CPC Class Codes: H04Q 2213/13541 routing
• CPC Class Codes: H04Q 3/0029 Provisions for intelligent networking

Abstract

Data elements stored in a distributed data structure are accessible by means of a hierarchical routing network in which routes through the network to individual data elements are flagged. The network includes communicating links between nodes extending from a "root node" to a plurality of end nodes. The end nodes contain the data elements. To find a data element, a search message entering the network at an end node passes through the network towards the root node until it encounters a flagged route to the relevant data element. Thereafter it passes along the route to the end node containing the relevant data element. The invention is relevant to personal numbering services in a communications network. In this case, the data elements each comprise hardware addresses for users of the network. If a user moves in relation to the network, their hardware address will change and, in many cases, the relevant end node will also change. However, the flagged route consequently changes and the routing network therefore provides automatic tracing of the user. In the case of communication failure between a child and parent node, special system recovery techniques are used to establish a new parent node and to efficiently communicate the hierarchical change to other nodes as needed.

Claims

1. A recovery method for a data access system for accessing data elements stored in a distributed data structure, wherein the system comprises a hierarchy of nodes having communication links there between, the hierarchy extending from a root node to a plurality of end nodes, said plurality of end nodes providing the distributed data structure, and wherein routes through the hierarchy to specific data elements stored at the end nodes are identifiable by pointers stored in nodes along each route, and further wherein a request to access a specific data element triggers a search message which passes through the hierarchy from an end node towards the root node until it reaches a node having a pointer relevant to the specific data element, whereafter the search message is passed along the associated route to the end node containing the data element, said recovery method comprising the steps of:

(a) detecting a failure of part of the hierarchy affecting communication between at least one respective child node and respective parent node of the hierarchy;

(b) establishing a first further communication link between the child node and a further node, the further node then becoming a second respective parent node to the respective child node;

(c) establishing a second further communication link between the second parent node and the first parent node;

(d) instructing the first parent node to send messages destined for the child node to the second parent node from which node they are passed to the child node; and

(e) the second parent node periodically updating the other nodes of the hierarchy as to the new location of the child node in the hierarchy.

2. A method as in claim 1 wherein the data elements each comprise an address which identifies a data storage location in a data structure.

3. A method as in claim 1 wherein the data elements each comprise an address which identifies a location in a communications network.

4. A method as in claim 3 wherein:

receipt of the search message at the end node containing the data element triggers transmission of the data element to call control means in the communications network such that a connection can be established in the communications network to the location identified.

5. A method as in claim 1 wherein:

each pointer comprises an identifier associated with a data element stored at the relevant specific end node, together with a link indicator to indicate the next communication link on the route to the end node.

6. A method as in claim 1 wherein:

receipt of the search message at the end node containing the data element triggers downloading of the data element.

7. A method according to claim 1 further comprising the steps of:

loading a data element at any end node, and

responsive to the loading of a data elements, triggering consequential updating of the pointers stored in the nodes of the hierarchy.

8. A recovery method as in claim 1 embodied management method for a data access system in a communications network.

9. A method as in claim 8 used in providing a personal numbering service in the communications network.

10. A method as in claim 9 wherein:

each pointer along a route identifies a personal number for a specific network user, and

the data element located at the end node reached by a search message passed along that route comprises a hardware address for the specific network user in said communications network.

11. A recovery apparatus for a data access system accessing data elements stored in a distributed data structure, wherein the system comprises a hierarchy of nodes having communication links therebetween, the hierarchy extending from a root node to a plurality of end nodes, said plurality of end nodes providing the distributed data structure, and wherein routes through the hierarchy to specific data elements stored at the end nodes are identifiable by pointers stored in nodes along each route, and further wherein a request to access a specific data element triggers a search message which passes through the hierarchy from an end node towards the root node until it reaches a node having a pointer relevant to the specific data element, whereafter the search message is passed along the associated route to the end node containing the data element, said recovery apparatus comprising:

(a) means for detecting a failure of part of the hierarchy affecting communication between at least one respective child node and respective parent node of the hierarchy;

(b) means for establishing a first further communication link between the child node and a further node, the further node then becoming a second respective parent node to the respective child node;

(c) means for establishing a second further communication link between the second parent node and the first parent node;

(d) means for instructing the first parent node to send messages destined for the child node to the second parent node from which node they are passed to the child node; and

(e) means for causing the second parent node periodically updating the other nodes of the hierarchy as to the new location of the child node in the hierarchy.

12. Apparatus as in claim 11 wherein the data elements each comprise an address which identifies a data storage location in a data structure.

13. Apparatus as in claim 11 wherein the data elements each comprise an address which identifies a location in a communications network.

14. Apparatus as in claim 13 wherein:

receipt of the search message at the end node containing the data element triggers transmission of the data element to call control means in the communications network such that a connection can be established in the communications network to the location identified.

15. Apparatus as in claim 11 wherein:

each pointer comprises an identifier associated with a data element stored at the relevant specific end node, together with a link indicator to indicate the next communication link on the route to the end node.

16. Apparatus as in claim 11 wherein:

receipt of the search message at the end node containing the data element triggers downloading of the data element.

17. Apparatus as in claim 11 wherein means are provided for loading a data element at any end node, and pointer updating means are provided which are responsive to the loading of a data element to trigger consequential updating of the pointers are stored in the nodes of the hierarchy.

18. Apparatus as in claim 11 in combination with a management system for a data access system in a communications network.

19. Apparatus as in claim 18 arranged to provide a personal numbering service in the communications network.

20. Apparatus as in claim 19 wherein:

each pointer along a route identifies a personal number for a specific network user, and

the data element located at the end node reached by a search message passed along that route comprises a hardware address for the specific network user in said communications network.