Role grouping
First Claim
Patent Images
1. A computer implemented method to assign nodes in a network to groups of nodes, comprising:
- observing connection patterns between nodes in the network;
identifying nodes with similar connection patterns in the network, wherein the similar connection patterns are based on regular communication with common network end nodes;
generating a connectivity graph based on observed connection patterns between nodes, wherein, in the connectivity graph, a vertex denotes a node, and an edge between vertices denotes a one-hop connectivity between the corresponding nodes;
grouping the identified nodes into groups based on the connectivity graph; and
merging a first group and a second group into a larger group in response to;
determining that a similarity measure between the first group and the second group exceeds a user-defined threshold, wherein the similarity measure is based on connection patterns from the first group and the second group, anddetermining that a first average number of connected host pairs in the first group is within a pre-determined percentage of a second average number of connected host pairs in the second group.
20 Assignments
0 Petitions
Accused Products
Abstract
Techniques to assign nodes in a network to groups of nodes includes grouping nodes on a network into groups based on host connection set data by identifying bi-connected components in the host connection set data; and merging groups with similar connection habits as determined by examining the host connection set data into larger groups.
-
Citations
27 Claims
-
1. A computer implemented method to assign nodes in a network to groups of nodes, comprising:
-
observing connection patterns between nodes in the network; identifying nodes with similar connection patterns in the network, wherein the similar connection patterns are based on regular communication with common network end nodes; generating a connectivity graph based on observed connection patterns between nodes, wherein, in the connectivity graph, a vertex denotes a node, and an edge between vertices denotes a one-hop connectivity between the corresponding nodes; grouping the identified nodes into groups based on the connectivity graph; and merging a first group and a second group into a larger group in response to; determining that a similarity measure between the first group and the second group exceeds a user-defined threshold, wherein the similarity measure is based on connection patterns from the first group and the second group, and determining that a first average number of connected host pairs in the first group is within a pre-determined percentage of a second average number of connected host pairs in the second group. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. An apparatus comprising:
-
a processor; a memory; and an observation mechanism configured to observe connection patterns between nodes in a network; an identification mechanism configured to identify nodes with similar connection patterns in the network, wherein the similar connection patterns are based on regular communication with common network end nodes; a generating mechanism configured to generate a connectivity graph based on observed connection patterns between nodes, wherein, in the connectivity graph, a vertex denotes a node, and an edge between vertices denotes a one-hop connectivity between the corresponding nodes; a grouping mechanism configured to group the identified nodes into groups based on the connectivity graph; and a merging mechanism configured to merge a first group and a second group into a larger group in response to; determining that a similarity measure between the first group and the second group exceeds a user-defined threshold, wherein the similarity measure is based on connection patterns from the first group and the second group, and determining that a first average number of connected host pairs in the first group is within a pre-determined percentage of a second average number of connected host pairs in the second group. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19)
-
-
20. A computer program product residing on a non-transitory computer readable medium for assigning nodes in a network to groups of nodes comprising instructions, which when executed by a computer, cause the computer to:
-
observe connection patterns between nodes in the network; identify nodes with similar connection patterns in the network, wherein the similar connection patterns are based on regular communication with common network end nodes; generate a connectivity graph based on observed connection patterns between nodes, wherein, in the connectivity graph, a vertex denotes a node, and an edge between vertices denotes a one-hop connectivity between the corresponding nodes; group the identified nodes into groups based on the connectivity graph; and merge a first group and a second group into a larger group in response to; determining that a similarity measure between the first group and the second group exceeds a user-defined threshold, wherein the similarity measure is based on connection patterns from the first group and the second group, and determining that a first average number of connected host pairs in the first group is within a pre-determined percentage of a second average number of connected host pairs in the second group. - View Dependent Claims (21, 22, 23, 24, 25, 26, 27)
-
Specification