Master node selection in clustered node configurations
First Claim
1. A method for selecting master nodes to manage a target node group in a computer network having multiple nodes and node groups, the method comprising:
- determining a hamming distance for node pairs within the network, each of the node pairs having two node pair members and the hamming distance being the number of node groups the node pair members do not share in common;
determining a participation index for nodes within the network, the participation index being the number of node groups a node belongs to;
determining an availability potential for the node pairs, the availability potential being the sum of the participation indexes of the node pair members subtracted by the hamming distance of the node pair;
finding an optimal combination of node pairs, the optimal combination of node pairs having a maximum total availability potential for the network;
selecting a master node pair for the target node group, the master node pair being the node pair from the optimal combination of node pairs having both node pair members belonging to the target node group; and
if the master node pair does not exist for the target node group, selecting a master node for the target node group, the master node being the node belonging to the target node group.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and system for selecting master nodes to manage a target node group in a computer network having multiple nodes and overlapping node groups. The system includes determining a hamming distance for node pairs within the network. The node pair includes two node pair members and the hamming distance is the number of node groups the node pair members do not share in common. A participation index for nodes within the network is determined at a determining operation. The participation index is the number of node groups the node belongs to. An availability potential for node pairs is also determined. The availability potential is the sum of the participation indexes of the node pair members subtracted by the hamming distance of the node pair. An optimal combination of node pairs is found by searching for the maximum total availability potential for the network. A master node pair for the target node group is selected from the optimal combination of node pairs. If a master node pair does not exist for the target node group, a master node belonging to the target node group is selected for the target group.
-
Citations
29 Claims
-
1. A method for selecting master nodes to manage a target node group in a computer network having multiple nodes and node groups, the method comprising:
-
determining a hamming distance for node pairs within the network, each of the node pairs having two node pair members and the hamming distance being the number of node groups the node pair members do not share in common;
determining a participation index for nodes within the network, the participation index being the number of node groups a node belongs to;
determining an availability potential for the node pairs, the availability potential being the sum of the participation indexes of the node pair members subtracted by the hamming distance of the node pair;
finding an optimal combination of node pairs, the optimal combination of node pairs having a maximum total availability potential for the network;
selecting a master node pair for the target node group, the master node pair being the node pair from the optimal combination of node pairs having both node pair members belonging to the target node group; and
if the master node pair does not exist for the target node group, selecting a master node for the target node group, the master node being the node belonging to the target node group. - View Dependent Claims (2, 3, 4, 5)
-
-
6. In a computer-readable medium having stored thereon a data structure for use in selecting master nodes to manage a target node group in a computer network having multiple nodes and overlapping node groups, the data structure comprising:
-
a hamming distance array containing, for node pairs in the network, the number of node groups node pair members do not share in common;
a participation index array containing, for nodes in the network, the number of node groups the node belongs to; and
an availability potential array containing, for node pairs in the network, the sum of the participation indexes of the node pair members subtracted by the hamming distance of the node pair. - View Dependent Claims (7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A computer program product embodied in a computer storage media comprising:
-
computer readable program codes coupled to the computer storage media for selecting master nodes to manage a target node group in a computer network having multiple nodes and node groups, the computer readable program codes comprising;
first computer readable program code configured to cause the program to determine a hamming distance for node pairs within the network, the node pair having two node pair members and the hamming distance being the number of node groups the node pair members do not share in common;
second computer readable program code configured to cause the program to determine a participation index for nodes within the network, the participation index being the number of node groups a node belongs to;
third computer readable program code configured to cause the program to determine an availability potential for each node pair, the availability potential being the sum of the participation indexes of the node pair members subtracted by the hamming distance of the node pair;
fourth computer readable program code configured to cause the program to find an optimal combination of node pairs, the optimal combination of node pairs having the maximum total availability potential for the network; and
fifth computer readable program code configured to cause the program to select a master node pair for the target node group, the master node pair being the node pair from the optimal combination of node pairs having both node pair members belonging to the target node group; and
if the master node pair does not exist for the target node group, sixth computer readable program code configured to cause the program to select a master node for the target node group, the master node being the node belonging to the target node group. - View Dependent Claims (17, 18, 19)
-
-
20. A system for selecting master nodes to manage a target node group in a computer network having multiple nodes and node groups, the system comprising:
-
a computer storage media having stored thereon the following, a hamming distance module for determining a hamming distance of node pairs within the network, each of the node pairs having two node pair members and the hamming distance being the number of node groups the node pair members do not share in common;
a participation index module for determining a participation index of nodes within the network, the participation index being the number of node groups a node belongs to;
an availability potential module for determining an availability potential of the node pairs, the availability potential being the sum of the participation indexes of the node pair members subtracted by the hamming distance of the node pair;
a search module for finding an optimal combination of node pairs, the optimal combination of node pairs having the maximum total availability potential for the network;
a first selection module for selecting a master node pair of the target node group, the master node pair being the node pair from the optimal combination of node pairs having both node pair members belonging to the target node group; and
a second selection module for selecting a master node for the target node group if the master node pair does not exist for the target node group, the master node being the node belonging to the target node group. - View Dependent Claims (21, 22, 23, 24)
-
-
25. A method for selecting master nodes to manage a target node group in a computer network having multiple nodes and node groups, the method comprising:
-
determining a hamming distance for node pairs within the network, each of the node pairs having two node pair members and the hamming distance being the number of node groups the node pair members do not share in common;
finding an optimal combination of node pairs, the optimal combination of node pairs having a minimum total hamming distance for the network;
selecting a master node pair for the target node group, the master node pair being the node pair from the optimal combination of node pairs having both node pair members belonging to the target node group; and
if the master node pair does not exist for the target node group, selecting a master node for the target node group, the master node being the node belonging to the target node group. - View Dependent Claims (26, 27, 28, 29)
-
Specification