A network node control method, apparatus, device, medium, and product

Abstract

The application provides a network node control method, device, equipment, medium and product, which can be applied to the technical field of distribution, the technical field of artificial intelligence and the technical field of financial technology. The method comprises the following steps: determining a target network node set; the target network node set comprises N network nodes, and N is a positive integer; in the N network nodes, a key node with an importance higher than a preset importance threshold is determined; for any key node not belonging to any triangular node interconnection relationship, a triangular node interconnection relationship comprising the key node is constructed; the triangular node interconnection relationship comprises three network nodes, and each network node in the three network nodes has a communication connection with the other two network nodes.

Description

Technical Field

[0001] This application relates to the fields of distributed technology, artificial intelligence technology, and financial technology, and specifically to a network node control method, apparatus, device, medium, and product. Background Technology

[0002] A network typically contains multiple network nodes, which are interconnected through communication. For example, in a file transfer network, different network nodes can transfer files to each other.

[0003] In this system, different network nodes can establish communication connections to achieve direct connection and communication interaction. Furthermore, two network nodes that do not currently have a communication connection can communicate through a relay connection between different network nodes. For example, if network node A has a communication connection with network node B, and network node B has a communication connection with network node C, network node A can communicate with network node C through network node B.

[0004] However, the communication stability between network nodes in many networks is currently poor. For example, if a single communication connection is lost due to network fluctuations, it may cause many network nodes to be unable to communicate. Summary of the Invention

[0005] In view of the above problems, embodiments of this application provide a network node control method, apparatus, device, medium, and product that can improve the communication stability between network nodes.

[0006] According to a first aspect of this application, a network node control method is provided, comprising: determining a target network node set; the target network node set containing N network nodes, where N is a positive integer; determining, among the N network nodes, key nodes whose importance is higher than a preset importance threshold; constructing a triangular node interconnection relationship containing the target key node for any key node that does not belong to any triangular node interconnection relationship; the triangular node interconnection relationship containing three network nodes, wherein each of the three network nodes has a communication connection with the other two network nodes respectively.

[0007] According to an embodiment of this application, the method further includes: for any key node, determining a lower limit for the number of triangular node interconnections based on the importance of the key node; the determined lower limit for the number of triangular node interconnections is positively correlated with the importance of the key node; and constructing triangular node interconnections that include the key node when the number of triangular node interconnections to which the key node currently belongs is less than the lower limit for the number of triangular node interconnections.

[0008] According to an embodiment of this application, the step of constructing a triangular node interconnection relationship including the target key node for any key node that does not belong to any triangular node interconnection relationship includes: for any key node that does not belong to any triangular node interconnection relationship, if it is determined that any two adjacent network nodes of the target key node can establish a communication connection, constructing a triangular node interconnection relationship for the two adjacent network nodes that can establish a communication connection and the target key node; wherein the adjacent network nodes have a communication connection with the target key node.

[0009] According to an embodiment of this application, the step of constructing a triangular node interconnection relationship including the target key node for any key node that does not belong to any triangular node interconnection relationship includes: for any key node that does not belong to any triangular node interconnection relationship, determining the adjacent network node pairs of the target key node; and sequentially determining whether a communication connection can be established between two adjacent network nodes contained in different adjacent network node pairs according to a preset order; wherein the adjacent network nodes have a communication connection with the target key node; and, if it is determined that a communication connection can be established between two adjacent network nodes contained in any adjacent network node pair, constructing a triangular node interconnection relationship for the two adjacent network nodes that can establish a communication connection and the target key node.

[0010] According to embodiments of this application, the preset order includes any one of the following: the order of the sum of importance of two adjacent network nodes in an adjacent network node pair from high to low; the order of the sum of importance of two adjacent network nodes in an adjacent network node pair from low to high; the order of the network distance of the preset shortest communication path between two adjacent network nodes in an adjacent network node pair from small to large; the preset shortest communication path includes the shortest communication path between two adjacent network nodes that does not pass through the target key node; the order of the quotient of the network distance of the preset shortest communication path and the sum of importance between two adjacent network nodes in an adjacent network node pair from small to large.

[0011] According to embodiments of this application, the determination of importance includes: for any network node, determining the importance of the target network node based on at least one of the following: the current network traffic of the target network node, the future network traffic of the target network node within a preset future time period, and the node betweenness number of the target network node in a preset network graph structure; any graph node in the preset network graph structure is used to represent a network node in the target network node set, and any side of the preset network graph structure is used to represent a communication connection between the network nodes represented by the connected nodes; the importance of the target network node is positively correlated with the current network traffic of the target network node; the importance of the target network node is positively correlated with the future network traffic of the target network node within a preset future time period; and the importance of the target network node is positively correlated with the node betweenness number of the target network node in the preset network graph structure.

[0012] According to an embodiment of this application, the method further includes: when a new network node is determined to be added to the target network node set, for any newly added network node, determining any candidate network node that meets preset selection conditions from the N network nodes, and establishing a communication connection between the newly added network node and the determined candidate network node; the preset selection conditions include at least one of the following: the importance of the candidate network node is lower than a first importance threshold; the number of other network nodes that the candidate network node can communicate with is greater than a communication node number threshold; the other network nodes belong to the target network node set; the number of adjacent network nodes of the candidate network node is less than an adjacent node number threshold; and there is a communication connection between the adjacent network nodes and the candidate network node.

[0013] According to a second aspect of this application, a network node control device is provided, comprising: a node set determination module, configured to determine a target network node set; the target network node set includes N network nodes, where N is a positive integer; a key node determination module, configured to determine, among the N network nodes, key nodes whose importance is higher than a preset importance threshold; and a construction module, configured to construct a triangular node interconnection relationship including any key node that does not belong to any triangular node interconnection relationship; the triangular node interconnection relationship includes three network nodes, and each of the three network nodes has a communication connection with the other two network nodes respectively.

[0014] According to a third aspect of this application, an electronic device is provided, comprising: one or more processors; and a memory for storing one or more computer programs, wherein the one or more processors execute the one or more computer programs to implement the steps of the method described above.

[0015] According to a fourth aspect of this application, a computer-readable storage medium is also provided, on which a computer program or instructions are stored, wherein the computer program or instructions, when executed by a processor, implement the steps of the above-described method.

[0016] According to a fifth aspect of this application, a computer program product is also provided, including a computer program or instructions that, when executed by a processor, implement the steps of the above-described method. Attached Figure Description

[0017] The above-mentioned contents, other objects, features and advantages of this application will become clearer from the following description of embodiments with reference to the accompanying drawings, in which:

[0018] Figure 1 This illustration schematically depicts an exemplary distributed system architecture that can be applied to a network node control method according to embodiments of this application;

[0019] Figure 2 A flowchart illustrating a network node control method according to an embodiment of this application is shown schematically.

[0020] Figure 3 This schematic diagram illustrates a structural block diagram of a network node control device according to an embodiment of the present application;

[0021] Figure 4 A block diagram schematically illustrates an electronic device suitable for implementing a network node control method according to an embodiment of this application. Detailed Implementation

[0022] The embodiments of this application will now be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of this application. In the following detailed description, numerous specific details are set forth to provide a thorough understanding of the embodiments of this application for ease of explanation. However, it will be apparent that one or more embodiments may be implemented without these specific details. Furthermore, descriptions of well-known structures and technologies are omitted in the following description to avoid unnecessarily obscuring the concepts of this application.

