Knowledge routing method and device of knowledge center network
阅读说明：本技术 知识中心网络的知识路由方法及装置 (Knowledge routing method and device of knowledge center network ) 是由 许长桥 杨树杰 皮文超 赵楠 郝昊 谢海永 刘弋峰 王亚珅 于 2019-08-21 设计创作，主要内容包括：本发明实施例提供一种知识中心网络的知识路由方法及装置,该方法包括：路由节点接收同组的源节点发送的知识数据包；路由节点根据所述知识数据包中的目的地址,计算从源节点到目的节点的转发路径,并经由中间跳路由节点,转发至目的节点所在分组的路由节点,以供最终转发至所述目的节点；其中,所有节点按节点类型进行分组,每一分组由一个路由节点,和一个或多个普通节点构成,或者仅由一个路由节点构成,每一路由节点和对应分组的所有普通节点均连接。该方法避免了传统路由算法中路由闭环和收敛速度慢等问题。在知识网络中,路由路径无需各个节点自己计算,而是由本组的路由节点计算,提高了知识包的传输效率,具有较高的准确率和较低的延迟率。(The embodiment of the invention provides a knowledge routing method and a knowledge routing device of a knowledge center network, wherein the method comprises the following steps: the routing node receives a knowledge data packet sent by source nodes in the same group; the routing node calculates a forwarding path from the source node to the destination node according to the destination address in the knowledge data packet, and forwards the forwarding path to the routing node of the packet where the destination node is located through the intermediate hop routing node for final forwarding to the destination node; all nodes are grouped according to node types, each group is composed of one routing node and one or more common nodes or only one routing node, and each routing node is connected with all common nodes of the corresponding group. The method avoids the problems of closed loop routing, low convergence speed and the like in the traditional routing algorithm. In the knowledge network, the routing path is calculated by the routing nodes of the group without each node, so that the transmission efficiency of the knowledge packet is improved, and the knowledge packet has higher accuracy and lower delay rate.)
1. A knowledge routing method of a knowledge-centric network is characterized by comprising the following steps:
the routing node receives a knowledge data packet sent by source nodes in the same group;
the routing node calculates a forwarding path from the source node to the destination node according to the destination address in the knowledge data packet, and forwards the forwarding path to the routing node of the packet where the destination node is located through the intermediate hop routing node for final forwarding to the destination node;
all nodes are grouped according to node types, each group is composed of one routing node and one or more common nodes or only one routing node, and each routing node is connected with all common nodes of the corresponding group.
2. The knowledge routing method of the knowledge-centric network of claim 1, wherein before the routing node receives the knowledge data packet sent by the source node of the same group, the method further comprises:
and grouping the nodes according to the knowledge types which can be acquired by each node.
3. The knowledge routing method of the knowledge-centric network of claim 1, wherein after all the nodes are grouped according to node type, before the routing node receives the knowledge data packet sent by the source node of the same group, further comprising:
and selecting the nodes with the optimal performance from each group of nodes as routing nodes according to a preset node performance function.
4. The knowledge routing method of a knowledge-centric network of claim 3 wherein the performance parameters of the node performance function comprise:
CPU performance, remaining cache space, power stability, and number of cores.
5. The knowledge routing method of a knowledge-centric network of claim 3, further comprising:
in any group of nodes, the performance value of each node is calculated according to the node performance function and stored, if the current routing node fails, a new routing node is selected according to the stored performance value of each node, and the common node is connected to the new routing node.
6. The knowledge routing method of the knowledge-centric network of claim 1, wherein after the routing node receives the knowledge data packet sent by the source node of the same group, the method further comprises:
calculating evaluation values for all nodes of other groups according to a preset evaluation model;
and forwarding the knowledge data packet to a node of which the evaluation value meets a preset condition.
7. The knowledge routing method of the knowledge-centric network of claim 1, wherein if a newly added node is detected, the matching degree of the newly added node with each routing node is determined according to a preset matching function, and the newly added node is assigned to a group in which the routing node with the largest matching degree is located.
8. A knowledge routing apparatus for a knowledge-centric network, comprising:
the receiving module is used for receiving the knowledge data packets sent by the source nodes in the same group;
the forwarding module is used for calculating a forwarding path from a source node to a destination node according to a destination address in the knowledge data packet, and forwarding the forwarding path to a routing node of a packet where the destination node is located through an intermediate hop routing node for final forwarding to the destination node;
all nodes are grouped according to node types, each group is composed of one routing node and one or more common nodes or only one routing node, and each routing node is connected with all common nodes of the corresponding group.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor, when executing the program, carries out the steps of the knowledge routing method of the knowledge-centric network according to any one of claims 1 to 7.
10. A non-transitory computer readable storage medium, having stored thereon a computer program, characterized in that the computer program, when being executed by a processor, is adapted to carry out the steps of the method for knowledge routing of a knowledge-centric network according to any one of claims 1 to 7.
Technical Field
The invention relates to the field of network data transmission, in particular to a knowledge routing method and a knowledge routing device for a knowledge center network.
Background
In a conventional IP network, an IP address is composed of a 32-bit string of digits. Binary IP addresses are difficult to read, so one groups 8 bits binary, dividing these 32 bits into four octets makes up a decimal IP address. When routing forwarding, a forwarding port corresponding to the address needs to be found in a routing table, and the process of searching the 32-bit address is addressing. Because the number of the IP addresses is less, the addressing is carried out in a full digital mode, and the longest prefix matching is carried out in a complete tree mode to realize the search of the IP addresses. However, in the knowledge center network, the number of the knowledge names is far greater than the number of the IP addresses, and the knowledge names not only consist of numbers, but also include characters, symbols and other forms, so that the traditional addressing mode cannot be applied to the addressing of the knowledge names. Meanwhile, due to the complexity of knowledge naming addressing, the traditional full tree addressing mode is difficult to be applied to a knowledge center network.
The traditional routing and sharing mechanism works in the third layer of the Open System Interconnection (OSI) reference model, namely the network layer, and realizes packet forwarding and sharing. Routers implement network interconnections by forwarding packets. While routers may support multiple protocols (e.g., TCP/IP, IPX/SPX, AppleTalk, etc.), most routers run the TCP/IP protocol. A conventional router typically connects two or more logical ports, identified by IP subnets or point-to-point protocols, with at least 1 physical port. The router determines an output port and a next hop address according to a network layer address in the received data packet and a routing table maintained inside the router, and rewrites a link layer data packet header to realize forwarding of the data packet. Routers maintain routing tables to reflect the current network topology by dynamically maintaining routing tables, and to exchange routing and link information through other routers on the network.
In the knowledge center Network, knowledge routing runs in an application layer (the whole knowledge deduction Network is an Overlay Network running in the application layer), and the knowledge center Network is responsible for maintaining a knowledge routing table, executing knowledge compiling and addressing and supporting the addressing and forwarding of knowledge in a high-speed and reliable transmission mode.
The knowledge network name is huge in scale, far exceeds the number of the existing IP addresses, and is different from the IP addresses which are composed of single elements of numbers, and the knowledge network name is composed of a plurality of elements of numbers, characters, symbols and the like. How to realize low-consumption and high-efficiency forwarding of a knowledge network is a problem to be solved urgently at present.
Disclosure of Invention
In order to solve the above problem, embodiments of the present invention provide a knowledge routing method and apparatus for a knowledge-centric network.
In a first aspect, an embodiment of the present invention provides a knowledge routing method for a knowledge-centric network, including: the routing node receives a knowledge data packet sent by source nodes in the same group; the routing node calculates a forwarding path from the source node to the destination node according to the destination address in the knowledge data packet, and forwards the forwarding path to the routing node of the packet where the destination node is located through the intermediate hop routing node for final forwarding to the destination node; all nodes are grouped according to node types, each group is composed of one routing node and one or more common nodes or only one routing node, and each routing node is connected with all common nodes of the corresponding group.
Further, before the routing node receives the knowledge data packet sent by the source node of the same group, the method further includes: and grouping the nodes according to the knowledge types which can be acquired by each node.
Further, after all the nodes are grouped according to the node types and before the routing node receives the knowledge data packet sent by the source node in the same group, the method further includes: and selecting the nodes with the optimal performance from each group of nodes as routing nodes according to a preset node performance function.
Further, the performance parameters of the node performance function include: CPU performance, remaining cache space, power stability, and number of cores.
Further, the method also includes: in any group of nodes, the performance value of each node is calculated according to the node performance function and stored, if the current routing node fails, a new routing node is selected according to the stored performance value of each node, and the common node is connected to the new routing node.
Further, after the routing node receives the knowledge data packet sent by the source node of the same group, the method further includes: calculating evaluation values for all nodes of other groups according to a preset evaluation model; and forwarding the knowledge data packet to a node of which the evaluation value meets a preset condition.
Further, if a newly added node is detected, the matching degree of the newly added node and each routing node is determined according to a preset matching function, and the newly added node is distributed to the group where the routing node with the largest matching degree is located.
In a second aspect, an embodiment of the present invention provides a knowledge routing apparatus for a knowledge-centric network, including: the receiving module is used for receiving the knowledge data packets sent by the source nodes in the same group; the forwarding module is used for calculating a forwarding path from a source node to a destination node according to a destination address in the knowledge data packet, and forwarding the forwarding path to a routing node of a packet where the destination node is located through an intermediate hop routing node for final forwarding to the destination node; all nodes are grouped according to node types, each group is composed of one routing node and one or more common nodes or only one routing node, and each routing node is connected with all common nodes of the corresponding group.
In a third aspect, an embodiment of the present invention provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the steps of the knowledge routing method for the knowledge-centric network according to the first aspect of the present invention.
In a fourth aspect, an embodiment of the present invention provides a non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the steps of the knowledge routing method of the knowledge-centric network of the first aspect of the present invention.
In the knowledge routing method and device for the knowledge-centric network provided by the embodiment of the invention, under the environment of the knowledge-centric network, nodes in the network are divided into correct classes according to a classification mechanism, each different class selects a routing node for each class according to a routing strategy, a forwarding path of a knowledge packet is calculated by the routing node of the class where a source node is located, and forwarding action is completed according to the obtained forwarding path. Meanwhile, the problems of closed loop routing, low convergence speed and the like in the traditional routing algorithm are avoided. The transmission routing path of the knowledge packet does not need to be calculated by each node, but the calculation work is handed over to the routing nodes of the group, so that the problem of routing search of the knowledge packet in the local is solved, and the transmission efficiency of the knowledge packet is greatly improved. The invention can enable the source node to rapidly send the knowledge packet to the destination node, and has higher accuracy and lower delay rate.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a flowchart of a knowledge routing method of a knowledge-centric network according to an embodiment of the present invention;
FIG. 2 is a diagram of a knowledge routing system of a knowledge-centric network according to an embodiment of the present invention;
FIG. 3 is a diagram of a knowledge routing apparatus of a knowledge-centric network according to an embodiment of the present invention;
fig. 4 is a schematic physical structure diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The method aims to reduce the time of knowledge router knowledge addressing, reduce network delay and improve network transmission efficiency. To solve the problem, the embodiment of the invention provides a knowledge routing method for a knowledge-centric network. The method can be applied to the knowledge data packet forwarding scene of the knowledge center network, for example, a plurality of unmanned aerial vehicles carry out investigation cooperatively, each group of unmanned aerial vehicles acquires one type of information, and mutual forwarding of the knowledge data packets among the groups is realized.
Fig. 1 is a flowchart of a knowledge routing method for a knowledge-centric network according to an embodiment of the present invention, and as shown in fig. 1, the embodiment of the present invention provides a knowledge routing method for a knowledge-centric network, including:
101, the routing node receives the knowledge data packet sent by the source node of the same group.
In 101, all nodes have been grouped according to node type, i.e. each type of node is grouped into a group, each group is composed of a routing node and one or more common nodes, or is composed of only one routing node, i.e. each group includes at least one routing node, there may be 0 to more common nodes. And selecting a routing node in each class according to a routing strategy, wherein each routing node is connected with all the common nodes of the corresponding group. The routing nodes can be in a full connection relationship, or the connection relationship can be established according to specific requirements. The source node constructs a knowledge data packet containing a destination address from a message to be sent, and the source node only needs to send the knowledge data packet to be sent to the routing node of the class where the source node is located, that is, the routing node receives the knowledge data packet sent by the source node of the same group. It should be noted that the connection between the nodes may be a wired connection or a wireless connection, which is determined according to a specific application scenario.
And 102, the routing node calculates a forwarding path from the source node to the destination node according to the destination address in the knowledge data packet, and forwards the forwarding path to the routing node of the packet where the destination node is located through the intermediate hop routing node for final forwarding to the destination node.
In 102, the routing node calculates a complete path from the source point to the destination node according to the destination address in the knowledge packet, forwards the knowledge packet, and forwards the knowledge packet to the next-hop routing node through the path routing node, thereby completing the forwarding action. And each routing node can forward the knowledge data packet according to the forwarding path after receiving the knowledge packet until the knowledge data packet reaches the routing node of the group where the destination node is located.
In the knowledge routing method for the knowledge-centric network provided by this embodiment, under the knowledge-centric network environment, nodes in the network are divided into correct classes according to a classification mechanism, each different class selects a routing node for each class according to a routing policy, a forwarding path of a knowledge packet is calculated by a routing node of the class in which a source node of the forwarding path is located, and a forwarding action is completed according to the obtained forwarding path. Meanwhile, the problems of closed loop routing, low convergence speed and the like in the traditional routing algorithm are avoided. The transmission routing path of the knowledge packet does not need to be calculated by each node, but the calculation work is handed over to the routing nodes of the group, so that the problem that the knowledge packet is subjected to routing search locally is solved, and the transmission efficiency of the knowledge packet is greatly improved. The invention can enable the source node to rapidly send the knowledge packet to the destination node, and has higher accuracy and lower delay rate.
Based on the content of the foregoing embodiment, as an optional embodiment, before the routing node receives the knowledge data packet sent by the source node in the same group, the method further includes: and grouping the nodes according to the knowledge types which can be acquired by each node.
Each node is grouped according to the type of knowledge that can be acquired, for example, if the node A1 can acquire images, the node A1 is divided into the categories of acquired images; node B2 is able to acquire the electromagnetic pulse, then B2 is classified into the category of acquiring the electromagnetic pulse, and so on. Fig. 2 is a structure diagram of a knowledge routing system of a knowledge-centric network according to an embodiment of the present invention, and as shown in fig. 2, four types of node types are taken as an example for explanation, A, B, C and D are routing nodes, and a corresponding node is a general node of a corresponding group. The number of classes in the network is determined by the different types of nodes after the network reaches a steady state. The network nodes are classified into the correct classes according to the knowledge types which can be acquired by each node, so that the correct forwarding of the knowledge packet is facilitated, and the forwarding efficiency can be realized.
Based on the content of the foregoing embodiment, as an optional embodiment, after all the nodes are grouped according to node types, before the routing node receives the knowledge data packet sent by the source node in the same group, the method further includes: and selecting the nodes with the optimal performance from each group of nodes as routing nodes according to a preset node performance function.
Based on the content of the foregoing embodiment, as an optional embodiment, the performance parameters of the node performance function include: CPU performance, remaining cache space, power stability, and number of cores.
Specifically, each node reference performance function P (n) may be set and defined in advancei) Represents a node niReference property of (2).
For example, the following performance reference functions may be defined:
wherein c isi∈C，wiThe epsilon W and C (cpu, rcs, ps and kn) represent parameters for evaluating the performance of the node; w (W)cpu,wrcs,wps,wkn) Representing the weight occupied by each parameter.
The Cpu entry is the CPU performance and may include the frequency of the CPU and the second level cache, where the higher the frequency, the larger the second level cache, and the faster the speed. rcs (remaining cache space) is the remaining cache space; ps (power source) is power source stability; kn (kernel number) is the number of cores; k is the number of performance parameters. Finally, according to the reference performance function P (n)i) And selecting the node with the highest performance in each class as the routing node of the class.
Through the preset node performance function, the nodes with strong performance can be selected as the routing nodes, so that the routing calculation method is favorable for dealing with larger calculation load in the routing calculation process, and the forwarding efficiency can be realized.
The performance parameters through the node performance function include: the CPU performance, the residual cache space, the power stability and the number of the inner cores can further realize the accurate evaluation of the node performance by the node performance function.
Based on the content of the foregoing embodiment, as an optional embodiment, the method further includes: in any group of nodes, the performance value of each node is calculated according to the node performance function and stored, if the current routing node fails, a new routing node is selected according to the stored performance value of each node, and the common node is connected to the new routing node.
Considering the possibility that a routing node has a fault, such as a downtime fault, the group in which the faulty routing node is located cannot be forwarded. In this embodiment, the performance value of each node in any group is stored on the basis of the performance value evaluated by the performance reference function. For example, a list is created to store the performance values of each node. If the current routing node of the group fails, selecting a new routing node according to the performance value, for example, selecting a common node with the performance value second to the original routing node as the new routing node. At the same time, the remaining ordinary nodes are connected to the new routing node.
As an optional embodiment, if the original failed routing node returns to normal, the routing node is directly replaced with the routing node which has the largest calculated performance value and returned to normal by the failure. The performance values of all nodes can be recalculated according to the performance reference function, and the routing node is selected again.
If the current routing node fails, a new routing node is selected according to the stored performance values of all the nodes, and when the current path node fails, the normal use of network forwarding is still ensured.
Based on the content of the foregoing embodiment, as an optional embodiment, after the routing node receives the knowledge packet sent by the source node in the same group, the method further includes: calculating evaluation values for all nodes of other groups according to a preset evaluation model; and forwarding the knowledge data packet to a node of which the evaluation value meets a preset condition.
In this embodiment, the knowledge routing process is mainly divided into availability evaluation and packet forwarding. After a certain device node generates knowledge, the "availability" of the knowledge to other device nodes (i.e., the value of forwarding the knowledge to the node for caching) is evaluated through a preset evaluation model. The calculation can be carried out by the knowledge generating node, the calculation can also be carried out for the routing node, or the calculation of other grouping routing nodes is sent to the current routing node. When the knowledge is forwarded, the newly-generated equipment node calculates the evaluation values Q of all nodes (nodes to receive the newly-generated knowledge data packet) of other groups through a preset evaluation modeliAnd forwarding the knowledge data packet to a node of which the evaluation value meets the preset condition. For example, if QiAnd if the value is larger than the preset threshold, forwarding the addressed knowledge data packet to the i node.
The evaluation model can be set according to requirements, for example, the evaluation model is determined according to performance parameters such as the computing power of the data node to be received and the acquired knowledge type. For example, after availability evaluation, the routing node in group a sends the received knowledge packet to one or two nodes with the largest availability value to cache the knowledge packet, thereby achieving the purpose of data backup. In this case, one or two nodes with the largest size may be selected by setting a preset condition according to the evaluation criterion of the evaluation model using the node residual space of the B, C, D groups, and the data packet may be sent to the node.
Specifically, after the device node that newly generates knowledge is evaluated, the knowledge forwarding policy may be as follows: when knowledge is found, the knowledge finding equipment carries out knowledge addressing, searches a knowledge address capability table, determines the address of a target related knowledge cache node, then constructs a request message, sends the request message through a network, achieves a target node through forwarding of network intermediate nodes, constructs a response message by the target node, and sends the response message through the network.
According to a preset evaluation model, the availability of the received knowledge data packet is evaluated, the nodes with the availability are forwarded, and the nodes without the availability are not forwarded, so that the huge energy consumption caused by broadcasting is avoided, and the problem of low unicast efficiency is solved.
Based on the content of the foregoing embodiment, as an optional embodiment, if a newly added node is detected, according to a preset matching function, the matching degree between the newly added node and each routing node is determined, and the newly added node is allocated to a packet in which the routing node with the largest matching degree is located.
It is considered that the newly added node may acquire a plurality of knowledge types, such as an image collector, an electromagnetic pulse collector, and the like. The newly added node and the routing node of each class calculate a matching value according to the matching function, the matching value reflects the matching degree, and the node is added into the class with the maximum matching value, so that the accurate classification of the newly added node is facilitated, and the forwarding efficiency of the network is improved. The matching function can be set according to requirements, such as setting the matching function according to the type of the acquired knowledge.
For example, the matching function is used to reflect the degree of identity between nodes, and the setting of the matching function is: each node has n features, including the feature as 1, and not including as 0. For example, the n features include: temperature sensor characteristics, image acquisition characteristics, voiceprint acquisition characteristics, electromagnetic pulse perception characteristics. The newly added node P is (1, 0, 0, 1), which indicates that the node has the characteristics of a temperature sensor and sensing electromagnetic pulse. The more identical eigenvalues of two nodes, the larger the matching function. For example, if the routing node a is (1, 0, 0, 1), B is (1, 0, 0, 0), C is (0, 0, 0, 1), and the matching degree between the routing node a and P is 2, P is assigned to the packet in which the routing node a is located.
In the embodiment of the invention, a knowledge forwarding strategy based on grouping is provided by combining a node grouping and dividing mechanism, so that the defects caused by network flooding and accurate searching are avoided, and the forwarding with low knowledge consumption and high efficiency is realized.
Fig. 3 is a structural diagram of a knowledge routing apparatus of a knowledge-centric network according to an embodiment of the present invention, and as shown in fig. 3, the knowledge routing apparatus of the knowledge-centric network includes: a receiving
All nodes are grouped according to node types, namely each type of node is divided into a group, each group consists of one routing node and one or more common nodes, or only consists of one routing node, namely each group at least comprises one routing node, and 0 to more common nodes can be arranged. And selecting a routing node in each class according to a routing strategy, wherein each routing node is connected with all the common nodes of the corresponding group. The routing nodes can be in a full connection relationship, or the connection relationship can be established according to specific requirements. The source node constructs a knowledge data packet containing a destination address for a message to be sent, and the source node only needs to send the knowledge data packet to be sent to the receiving
The
The device embodiment provided in the embodiments of the present invention is for implementing the above method embodiments, and for details of the process and the details, reference is made to the above method embodiments, which are not described herein again.
The knowledge routing device of the knowledge center network provided by the embodiment of the invention divides nodes in the network into correct classes according to a classification mechanism under the knowledge center network environment, each different class selects a routing node for each class according to a routing strategy, a forwarding path of a knowledge packet is calculated by the routing node of the class where a source node is located, and a forwarding action is completed according to the obtained forwarding path. Meanwhile, the problems of closed loop routing, low convergence speed and the like in the traditional routing algorithm are avoided. The transmission routing path of the knowledge packet does not need to be calculated by each node, but the calculation work is handed over to the routing nodes of the group, so that the problem of routing search of the knowledge packet in the local is solved, and the transmission efficiency of the knowledge packet is greatly improved. The invention can enable the source node to rapidly send the knowledge packet to the destination node, and has higher accuracy and lower delay rate.
Fig. 4 is a schematic entity structure diagram of an electronic device according to an embodiment of the present invention, and as shown in fig. 4, the electronic device may include: a processor (processor)401, a communication Interface (communication Interface)402, a memory (memory)403 and a
In addition, the logic instructions in the
In another aspect, an embodiment of the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program is implemented to perform the transmission method provided in the foregoing embodiments when executed by a processor, and for example, the method includes: the routing node receives a knowledge data packet sent by source nodes in the same group; the routing node calculates a forwarding path from the source node to the destination node according to the destination address in the knowledge data packet, and forwards the forwarding path to the routing node of the packet where the destination node is located through the intermediate hop routing node for final forwarding to the destination node; all nodes are grouped according to node types, each group is composed of one routing node and one or more common nodes or only one routing node, and each routing node is connected with all common nodes of the corresponding group.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.