Handling un-partitioning of a computer network
View Patent ↗A system and method for handling un-partitioning of a computer network are disclosed. Routing information may be stored on a first node in the network when the network is partitioned into a first group of nodes and a second group of nodes, where the first node is in the first group of nodes. Storing the routing information on the first node may include storing information usable to route messages to nodes in the first group of nodes. A technique for determining when the second group of nodes has become un-partitioned from the first group of nodes (i.e., for determining when the partition has been repaired) may be employed. In response to determining that the second group of nodes has become un-partitioned from the first group of nodes, the routing information on the first node may be modified. Modifying the routing information on the first node may include storing information useable to route messages to nodes in the second group of nodes.
1. A method for determining when a network becomes unpartitioned, the method comprising:
assigning a value to each node in the network using a computer, in response to the detection of a failure of a link that enables communication between nodes, such that all nodes in a given group of nodes are assigned the same value, wherein the network is partitioned into a first group of nodes and a second group of nodes,
each node in the first group of nodes is assigned a first value,
each node in the second group of nodes is assigned a second value, and
the first value is different than the second value;
determining that a new link has been added to the network using the computer, wherein the link enables a first node to communicate with a second node;
comparing the value assigned to the first node to the value assigned to the second node using the computer; and
determining that the value assigned to the first node is different than the value assigned to the second node using the computer, wherein
said determining that the value assigned to the first node is different than the value assigned to the second node indicates that the network has become unpartitioned.
2. The method of claim 1 , wherein said assigning a value to each node in the network is performed in response to detecting that the network has become partitioned into the first group of nodes and the second group of nodes.
3. The method of claim 1 , further comprising:
modifying routing information stored on one or more nodes in the network in response to determining that the network has become un-partitioned.
4. The method of claim 1 , further comprising one of:
assigning the first value to each node in the second group of nodes after determining that the network has become un-partitioned; or
assigning the second value to each node in the first group of nodes after determining that the network has become un-partitioned.
5. The method of claim 1 , wherein said assigning a value to each node in the network is performed using a technique that guarantees that each node in the same group is assigned the same value.
6. The method of claim 5 , further comprising:
utilizing Lamport Logical Clock readings to ensure that each node in the same group is assigned the same value.
7. The method of claim 1 , wherein said assigning a value to each node in the network is performed using a technique that guarantees that the first value assigned to nodes in the first group of nodes is different than the second value assigned to nodes in the second group of nodes.
8. The method of claim 1 , further comprising:
assigning an undefined value to each node in the network before the network is partitioned into the first group of nodes and the second group of nodes.
9. A non-transitory computer-readable memory medium comprising program instructions executable to:
assign a value to each node in a network in response to the detection of a failure of a link that enables communication between nodes, such that all nodes in a given group of nodes are assigned the same value, wherein
the network is partitioned into a first group of nodes and a second group of nodes,
each node in the first group of nodes is assigned a first value,
each node in the second group of nodes is assigned a second value, and
the first value is different than the second value;
determine that a new link has been added to the network, wherein
the link enables a first node to communicate with a second node;
compare the value assigned to the first node to the value assigned to the second node; and
determine that the value assigned to the first node is different than the value assigned to the second node, wherein
said determining that the value assigned to the first node is different than the value assigned to the second node indicates that the network has become unpartitioned.
10. The computer-readable memory medium of claim 9 , wherein said assigning a value to each node in the network is performed in response to detecting that the network has become partitioned into the first group of nodes and the second group of nodes.
11. The computer-readable memory medium of claim 9 , wherein the program instructions are further executable to:
modify routing information stored on one or more nodes in the network in response to determining that the network has become un-partitioned.
12. The computer-readable memory medium of claim 9 , wherein the program instructions are further executable to perform one of:
assigning the first value to each node in the second group of nodes after determining that the network has become un-partitioned; or
assigning the second value to each node in the first group of nodes after determining that the network has become un-partitioned.
13. The computer-readable memory medium of claim 9 , wherein the program instructions are further executable to:
assign an undefined value to each node in the network before the network is partitioned into the first group of nodes and the second group of nodes.
14. A system comprising:
a plurality of nodes in a network;
wherein the plurality of nodes execute program instructions to:
assign a value to each node in the network in response to the detection of a failure of a link that enables communication between nodes, such that all nodes in a given group of nodes are assigned the same value, wherein
the network is partitioned into a first group of nodes and a second group of nodes,
each node in the first group of nodes is assigned a first value,
each node in the second group of nodes is assigned a second value, and
the first value is different than the second value;
determine that a new link has been added to the network, wherein
the link enables a first node to communicate with a second node;
compare the value assigned to the first node to the value assigned to the second node; and
determine that the value assigned to the first node is different than the value assigned to the second node, wherein
said determining that the value assigned to the first node is different than the value assigned to the second node indicates that the network has become unpartitioned.
15. The system of claim 14 , wherein said assigning a value to each node in the network is performed in response to detecting that the network has become partitioned into the first group of nodes and the second group of nodes.
16. The system of claim 14 , wherein the plurality of nodes further execute program instructions to:
modify routing information stored on one or more nodes in the network in response to determining that the network has become un-partitioned.
17. The system of claim 14 , wherein the plurality of nodes further execute program instructions to perform one of:
assigning the first value to each node in the second group of nodes after determining that the network has become un-partitioned; or
assigning the second value to each node in the first group of nodes after determining that the network has become un-partitioned.
18. The system of claim 7 , wherein the plurality of nodes further execute program instructions to:
assign an undefined value to each node in the network before the network is partitioned into the first group of nodes and the second group of nodes.