[0023] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of this application. The terms “comprising,” “including,” etc., as used herein indicate the presence of the stated features, steps, operations, and / or components, but do not exclude the presence or addition of one or more other features, steps, operations, or components.

[0024] All terms used herein (including technical and scientific terms) have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein are to be interpreted in a manner consistent with the context of this specification, and not in an idealized or overly rigid way.

[0025] When using expressions such as "at least one of A, B and C", they should generally be interpreted in accordance with the meaning that is commonly understood by those skilled in the art (e.g., "a system having at least one of A, B and C" should include, but is not limited to, a system having A alone, a system having B alone, a system having C alone, a system having A and B, a system having A and C, a system having B and C, and / or a system having A, B and C, etc.).

[0026] A network typically contains multiple network nodes, interconnected through communication between them. For example, in a file-sharing network, different network nodes can transfer files to each other. Different network nodes can establish communication connections to achieve direct connection and interaction. Furthermore, two network nodes without a communication connection can communicate through a relay connection between different network nodes. For instance, if network node A has a communication connection with network node B, and network node B has a communication connection with network node C, network node A can communicate with network node C through network node B. However, the stability of communication between network nodes in many networks is currently poor. For example, network fluctuations causing a single communication connection to break can lead to a loss of communication between many network nodes.

[0027] To address the aforementioned technical problems, embodiments of this application provide a network node control method. In this method, multiple communication paths can be set between different network nodes to improve communication stability. Even if one or more communication paths become unavailable (e.g., due to network fluctuations causing a communication connection loss), communication between network nodes can still be achieved through other communication paths, thereby improving communication stability.

[0028] Furthermore, a triangular interconnection architecture can be set up for the three network nodes. Each of the three network nodes can have communication connections with the other two network nodes, thus ensuring that there are two communication paths between any two network nodes, which can improve the communication stability between any two network nodes. As the number of triangular interconnection architectures in the network increases, the communication stability between different network nodes in the network can be improved.

[0029] For example, network node A has a communication connection with network node B, and network node B has a communication connection with network node C. Furthermore, a communication connection can also be established between network node A and network node C. For network node A and network node C, there can be two communication paths: one through a direct connection, and the other using network node B as an intermediary. Even if the communication connection between network node A and network node C is broken due to network fluctuations, communication can be restored through network node B, thereby improving the communication stability between network node A and network node C. The same principle applies to communication between network node A and network node B, and between network node B and network node C, to improve communication stability.

[0030] In the above method, it is further considered that communication connections between network nodes require certain resources. If a triangular node interconnection architecture is built for all network nodes, the resources for communication connections are often insufficient, and resource waste is likely to occur. Therefore, network nodes with importance higher than a threshold (which can be called key nodes) can be selected from the multiple network nodes included in the network. Communication stability can be improved for key nodes, that is, the above-mentioned triangular node interconnection architecture can be built for key nodes, which can improve the resource utilization of communication connections.

[0031] Specifically, key nodes are network nodes whose network traffic exceeds a threshold. Since they need to exchange a large amount of data, communication stability can be improved for key nodes by enabling data interaction with key nodes through multiple different communication paths. Even if any communication path fails, data interaction with key nodes can continue through other communication paths, thereby improving the stability of data interaction at key nodes.

[0032] Furthermore, critical nodes can be identified based on future network traffic. Specifically, machine learning models can be used to predict the future traffic of each network node in future time periods, and nodes with future traffic exceeding a threshold can be designated as critical nodes. Alternatively, the importance of network nodes can be determined based on other information, thus identifying critical nodes accordingly.

[0033] Therefore, in the above method, it is possible to determine whether a key node belongs to a triangular node interconnection architecture. For a key node that does not belong to any triangular node interconnection architecture, a triangular node interconnection architecture containing the key node can be constructed, so that the key node belongs to at least one triangular node interconnection architecture, thereby improving the communication stability between the key node and other nodes, and further improving the overall communication stability of the network nodes.

[0034] In the above method, for critical nodes with high importance, multiple different triangular node interconnection architectures can be constructed. The number of triangular node interconnection architectures required for a critical node can be determined according to its importance, and the importance of a critical node can be positively correlated with the number of triangular node interconnection architectures it belongs to. For critical nodes with higher importance, more communication paths can be constructed to improve communication stability, which means that more triangular node interconnection architectures can be constructed.

[0035] In the above method, specifically constructing the triangular node interconnection architecture can involve identifying three network nodes capable of establishing communication connections with each other from among multiple network nodes, and establishing communication connections for each of these nodes to complete the triangular node interconnection architecture. To improve the efficiency of constructing the triangular node interconnection architecture, existing communication connections can be reused. Specifically, for any two network nodes connected by a communication connection, it can be determined whether other network nodes can establish communication connections with these two network nodes respectively. If it is determined that any other network node can establish communication connections with these two network nodes respectively, then that other network node can establish communication connections with them to complete the triangular node interconnection architecture. By reusing an already established communication connection to construct the triangular node interconnection architecture, the construction efficiency can be improved. Alternatively, for any network node connected to two other network nodes through different communication connections, it can be determined whether a communication connection can be established between these two other network nodes. If it is determined that a communication connection can be established between these two other network nodes, then a communication connection can be established between them to complete the triangular node interconnection architecture. By reusing two already established communication connections to construct the triangular node interconnection architecture, the construction efficiency can be improved.

[0036] It is understandable that any of the above methods can be used to build a triangular node interconnection architecture for key nodes.

[0037] It should be noted that the network node control method and apparatus provided in the embodiments of this application can be applied to the fields of distributed technology, artificial intelligence technology, and fintech. For example, for remote network node devices deployed by financial institutions such as banks, the network node control method provided in the embodiments of this application can be used to improve the communication stability between remote network node devices. The network node control method and apparatus provided in the embodiments of this application can also be applied to any field other than fintech, and the application field of the network node control method and apparatus provided in the embodiments of this application is not limited.

[0038] As used in this paper, the term "model" refers to a model that learns the relationship between inputs and outputs from training data, enabling it to generate corresponding outputs for a given input after training. Model generation can be based on machine learning techniques. Deep learning is a machine learning algorithm that processes inputs and provides corresponding outputs using multiple layers of processing units. A neural network model is an example of a deep learning-based model. In this paper, "model" may also be referred to as a "machine learning model," "learning model," "machine learning network," or "learning network," and these terms are used interchangeably.

[0039] It's important to note that the term "neural network" can refer to a machine learning network based on deep learning. A neural network processes input and provides corresponding output, typically consisting of an input layer, an output layer, and one or more hidden layers between them. Neural networks used in deep learning applications often include many hidden layers, increasing the network's depth. The layers of a neural network are connected sequentially, so that the output of the previous layer serves as the input to the next layer. The input layer receives the input to the neural network, while the output layer's output becomes the final output. Each layer of a neural network includes one or more nodes (also called processing nodes or neurons), each processing the input from the layer above.

[0040] It should be understood that machine learning generally includes three phases: training, testing, and application (also known as inference). In the training phase, a given model is trained using a large amount of training data, iteratively updating parameter values ​​until the model can consistently generate inferences that meet the expected goals from the training data. Through training, the model can be considered to have learned the relationship between inputs and outputs (also known as the input-output mapping) from the training data. The parameter values ​​of the trained model are determined. In the testing phase, test inputs are applied to the trained model to test whether it can provide the correct output, thus determining the model's performance. In the application phase, the model can be used to process actual inputs based on the trained parameter values ​​to determine the corresponding output.

[0041] Figure 1 This illustration schematically depicts an exemplary distributed system architecture that can be applied to a network node control method according to embodiments of this application. It should be noted that... Figure 1 The examples shown are merely examples of the architecture that can be applied to the methods according to the embodiments of this application, in order to help those skilled in the art understand the technical content of this application, but do not imply any limitation on the application scenarios of the embodiments of this application.

[0042] like Figure 1As shown, the exemplary distributed system architecture 100 according to the embodiments of this application may include: a network control terminal 110 and a network node set 120.

[0043] The network node set 120 may include multiple network nodes, referred to as network node 1 to network node 7. Communication connections can exist between different network nodes in the network node set 120, forming a network node graph structure. The network control terminal 110 can be used to control the network nodes in the network node set, specifically to control the establishment of communication connections between different network nodes.

[0044] A network node can be a computer or a software module, application, or application running on a computer. Different network nodes can communicate and connect in various ways, such as, but not limited to, wired connections, wireless connections, signaling connections, and connections via the Internet. Multiple network nodes can be used to implement one or more services, such as, but not limited to, financial services.

[0045] The network control terminal 110 is used to configure and manage the various network nodes in the network node set 120. The network control terminal 110 may include one or more computers. The network control terminal 110 can communicate and connect with the various network nodes in various ways, including but not limited to wired connections, wireless connections, signaling connections, and connections via the Internet.

[0046] A network node control method according to an embodiment of this application can be executed by a network control terminal 110. Correspondingly, a network node control device according to an embodiment of this application can be disposed in the network control terminal 110.

[0047] It should be understood that Figure 1 The number of network nodes and network control terminals shown is merely illustrative. Depending on implementation needs, there can be any number of network nodes and network control terminals.

[0048] Figure 2 A flowchart illustrating a network node control method according to an embodiment of this application is shown schematically.

[0049] like Figure 2 As shown, a network node control method 200 according to an embodiment of this application may include steps S210 to S230.

[0050] The embodiments of this application do not limit the executing entity of a network node control method. Optionally, a network node control method can be applied to any electronic device or any software application, specifically to a server, terminal or control terminal.

[0051] In step S210, the target network node set is determined; the target network node set contains N network nodes, where N is a positive integer.

[0052] In step S220, among the N network nodes, key nodes with an importance level higher than a preset importance threshold are identified.

[0053] In step S230, for any key node that does not belong to any triangular node interconnection relationship, a triangular node interconnection relationship containing the key node is constructed; the triangular node interconnection relationship contains three network nodes, and each of the three network nodes has a communication connection with the other two network nodes respectively.

[0054] The above method can improve the communication stability of key nodes by constructing triangular node interconnection relationships for key nodes in the target network node set.

[0055] In a specific example, within the constructed triangular node interconnection relationship containing key nodes, even if any communication connection is broken, any two network nodes in the triangular node interconnection relationship can still communicate, improving the communication stability between network nodes. Furthermore, by executing the above method, triangular node interconnection relationships containing key nodes can be constructed for each key node in the target network node set, ensuring that each key node in the target network node set belongs to at least one triangular node interconnection relationship, thus improving the overall communication stability of the target network node set.

[0056] The embodiments of this application are not limited to network nodes. Optionally, a network node may specifically be a network node device or a network node in the form of a software application.

[0057] The embodiments of this application are not limited to a target network node set. Optionally, the target network node set can be any set of network nodes, which can be a combination of multiple network nodes in the same network or multiple network nodes belonging to the same business entity.

[0058] Optionally, in the target network node set, any network node may have a communication connection with at least one other network node; or, in the target network node set, at least two network nodes may have a communication connection.

[0059] In one optional embodiment, to facilitate overall control of the target network node set, a preset network graph structure can be constructed for the target network node set. Specifically, a corresponding graph node can be constructed for each individual network node in the target network node set; and corresponding edges can be constructed for communication connections between different network nodes in the target network node set. The two graph nodes connected by the constructed edges can respectively represent the two network nodes connected by the communication connection.

[0060] Therefore, optionally, any node in the preset network graph structure is used to represent a network node in the target network node set, and any edge in the preset network graph structure is used to represent a communication connection between the network nodes represented by the connected nodes. Of course, for each network node included in the target network node set, corresponding graph nodes can be constructed in the preset network graph structure, which can improve the completeness of the preset network graph structure.

[0061] Understandably, using a pre-defined network graph structure makes it easy to determine the communication connections between different network nodes in a target network node set, and also facilitates the execution of related operations. For example, it can help identify whether a key node belongs to any triangular node interconnection relationship.

[0062] The embodiments of this application do not limit the communication connection between network nodes. Optionally, the communication connection between network nodes can be a wired connection or a wireless connection, a physical connection or a logical connection, and the communication connection can be used to realize communication interaction between network nodes. The communication connection between network nodes can be a direct communication connection at the network node level, that is, in the communication connection between two network nodes, there are no other network nodes acting as intermediaries.

[0063] The embodiments of this application are not limited to a triangular node interconnection relationship, and can also be referred to as a triangular node interconnection architecture. The triangular node interconnection relationship can include three network nodes, each of which has communication connections with the other two network nodes. It is understood that even if a single communication connection between any two network nodes in the triangular node interconnection relationship fails, the three network nodes can still communicate with each other, thus improving communication stability. Therefore, network nodes with importance exceeding a threshold (critical nodes) can be placed in the triangular node interconnection relationship to improve the communication stability of critical nodes.

[0064] The embodiments of this application do not limit the method for determining the importance of network nodes. Optionally, the importance of a network node can be used to characterize the importance of the network node in terms of services, or it can be used to characterize the importance of the network node in the network architecture. For example, if a network node is used to transmit important service data, then the importance of that network node can be determined to be high, and the importance of the service data transmitted by the network node can be positively correlated with the importance of the network node; or if a network node has a large amount of traffic in the network architecture, then the importance of that network node can be determined to be high, and the traffic of the network node can be positively correlated with the importance of the network node.

[0065] Optionally, the method for determining importance may specifically include: for any network node, determining the importance of the target network node based on at least one of the following: the current network traffic of the target network node, the future network traffic of the target network node within a preset future time period, and the node betweenness number of the target network node in a preset network graph structure. Wherein, any graph node in the preset network graph structure represents a network node in the target network node set, and any edge in the preset network graph structure represents a communication connection between the network nodes represented by the connected nodes. The importance of the target network node may be positively correlated with its current network traffic. The importance of the target network node may be positively correlated with its future network traffic within a preset future time period. The importance of the target network node may be positively correlated with its node betweenness number in the preset network graph structure. This embodiment can determine the importance of a network node based on multiple attribute information, which can improve the accuracy of network node importance determination.

[0066] The embodiments of this application do not limit the method for determining future network traffic. Optionally, future network traffic of network nodes in a preset future time period can be predicted based on a traffic prediction model and the historical traffic time series of network nodes. The model architecture of the traffic prediction model is not limited; it can specifically be a neural network model or a time series prediction model. The training method of the traffic prediction model is also not limited; specifically, training samples can be constructed based on the historical traffic time series of network nodes. Traffic within a certain time period can be determined as sample labels, and the traffic time series of historical time periods before that period can be determined as sample features, thereby constructing training samples for training the traffic prediction model. The preset future time period is, for example, one day in the future or five hours in the future. It is understood that the higher the current or future network traffic, the higher the importance of the network node.

