CN117493638A - Node clustering method and device, electronic equipment and storage medium - Google Patents
Node clustering method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN117493638A CN117493638A CN202310546011.9A CN202310546011A CN117493638A CN 117493638 A CN117493638 A CN 117493638A CN 202310546011 A CN202310546011 A CN 202310546011A CN 117493638 A CN117493638 A CN 117493638A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- routing path
- network nodes
- level
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 84
- 238000012545 processing Methods 0.000 claims description 65
- 230000008569 process Effects 0.000 claims description 25
- 238000004590 computer program Methods 0.000 claims description 22
- 230000005540 biological transmission Effects 0.000 claims description 13
- 238000010586 diagram Methods 0.000 description 17
- 230000006870 function Effects 0.000 description 12
- 102100025682 Dystroglycan 1 Human genes 0.000 description 7
- 101000855983 Homo sapiens Dystroglycan 1 Proteins 0.000 description 7
- 102100030685 Alpha-sarcoglycan Human genes 0.000 description 5
- 101100224343 Arabidopsis thaliana DOF2.5 gene Proteins 0.000 description 5
- 101150019520 SGCA gene Proteins 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 229910052802 copper Inorganic materials 0.000 description 1
- 239000010949 copper Substances 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/906—Clustering; Classification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure provides a node clustering method, a node clustering device, electronic equipment and a storage medium, wherein the method comprises the following steps: determining a plurality of routing paths according to calling relations among a plurality of network nodes; determining a starting node and a node level to which the starting node belongs from a plurality of network nodes; traversing each routing path from the starting node; when traversing the current routing path, determining the level of each node according to the distance between each network node and the starting node and the level of the starting node; if the next node of the current node has determined the hierarchy, finishing traversing and recording a path traversing result; and when the traversal of the plurality of routing paths is finished, clustering the network nodes positioned at the same level into the same cluster node group according to all the results. According to the method, the network nodes are clustered according to the data flow direction in the network, and the problem that node clustering cannot be achieved under the condition that a loop exists can be solved by setting the traversing ending condition.
Description
Technical Field
The disclosure relates to the technical field of data processing, and in particular relates to a node clustering method, a node clustering device, electronic equipment and a storage medium.
Background
A plurality of network nodes are deployed in the network, each network node has different functions in specific applications, for example, some network nodes can be used for performing service processing, some network nodes are used for performing route forwarding, and in order to better improve the working efficiency of high network nodes, the network nodes are generally required to be clustered.
For the same type of network node, the network node can be generally used for processing the same service, when a plurality of service requests are processed in parallel in the network, according to the service requests which can be processed by each type of network node and the working states of the network nodes in each type of network node, the appropriate network node is quickly found for each service request, so that the service processing efficiency in the network is improved. Therefore, how to perform clustering processing on network nodes becomes one of the hot problems of current research.
Disclosure of Invention
The disclosure provides a node clustering method, a node clustering device, electronic equipment and a storage medium, which are used for realizing the clustering of network nodes according to the data flow direction in a network, and particularly can realize the clustering of network nodes in the network aiming at network links with complex calling relations such as loops.
In a first aspect, the present disclosure provides a node clustering method, including:
determining a plurality of routing paths according to node calling relations among a plurality of network nodes, wherein each routing path comprises at least two network nodes; at least one routing path in the plurality of routing paths has a loop;
determining an initial node from a plurality of network nodes, and determining a node level to which the initial node belongs; the initial node is a public node in a plurality of routing paths;
traversing each routing path from the starting node;
in the process of traversing the current routing path, determining the node level of each network node in the current routing path according to the distance between each network node and the starting node in the current routing path and the node level of the starting node; if the next network node of the currently traversed network node belongs to the node of the determined node level, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node level of each network node in the current routing path;
when the traversal of the plurality of routing paths is finished, the network nodes positioned at the same node level are clustered into the same cluster node group according to the traversal result of each routing path.
In a second aspect, the present disclosure provides a node clustering apparatus, including:
the determining module is used for determining a plurality of routing paths according to node calling relations among a plurality of network nodes, and each routing path comprises at least two network nodes; at least one routing path in the plurality of routing paths has a loop;
the determining module is further used for determining an initial node from the plurality of network nodes and determining a node level to which the initial node belongs; the initial node is a public node in a plurality of routing paths;
the traversing module is used for traversing each routing path from the initial node;
the determining module is further used for determining the node level of each network node in the current routing path according to the distance between each network node and the starting node in the current routing path and the node level of the starting node in the current routing path in the process of traversing the current routing path; if the next network node of the currently traversed network node belongs to the node of the determined node level, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node level of each network node in the current routing path;
And the clustering module is used for clustering the network nodes positioned at the same node level into the same cluster node group according to the traversing result of each routing path when the traversing of the routing paths is finished.
In a third aspect, the present disclosure provides an electronic device comprising: at least one processor; and at least one memory; wherein the memory stores one or more computer programs executable by the at least one processor, the one or more computer programs being executable by the at least one processor to enable the at least one processor to perform the node clustering method described above.
In a fourth aspect, the present disclosure provides a computer readable storage medium having stored thereon a computer program, wherein the computer program, when executed by a processor/processing core, implements the above-described node clustering method.
According to the node clustering method provided by the disclosure, firstly, a plurality of routing paths are determined according to node calling relations among a plurality of network nodes, and each routing path comprises at least two network nodes; and determining an initial node from a plurality of network nodes, and determining a node level to which the initial node belongs. Then, traversing each routing path from the initial node; in the process of traversing the current routing path, determining the node level of each network node in the current routing path according to the distance between each network node and the starting node in the current routing path and the node level of the starting node; if the next network node of the currently traversed network node belongs to the node of the determined node level, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node level of each network node in the current routing path; when the traversal of the plurality of routing paths is finished, the network nodes positioned at the same node level are clustered into the same cluster node group according to the traversal result of each routing path. In the mode, the calling relation among the nodes reflects the data flow direction in the network, and the node clustering method provided by the application can be used for carrying out clustering processing on the network nodes according to the data flow direction in the network, so that the clustering method can be suitable for more networks and more application scenes, and the clustering accuracy is ensured. In addition, in the clustering process of the network nodes, whether the next network node of the currently traversed network node belongs to the node of the determined node hierarchy needs to be judged in the traversal process, if the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, the next network node is traversed, and the node hierarchy of the next network node is determined, so that on one hand, in order to avoid the problem that the hierarchy is repeatedly determined for the same network node (and the repeatedly determined hierarchy is inconsistent); on the other hand, in order to reduce the complexity of node clustering and improve the clustering efficiency, under the condition that the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, the current path is determined to accord with the traversing ending condition, the traversing process of the current path is ended in advance, and the traversing is not required to be carried out on the rest network nodes under the current path. Therefore, the problem that node clustering cannot be achieved under the condition that a loop exists can be solved by setting the traversal ending condition, and the node clustering efficiency is improved under the condition that a complex calling relationship exists, namely, the loop exists in a routing path.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the disclosure, nor is it intended to be used to limit the scope of the disclosure. Other features of the present disclosure will become apparent from the following specification.
Drawings
The accompanying drawings are included to provide a further understanding of the disclosure, and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure, without limitation to the disclosure. The above and other features and advantages will become more readily apparent to those skilled in the art by describing in detail exemplary embodiments with reference to the attached drawings, in which:
fig. 1 is a flowchart of a node clustering method provided in an embodiment of the present disclosure;
fig. 2 is a schematic diagram of a node call relationship between a plurality of network nodes in a network provided by a specific example of an embodiment of the disclosure;
fig. 3 is a block diagram of a node clustering apparatus according to an embodiment of the present disclosure;
fig. 4 is a block diagram of an electronic device according to an embodiment of the present disclosure.
Detailed Description
For a better understanding of the technical solutions of the present disclosure, exemplary embodiments of the present disclosure will be described below with reference to the accompanying drawings, in which various details of the embodiments of the present disclosure are included to facilitate understanding, and they should be considered as merely exemplary. Accordingly, one of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Embodiments of the disclosure and features of embodiments may be combined with each other without conflict.
As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used herein, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect.
Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and the present disclosure, and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
The node clustering method according to the embodiments of the present disclosure may be performed by an electronic device such as a terminal device or a server, where the terminal device may be a vehicle-mounted device, a User Equipment (UE), a mobile device, a User terminal, a cellular phone, a cordless phone, a personal digital assistant (Personal Digital Assistant, PDA), a handheld device, a computing device, a vehicle-mounted device, a wearable device, or the like; the server may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing cloud computing service. The method may in particular be implemented by means of a processor calling a computer program stored in a memory.
There are typically many network nodes in a network, where the roles of the network nodes are different, and there is typically a certain call relationship between the network nodes (the call relationship is determined according to the data flow direction, for example, the data flows from the network node a to the network node B, then it may be determined that the network node a calls the network node B), according to the call relationship between the network nodes, a routing path may be generated, and a routing path may be represented by using a directed graph, such as a directed acyclic graph (Directed Acyclic Graph, DAG) or a non-DAG graph. According to the method and the device, different levels can be divided for the network nodes by traversing the directed graph, so that clustering of the network nodes is realized based on the network levels, and data processing is conveniently carried out on the network nodes according to the node clustering result.
In the related art, traversal for DAGs having only one-way call relationships may be generally implemented, so that hierarchical partitioning of network nodes is accomplished through the traversal. For a non-DAG graph with complex call relationships (such as loops), it is difficult to determine the condition of the end of traversal, so it is impossible to explicitly hierarchical divide network nodes in the non-DAG graph and cluster the nodes. Therefore, how to cluster the network nodes, especially to cluster the nodes aiming at the non-DAG graph with complex calling relationship, becomes the technical problem to be solved urgently at present. In order to solve the above-mentioned problems, the present disclosure provides a node clustering method, which needs to determine whether a next network node of a currently traversed network node belongs to a node of a determined node hierarchy in a traversal process, and if the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, it indicates that the next network node has been traversed and the node hierarchy of the next network node has been determined, so on, in order to avoid repeatedly determining the hierarchy for the same network node (and the repeatedly determined hierarchy may have inconsistent problems); on the other hand, in order to reduce the complexity of node clustering and improve the clustering efficiency, under the condition that the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, the current path is determined to accord with the traversing ending condition, the traversing process of the current path is ended in advance, and the traversing is not required to be carried out on the rest network nodes under the current path. Therefore, the problem that node clustering cannot be achieved under the condition of existence of a loop can be solved by setting the traversal ending condition, and the node clustering efficiency is improved in the non-DAG graph with complex calling relation. .
Fig. 1 is a flowchart of a node clustering method provided in an embodiment of the present disclosure. Referring to fig. 1, the method includes:
step S110: and determining a plurality of routing paths according to node calling relations among the plurality of network nodes, wherein each routing path comprises at least two network nodes.
The nodes may be workstations, clients, network users or personal computers, servers, printers and other devices capable of network connection. Each workstation, server, terminal device, network device, i.e. device having its own unique network address, is a network node. The whole network is composed of a plurality of network nodes, and the network nodes are connected by communication lines to form a certain geometrical relationship, namely a computer network topology.
The data flow is transmitted to each network node contained in the network through the network link in the computer topology, and according to the transmission direction of the data flow in the network, the node calling relationship among a plurality of network nodes in the network can be obtained. In an alternative implementation, the node call relationship between multiple network nodes is determined by:
Acquiring a data traffic transmission direction among a plurality of network nodes; determining node calling relations among a plurality of network nodes according to the data traffic transmission direction; for example, the direction of data traffic transmission is from network node a to network node B, then it is stated that network node a invokes network node B.
After determining the node call relationships among the plurality of network nodes in the network, a plurality of routing paths, also called node call paths, may be generated according to the node call relationships among the plurality of network nodes. Wherein each routing path comprises at least two network nodes. At least one routing path has a loop, for example, network node a calls network node B, network node B calls network node C, network node C calls network node a, and such a routing path has a loop. A data flow flows into a plurality of network nodes in turn, the network nodes form a calling relationship in turn, the network nodes form a routing path according to the flowing sequence of the data flow, for example, the data flow flows into a network node B through a network node A and then flows into a network node C, then the network node A calls the network node B, the network node B calls the network node C, and the network node A, the network node B and the network node C form a routing path.
Step S120: and determining an initial node from a plurality of network nodes, and determining a node level to which the initial node belongs.
The starting node is a common node in a plurality of routing paths, the selection of the starting node and the determination of the node level to which the starting node belongs are determined specifically by the field scene requirement of the person skilled in the art when implementing the method, and the method is not limited herein.
By common node is meant a network node comprising a plurality of routing paths, e.g. one routing path is: the other route path is the network node B, the network node C and the network node E, so the network node B belongs to the common node of the two route paths, and the network node B can be used as the selected starting node.
In one embodiment, if there are multiple common nodes in the multiple network nodes, any one of the common nodes may be determined to be the starting node; or the starting node may be selected from a plurality of public nodes according to a preset selection rule, for example, the selection rule may be: selecting a common node in the shortest route as a starting node; the selection rules may also be: the common node in the longest routing path is selected as the starting node. The embodiment of the disclosure only enumerates two selection rules, and for a specific selection rule, the selection rule may be determined according to an actual application scenario, and the embodiment of the disclosure is not specifically limited.
Step S130: each routing path is traversed from the originating node.
Wherein the plurality of routing paths have been determined in step S110 from node invocation relationships between the plurality of network nodes in the network. In an alternative implementation, each routing path is traversed sequentially from the originating node according to a preset routing priority rule. When each route path is traversed according to the routing priority rule, the traversal can be performed according to the sequence from high to low of the traversed priority, or the traversal can be performed according to the sequence from low to high of the traversed priority.
The preset routing priority rule is specifically determined by a field view requirement of a person skilled in the art when the method is implemented, for example, the routing priority rule can be set to be a routing path, the more the number of nodes is, the higher the traversed priority is, and otherwise, the lower the traversed priority is; for another example, the routing priority rule may also be: the larger the I/O on a routing path, the higher the priority that is traversed, and conversely, the lower the priority that is traversed.
Step S140: and determining the node level of each network node in the current routing path according to the distance between each network node and the starting node in the current routing path and the node level of the starting node in the current routing path in the process of traversing the current routing path.
In an alternative implementation manner, in order to determine a node level to which each network node in the current routing path belongs, if a node level to which a start node belongs is s, if a distance between the network node and the start node is n, the node level to which the network node belongs is s+n; wherein s and n are natural numbers, and the node level s to which the start node belongs and the distance n between the network node and the start node are both specifically set by the field scene requirement of the person skilled in the art when implementing the method, and the method is not limited herein. In an alternative implementation, the distance n between the network node and the start node is calculated by the number of network nodes spaced apart from the start node and a preset step size between adjacent network nodes.
For example, if the node level s to which the start node belongs is 2, the number of network nodes separated from the start node is 2, and the preset step length between adjacent network nodes is 1, the distance n between the network node and the start node is 3, and then the node level to which the network node belongs is 5; for another example, if the node level s to which the start node belongs is 1, the number of network nodes separated from the start node is 3, and the preset step length between adjacent network nodes is 2, the distance n between the network node and the start node is 8, and then the node level to which the network node belongs is 9.
Step S150: if the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node hierarchy of each network node in the current routing path.
In an alternative implementation, in order to determine the level of each network node in the case that there is a loop in the routing path, the node level to which the node traversed for the second time belongs is not determined again, and the end traversal condition of the current routing path includes: if the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node hierarchy of each network node in the current routing path. Correspondingly, if the current routing path does not have a loop, the end traversing condition of the current routing path is that the leaf node of the current routing path is traversed.
Step S160: when the traversal of the plurality of routing paths is finished, the network nodes positioned at the same node level are clustered into the same cluster node group according to the traversal result of each routing path.
The traversing result of each routing path comprises node levels of each network node in the current routing path, the node level of each network node in the plurality of network nodes can be known according to the traversing result of each routing path, after the node level of each network node is determined, the network nodes in the same node level can be clustered into the same cluster node group, and a plurality of cluster node groups respectively corresponding to different node levels can be obtained.
It can be seen that each cluster node group includes one or more network nodes located at the same node level, and is used for clustering the network nodes with the same node level. For example, cluster node group 1 includes a plurality of network nodes at node level 1, and cluster node group 2 includes a plurality of network nodes at node level 2.
If the network nodes included in each cluster node group have the same node priority, generating a plurality of cluster node groups corresponding to different node levels facilitates subsequent unified data processing operation on the network nodes having the same node priority, for example, distributing the same data processing policy to the network nodes in the same cluster node group.
In summary, for the node clustering method provided by the embodiment of the present disclosure, first, according to a node calling relationship between a plurality of network nodes, a plurality of routing paths are determined, where each routing path includes at least two network nodes; and determining an initial node from a plurality of network nodes, and determining a node level to which the initial node belongs. Then, traversing each routing path from the initial node; in the process of traversing the current routing path, determining the node level of each network node in the current routing path according to the distance between each network node and the starting node in the current routing path and the node level of the starting node; if the next network node of the currently traversed network node belongs to the node of the determined node level, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node level of each network node in the current routing path; when the traversal of the plurality of routing paths is finished, the network nodes positioned at the same node level are clustered into the same cluster node group according to the traversal result of each routing path. In the above manner, it is necessary to determine whether the next network node of the currently traversed network node belongs to the node of the determined node hierarchy in the traversal process, and if the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, it is described that the next network node has been traversed and the node hierarchy of the next network node has been determined, so, on the one hand, in order to avoid repeatedly determining the hierarchy for the same network node (and the repeatedly determined hierarchy may have inconsistent problems); on the other hand, in order to reduce the complexity of node clustering and improve the clustering efficiency, under the condition that the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, the current path is determined to accord with the traversing ending condition, the traversing process of the current path is ended in advance, and the traversing is not required to be carried out on the rest network nodes under the current path. Therefore, the problem that node clustering cannot be achieved under the condition of existence of a loop can be solved by setting the traversal ending condition, and the node clustering efficiency is improved in the non-DAG graph with complex calling relation.
In an alternative implementation, following step S160, the following step S170 is further performed:
step S170: determining the node priority of the network nodes contained in each clustered node group according to the level value of the node level to which each network node belongs; and, data processing is performed according to node priorities of the plurality of network nodes.
In an alternative implementation manner, according to the plurality of clustered node groups obtained by clustering in step S160, a plurality of nodes in the same clustered node group have the same priority; the node having a smaller hierarchical value of the node hierarchy has a higher node priority, and the node having a larger hierarchical value of the node hierarchy has a lower node priority. For example, in step S160, three cluster node groups corresponding to different node levels are obtained by clustering, and the corresponding level values are respectively one, two, and three, so that the node priority of the network node included in the cluster node group corresponding to the first node level is highest, the node priority of the network node included in the cluster node group corresponding to the second node level is next higher, and the node priority of the network node included in the cluster node group corresponding to the third node level is lowest.
By determining the node priority of the network nodes contained in each cluster node group, the standard definition of the data flow in the network containing the complex calling relationship is realized, so that a plurality of network nodes in the network can perform data processing according to the node priority, the data flow calculation in the network is further simplified, the calculation pressure of a computer is reduced, and the service requirements of different application scenes on the data processing are met.
In an optional implementation manner, if the above node clustering method is applied to the network security domain, performing data processing according to node priorities of a plurality of network nodes includes: and configuring the security level of each network node according to the node priority of each network node, and executing a security protection strategy corresponding to the security level for each network node. For example, for a network node with higher node priority, configuring a higher security level, executing a stricter security protection policy (e.g., setting a higher security scanning frequency) for the network node with higher security level; accordingly, for network nodes with lower node priorities, configuring lower security levels, and executing looser security protection policies (such as setting lower security scanning frequency) for network nodes with lower security levels; thereby meeting the different demands of network nodes with different safety protection requirements, ensuring the safety of the network nodes with higher safety protection requirements and reducing the cost of executing the safety protection strategy for the network nodes with lower safety protection requirements.
In an optional implementation manner, if the above node clustering method is applied to the field of data query, performing data processing according to node priorities of a plurality of network nodes includes: configuring the searching priority of each network node according to the node priority of each network node; in the query class service, a lookup policy corresponding to a respective lookup priority is performed for each network node. For example, for a network node with higher node priority, configuring higher search priority, and executing a more detailed search strategy for the network node with higher search priority; correspondingly, for the network nodes with lower node priority, configuring lower search priority, and executing a search strategy with simpler content for the network nodes with lower search priority; thereby meeting the different requirements of network nodes with different search priorities, ensuring the accuracy of the search result of the network node with higher search priority and reducing the cost of executing the search strategy for the network node with lower search priority.
In an optional implementation manner, because the call relationship between each network node included in the network is determined, in order to ensure that a complete routing path can be generated between each network node selected by node clustering, so as to implement processing of a service request, the node clustering method in the foregoing embodiment further includes:
When a service processing request is received, M nodes which can participate in processing the service processing request are determined; m nodes belong to a plurality of network nodes; according to the node clustering method provided in steps S110-S160 of the above embodiment, M network nodes are located in one or more clustered node groups, wherein the node levels to which the network nodes located in the same clustered node group belong are the same and have the same node priority.
And acquiring the service loads of all network nodes in the same cluster group in the M network nodes, distributing routing paths for the service processing requests according to the service loads of all network nodes and the calling relations among the nodes in the network nodes, and cooperatively processing the service processing requests by all network nodes in the routing paths. Wherein, the service load refers to the flow carried by the network nodes in the service processing process, and the service load of each network node dynamically changes according to the data flow of the network in the service processing process; and on the premise of ensuring that calling relations exist between network nodes positioned at adjacent node levels, selecting the network node with the smallest current service load in each cluster node group as the network node at each node level in the routing path, so that the service processing request can realize data flow through the current most efficient routing path.
In the following, specific implementation details of the above embodiment are described in detail by taking a specific example as an example for understanding.
Fig. 2 is a schematic diagram of a node call relationship between a plurality of network nodes in the network provided in this specific example. According to fig. 2, it is assumed that a network node 1 (hereinafter referred to as data1, and other network nodes are analogized) is used as a start node, a node level to which data1 belongs is determined as 1, and a network data stream of data1 is calculated. For example, 1- >5 indicates that data1 calls data5, and also constitutes a simple DAG (Directed Acyclic Graph ), which corresponds to the aforementioned one route path, and includes data1 and data5, where data1 is at level 1, data5 is at level 2, and the level value is incremented by the directionality of the DAG, and the increment is 1..
Taking the node call relationship shown in fig. 2 as an example, the plurality of network nodes are respectively network node 1-network node 7, and each network node may be simply called data, for example, network node 1 may be simply called data1, and in fig. 2, network node 1 is denoted by numeral 1. According to the node call relationship shown in fig. 2, a plurality of routing paths may be determined, where the routing paths are respectively: data1-data5, data1-data2-data3-data4-data7, data1-data2-data3-data4-data2, data1-data2-data3-data4-data1, and data1-data2-data6. It should be noted that one route path may be referred to as a simple DAG (Directed Acyclic Graph ), and one route path is traversed, and in fact one DAG is traversed.
Based on the description of the embodiment of fig. 1, assuming that data1 is determined to be a start node, the node level described by the start node data1 is 1, the step size between adjacent node levels is 1, the process of traversing each routing path in fig. 2 may include:
(1) When traversing the DAG, data1-data5, data1 calls data5, and data5 does not call any other network node any more, the DAG ends the circulation (i.e. ends the current route path traversal as shown in fig. 1), so data1 is the first level network node (at layer 1, other network nodes are analogized), the distance between data1 and data5 is 1, and data5 is at layer 2;
(2) data1 calls data2, while data2 calls both data6 and data3 network nodes, then data2 is at layer 2, data6 and data3 are at layer 3, thus yielding the following two DAGs: DAG1 (data 1, data2, data 6) and DAG2 (data 1, data2, data 3), and preset routing rules are set as DAG1, DAG2.
For DAG1, if data6 does not call any other network node, DAG1 ends the circulation, at this time, data1 is located in layer 1, data2 is located in layer 2, and data6 is located in layer 3;
continuing to circulate for DAG2, calling data4 by data3, wherein the data4 is positioned in the layer 4, and updating the original DAG2 into DAG2 (data 1, data2, data3 and data 4); continuing to flow downwards, data4 calls three network nodes of data7, data2 and data1, and then the following 3 DAGs are obtained according to the DAG 2: DAG3 (data 1, data2, data3, data4, data 7), DAG4 (data 1, data2, data3, data4, data 2), DAG5 (data 1, data2, data3, data4, data 1), preset routing rules are set as DAG3, DAG4, DAG5.
For DAG3, if data7 does not call any other network node, DAG3 ends the flow, and at this time, data1 is located at layer 1, data2 is located at layer 2, data3 is located at layer 3, data4 is located at layer 4, and data7 is located at layer 5;
for DAG4, it is known by reverse checking that data2 already exists in DAG4 and has been defined as a second tier network node, so DAG4 ends the flow and all network nodes in DAG4 have defined the tier, data2 still being at tier 2;
for DAG5, it is known by reverse checking that data1 already exists in DAG5 and has been defined as the first tier network node, so DAG5 ends the flow and all network nodes in DAG5 have defined the tier, data1 still being at tier 1.
In summary, according to the traversing result of all the routing paths, the network includes network nodes belonging to five node levels (respectively shown in the right side diagram of fig. 2): first level network node data1, second level network nodes data2 and data5, third level network nodes data3 and data6, fourth level network node data4 and fifth level network node data7. And clustering the network nodes positioned at the same node level into the same cluster node group to obtain a plurality of cluster node groups respectively corresponding to five different node levels, wherein the node priorities of the network nodes are sequentially reduced according to the increasing sequence of the level values, so that the plurality of network nodes can process data according to the node priorities. The method identifies the routing relationship and the directionality of the network nodes, classifies and aggregates the hierarchical relationship, so that the data flow method among the network nodes is defined in a standardized manner, and the method can be applied to data processing methods of scenes such as data processing, transaction planning, optimal path searching, data compression and the like, and provides reliable and analyzable basis for data flow calculation in the data processing process of the application scenes.
It will be appreciated that the above-mentioned method embodiments of the present disclosure may be combined with each other to form a combined embodiment without departing from the principle logic, and are limited to the description of the present disclosure. It will be appreciated by those skilled in the art that in the above-described methods of the embodiments, the particular order of execution of the steps should be determined by their function and possible inherent logic.
Fig. 3 is a block diagram of a node clustering apparatus according to an embodiment of the present disclosure. Referring to fig. 3, the node clustering apparatus 30 includes:
a determining module 31, configured to determine a plurality of routing paths according to node calling relationships among a plurality of network nodes, where each routing path includes at least two network nodes;
the determining module 31 is further configured to determine a starting node from a plurality of network nodes, and determine a node level to which the starting node belongs; the initial node is a public node in a plurality of routing paths;
a traversing module 32, configured to traverse each routing path from the start node;
the determining module 31 is further configured to determine, in the process of traversing the current routing path, a node level to which each network node in the current routing path belongs according to a distance between each network node and the starting node in the current routing path and a node level to which the starting node belongs; if the next network node of the currently traversed network node belongs to the node of the determined node level, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node level of each network node in the current routing path;
And the clustering module 33 is configured to cluster network nodes located at the same node level into the same cluster node group according to the traversal result of each routing path when the traversal of the plurality of routing paths is completed.
Optionally, the node clustering apparatus 30 further comprises a processing module 34 for:
when a service processing request is received, M nodes which can participate in processing the service processing request are determined; m nodes belong to a plurality of network nodes;
and acquiring the service loads of all network nodes in the same cluster group in the M network nodes, distributing routing paths for the service processing requests according to the service loads of all network nodes and the calling relations among the nodes in the network nodes, and cooperatively processing the service processing requests by all network nodes in the routing paths.
Optionally, the processing module 34 is further configured to:
determining the node priority of the network nodes contained in each clustered node group according to the level value of the node level to which each network node belongs;
performing data processing according to node priorities of a plurality of network nodes; multiple nodes in the same cluster node group have the same priority; the smaller the level value of the node level, the higher the node priority.
Optionally, the determining module 31 is further configured to:
acquiring the traffic transmission direction among a plurality of network nodes;
and determining node calling relations among the plurality of network nodes according to the traffic transmission directions.
The level network node is added to the node call path.
Optionally, if the node clustering device 30 is applied to the network security domain, the processing module 34 is specifically configured to:
and configuring the security level of each network node according to the node priority of each network node, and executing a security protection strategy corresponding to the security level for each network node.
Optionally, if the node clustering apparatus 30 is applied to the field of data query, the processing module 34 is specifically configured to:
configuring the searching priority of each network node according to the node priority of each network node;
in the query class service, a lookup policy corresponding to a respective lookup priority is performed for each network node.
Optionally, the determining module 31 is specifically configured to:
if the distance between the network node and the starting node is n under the condition that the node level to which the starting node belongs is s, the node level to which the network node belongs is s+n; wherein s and n are natural numbers.
The specific structure and working principle of each module may refer to the description of the corresponding parts of the method embodiment, and are not repeated here.
The embodiment of the disclosure also provides an electronic device, which comprises: at least one processor; and at least one memory; wherein the memory stores one or more computer programs executable by the at least one processor, the one or more computer programs being executable by the at least one processor to enable the at least one processor to perform the node clustering method described above. Fig. 4 is a block diagram of an electronic device according to an embodiment of the present disclosure. Referring to fig. 4, the electronic device 50 includes: at least one processor 501; at least one memory 502; and one or more I/O interfaces 503 coupled between the processor 501 and the memory 502; wherein the memory 502 stores one or more computer programs executable by the at least one processor 501, the one or more computer programs being executable by the at least one processor 501 to enable the at least one processor 501 to perform the node clustering method described above.
The embodiment of the disclosure also provides a computer readable storage medium, which may be a volatile or nonvolatile computer readable storage medium, and a computer program stored thereon, where the computer program when executed by a processor processing core implements the node clustering method described above, and specifically includes:
Determining a plurality of routing paths according to node calling relations among a plurality of network nodes, wherein each routing path comprises at least two network nodes;
determining an initial node from a plurality of network nodes, and determining a node level to which the initial node belongs; the initial node is a public node in a plurality of routing paths;
traversing each routing path from the starting node;
in the process of traversing the current routing path, determining the node level of each network node in the current routing path according to the distance between each network node and the starting node in the current routing path and the node level of the starting node; if the next network node of the currently traversed network node belongs to the node of the determined node level, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node level of each network node in the current routing path;
when the traversal of the plurality of routing paths is finished, the network nodes positioned at the same node level are clustered into the same cluster node group according to the traversal result of each routing path.
The processor is further configured to perform:
when a service processing request is received, M nodes which can participate in processing the service processing request are determined; m nodes belong to a plurality of network nodes;
And acquiring the service loads of all network nodes in the same cluster group in the M network nodes, distributing routing paths for the service processing requests according to the service loads of all network nodes and the calling relations among the nodes in the network nodes, and cooperatively processing the service processing requests by all network nodes in the routing paths.
The processor is further configured to, after clustering network nodes located at the same node level into the same cluster node group according to the traversal result of each routing path:
determining the node priority of the network nodes contained in each clustered node group according to the level value of the node level to which each network node belongs;
performing data processing according to node priorities of a plurality of network nodes; multiple nodes in the same cluster node group have the same priority; the smaller the level value of the node level, the higher the node priority.
The processor is further configured to, before determining the plurality of routing paths according to node call relationships between the plurality of network nodes:
acquiring the traffic transmission direction among a plurality of network nodes;
and determining node calling relations among the plurality of network nodes according to the traffic transmission directions.
The node clustering method is applied to the network security field, and performs data processing according to node priorities of a plurality of network nodes, and comprises the following steps:
and configuring the security level of each network node according to the node priority of each network node, and executing a security protection strategy corresponding to the security level for each network node.
When the processor is applied to the field of data query in the node clustering method, the processor executes the following steps when performing data processing according to the node priorities of a plurality of network nodes:
configuring the searching priority of each network node according to the node priority of each network node;
in the query class service, a lookup policy corresponding to a respective lookup priority is performed for each network node.
The processor executes the following steps when determining the node level of each network node in the current routing path according to the distance between each network node and the starting node in the current routing path and the node level of the starting node, wherein the node level of each network node in the current routing path is:
if the distance between the network node and the starting node is n under the condition that the node level to which the starting node belongs is s, the node level to which the network node belongs is s+n; wherein s and n are natural numbers.
In summary, according to a node clustering method implemented by a computer program stored on the computer readable storage medium, first, a plurality of routing paths are determined according to a node calling relationship between a plurality of network nodes, where each routing path includes at least two network nodes; and determining an initial node from a plurality of network nodes, and determining a node level to which the initial node belongs. Then, traversing each routing path from the initial node; in the process of traversing the current routing path, determining the node level of each network node in the current routing path according to the distance between each network node and the starting node in the current routing path and the node level of the starting node; if the next network node of the currently traversed network node belongs to the node of the determined node level, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node level of each network node in the current routing path; when the traversal of the plurality of routing paths is finished, the network nodes positioned at the same node level are clustered into the same cluster node group according to the traversal result of each routing path. In the above manner, it is necessary to determine whether the next network node of the currently traversed network node belongs to the node of the determined node hierarchy in the traversal process, and if the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, it is described that the next network node has been traversed and the node hierarchy of the next network node has been determined, so, on the one hand, in order to avoid repeatedly determining the hierarchy for the same network node (and the repeatedly determined hierarchy may have inconsistent problems); on the other hand, in order to reduce the complexity of node clustering and improve the clustering efficiency, under the condition that the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, the current path is determined to accord with the traversing ending condition, the traversing process of the current path is ended in advance, and the traversing is not required to be carried out on the rest network nodes under the current path. Therefore, the problem that node clustering cannot be achieved under the condition of existence of a loop can be solved by setting the traversal ending condition, and the node clustering efficiency is improved in the non-DAG graph with complex calling relation.
Embodiments of the present disclosure also provide a computer program product comprising computer readable code, or a non-transitory computer readable storage medium carrying computer readable code, which when executed in a processor of an electronic device, performs the above-described node clustering method.
Those of ordinary skill in the art will appreciate that all or some of the steps, systems, functional modules/units in the apparatus, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between the functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed cooperatively by several physical components. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer-readable storage media, which may include computer storage media (or non-transitory media) and communication media (or transitory media).
The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable program instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, random Access Memory (RAM), read Only Memory (ROM), erasable Programmable Read Only Memory (EPROM), static Random Access Memory (SRAM), flash memory or other memory technology, portable compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical disc storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies computer readable program instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and may include any information delivery media.
The computer readable program instructions described herein may be downloaded from a computer readable storage medium to a respective computing/processing device or to an external computer or external storage device over a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmissions, wireless transmissions, routers, firewalls, switches, gateway computers and/or edge servers. The network interface card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium in the respective computing/processing device.
Computer program instructions for performing the operations of the present disclosure can be assembly instructions, instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, c++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer readable program instructions may be executed entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, aspects of the present disclosure are implemented by personalizing electronic circuitry, such as programmable logic circuitry, field Programmable Gate Arrays (FPGAs), or Programmable Logic Arrays (PLAs), with state information of computer readable program instructions, which can execute the computer readable program instructions.
The computer program product described herein may be embodied in hardware, software, or a combination thereof. In an alternative embodiment, the computer program product is embodied as a computer storage medium, and in another alternative embodiment, the computer program product is embodied as a software product, such as a software development kit (Software Development Kit, SDK), or the like.
Various aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable medium having the instructions stored therein includes an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Example embodiments have been disclosed herein, and although specific terms are employed, they are used and should be interpreted in a generic and descriptive sense only and not for purpose of limitation. In some instances, it will be apparent to one skilled in the art that features, characteristics, and/or elements described in connection with a particular embodiment may be used alone or in combination with other embodiments unless explicitly stated otherwise. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the disclosure as set forth in the appended claims.
Claims (10)
1. A method of clustering nodes, comprising:
determining a plurality of routing paths according to node calling relations among a plurality of network nodes, wherein each routing path comprises at least two network nodes; a loop exists in at least one routing path in the plurality of routing paths;
determining a starting node from the plurality of network nodes, and determining a node level to which the starting node belongs; wherein the start node is a common node in the plurality of routing paths;
Traversing each routing path from the start node;
in the process of traversing a current routing path, determining a node level to which each network node in the current routing path belongs according to the distance between each network node in the current routing path and the starting node and the node level to which the starting node belongs; if the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node hierarchy of each network node in the current routing path;
when the traversal of the plurality of routing paths is finished, the network nodes positioned at the same node level are clustered into the same cluster node group according to the traversal result of each routing path.
2. The method according to claim 1, wherein the method further comprises:
when a service processing request is received, M nodes which can participate in processing the service processing request are determined; the M nodes belong to the plurality of network nodes;
and acquiring the service loads of all network nodes in the same cluster group in the M network nodes, distributing a routing path for the service processing request according to the service loads of all network nodes and the calling relationship among the nodes in the network nodes, and cooperatively processing the service processing request by all network nodes in the routing path.
3. The method according to claim 1, wherein after the network nodes located at the same node level are clustered into the same cluster node group according to the traversal result of each routing path, further comprising:
determining the node priority of the network nodes contained in each clustered node group according to the level value of the node level to which each network node belongs;
performing data processing according to the node priorities of the plurality of network nodes; multiple nodes in the same cluster node group have the same priority; the smaller the level value of the node level, the higher the node priority.
4. The method of claim 1, wherein prior to determining the plurality of routing paths based on node call relationships between the plurality of network nodes, further comprising:
acquiring the traffic transmission direction among a plurality of network nodes;
and determining node calling relations among the plurality of network nodes according to the traffic transmission directions.
5. A method according to claim 3, wherein the node clustering method is applied to the network security domain, and the processing the data according to the node priorities of the plurality of network nodes comprises:
And configuring the security level of each network node according to the node priority of each network node, and executing a security protection strategy corresponding to the security level for each network node.
6. A method according to claim 3, wherein the node clustering method is applied to the field of data query, and the processing data according to the node priorities of the plurality of network nodes comprises:
configuring the searching priority of each network node according to the node priority of each network node;
in the query class service, a lookup policy corresponding to a respective lookup priority is performed for each network node.
7. The method according to any one of claims 1-6, wherein determining the node level to which each network node in the current routing path belongs according to the distance between each network node in the current routing path and the starting node and the node level to which the starting node belongs comprises:
if the distance between a network node and a starting node is n under the condition that the node level to which the starting node belongs is s, the node level to which the network node belongs is s+n; wherein s and n are natural numbers.
8. A node clustering apparatus, comprising:
the determining module is used for determining a plurality of routing paths according to node calling relations among a plurality of network nodes, and each routing path comprises at least two network nodes; a loop exists in at least one routing path in the plurality of routing paths;
the determining module is further configured to determine a starting node from the plurality of network nodes, and determine a node level to which the starting node belongs; wherein the start node is a common node in the plurality of routing paths;
the traversing module is used for traversing each routing path from the starting node;
the determining module is further configured to determine, in a process of traversing a current routing path, a node level to which each network node in the current routing path belongs according to a distance between each network node in the current routing path and the starting node and a node level to which the starting node belongs; if the next network node of the currently traversed network node belongs to the node of the determined node hierarchy, the traversing of the current routing path is ended, and the traversing result of the current routing path is recorded, wherein the traversing result comprises the node hierarchy of each network node in the current routing path;
And the clustering module is used for clustering the network nodes positioned at the same node level into the same cluster node group according to the traversing result of each routing path when the traversing of the routing paths is finished.
9. An electronic device, comprising:
at least one processor; and at least one memory; wherein,
the memory stores one or more computer programs for execution by the at least one processor, the one or more computer programs being executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-7.
10. A computer readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the method according to any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310546011.9A CN117493638A (en) | 2023-05-15 | 2023-05-15 | Node clustering method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310546011.9A CN117493638A (en) | 2023-05-15 | 2023-05-15 | Node clustering method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117493638A true CN117493638A (en) | 2024-02-02 |
Family
ID=89677056
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310546011.9A Pending CN117493638A (en) | 2023-05-15 | 2023-05-15 | Node clustering method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117493638A (en) |
-
2023
- 2023-05-15 CN CN202310546011.9A patent/CN117493638A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11646940B2 (en) | Intent driven network policy platform | |
| US7474654B2 (en) | Method and system for classification of packets based on meta-rules | |
| US7865608B1 (en) | Method and apparatus for fast and scalable matching of structured data streams | |
| CN102857322B (en) | Hybrid port scope is encoded | |
| CN103795644B (en) | Policy Table's list item collocation method, apparatus and system | |
| US10459729B2 (en) | Map tables for hardware tables | |
| US20230042388A1 (en) | Graph database query pagination | |
| CN109583227B (en) | Privacy information protection method, device and system | |
| US9135833B2 (en) | Process for selecting compressed key bits for collision resolution in hash lookup table | |
| CN114205191B (en) | API gateway system and operation method | |
| US20220345364A1 (en) | Network management apparatus, method, and program | |
| US7000006B1 (en) | Implementing network management policies using topology reduction | |
| US11108854B2 (en) | Peer-to-peer network for internet of things resource allocation operation | |
| US7158024B2 (en) | Packet intrusion detection rule simplification apparatus and method, and packet intrusion detection apparatus and method using simplified intrusion detection rule | |
| Gadre et al. | Centralized approaches for virtual network function placement in SDN-enabled networks | |
| US8856338B2 (en) | Efficiently relating adjacent management applications managing a shared infrastructure | |
| CN117493638A (en) | Node clustering method and device, electronic equipment and storage medium | |
| US11799731B2 (en) | Representation and orchestration for virtual wide area networks | |
| CN113395183B (en) | Virtual node scheduling method and system for network simulation platform VLAN interconnection | |
| CN113992580B (en) | Method and equipment for modifying policy routing | |
| CN109861908A (en) | A kind of routing conversion and equipment | |
| CN111107142B (en) | Service access method and device | |
| CN112783673A (en) | Method and device for determining call chain, computer equipment and storage medium | |
| US9324039B2 (en) | Incremental updates for ordered multi-field classification rules when represented by a tree of longest prefix matching tables | |
| Abramov et al. | Automated method for constructing of network traffic filtering rules |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |