Master node selection in clustered node configurations

一种用于选择主节点以管理一个具有多个节点和重叠节点组的计算机网络中的目标节点组的方法和系统。所述系统包括确定网络中节点对的汉明距离。所述节点对包括两个节点对成员并且所述汉明距离是节点对成员未共同共享的节点组的数目。在一确定操作中确定网络中节点的参与指数。所述参与指数是节点所属于的节点组的数目。还确定节点对的可用性潜力。所述可用性潜力是节点对成员的参与指数之和减去节点对的汉明距离。通过搜索网络的最大总可用性潜力来寻找节点对的最佳组合。从该节点对的最佳组合选择目标节点组的主节点对。如果目标节点组的主节点对不存在,将为该目标节点组选择一个属于目标节点组的主节点。 A method and syste...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: SAMPATHKUMAR GOVINDARAJ
Format: Patent
Sprache:chi ; eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:一种用于选择主节点以管理一个具有多个节点和重叠节点组的计算机网络中的目标节点组的方法和系统。所述系统包括确定网络中节点对的汉明距离。所述节点对包括两个节点对成员并且所述汉明距离是节点对成员未共同共享的节点组的数目。在一确定操作中确定网络中节点的参与指数。所述参与指数是节点所属于的节点组的数目。还确定节点对的可用性潜力。所述可用性潜力是节点对成员的参与指数之和减去节点对的汉明距离。通过搜索网络的最大总可用性潜力来寻找节点对的最佳组合。从该节点对的最佳组合选择目标节点组的主节点对。如果目标节点组的主节点对不存在,将为该目标节点组选择一个属于目标节点组的主节点。 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.