[0067] The embodiments of this application do not limit the node betweenness number of a network node in a preset network graph structure. Specifically, it can be the node betweenness number of the graph node corresponding to the network node in the preset network graph structure. Any graph node in the preset network graph structure is used to represent the corresponding network node. It is understood that different graph nodes in the preset network graph structure can each correspond one-to-one with different network nodes in the target network node set. For example, the preset network graph structure can contain N graph nodes, each corresponding to one of the N network nodes in the target network node set. The node betweenness number can be used to characterize the frequency with which a network node appears in the shortest path between other network nodes in the preset network graph structure. Since different other network nodes can usually communicate via the shortest path, the importance of a network node in the preset network graph structure can be measured. It is understood that the higher the node betweenness number of a network node in the preset network graph structure, the higher its importance.

[0068] Of course, other attributes of network nodes can also be used to determine importance. The embodiments of this application do not limit the information on which importance is determined. For example, the degree of a network node in a preset network graph structure can be used to determine the importance of the network node. The degree of a node can be positively correlated with its importance; the higher the degree of a node, the higher its importance.

[0069] Based on the above explanation of importance, network nodes in the target network node set whose importance is higher than a preset importance threshold can be identified as key nodes.

[0070] After identifying the key nodes, step S230 can be performed.

[0071] In one optional embodiment, it can be determined whether the identified key nodes belong to any triangular node interconnection relationship. Specifically, it can be determined whether each or multiple identified key nodes belong to any triangular node interconnection relationship individually.

[0072] The embodiments of this application do not limit the specific judgment method. Optionally, the existing triangular node interconnection relationships in the target network node set can be identified first, and then for different key nodes, it can be determined whether they belong to any of the identified triangular node interconnection relationships; or, for different key nodes, it can be determined whether the key node belongs to any triangular node interconnection relationship. Specifically, it can be determined whether there are any adjacent nodes that have established communication connections with each other among the multiple adjacent nodes of the key node. The adjacent nodes can be network nodes that have communication connections with the key node.

[0073] In one specific example, a triangular node interconnection relationship can be identified by recognizing three nodes that form a triangle based on a pre-defined network graph structure. Alternatively, it can be determined by traversing the communication connections between any two network nodes in the target network node set and checking if any other network nodes have communication connections with these two nodes to identify the triangular node interconnection relationship.

[0074] In another specific example, for any key node, each adjacent node (also called a neighbor node) can be determined. Specifically, this can be done by using a preset network graph structure, or by determining the adjacent nodes based on the current communication connection of the key node. Further, it can be determined whether there is a communication connection between different adjacent nodes in order to identify whether the key node belongs to any triangular node interconnection relationship.

[0075] It is understandable that, in the case of identifying any key node that does not belong to any triangular node interconnection relationship, step S230 above can be executed accordingly to construct a triangular node interconnection relationship that includes the key node.

[0076] Alternatively, if each key node that does not belong to any triangular node interconnection relationship is identified, step S230 can be performed separately to construct triangular node interconnection relationships containing the key nodes.

[0077] Furthermore, in an optional embodiment, for critical nodes with high importance, more triangular node interconnections can be constructed to increase communication paths and improve communication stability. The higher the importance of a critical node, the more different triangular node interconnections it can belong to. Specifically, the lower limit of the required number of triangular node interconnections can be dynamically adjusted based on the importance of the critical node, ensuring that the number of triangular node interconnections belonging to a critical node is greater than or equal to this lower limit. The higher the importance of a critical node, the higher the lower limit of the number of different triangular node interconnections it can have.

[0078] Therefore, optionally, the above method may further include: for any key node, determining a lower limit for the number of triangular node interconnections based on the importance of the key node; the determined lower limit for the number of triangular node interconnections is positively correlated with the importance of the key node; and constructing triangular node interconnections that include the key node when the number of triangular node interconnections currently belonging to the key node is less than the lower limit for the number of triangular node interconnections. This embodiment can dynamically adjust the lower limit for the number of triangular node interconnections based on the importance of the key node. For key nodes with higher importance, more triangular node interconnections can be set, thereby improving the communication stability of the key node and correspondingly improving the overall communication stability of the target network node set.

[0079] Of course, if the number of triangular node interconnections to which the critical node currently belongs is less than the lower limit of the corresponding number of triangular node interconnections, new triangular node interconnections to which the critical node belongs can be added until the number of triangular node interconnections to which the critical node currently belongs is greater than or equal to the lower limit of the corresponding number of triangular node interconnections.

[0080] The embodiments of this application do not limit the specific method of constructing triangular node interconnection relationships for key nodes. Optionally, a communication connection can be established between the key node and every two other network nodes to construct the triangular node interconnection relationship. Specifically, two other network nodes can be randomly selected from the target network node set. Of course, to improve the efficiency of establishing communication connections, optionally, a filter can be performed based on the network distance to the key node, randomly selecting two other network nodes from those whose network distance to the key node is less than a threshold to construct the triangular node interconnection relationship with the key node.

[0081] Alternatively, existing communication connections can be utilized, and two other network nodes with existing communication connections can be randomly selected to construct a triangular node interconnection relationship with the critical node. Alternatively, an adjacent node with an existing communication connection to the critical node and another randomly selected network node can be randomly selected to construct a triangular node interconnection relationship with the critical node. Alternatively, two adjacent nodes can be randomly selected from among the critical node's multiple adjacent nodes to establish a communication connection and construct a triangular node interconnection relationship; alternatively, for any adjacent node of the critical node, an adjacent node of that adjacent node (i.e., another network node connected to the critical node via two hops, or another network node whose communication with the critical node is relayed through that adjacent node) can be randomly selected to construct a triangular node interconnection relationship with the critical node.

[0082] In addition, when selecting other network nodes, the feasibility of establishing a communication connection should also be considered. For example, communication connections cannot be established with other network nodes that are too far away, have insufficient communication resources, or have all their communication ports occupied.

[0083] Of course, the different embodiments described above can be combined with each other, and various methods can be used to select other network nodes to determine whether a communication connection can be established, so as to utilize other network nodes that can establish a communication connection to construct a triangular node interconnection relationship. It is understood that if other network nodes selected by any method cannot establish a triangular node interconnection relationship, other methods can be used for selection.

[0084] Optionally, for any key node that does not belong to any triangular node interconnection relationship, a triangular node interconnection relationship including the targeted key node is constructed. Specifically, this may include: for any key node that does not belong to any triangular node interconnection relationship, if it is determined that any two adjacent network nodes of the targeted key node can establish a communication connection, a triangular node interconnection relationship is constructed for the two adjacent network nodes that can establish a communication connection and the targeted key node; the adjacent network nodes have a communication connection with the targeted key node. This embodiment can utilize the adjacent network nodes of the key node to construct the triangular node interconnection relationship. By leveraging the existing communication connection between the key node and the adjacent network nodes, the difficulty of constructing the triangular node interconnection relationship can be reduced, and the efficiency of constructing the triangular node interconnection relationship can be improved.

