Method and apparatus for automatic loading of a data set in a node of a communication network

• US 4,847,830 A
• Filed: 12/02/1987
• Issued: 07/11/1989
• Est. Priority Date: 12/02/1987
• Status: Expired due to Term

• Current Assignee: Network Equipment Technologies Incorporated (Ribbon Communications, Inc.)
• Original Assignee: Network Equipment Technologies Incorporated (Ribbon Communications, Inc.)
• Inventors: Momirov, Milan
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Chin, Wellington
• Application Number:
  US07/127,798
• Time in Patent Office: 587 Days
• Field of Search: 370/60, 370/85, 370/86, 370/88, 370/90, 370/92, 370/94, 370/96, 340/825.07, 340/825.08, 340/825.3, 340/825.52, 340/825.53, 340/825.54, 340/825.5, 364/131, 364/133, 364/184, 364/187, 371/7, 371/11, 371/12, 371/13
• US Class Current: 370/400
• CPC Class Codes: G06F 8/65 Updates security arrangements therefor G06F21/57
• CPC Class Codes: H04L 41/00 Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: H04Q 2213/1305 Software aspects
• CPC Class Codes: H04Q 2213/13109 Initializing, personal profile
• CPC Class Codes: H04Q 2213/13376 Information service, downloading of information, 0800/0900 services
• CPC Class Codes: H04Q 3/54516 Initialization, software or data downloading G06F9/445 takes precedence

Abstract

In a communication network, including a first node and a plurality of neighbor nodes that are linked by communication channels to the first node, a data set is retrieved from neighbor nodes according to the following process:

1. identifying the data set to be retrieved in the first node;

2. identifying neighbor nodes in the plurality that have a copy of the identified data set;

3. supplying requests for individual blocks in the data set across the communication channels essentially in parallel to the identified neighbor nodes;

4. receiving the individual blocks as the individual blocks are returned from the neighbor nodes; and

5. assemblying data set in the first node from the received individual blocks.

Claims

1. In a communications network including a first node and plurality of neighbor nodes linked by communications channels to the first node, a method for retrieving a data set including a number M blocks of data to the first node from the plurality of neighbor nodes comprising:

identifying the data set to be retrieved in the first node;

identifying neighbor nodes in the plurality that have a copy of the identified data set;

supplying requests for individual blocks in the data set across communications channels essentially in parallel to the identified neighbor nodes;

receiving the individual blocks as the individual blocks are returned from the neighbor nodes, and

assembling the data set in the first node from the received individual blocks.

2. The method of claim 1, further including after receiving an individual block from a given neighbor:

identifying blocks yet to be requested or received, if any; and

supplying a request for a block yet to be requested or received to the given neighbor.

3. The method of claim 1, further including after receiving a plurality of individual blocks from given neighbors:

identifying blocks yet to be requested or received, if any; and

supplying requests for blocks yet to be requested or received in parallel to the given neighbors.

4. The method of claim 1, wherein the step of identifying the data set includes:

providing a user-programmable resource for identifying the data set, and

reading the user-programmable resource.

5. The method of claim 4, wherein the data set is a pre-specified facility having versions, and the data set is identified by version.

6. The method of claim 4, wherein the data set is a pre-specified facility having versions, and the data set is identified by version and the step of identifying the data set includes:

providing a user-programmable resource for specifying a desired version,

reading the user-programmable resource, and if the user has specified a desired version, then selecting the desired version as the data set to be retrieved, and

if the user has not specified a desired version, then determining a preferred version from among the versions in the neighbor nodes and selecting the preferred version as the data set to be retrieved.

7. The method of claim 6, further including:

if after selecting the desired version as the data set to be retrieved, no neighbors are identified having the desired version, then determining a preferred version from among the versions in the neighbor nodes and selecting the preferred version as the data set to be retrieved.

8. The method of claim 1, wherein the data set is a pre-specified facility having versions, and the data set is identified by version and the step of identifying the data set includes:

determining a preferred version from among the versions in the neighbor nodes and selecting the preferred version as the data set to be retrieved.

9. The method of claim 1, wherein at least one individual block includes a header field indicating the number of blocks in the data set, and further including:

determining the number of blocks in the data set to be requested from the header field in the at least one individual block after it is received.

10. The method of claim 1, further including:

relating individual blocks in the data set to a status of "not requested," "requested from given neighbor," or "received"; and

wherein

the step of supplying requests is responsive to the status of individual blocks to supply requests for blocks having a status of "not requested" to respective available ones of the identified neighbors, available neighbors being neighbors having the identified data set and not related to blocks having a status of "requested from given neighbor."

