Terminal computing power network-oriented relay forwarding node selection method and system
Through the distributed hash table DHT filtering and monitoring mechanism, the problem of inter-node communication in the terminal computing power network is solved, efficient relay and forwarding node selection and connection quality assurance is achieved, and the network resource needs of the service provider node are met.
Patent Information
- Application Number
- CN202411321164.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-23
- Publication Date
- 2024-12-27
- Estimated Expiration
- 2044-09-23
AI Technical Summary
In terminal computing power networks, the existing technology cannot effectively ensure direct interoperability between nodes, especially in the absence of static public network IP addresses, complex firewalls and NAT configurations, the transmission quality and performance are insufficient, making it difficult to achieve relay connections .
Search the relay forwarding node list through the distributed hash table DHT, obtain and filter the relay forwarding nodes that meet service needs, perform preliminary, second and third filters, combine random algorithms and IP home information to select the relay forwarding node, and establish a Relay connections, and monitor connection quality in real time, and dynamically adjust relay resources to ensure business quality.
The connection resource information of the relay service is updated in a timely manner, meeting the network resource needs of the service provider nodes, and ensuring the communication quality between the service provider nodes and the service consumption nodes.
Smart Images

Figure CN119212035A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of computing power scheduling technology, and in particular to a relay forwarding node selection method and system for a terminal computing power network. Background Art
[0002] Computing power network has emerged as a new type of technical research topic, aiming to solve the problem of coordinated scheduling of ubiquitous computing power and network. At present, most research and technical directions focus on the coordination and optimization of bearer network and edge computing and cloud computing. As a typical application scenario with high computing idle rate and uneven allocation of network resources, the terminal computing power network for broadband access network has less research investment in the industry and lacks relevant technical solutions. Especially when building the network connection layer of the terminal computing power network, it is often based on the existing P2P connection technology, but this type of technology only solves the problem of whether there is network connection, and there are still deficiencies in transmission quality and performance.
[0003] In the complex scenario of the terminal computing network, the computing network is large in scale, widely distributed, complex in structure, and has large differences in terminal devices. In addition, in the broadband access network, the IPv4 network has complex network address translation (NAT) configurations, and the IPv6 network has state firewall restrictions. Therefore, it is a reasonable solution to achieve direct intercommunication between these nodes through technologies such as NAT penetration and firewall penetration. However, in reality, the network environment of the nodes is very complex, and the above technologies cannot guarantee that peers can directly visit each other, so relay servers are still needed to provide relay links to achieve connections between peers.
[0004] For terminal devices that lack static public IP addresses and have complex firewall and NAT configurations, a relay forwarding node selection method and system for terminal computing power networks are proposed, which provide computing power services to the outside world or use external computing power services through relay connections. Summary of the invention
[0005] In order to remedy the deficiencies of the prior art, the present invention provides a simple and efficient method and system for selecting relay forwarding nodes for a terminal computing power network.
[0006] The present invention is achieved through the following technical solutions:
[0007] A method for selecting a relay forwarding node for a terminal computing network, characterized in that it comprises the following steps:
[0008] Step S1, obtaining network resource demand information of deployed services;
[0009] First, obtain the network resource requirement information of the deployed services on the service provider node, including but not limited to the minimum bandwidth requirement, maximum latency requirement and number of connections required, for reference in the subsequent selection process of relay forwarding nodes;
[0010] Step S2: Search the distributed hash table DHT to retrieve the relay forwarding node list and perform preliminary screening;
[0011] The service provider node searches and retrieves the distributed hash table DHT to obtain a list of available relay forwarding nodes, and screens them based on the tunnel protocol type and encryption type to obtain a preliminary screened list of relay forwarding nodes;
[0012] In the step S2, a custom periodic timer is used to update the connection resource information available to the relay forwarding node to the distributed hash table DHT at a custom period;
[0013] The available connection resource information of the relay forwarding node includes but is not limited to available bandwidth, number of available connections, supported relay tunnel protocols and supported encryption methods;
[0014] The relay forwarding node list is formed by screening according to the relay tunnel protocols and encryption methods supported by the service provider nodes.
[0015] Step S3, performing secondary screening based on available bandwidth and number of connections;
[0016] The service providing node further screens the relay forwarding node list after the preliminary screening, and filters out the relay forwarding nodes whose available bandwidth and available connection number do not meet the requirements of the deployed services on the service providing node, thereby forming a relay forwarding node list after secondary screening;
[0017] Step S4: perform a distributed hash table DHT search again to obtain the associated address information multiaddr;
[0018] The service provider node searches the distributed hash table DHT again based on the node identifier Peer ID in the relay forwarding node list after the secondary screening to find its corresponding associated address information multiaddr;
[0019] Step S5: perform a connection test, obtain connection performance data, filter out relay forwarding nodes that cannot meet the service requirements of the deployed service providing nodes, and form a relay forwarding node list after three screenings;
[0020] If the list of relay forwarding nodes after three screenings formed by the connection test is not empty, a relay connection is established with at least one of the relay forwarding nodes, otherwise a network connection alarm message is output;
[0021] In the step S5, after the connection test is completed, the delay, packet loss and jitter information of each relay forwarding node under test are recorded, and the relay forwarding nodes that cannot meet the maximum delay requirement of the deployed service of the service providing node are filtered out to form a relay forwarding node list after three screenings;
[0022] The service providing node selects at least one relay forwarding node from the relay forwarding node list after three screenings based on a random algorithm and / or IP attribution information to establish a relay connection.
[0023] More preferably, the service provider node selects at least two relay forwarding nodes to establish a relay connection to avoid a single point failure that causes the service provider node to be inaccessible.
[0024] Step S6: The service providing node monitors the performance data of the established relay connection to determine whether the relay connection meets the network resource requirements of the service provided by the service providing node:
[0025] If satisfied, the connection is maintained and monitoring continues;
[0026] If not, jump to step S2 to find a suitable relay forwarding node;
[0027] In the step S6, all relay connections of the relay forwarding node are monitored in real time, and a custom periodic timer is defined to monitor the performance data of the established relay connections at a custom period;
[0028] Performance data of established relay connections includes, but is not limited to, latency, packet loss, jitter information, and available bandwidth information to relay forwarding nodes;
[0029] When it is detected that the quality of some relay connections is deteriorated, the suitable relay forwarding node is searched again according to steps S2 to S5. When it is detected that the quality of all relay connections is deteriorated, the corresponding network connection alarm information is output.
[0030] Step S7: After establishing a relay connection with the service provider node, the relay forwarding node reserves available bandwidth and number of connections equal to the minimum bandwidth requirement for the corresponding service provider node, and preferentially forwards the uplink and downlink traffic of the service provider node to ensure service quality;
[0031] After the relay forwarding node completes the reservation of available bandwidth, the available connection resource information of the relay forwarding node is updated to the distributed hash table DHT, where the available bandwidth and the number of available connections are deducted from the reserved resources.
[0032] A relay forwarding node selection system for a terminal computing network, comprising:
[0033] The distributed hash table DHT maintenance module is responsible for customizing the periodic timer and updating the connection resource information available to the relay forwarding node to the distributed hash table DHT at a custom period; the available connection resource information of the relay forwarding node includes but is not limited to available bandwidth, number of available connections, supported relay tunneling protocols and supported encryption methods;
[0034] The network resource requirement module is responsible for obtaining the network resource requirement information of the deployed services on the service provider node, including but not limited to the minimum bandwidth requirement, maximum latency requirement and number of connections required, for reference in the subsequent selection process of relay forwarding nodes;
[0035] The preliminary screening module is responsible for searching and retrieving the distributed hash table DHT to obtain a list of available relay forwarding nodes, and screening the relay tunnel protocols and encryption methods supported by the service provider nodes to obtain a list of relay forwarding nodes after preliminary screening;
[0036] The secondary screening module is responsible for further screening based on the relay forwarding node list after the initial screening, filtering out the relay forwarding nodes whose available bandwidth and available connection number do not meet the requirements of the deployed services on the service providing node, and forming a relay forwarding node list after the secondary screening;
[0037] The second retrieval module is responsible for searching the distributed hash table DHT again based on the node identifier Peer ID in the relay forwarding node list after the second screening, and finding its corresponding associated address information multiaddr;
[0038] The connection test module is responsible for performing connection tests, obtaining connection performance data, filtering out relay forwarding nodes that cannot meet the service requirements of the deployed service provider nodes, and forming a list of relay forwarding nodes after three screenings;
[0039] If the list of relay forwarding nodes after three screenings formed by the connection test is not empty, a relay connection is established with at least one of the relay forwarding nodes, otherwise a network connection alarm message is output;
[0040] After completing the connection test, the connection test module records the delay, packet loss and jitter information of each relay forwarding node under test, filters out the relay forwarding nodes that cannot meet the maximum delay requirement of the deployed service of the service providing node, and forms a relay forwarding node list after three screenings;
[0041] The service providing node selects at least one relay forwarding node from the relay forwarding node list after three screenings based on a random algorithm and / or IP attribution information to establish a relay connection.
[0042] More preferably, the service provider node selects at least two relay forwarding nodes to establish a relay connection to avoid a single point failure that causes the service provider node to be inaccessible.
[0043] The relay connection monitoring module is responsible for monitoring the performance data of established relay connections and determining whether the relay connections meet the network resource requirements of the deployed services of the service provider node:
[0044] If satisfied, the connection is maintained and monitoring continues;
[0045] If not, the preliminary screening module is triggered to search for a suitable relay forwarding node again;
[0046] The relay connection monitoring module monitors all relay connections of the relay forwarding node in real time, and uses a custom periodic timer to monitor the performance data of the established relay connections at a custom periodicity;
[0047] Performance data of established relay connections includes, but is not limited to, latency, packet loss, jitter information, and available bandwidth information to relay forwarding nodes;
[0048] When it is detected that the quality of some relay connections has deteriorated, the applicable relay forwarding node is searched again. When it is detected that the quality of all relay connections has deteriorated, the corresponding network connection alarm information is output.
[0049] The connection resource management module is responsible for reserving available bandwidth and number of connections equal to the minimum bandwidth requirement for the corresponding service provider node after the relay forwarding node establishes a relay connection with the service provider node, and giving priority to forwarding the uplink and downlink traffic of the service provider node to ensure service quality;
[0050] After the relay forwarding node completes the reservation of available bandwidth, the available connection resource information of the relay forwarding node is updated to the distributed hash table DHT, wherein the available bandwidth and the number of available connections are deducted from the reserved resources.
[0051] A readable storage medium, characterized in that: a computer program is stored on the readable storage medium, and the computer program implements the above method when executed by a processor.
[0052] The beneficial effects of the present invention are: the relay forwarding node selection method and system for the terminal computing power network can timely update the connection resource information of the relay forwarding nodes providing relay services, meet the network resource requirements of the deployed services on the service providing nodes, realize the communication between the service providing nodes and the service consuming nodes, and ensure the connection quality of the services. BRIEF DESCRIPTION OF THE DRAWINGS
[0053] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.
[0054] Attached Figure 1 A schematic diagram of a relay forwarding node selection method for a terminal computing power network according to the present invention. DETAILED DESCRIPTION
[0055] In order to enable those skilled in the art to better understand the technical solutions in the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.
[0056] In current P2P networks, distributed hash tables (DHTs) are commonly used to retrieve nodes that can provide relay services and select one of the nodes to perform relay forwarding. However, in the scenario of terminal computing network, the relay traffic demand is large, and the node load and dynamicity of providing relay forwarding services are high. It is necessary to expand the connection resource status information of the relay forwarding nodes in the distributed hash table (DHT) so that the service providing node can select the relay forwarding node that meets its needs.
[0057] There are usually three types of nodes in the service model of the terminal computing network, namely service provider nodes, relay forwarding nodes, and service consumption nodes. Among them, since the service provider nodes and service consumption nodes are located behind firewalls or NAT devices, there is a situation where the two cannot communicate directly, and they need to communicate through relay forwarding nodes with public IP addresses.
[0058] The relay forwarding node selection method for the terminal computing network records and searches for relay forwarding nodes that can provide relay services through the distributed hash table DHT, and expands the connection resource status information of the nodes. The service providing node selects a node from the found relay forwarding nodes to achieve communication with the service consuming node and ensure the connection quality of the service.
[0059] The specific steps include:
[0060] Step S1, obtaining network resource demand information of deployed services;
[0061] First, obtain the network resource requirement information of the deployed services on the service provider node, including but not limited to the minimum bandwidth requirement, maximum latency requirement and number of connections required, for reference in the subsequent selection process of relay forwarding nodes;
[0062] Step S2: Search the distributed hash table DHT to retrieve the relay forwarding node list and perform preliminary screening;
[0063] The service provider node searches and retrieves the distributed hash table DHT to obtain a list of available relay forwarding nodes, and screens them based on the tunnel protocol type and encryption type to obtain a preliminary screened list of relay forwarding nodes;
[0064] In the step S2, a custom periodic timer is used to update the connection resource information available to the relay forwarding node to the distributed hash table DHT at a custom period;
[0065] The available connection resource information of the relay forwarding node includes but is not limited to available bandwidth, number of available connections, supported relay tunnel protocols and supported encryption methods;
[0066] The relay forwarding node list is formed by screening according to the relay tunnel protocols and encryption methods supported by the service provider nodes.
[0067] Step S3, performing secondary screening based on available bandwidth and number of connections;
[0068] The service providing node further screens the relay forwarding node list after the preliminary screening, and filters out the relay forwarding nodes whose available bandwidth and available connection number do not meet the requirements of the deployed services on the service providing node, thereby forming a relay forwarding node list after secondary screening;
[0069] Step S4: perform a distributed hash table DHT search again to obtain the associated address information multiaddr;
[0070] The service provider node searches the distributed hash table DHT again based on the node identifier Peer ID in the relay forwarding node list after the secondary screening to find its corresponding associated address information multiaddr;
[0071] Step S5: perform a connection test, obtain connection performance data, filter out relay forwarding nodes that cannot meet the service requirements of the deployed service providing nodes, and form a relay forwarding node list after three screenings;
[0072] If the list of relay forwarding nodes after three screenings formed by the connection test is not empty, a relay connection is established with at least one of the relay forwarding nodes, otherwise a network connection alarm message is output;
[0073] In the step S5, after the connection test is completed, the delay, packet loss and jitter information of each relay forwarding node under test are recorded, and the relay forwarding nodes that cannot meet the maximum delay requirement of the deployed service of the service providing node are filtered out to form a relay forwarding node list after three screenings;
[0074] The service providing node selects at least one relay forwarding node from the relay forwarding node list after three screenings based on a random algorithm and / or IP attribution information to establish a relay connection.
[0075] More preferably, the service provider node selects at least two relay forwarding nodes to establish a relay connection to avoid a single point failure that causes the service provider node to be inaccessible.
[0076] Step S6: The service providing node monitors the performance data of the established relay connection to determine whether the relay connection meets the network resource requirements of the service provided by the service providing node:
[0077] If satisfied, the connection is maintained and monitoring continues;
[0078] If not, jump to step S2 to find a suitable relay forwarding node;
[0079] In the step S6, all relay connections of the relay forwarding node are monitored in real time, and a custom periodic timer is defined to monitor the performance data of the established relay connections at a custom period;
[0080] Performance data of established relay connections includes, but is not limited to, latency, packet loss, jitter information, and available bandwidth information to relay forwarding nodes;
[0081] When it is detected that the quality of some relay connections is deteriorated, the suitable relay forwarding node is searched again according to steps S2 to S5. When it is detected that the quality of all relay connections is deteriorated, the corresponding network connection alarm information is output.
[0082] Step S7: After establishing a relay connection with the service provider node, the relay forwarding node reserves available bandwidth and number of connections equal to the minimum bandwidth requirement for the corresponding service provider node, and preferentially forwards the uplink and downlink traffic of the service provider node to ensure service quality;
[0083] After the relay forwarding node completes the reservation of available bandwidth, the available connection resource information of the relay forwarding node is updated to the distributed hash table DHT, where the available bandwidth and the number of available connections are deducted from the reserved resources.
[0084] The relay forwarding node selection system for the terminal computing network includes:
[0085] The distributed hash table DHT maintenance module is responsible for customizing the periodic timer and updating the connection resource information available to the relay forwarding node to the distributed hash table DHT at a custom period; the available connection resource information of the relay forwarding node includes but is not limited to available bandwidth, number of available connections, supported relay tunneling protocols and supported encryption methods;
[0086] The network resource requirement module is responsible for obtaining the network resource requirement information of the deployed services on the service provider node, including but not limited to the minimum bandwidth requirement, maximum latency requirement and number of connections required, for reference in the subsequent selection process of relay forwarding nodes;
[0087] The preliminary screening module is responsible for searching and retrieving the distributed hash table DHT to obtain a list of available relay forwarding nodes, and screening the relay tunnel protocols and encryption methods supported by the service provider nodes to obtain a list of relay forwarding nodes after preliminary screening;
[0088] The secondary screening module is responsible for further screening based on the relay forwarding node list after the initial screening, filtering out the relay forwarding nodes whose available bandwidth and available connection number do not meet the requirements of the deployed services on the service providing node, and forming a relay forwarding node list after the secondary screening;
[0089] The second retrieval module is responsible for searching the distributed hash table DHT again based on the node identifier Peer ID in the relay forwarding node list after the second screening, and finding its corresponding associated address information multiaddr;
[0090] The connection test module is responsible for performing connection tests, obtaining connection performance data, filtering out relay forwarding nodes that cannot meet the service requirements of the deployed service provider nodes, and forming a list of relay forwarding nodes after three screenings;
[0091] If the list of relay forwarding nodes after three screenings formed by the connection test is not empty, a relay connection is established with at least one of the relay forwarding nodes, otherwise a network connection alarm message is output;
[0092] After completing the connection test, the connection test module records the delay, packet loss and jitter information of each relay forwarding node under test, filters out the relay forwarding nodes that cannot meet the maximum delay requirement of the deployed service of the service providing node, and forms a relay forwarding node list after three screenings;
[0093] The service providing node selects at least one relay forwarding node from the relay forwarding node list after three screenings based on a random algorithm and / or IP attribution information to establish a relay connection.
[0094] More preferably, the service provider node selects at least two relay forwarding nodes to establish a relay connection to avoid a single point failure that causes the service provider node to be inaccessible.
[0095] The relay connection monitoring module is responsible for monitoring the performance data of the established relay connection and determining whether the relay connection meets the network resource requirements of the deployed service of the service provider node:
[0096] If satisfied, the connection is maintained and monitoring continues;
[0097] If not, the preliminary screening module is triggered to search for a suitable relay forwarding node again;
[0098] The relay connection monitoring module monitors all relay connections of the relay forwarding node in real time, and uses a custom periodic timer to monitor the performance data of the established relay connections at a custom periodicity;
[0099] Performance data of established relay connections includes, but is not limited to, latency, packet loss, jitter information, and available bandwidth information to relay forwarding nodes;
[0100] When it is detected that the quality of some relay connections has deteriorated, the applicable relay forwarding node is searched again. When it is detected that the quality of all relay connections has deteriorated, the corresponding network connection alarm information is output.
[0101] The connection resource management module is responsible for reserving available bandwidth and number of connections equal to the minimum bandwidth requirement for the corresponding service provider node after the relay forwarding node establishes a relay connection with the service provider node, and giving priority to forwarding the uplink and downlink traffic of the service provider node to ensure service quality;
[0102] After the relay forwarding node completes the reservation of available bandwidth, the available connection resource information of the relay forwarding node is updated to the distributed hash table DHT, wherein the available bandwidth and the number of available connections are deducted from the reserved resources.
[0103] The readable storage medium stores a computer program, and when the computer program is executed by a processor, the method described above is implemented.
[0104] The embodiment described above is only one specific implementation of the present invention. Common changes and substitutions made by those skilled in the art within the scope of the technical solution of the present invention should be included in the protection scope of the present invention.
Claims
1. A method for selecting relay forwarding nodes for a terminal computing network, characterized in that: The following steps are involved: Step S1, obtaining network resource demand information of deployed services; First, obtain the network resource requirement information of the deployed services on the service provider node, including but not limited to the minimum bandwidth requirement, maximum latency requirement and number of connections required, for reference in the subsequent selection process of relay forwarding nodes; Step S2: Search the distributed hash table DHT to retrieve the relay forwarding node list and perform preliminary screening; The service provider node searches and retrieves the distributed hash table DHT to obtain a list of applicable relay forwarding nodes, and screens them based on the tunnel protocol type and encryption type to obtain a preliminary screened list of relay forwarding nodes; Step S3, performing secondary screening based on available bandwidth and number of connections; The service providing node further screens the relay forwarding node list after the preliminary screening, and filters out the relay forwarding nodes whose available bandwidth and available connection number do not meet the requirements of the deployed services on the service providing node, thereby forming a relay forwarding node list after secondary screening; Step S4: perform a distributed hash table DHT search again to obtain the associated address information multiaddr; The service provider node searches the distributed hash table DHT again based on the node identifier Peer ID in the relay forwarding node list after the secondary screening to find its corresponding associated address information multiaddr; Step S5: perform a connection test, obtain connection performance data, filter out relay forwarding nodes that cannot meet the service requirements of the deployed service providing nodes, and form a relay forwarding node list after three screenings; If the list of relay forwarding nodes after three screenings formed by the connection test is not empty, a relay connection is established with at least one of the relay forwarding nodes, otherwise a network connection alarm message is output; Step S6: The service providing node monitors the performance data of the established relay connection to determine whether the relay connection meets the network resource requirements of the service provided by the service providing node: If satisfied, the connection is maintained and monitoring continues; If not, jump to step S2 to find a suitable relay forwarding node; Step S7: After establishing a relay connection with the service provider node, the relay forwarding node reserves available bandwidth and number of connections equal to the minimum bandwidth requirement for the corresponding service provider node, and preferentially forwards the uplink and downlink traffic of the service provider node to ensure service quality; After the relay forwarding node completes the reservation of available bandwidth, the available connection resource information of the relay forwarding node is updated to the distributed hash table DHT, where the available bandwidth and the number of available connections are deducted from the reserved resources.
2. The method for selecting relay forwarding nodes for a terminal computing network according to claim 1, characterized in that: In the step S2, a custom periodic timer is used to update the connection resource information available to the relay forwarding node to the distributed hash table DHT at a custom period; The available connection resource information of the relay forwarding node includes but is not limited to available bandwidth, number of available connections, supported relay tunnel protocols and supported encryption methods; The relay forwarding node list is formed by screening according to the relay tunnel protocols and encryption methods supported by the service provider nodes.
3. The method for selecting relay forwarding nodes for a terminal computing network according to claim 1, characterized in that: In the step S5, after the connection test is completed, the delay, packet loss and jitter information of each relay forwarding node under test are recorded, and the relay forwarding nodes that cannot meet the maximum delay requirement of the deployed service of the service providing node are filtered out to form a relay forwarding node list after three screenings; The service providing node selects at least one relay forwarding node from the relay forwarding node list after three screenings based on a random algorithm and / or IP attribution information to establish a relay connection.
4. The method for selecting relay forwarding nodes for a terminal computing network according to claim 3, characterized in that: The service provider node selects at least two relay forwarding nodes to establish a relay connection to avoid a single point failure that causes the service provider node to be inaccessible.
5. The method for selecting relay forwarding nodes for a terminal computing network according to claim 1, characterized in that: In the step S6, all relay connections of the relay forwarding node are monitored in real time, and a custom periodic timer is defined to monitor the performance data of the established relay connections at a custom period; Performance data of established relay connections includes, but is not limited to, latency, packet loss, jitter information, and available bandwidth information to relay forwarding nodes; When it is detected that the quality of some relay connections is deteriorated, the suitable relay forwarding node is searched again according to steps S2 to S5. When it is detected that the quality of all relay connections is deteriorated, the corresponding network connection alarm information is output.
6. A relay forwarding node selection system for a terminal computing network, characterized in that: include: The distributed hash table DHT maintenance module is responsible for customizing the periodic timer and updating the connection resource information available to the relay forwarding node to the distributed hash table DHT at a custom period; The available connection resource information of the relay forwarding node includes but is not limited to available bandwidth, number of available connections, supported relay tunnel protocols and supported encryption methods; The network resource requirement module is responsible for obtaining the network resource requirement information of the deployed services on the service provider node, including but not limited to the minimum bandwidth requirement, maximum latency requirement and number of connections required, for reference in the subsequent selection process of relay forwarding nodes; The preliminary screening module is responsible for searching and retrieving the distributed hash table DHT to obtain a list of applicable relay forwarding nodes, and screening the relay tunnel protocols and encryption methods supported by the service provider nodes to obtain a list of relay forwarding nodes after preliminary screening; The secondary screening module is responsible for further screening based on the relay forwarding node list after the initial screening, filtering out the relay forwarding nodes whose available bandwidth and available connection number do not meet the requirements of the deployed services on the service providing node, and forming a relay forwarding node list after the secondary screening; The second retrieval module is responsible for searching the distributed hash table DHT again based on the node identifier Peer ID in the relay forwarding node list after the second screening, and finding its corresponding associated address information multiaddr; The connection test module is responsible for performing connection tests, obtaining connection performance data, filtering out relay forwarding nodes that cannot meet the service requirements of the deployed service provider nodes, and forming a list of relay forwarding nodes after three screenings; If the list of relay forwarding nodes after three screenings formed by the connection test is not empty, a relay connection is established with at least one of the relay forwarding nodes, otherwise a network connection alarm message is output; The relay connection monitoring module is responsible for monitoring the performance data of established relay connections and determining whether the relay connections meet the network resource requirements of the deployed services of the service provider node: If satisfied, the connection is maintained and monitoring continues; If not, the preliminary screening module is triggered to search for a suitable relay forwarding node again; The connection resource management module is responsible for reserving available bandwidth and number of connections equal to the minimum bandwidth requirement for the corresponding service provider node after the relay forwarding node establishes a relay connection with the service provider node, and giving priority to forwarding the uplink and downlink traffic of the service provider node to ensure service quality; After the relay forwarding node completes the reservation of available bandwidth, the available connection resource information of the relay forwarding node is updated to the distributed hash table DHT, wherein the available bandwidth and the number of available connections are deducted from the reserved resources.
7. The relay forwarding node selection system for the terminal computing network according to claim 6 is characterized in that: After completing the connection test, the connection test module records the delay, packet loss and jitter information of each relay forwarding node under test, filters out the relay forwarding nodes that cannot meet the maximum delay requirement of the deployed service of the service providing node, and forms a relay forwarding node list after three screenings; The service providing node selects at least one relay forwarding node from the relay forwarding node list after three screenings based on a random algorithm and / or IP attribution information to establish a relay connection.
8. The relay forwarding node selection system for the terminal computing network according to claim 7, characterized in that: The service provider node selects at least two relay forwarding nodes to establish a relay connection to avoid a single point failure that causes the service provider node to be inaccessible.
9. The relay forwarding node selection system for the terminal computing network according to claim 6, characterized in that: The relay connection monitoring module monitors all relay connections of the relay forwarding node in real time, and uses a custom periodic timer to monitor the performance data of the established relay connections at a custom periodicity; Performance data of established relay connections includes, but is not limited to, latency, packet loss, jitter information, and available bandwidth information to relay forwarding nodes; When it is detected that the quality of some relay connections has deteriorated, the applicable relay forwarding node is searched again. When it is detected that the quality of all relay connections has deteriorated, the corresponding network connection alarm information is output.
10. A readable storage medium, characterized in that: The readable storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.
Citation Information
Patent Citations
Network deployment system and mapping and data forwarding method thereof
CN101958830A
System and method for broadcasting message in structural peer-to-peer network
CN102055655A
System and method for interworking between IPv4 (internet protocol version 4) and IPv6 (internet protocol version 6) based on DHT (distributed hash table)
CN102098353A
Distributed hash table network-based anonymous communication method
CN104168265A
Computing power routing method and device, electronic equipment and storage medium
CN115412482A