[0085] It is understandable that adjacent network nodes can be other network nodes that have a communication connection with the target critical node.

[0086] The embodiments of this application are not limited to the specific method of determining whether a communication connection can be established between any two adjacent network nodes. Instead, adjacent network node pairs can be determined for multiple adjacent network nodes of a single key node. Each adjacent network node pair can contain two different adjacent network nodes, and at least one different adjacent network node can exist between different adjacent network node pairs.

[0087] Optionally, for multiple pairs of different adjacent network nodes of a single key node, it is possible to determine in parallel whether a communication connection can be established. Specifically, this can be done by checking the remaining communication resources or the number of idle communication ports of adjacent network nodes, or by attempting to establish communication connections between different adjacent network nodes. The specific determination method is not limited.

[0088] Alternatively, for multiple different adjacent network node pairs of a single key node, it can be determined sequentially whether a communication connection can be established. If it is determined that two adjacent network nodes in any adjacent network node pair can establish a communication connection, it is not necessary to determine other subsequent adjacent network node pairs before starting to build the triangular node interconnection relationship, which can improve the efficiency of building the triangular node interconnection relationship.

[0089] Optionally, for any key node that does not belong to any triangular node interconnection relationship, a triangular node interconnection relationship including the target key node is constructed. Specifically, this may include: for any key node that does not belong to any triangular node interconnection relationship, determining the adjacent network node pairs of the target key node; sequentially determining whether a communication connection can be established between two adjacent network nodes in different adjacent network node pairs according to a preset order; if a communication connection exists between the adjacent network nodes and the target key node; and if it is determined that a communication connection can be established between two adjacent network nodes in any adjacent network node pair, constructing a triangular node interconnection relationship for the two adjacent network nodes that can establish a communication connection and for the target key node. This embodiment can sequentially determine whether a communication connection can be established for different adjacent network node pairs of the key node, and construct a triangular node interconnection relationship including the target key node for adjacent network node pairs that can establish a communication connection, which can improve the efficiency of constructing triangular node interconnection relationships. In this case, if it is determined that two adjacent network nodes in any adjacent network node pair can establish a communication connection, it is not necessary to judge other adjacent network node pairs in the preset order. It is possible to stop judging whether two adjacent network nodes in the subsequent adjacent network node pairs in the preset order can establish a communication connection, and start constructing a triangular node interconnection relationship for the two adjacent network nodes that can establish a communication connection and the key node targeted, which can further improve the efficiency of constructing the triangular node interconnection relationship.

[0090] The embodiments of this application do not limit the specific method of determining the adjacent network node pairs of the target critical node. Optionally, it may be to determine each adjacent network node pair of the target critical node, specifically, to determine all possible adjacent network node pairs based on each adjacent network node of the target critical node; or it may be to filter and determine the adjacent network node pairs of the target critical node, specifically, to filter based on the attributes of the adjacent network node pairs, for example, to determine adjacent network node pairs in which the sum of the importance of the two adjacent network nodes is greater than a threshold.

[0091] This application does not limit the preset order between different adjacent network node pairs. A suitable sorting method can be selected based on actual needs to obtain a suitable preset order. Optionally, if it is necessary to prioritize adjacent network nodes with higher importance for the constructed triangular node interconnection relationship, the nodes can be sorted in descending order of the sum of the importance of the two adjacent network nodes. Conversely, if it is necessary to prioritize adjacent network nodes with lower importance for the constructed triangular node interconnection relationship, the nodes can be sorted in ascending order of the sum of the importance of the two adjacent network nodes.

[0092] In a specific example, in the newly constructed triangular node interconnection relationship, if there are many network nodes with an importance higher than the threshold, more network nodes with higher importance can be covered by a single triangular node interconnection relationship. This can reduce the cost of constructing the triangular node interconnection relationship, and thus prioritize the selection of adjacent network nodes with higher importance. The adjacent network nodes can be sorted in descending order of the sum of the importance of the two adjacent network nodes contained in each adjacent network node pair.

[0093] In another specific example, in the newly constructed triangular node interconnection relationship, if the number of network nodes with importance above the threshold is small, and the network nodes with higher importance usually have higher network traffic, the stability of the triangular node interconnection relationship can be improved accordingly. Thus, the adjacent network nodes with lower importance can be selected first, and the adjacent network nodes can be sorted in order from low to high according to the sum of the importance of the two adjacent network nodes contained in the adjacent network node pair.

[0094] Optionally, adjacent network nodes can be sorted from highest to lowest probability of establishing a communication connection, with priority given to pairs of adjacent network nodes with a higher probability of establishing a communication connection. The probability of establishing a communication connection can be measured by the network distance between two adjacent network nodes; the smaller the network distance, the higher the probability of establishing a communication connection. Therefore, the nodes can be sorted from smallest to largest based on the network distance between them. The embodiments of this application do not limit the method for determining the probability of establishing a communication connection between two adjacent network nodes, nor do they limit the method for determining the network distance between two adjacent network nodes. Optionally, the network distance can be determined based on the distance of the communication path between two adjacent network nodes. Of course, considering that two adjacent network nodes can communicate through a common key node, communication paths containing a common key node can be excluded. Therefore, the network distance can be determined based on the distance of the shortest communication path between two adjacent network nodes that does not pass through a common associated node.

[0095] Of course, the preset order can also be determined by combining the different embodiments described above.

[0096] Optionally, the preset order may include any of the following: (1) the order of the sum of importance of the two adjacent network nodes in the adjacent network node pair from high to low; (2) the order of the sum of importance of the two adjacent network nodes in the adjacent network node pair from low to high; (3) the order of the network distance of the preset shortest communication path between the two adjacent network nodes in the adjacent network node pair from small to large; the preset shortest communication path includes the shortest communication path between the two adjacent network nodes that does not pass through the target key node; (4) the order of the quotient of the network distance of the preset shortest communication path and the sum of importance between the two adjacent network nodes in the adjacent network node pair from small to large. This embodiment can provide a variety of different preset orders to meet different triangular node interconnection relationship construction requirements, and can flexibly adjust different preset orders for constructing triangular node interconnection relationships, which can improve the adaptability of the constructed triangular node interconnection relationship to the construction requirements, and can improve the flexibility and efficiency of constructing triangular node interconnection relationships.

[0097] Optionally, if there is only one communication path between two adjacent network nodes in an adjacent network node pair that passes through the target key node, and there are no other communication paths, the network distance of the preset shortest communication path can be set as the maximum network distance. The maximum network distance can be infinite or the maximum network distance in the target network node set.

[0098] Optionally, the preset order can also be an ascending order of the preset attribute values ​​of adjacent network node pairs. The preset attribute values ​​of adjacent network node pairs can be positively correlated with the network distance of the preset shortest communication path between the two adjacent network nodes in the pair; the preset attribute values ​​of adjacent network node pairs can be negatively correlated with the sum of the importance of the two adjacent network nodes in the pair. It can be understood that the preset attribute values ​​of adjacent network node pairs can specifically be the quotient of the network distance of the preset shortest communication path between the two adjacent network nodes in the pair and the sum of their importance.

[0099] In addition, in an optional embodiment, when a new network node is added to the target network node set, a communication connection can be established between the new network node and the existing network nodes to integrate the new network node into the target network node set and facilitate communication between the new network node and other network nodes.