11. The method of claim 10, wherein the step of relating includes indicating elapsed time since an individual block has been requested from a given neighbor, and the method further includes:

changing the status of blocks having "requested from given neighbor" status for which the elapsed time exceeds a threshold to "not requested."

12. The method of claim 10, wherein at least one individual block includes a header field indicating the number of blocks in the data set, and further including:

determining the number M of blocks in the data set to be requested from the header field in the at least one individual block after it is received; and

detecting when the M blocks have the "received" status.

13. For a communications network including a first node and plurality of neighbor nodes linked by communications channels to the first node, an apparatus in the first node for retrieving a data set including a number M blocks of data to the first node from the plurality of neighbor nodes, comprising:

means for identifying the data set to be retrieved;

means, in communication with the means for identifying the data set, for identifying neighbor nodes in the plurality that have a copy of the identified data set;

means, in communication with the means for identifying neighbor nodes and coupled to the communications channels, for supplying requests for individual blocks in the data set across communications channels essentially in parallel to the identified neighbor nodes;

means, coupled to the communications channels, for receiving the individual blocks as the individual blocks are returned from the neighbor nodes; and

means, in communication with the means for receiving, for assembling the data set in the first node from the received individual blocks.

14. For a communications network including a first node and a plurality of neighbor nodes linked by communications channels to the first node, an apparatus in the first node for retrieving a data set including a number M blocks of data to the first node from the plurality of neighbor nodes, comprising:

port means, coupled to the communications channels, for porting communications to and from the first node;

storage means for storing node software;

memory means for storing data for read and write access;

processing means, coupled to the storage means, to the memory means and to the port means and responsive to the node software, for running node functions, including

means for identifying the data set to be retrieved,

means for identifying neighbor nodes having the identified data set and linked by a working communications channel to the first node,

means for supplying requests for individual blocks of the data set to a plurality of the identified neighbors essentially in parallel through the port means,

means for receiving the individual blocks through the port means as the individual blocks are returned from the neighbor nodes, and

means for assembling the data set in the memory mean from the received individual blocks.

15. The apparatus of claim 14, wherein the data set is a pre-specified facility having versions, and the data set is identified by version, further including:

user interface means, coupled to the processing means and the memory means, for supplying user-specified data to the memory means; and

wherein

the means for identifying the data set includes

means for reading the user-specified data from the memory means, and if the user has specified a desired version, the selecting the desired version as the data set to be retrieved, and if the user has not specified a desired version, then determining a preferred version from among the versions in the neighbor nodes and selecting the preferred version as the data set to be retrieved.

16. The apparatus of claim 14, wherein the data set is a pre-specified facility having versions, and the data set is identified by version, wherein the means for identifying the data set to be retrieved includes:

means for determining a preferred version from among the versions in the neighbor nodes and selecting the preferred version as the data set to be retrieved.

17. The apparatus of claim 14, wherein the processing means further includes:

means for relating individual blocks in the data set to a status of "not requested," "requested from given neighbor," or "received"; and

wherein

the means for supplying requests is responsive to the means for relating to supply requests for blocks having a status of "not requested" to respective available neighbors of the identified neighbors, available neighbors being neighbors linked by a working communication channel to the first node, having the identified data set and not related to blocks having a status of "requested from given neighbor."

18. The apparatus of claim 17, wherein the means for relating including means for indicating elapsed time since an individual block has been requested from a given neighbor, and the processing means further includes:

means for changing the status of blocks "requested from given neighbor" for which the elapsed time exceeds a threshold to "not requested," and

means for updating the identified neighbor nodes having the identified data set and linked by a working communications channel to the first node.

19. The apparatus of claim 17, wherein at least one individual block includes a header field indicating the number M of blocks in the data set, and the processing means further includes:

means for determining the number M of blocks in the data set to be requested from the header field in the at least one individual block after it is received; and

means for detecting when the M blocks have the "received" status.

20. The apparatus of claim 14, wherein at least one individual block includes a header field indicating the number of blocks in the data set, and the processing means further includes:

means for determining the number of blocks in the data set to be requested from the header field in the at least one individual block after it is received.

21. The apparatus of claim 14, wherein the node software is adapted for initializing the node.

22. The apparatus of claim 15, wherein the node software is adapted for initializing the node and the pre-specified facility is communication network management software.

23. The apparatus of claim 16, wherein the node software is adapted for initializing the node and the pre-specified facility is communication network management software.