Methods for ensuring safe component removal
The invention includes a method for determining whether a node in a non-recursive network can be removed. The method includes the steps of executing a reachability algorithm for a resource of a system upon initialization of the system. The resource is accessible to the system upon the initialization. A safe to pull manager evaluates the reachability algorithm for each node situated on the network to determine whether the node can be removed without interrupting resource accessibility to the system.
1 . A method for determining whether a node in a plurality of nodes in a network can be removed comprising:
(a) executing a reachability algorithm for a resource of a system upon initialization of the system, wherein the resource is accessible to the system upon the initialization; and
(b) evaluating, by a safe to pull manager and for each node of the plurality of nodes situated on the network between the resource and the system, the reachability algorithm to determine whether the node can be removed without interrupting resource accessibility to the system.
2 . The method of claim 1 further comprising updating the reachability algorithm when the network is updated.
3 . The method of claim 2 wherein the updating of the network further comprises at least one of adding a new node, removing a node, and recognizing a node failure.
4 . The method of claim 1 further comprising signaling when at least one of the node can be removed from the network and when the node is unsafe to remove from the network.
5 . The method of claim 4 wherein the signaling further comprises using a first indicator when a node is unsafe to remove and using a second indicator when a node is safe to remove.
6 . The method of claim 1 wherein the step of evaluating of whether the node can be removed comprises determining at least one of whether the node is a root node and whether a threshold number of parent nodes exists for the node.
7 . The method of claim 1 wherein the evaluating of whether the node can be removed comprises simulating a failure of the node.
8 . The method of claim 7 wherein the simulating of the failure of the node comprises setting a variable in the reachability algorithm that corresponds with the node to a predetermined threshold or number.
9 . A network comprising:
(a) a computer system comprising a safe to pull manager;
(b) a resource in communication with the computer system upon initialization of the system; and
(c) a plurality of nodes connected between the resource and the system, wherein the safe to pull manager executes a reachability algorithm for the resource and for each node in the plurality of nodes to determine whether a node can be removed without interrupting resource communication with the system.
10 . The network of claim 9 wherein the plurality of nodes represent devices.
11 . The network of claim 9 wherein the computer system executes a program that can access the resource.
12 . The network of claim 9 wherein the determination of whether the node can be removed further comprises simulating a failure of the node in the reachability expression.
13 . The network of claim 9 wherein each node in the plurality of nodes is a computer node.
14 . The network of claim 9 wherein the system is a power grid system.
15 . The network of claim 14 wherein the plurality of nodes represent a plurality of power sinks.
16 . The network of claim 9 wherein the system is a telephone system.
17 . The network of claim 16 wherein the plurality of nodes represent a plurality of telephone transceivers.
18 . The network of claim 9 wherein the resource further comprises at least one of a disk volume, a network adapter, a physical disk, a program, and a network.
19 . The network of claim 9 wherein the node further comprises a disk mirror, a SCSI adapter, a disk, a central processing unit, an input/output board, and a network interface card.