[0100] The embodiments of this application do not limit the specific method of selecting existing network nodes and new network nodes. Optionally, a network node can be randomly selected from the N network nodes already included in the target network node set to establish a communication connection with the new network node; alternatively, the selection can be based on the attributes of the network node. For example, any network node with an importance level higher or lower than a threshold can be selected from the N network nodes already included in the target network node set to establish a communication connection with the new network node.

[0101] Optionally, the above method may further include: when a new network node is determined to be added to the target network node set, for any newly added network node, determine any candidate network node that meets preset selection conditions from among N network nodes, and establish a communication connection between the newly added network node and the determined candidate network node. The preset selection conditions include at least one of the following: (1) the importance of the candidate network node is lower than the first importance threshold; (2) the number of other network nodes that the candidate network node can communicate with is greater than the number of communication nodes threshold; the other network nodes belong to the target network node set; (3) the number of adjacent network nodes of the candidate network node is less than the number of adjacent nodes threshold; there is a communication connection between the adjacent network nodes and the candidate network node. This embodiment can flexibly select network nodes to establish communication connections with newly added network nodes by setting a variety of different preset selection conditions, which can improve the flexibility of establishing communication connections with newly added network nodes.

[0102] Among them, network nodes that meet the preset selection conditions can be called candidate network nodes. Furthermore, any candidate network node can be determined and a communication connection can be established with the newly added network node.

[0103] Optionally, the other network nodes that the candidate network node can communicate with may include other network nodes that the candidate network node can communicate directly or indirectly. Specifically, it may include other network nodes that can communicate directly with the candidate network node through a communication connection, and other network nodes that can relay communication with the candidate network node through one or more other network nodes.

[0104] In a specific example, since network nodes with higher importance generally have higher traffic and relatively lower stability, any candidate network node with an importance lower than the threshold can be selected to establish a communication connection with the new network node, thereby improving the stability of the communication connection. Selecting any candidate network node that can communicate with more than the threshold number of other network nodes out of N network nodes can increase the number of network nodes the new network node can communicate with, thus expanding its communication range. For any given network node, the network nodes that can communicate include: other network nodes that can communicate directly with the target network node through a communication connection, and other network nodes that can relay communication through one or more other network nodes. Selecting any candidate network node with fewer than the threshold number of adjacent network nodes to establish a communication connection with the new network node—that is, selecting a candidate network node with more remaining communication resources or idle communication ports—can further improve the stability of the communication connection.

[0105] Optionally, for a single newly added network node, one or more alternative network nodes can be selected, and communication connections can be established with each alternative network node. The specific method for selecting each alternative network node can be found in the explanation of the above embodiments. The number of alternative network nodes selected can be positively correlated with the importance of the newly added network node.

[0106] In the embodiments of this application, different embodiments can be combined with each other or referred to for explanation. The embodiments of this application do not limit the combination of different embodiments.

[0107] For ease of understanding, this application also provides an application embodiment. This embodiment can control network nodes in a file transfer network, which can contain multiple network nodes, also referred to as file transfer nodes.

[0108] A graph can be used to represent the relationships between objects. In this embodiment, it can refer to a network topology graph consisting of file transfer nodes (represented by graph nodes) and the network connection relationships between file transfer nodes (represented by edges between graph nodes).

[0109] A triangle relationship, in a graph, refers to three nodes that are connected to each other by an edge, forming a triangle. In a file transfer network, this means that the three nodes are neighbors, forming a closed-loop network.

[0110] In this embodiment, stability refers to the ability of a network topology to maintain connectivity of remaining nodes and preserve file transfer capabilities when a node fails or a link is broken. The triangular structure exhibits high stability due to its redundant path characteristics.

[0111] The streaming triangle sensing segmentation algorithm is an algorithm used to quickly identify and label triangular structures in dynamic or static graphs. It traverses graph data through streaming processing to segment triangular subgraphs.

[0112] Critical nodes can be nodes that undertake important file transfer tasks in a file transfer network, or nodes with high degree and located in a core position.

[0113] Link completion can be a network optimization operation that involves establishing new network connections (edges) between two nodes that were not originally directly connected, in order to change the network topology and enhance network redundancy.

[0114] This embodiment provides a network stability improvement method based on graph triangular segmentation. This method assesses network stability by identifying triangular structures in the graph and proactively completes links for critical nodes without triangular structures, constructing triangular connections. This provides redundant paths at the physical link level, ensuring that critical file transmission nodes can still indirectly transmit data through neighboring nodes during network attacks or unexpected disconnections, thus guaranteeing transmission continuity and high availability.

[0115] Step 1: Construct the file transfer network graph. Information about all file transfer nodes in the network and the connection status between them can be collected. Each file transfer node is mapped to a graph node in the graph. If two file transfer nodes have a physical network connection and can transfer files, an edge is established between the two corresponding graph nodes, thus constructing the initial file transfer network graph.

[0116] Step 2: Identify triangles based on the streaming triangle perception segmentation algorithm. The streaming triangle perception segmentation algorithm is used to process the graph and identify all existing triangle relationships. This algorithm quickly locates closed loops by traversing edges and nodes and utilizing adjacency relationships.

[0117] An adjacency list can be built for each file transfer node to store the neighboring nodes of each node. Each edge is traversed in a streaming manner as the base of a potential triangle. The set of neighboring nodes of the two nodes connected by the currently traversed edge is obtained. It is then determined whether there is an intersection between the two sets of neighboring nodes, that is, nodes that are connected to both nodes connected by the currently traversed edge. If an intersection exists, then a triangle relationship can be determined.

[0118] Step 3: Locate key nodes in non-triangular structures. Traverse all nodes in the graph and, based on the output of Step 2, filter out nodes that are not in any triangular relationship. Further filter this set based on node importance indicators (such as file transfer frequency, node betweenness centrality, and preset criticality level labels) to determine the set of "key file transfer nodes in non-triangular structures." These nodes typically only have single-link connections or simple chain connections and are vulnerable points in the file transfer network.

[0119] Step 4: Explore the relationships between key nodes. For each key node in the set of "key file transfer nodes with non-triangular structures", all one-hop neighbor nodes of that key node can be obtained to determine all possible neighbor node pairs.

[0120] Step 5: Construct triangles for link completion. For each identified pair of neighbor nodes, determine if a direct network connection can be established. If so, perform link completion to construct a triangle relationship. Step 5 can be executed for each critical node in the set of "critical file transfer nodes without a triangle structure" until each critical node belongs to at least one triangle structure.

[0121] Step 6: Stability Assurance. After the above processing, all critical file transfer nodes are incorporated into the triangle structure. When the network is attacked or an accident causes a link in the triangle structure to break, the file transfer traffic can automatically and seamlessly switch to another path due to the existence of the triangle structure, thus achieving self-healing and ensuring uninterrupted transmission of critical files.

[0122] The beneficial effects of this embodiment include at least the following: (1) Improved network topology structural stability: This embodiment greatly enhances network stability by transforming the chain or star structure around key nodes into a triangular structure. (2) Proactive risk defense: Unlike the passive response after a fault in existing technologies, this embodiment identifies weak links and actively fills in the links before a fault occurs, reducing the risk of "single point of failure" in the network. (3) Optimized fault recovery speed: Since the triangular structure naturally has redundant paths, when the link is interrupted, there is no need to wait for the complex routing protocol to reconverge, and the data packets can be directly forwarded through neighboring nodes, improving transmission stability. (4) Efficient and accurate algorithm: The streaming triangular perception segmentation algorithm can quickly process large-scale graph data, accurately locate non-triangular nodes, and reinforce key weak points, effectively balancing network construction costs and stability benefits.

[0123] Based on the above method embodiments, embodiments of this application also provide a network node control device. The following will be combined with... Figure 3 The device is described in detail.

[0124] Figure 3 The diagram illustrates a structural block diagram of a network node control device according to an embodiment of this application.

[0125] like Figure 3 As shown, the network node control device 300 provided in this embodiment includes: a node set determination module 310, a key node determination module 320, and a construction module 330.

[0126] The node set determination module 310 is used to determine the target network node set; the target network node set contains N network nodes, where N is a positive integer. In one embodiment, the node set determination module 310 can be used to execute the steps S210 and related steps described above, which will not be repeated here.

[0127] The critical node determination module 320 is used to determine critical nodes with an importance level higher than a preset importance threshold among N network nodes. In one embodiment, the critical node determination module 320 can be used to execute step S220 and related steps described above, which will not be repeated here.

[0128] The construction module 330 is used to construct a triangular node interconnection relationship containing any key node that does not belong to any triangular node interconnection relationship. The triangular node interconnection relationship contains three network nodes, and each of these three network nodes has a communication connection with the other two network nodes. In one embodiment, the construction module 330 can be used to execute the steps S230 and related steps described above, which will not be repeated here.

[0129] According to an embodiment of this application, the construction module 330 is further configured to: for any key node, determine a lower limit for the number of triangular node interconnections based on the importance of the key node; the determined lower limit for the number of triangular node interconnections is positively correlated with the importance of the key node; and when it is determined that the number of triangular node interconnections to which the key node currently belongs is less than the lower limit for the number of triangular node interconnections, construct a triangular node interconnection relationship that includes the key node.

[0130] According to an embodiment of this application, the construction module 330 is used to: for any key node that does not belong to any triangular node interconnection relationship, if it is determined that any two adjacent network nodes of the key node can establish a communication connection, construct a triangular node interconnection relationship for the two adjacent network nodes that can establish a communication connection and the key node; the adjacent network nodes have a communication connection with the key node.

[0131] According to an embodiment of this application, the construction module 330 is used to: for any key node that does not belong to any triangular node interconnection relationship, determine the adjacent network node pairs of the key node, and determine whether a communication connection can be established between two adjacent network nodes contained in the adjacent network node pairs according to a preset order between different adjacent network node pairs; if the adjacent network nodes have a communication connection with the key node; and if it is determined that a communication connection can be established between two adjacent network nodes contained in any adjacent network node pair, construct a triangular node interconnection relationship for the two adjacent network nodes that can establish a communication connection and the key node.

[0132] According to the embodiments of this application, the preset order includes any one of the following: (1) the order of the sum of importance of two adjacent network nodes in an adjacent network node pair from high to low; (2) the order of the sum of importance of two adjacent network nodes in an adjacent network node pair from low to high; (3) the order of the network distance of the preset shortest communication path between two adjacent network nodes in an adjacent network node pair from small to large; the preset shortest communication path includes the shortest communication path between two adjacent network nodes that does not pass through the target key node; (4) the order of the quotient of the network distance of the preset shortest communication path and the sum of importance between two adjacent network nodes in an adjacent network node pair from small to large.

[0133] According to embodiments of this application, the method for determining importance includes: for any network node, determining the importance of the target network node based on at least one of the following information: the current network traffic of the target network node, the future network traffic of the target network node within a preset future time period, and the node betweenness number of the target network node in a preset network graph structure; any graph node in the preset network graph structure is used to represent a network node in the target network node set, and any side of the preset network graph structure is used to represent that there is a communication connection between the network nodes represented by the connected nodes; the importance of the target network node is positively correlated with the current network traffic of the target network node; the importance of the target network node is positively correlated with the future network traffic of the target network node within a preset future time period; and the importance of the target network node is positively correlated with the node betweenness number of the target network node in the preset network graph structure.

[0134] According to an embodiment of this application, the above-described apparatus may further include: a new addition module, configured to: when a new network node is determined to be added to the target network node set, for any newly added network node, determine any candidate network node that meets preset selection conditions from among N network nodes, and establish a communication connection between the newly added network node and the determined candidate network node; the preset selection conditions include at least one of the following: the importance of the candidate network node is lower than a first importance threshold; the number of other network nodes that the candidate network node can communicate with is greater than a communication node number threshold; the other network nodes belong to the target network node set; the number of adjacent network nodes of the candidate network node is less than an adjacent node number threshold; and there is a communication connection between the adjacent network nodes and the candidate network node.

[0135] According to embodiments of this application, any multiple modules among the node set determination module 310, critical node determination module 320, construction module 330, and new addition module can be merged into one module, or any one of these modules can be split into multiple modules. Alternatively, at least some of the functions of one or more of these modules can be combined with at least some of the functions of other modules and implemented in one module. According to embodiments of this application, at least one of the node set determination module 310, critical node determination module 320, construction module 330, and new addition module can be at least partially implemented as hardware circuits, such as field-programmable gate arrays, programmable logic arrays, systems-on-a-chip, systems-on-a-substrate, systems-on-package, application-specific integrated circuits, or implemented by any other reasonable means of integrating or packaging circuits, or implemented in software, hardware, and firmware, or in any appropriate combination of any of these three implementation methods. Alternatively, at least one of the node set determination module 310, critical node determination module 320, construction module 330, and new addition module can be at least partially implemented as a computer program module, which can perform corresponding functions when the computer program module is run.

[0136] The explanation of the above device embodiments can be found in the explanation of other embodiments, and any step in the above method embodiments can be executed by the corresponding module in the above device embodiments.

[0137] Figure 4 A block diagram schematically illustrates an electronic device suitable for implementing a network node control method according to an embodiment of this application.

[0138] like Figure 4As shown, an electronic device 1200 according to an embodiment of this application includes a processor 1201, which can perform various appropriate actions and processes according to a program stored in a read-only memory 1202 or a program loaded from a storage portion 1208 into a random access memory 1203. The processor 1201 may include, for example, a general-purpose microprocessor, an instruction set processor and / or an associated chipset and / or a dedicated microprocessor. The processor 1201 may also include onboard memory for caching purposes. The processor 1201 may include a single processing unit or multiple processing units for executing different steps of the method flow according to an embodiment of this application.

[0139] Random access memory 1203 stores various programs and data required for the operation of electronic device 1200. Processor 1201, read-only memory 1202, and random access memory 1203 are interconnected via bus 1204. Processor 1201 executes various steps of the method flow according to embodiments of this application by executing programs in read-only memory 1202 and / or random access memory 1203. It should be noted that the programs may also be stored in one or more memories other than read-only memory 1202 and random access memory 1203. Processor 1201 may also execute various steps of the method flow according to embodiments of this application by executing programs stored in said one or more memories.

[0140] According to embodiments of this application, the electronic device 1200 may further include an input / output interface 1205, which is also connected to the bus 1204. The electronic device 1200 may also include one or more of the following components connected to the input / output interface 1205: an input section 1206 including a keyboard, mouse, etc.; an output section 1207 including a cathode ray tube, liquid crystal display, etc., and a speaker, etc.; a storage section 1208 including a hard disk, etc.; and a communication section 1209 including a network interface card, such as a local area network card, modem, etc. The communication section 1209 performs communication processing via a network such as the Internet. A drive 1210 is also connected to the input / output interface 1205 as needed. A removable medium 1211, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on the drive 1210 as needed so that computer programs read from it can be installed into the storage section 1208 as needed.

[0141] Embodiments of this application also provide a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or it may exist independently and not assembled into the device / apparatus / system. The computer-readable storage medium carries one or more programs, which, when executed, implement the method according to the embodiments of this application.

[0142] According to embodiments of this application, the computer-readable storage medium can be a non-volatile computer-readable storage medium, such as including but not limited to: portable computer disks, hard disks, random access memory, read-only memory, erasable programmable read-only memory, portable compact disk read-only memory, optical storage devices, magnetic storage devices, or any suitable combination thereof. In embodiments of this application, the computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. For example, according to embodiments of this application, the computer-readable storage medium may include the read-only memory 1202, and / or random access memory 1203, and / or one or more memories other than read-only memory 1202 and random access memory 1203 described above.

[0143] Embodiments of this application also include a computer program product comprising a computer program containing program code for performing the methods shown in the flowchart. When the computer program product is run on a computer system, the program code is used to cause the computer system to implement the methods provided in the embodiments of this application.

[0144] In one embodiment, the computer program may rely on a tangible storage medium such as an optical storage device or a magnetic storage device. In another embodiment, the computer program may also be transmitted and distributed in the form of signals over a network medium, and may be downloaded and installed via the communication section 1209, and / or installed from the removable medium 1211. The program code contained in the computer program can be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination thereof.

[0145] In embodiments of this application, the computer program can be downloaded and installed from a network via communication section 1209, and / or installed from removable medium 1211. When the computer program is executed by processor 1201, it performs the functions defined in the system of this application embodiment. According to embodiments of this application, the systems, devices, apparatuses, modules, units, etc., described above can be implemented by computer program modules.

[0146] According to embodiments of this application, program code for executing the computer programs provided in the embodiments of this application can be written in any combination of one or more programming languages. Specifically, these computational programs can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. The program code can be executed entirely on the user's computing device, partially on the user's device, partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0147] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0148] Those skilled in the art will understand that the features described in the various embodiments of this application can be combined and / or combined in various ways, even if such combinations or combinations are not explicitly described in this application. In particular, the features described in the various embodiments of this application can be combined and / or combined in various ways without departing from the spirit and teachings of this application. All such combinations and / or combinations fall within the scope of this application.

Claims

1. A network node control method, characterized in that, The method includes: Determine the target network node set; the target network node set contains N network nodes, where N is a positive integer; Among the N network nodes, key nodes with an importance level higher than a preset importance threshold are identified; For any key node that does not belong to any triangular node interconnection relationship, construct a triangular node interconnection relationship that includes the key node; the triangular node interconnection relationship includes three network nodes, and each of the three network nodes has a communication connection with the other two network nodes respectively.

2. The method according to claim 1, characterized in that, The method further includes: For any critical node, a lower limit for the number of triangular node interconnections is determined based on the importance of the critical node; the determined lower limit for the number of triangular node interconnections is positively correlated with the importance of the critical node. If the number of triangular node interconnections to which the target key node currently belongs is less than the lower limit of the corresponding number of triangular node interconnections, construct triangular node interconnections that include the target key node.

3. The method according to claim 1, characterized in that, The construction of a triangular node interconnection relationship including the targeted key node for any key node that does not belong to any triangular node interconnection relationship includes: For any critical node that does not belong to any triangular node interconnection relationship, if it is determined that any two adjacent network nodes of the critical node can establish a communication connection, a triangular node interconnection relationship is constructed for the two adjacent network nodes that can establish a communication connection and the critical node; the adjacent network nodes have a communication connection with the critical node.

4. The method according to claim 1, characterized in that, The construction of a triangular node interconnection relationship including the targeted key node for any key node that does not belong to any triangular node interconnection relationship includes: For any critical node that does not belong to any triangular node interconnection relationship, determine the adjacent network node pairs of the critical node. According to the preset order between different adjacent network node pairs, determine whether a communication connection can be established between the two adjacent network nodes contained in the adjacent network node pair; the adjacent network nodes have a communication connection with the critical node. Given that a communication connection can be established between two adjacent network nodes in any pair of adjacent network nodes, a triangular node interconnection relationship is constructed for the two adjacent network nodes that can establish a communication connection and the target key node.

5. The method according to claim 4, characterized in that, The preset order includes any of the following: The order of the sum of importance of the two adjacent network nodes in an adjacent network node pair from highest to lowest; The order of the sum of importance of the two adjacent network nodes in an adjacent network node pair from low to high; The network distances between two adjacent network nodes in an adjacent network node pair are ordered from smallest to largest based on the shortest communication path preset between them. The preset shortest communication path includes the shortest communication path between two adjacent network nodes that does not pass through the target critical node. The order of importance of the network distance and the sum of the shortest communication path between two adjacent network nodes in an adjacent network node pair is from smallest to largest.

6. The method according to claim 1, characterized in that, The methods for determining the degree of importance include: For any given network node, determine the importance of the network node based on at least one of the following: the current network traffic of the network node, the future network traffic of the network node in a preset future time period, and the node betweenness number of the network node in a preset network graph structure. Any node in the preset network graph structure is used to represent a network node in the target network node set, and any side of the preset network graph structure is used to represent a communication connection between the network nodes represented by the connected nodes. The importance of a target network node is positively correlated with its current network traffic; the importance of a target network node is positively correlated with its future network traffic within a preset future time period; and the importance of a target network node is positively correlated with its node betweenness number in a preset network graph structure.

7. The method according to claim 1, characterized in that, The method further includes: If a new network node is determined to be added to the target network node set, for any newly added network node, any candidate network node that meets the preset selection conditions is determined from the N network nodes, and a communication connection is established between the newly added network node and the determined candidate network node. The preset selection conditions include at least one of the following: The importance of the candidate network node is lower than the first importance threshold; The number of other network nodes that the candidate network node can communicate with is greater than the threshold for the number of communicating nodes; the other network nodes belong to the target network node set. The number of neighboring network nodes of the candidate network node is less than the threshold number of neighboring nodes; there is a communication connection between the neighboring network nodes and the candidate network node.

8. A network node control device, characterized in that, The device includes: A node set determination module is used to determine a target network node set; the target network node set contains N network nodes, where N is a positive integer. The critical node determination module is used to determine critical nodes with an importance level higher than a preset importance threshold among the N network nodes; The construction module is used to construct a triangular node interconnection relationship containing any key node that does not belong to any triangular node interconnection relationship; the triangular node interconnection relationship contains three network nodes, and each of the three network nodes has a communication connection with the other two network nodes respectively.

9. An electronic device, comprising: One or more processors; Memory, used to store one or more computer programs. The characteristic feature is that the one or more processors execute the one or more computer programs to implement the steps of the method according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program or instructions stored thereon, characterized in that, When the computer program or instructions are executed by a processor, they implement the steps of the method according to any one of claims 1 to 7.

11. A computer program product, comprising a computer program or instructions, characterized in that, When the computer program or instructions are executed by a processor, they implement the steps of the method according to any one of claims 1 to 7.

Images