Edge node discovery method, apparatus, device, storage medium, and program product

Abstract

The application discloses an edge node discovery method, device, equipment, storage medium and program product, and belongs to the technical field of communication. The method comprises the following steps: receiving an edge node acquisition request sent by a terminal; in response to the edge node acquisition request, querying a first edge node set by using a first network delay from the terminal to a root node, wherein the difference between the network delay from each edge node in the first edge node set to the root node and the first network delay is less than a first difference threshold; the root nodes corresponding to different network delays are the same or different; sending the connection information of each edge node in the first edge node set to the terminal, so that the terminal establishes a connection with the edge nodes in the first edge node set by using the connection information of the edge nodes in the first edge node set. The application can improve the accuracy of edge node discovery.

Description

Technical Field

[0001] This application belongs to the field of communication technology, and in particular relates to an edge node discovery method, apparatus, device, storage medium and program product. Background Technology

[0002] Edge computing is an extension of cloud computing, complementing and depending on it. Edge services are implemented based on edge nodes, which are business platforms (such as servers and base stations) built at the edge of the network side, close to the user side. They can provide storage, computing, and network resources. By executing some applications on the terminal (edge ​​applications) on edge nodes, it is equivalent to "sinking" some services to the edge of the access network, which can reduce bandwidth consumption and latency loss caused by multi-layer network transmission.

[0003] To ensure the continuity of edge application services, terminals need to select edge nodes to provide services. The process of a terminal selecting an edge node can be called edge node discovery. Existing edge node discovery methods involve randomly pulling connection information of edge nodes from the cloud after the terminal goes online, and then establishing a connection with the edge node based on this information. In this approach, the selection of edge nodes is random, and the selected edge nodes may not meet the terminal's edge computing needs, resulting in low accuracy in edge node discovery. Summary of the Invention

[0004] This application provides a method, apparatus, device, storage medium, and program product for edge node discovery, which can solve the problem of low accuracy in edge node discovery.

[0005] In a first aspect, embodiments of this application provide an edge node discovery method applied to root nodes, the method comprising:

[0006] Receive the edge node acquisition request sent by the terminal;

[0007] In response to the edge node acquisition request, the first edge node set is obtained by querying using the first network latency from the terminal to the root node, wherein the difference between the network latency from each edge node to the root node in the first edge node set and the first network latency is less than the first difference threshold.

[0008] The terminal sends connection information of each edge node in the first edge node set to the terminal, so that the terminal can use the connection information of the edge nodes in the first edge node set to establish a connection with the edge nodes in the first edge node set.

[0009] Secondly, embodiments of this application provide an edge node discovery method applied to a terminal, the method comprising:

[0010] Send an edge node retrieval request to the root node;

[0011] The receiving terminal sends connection information of each edge node in a first edge node set, wherein the first edge node set is obtained by the root node using the first network latency from the terminal to the root node, and the difference between the network latency from each edge node in the first edge node set to the root node and the first network latency is less than a first difference threshold.

[0012] The connection information of the edge nodes in the first edge node set is used to establish a connection with the edge nodes in the first edge node set.

[0013] Thirdly, embodiments of this application provide an edge node discovery device, the device comprising:

[0014] The first receiving module is used to receive edge node acquisition requests sent by the terminal.

[0015] The first query module is used to respond to the edge node acquisition request and use the first network latency from the terminal to the root node to query and obtain the first edge node set, wherein the difference between the network latency from each edge node to the root node in the first edge node set and the first network latency is less than the first difference threshold.

[0016] The first sending module is used to send connection information of each edge node in the first edge node set to the terminal, so that the terminal can use the connection information of the edge nodes in the first edge node set to establish a connection with the edge nodes in the first edge node set.

[0017] Fourthly, embodiments of this application provide an edge node discovery device, the device comprising:

[0018] The fourth sending module is used to send edge node acquisition requests to the root node;

[0019] The fourth receiving module is used to receive connection information of each edge node in the first edge node set sent by the terminal, wherein the first edge node set is obtained by the root node using the first network latency from the terminal to the root node, and the difference between the network latency from each edge node in the first edge node set to the root node and the first network latency is less than a first difference threshold.

[0020] The fifth receiving module is used to establish a connection with the edge nodes in the first edge node set by using the connection information of the edge nodes in the first edge node set.

[0021] Fifthly, embodiments of this application provide an edge node discovery device, the device comprising: a processor and a memory storing computer program instructions; the processor, when executing the computer program instructions, implements the edge node discovery method as described in the first or second aspect.

[0022] In a sixth aspect, embodiments of this application provide a computer storage medium storing computer program instructions, which, when executed by a processor, implement the edge node discovery method as described in the first or second aspect.

[0023] In a seventh aspect, embodiments of this application provide a computer program product in which instructions, when executed by a processor of an electronic device, cause the electronic device to perform the edge node discovery method as described in the first or second aspect.

[0024] In this embodiment, after receiving an edge node acquisition request from a terminal, the root node can respond to the request and, using the first network latency from the terminal to the root node, query a first set of edge nodes. The difference between the network latency from each edge node in the first set to the root node and the first network latency is less than a first difference threshold, meaning the network latency from the edge nodes in the first set to the root node is close to the network latency from the terminal to the root node. Then, the connection information of each edge node in the first set is sent to the terminal, enabling the terminal to establish a connection with the edge nodes in the first set using the received connection information. Since the network latency from the edge nodes in the first set to the root node is close to the network latency from the terminal to the root node, and the edge nodes in the first set are located close to the terminal, the probability of the selected edge nodes meeting the terminal's edge computing needs is increased, thereby improving the accuracy of edge node discovery. Attached Figure Description

[0025] To more clearly illustrate the technical solutions of the embodiments of this application, the accompanying drawings used in the embodiments of this application will be briefly introduced below. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0026] Figure 1 This is a structural diagram of the system architecture to which the embodiments of this application can be applied;

[0027] Figure 2 This is one of the flowcharts of the edge node discovery method provided in the embodiments of this application;

[0028] Figure 3 This is the second flowchart of the edge node discovery method provided in the embodiments of this application;

[0029] Figure 4 This is a flowchart of the edge node information acquisition method provided in the embodiments of this application;

[0030] Figure 5 This is the third flowchart of the edge node discovery method provided in the embodiments of this application;

[0031] Figure 6 This is the fourth flowchart of the edge node discovery method provided in the embodiments of this application;

[0032] Figure 7 This is one of the structural diagrams of the edge node discovery device provided in the embodiments of this application;

[0033] Figure 8 This is the second structural diagram of the edge node discovery device provided in the embodiments of this application;

[0034] Figure 9 This is a schematic diagram of the edge node discovery device provided in the embodiments of this application. Detailed Implementation

[0035] The features and exemplary embodiments of various aspects of this application will be described in detail below. To make the objectives, technical solutions, and advantages of this application clearer, the application will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only intended to explain this application and not to limit it. For those skilled in the art, this application can be implemented without some of these specific details. The following description of the embodiments is merely to provide a better understanding of this application by illustrating examples.

[0036] It should be noted that, in this document, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising..." does not exclude the presence of additional identical elements in the process, method, article, or apparatus that includes said element.

[0037] For ease of understanding, the following describes some aspects of the embodiments of this application:

[0038] Figure 1This is a system architecture that can be applied to the embodiments of this application, such as... Figure 1 As shown, the system architecture may include an access layer, an edge layer, and a central layer. The access layer may include at least one terminal, the edge layer may include at least one edge node, and the central layer may include at least one root node.

[0039] In this embodiment, the root node can obtain connection information between the terminal and the edge node, which may include public IP addresses and ports. The terminal and the edge node may be unknowing of each other; they can discover each other and establish connections by obtaining the connection information from the root node. Therefore, this embodiment can achieve node discovery through Layer 3 unicast, thus enabling node discovery across collision domains, and allowing node discovery to be achieved on both local area networks and the Internet.

[0040] In some embodiments, the central layer may also include a disk, also known as a server, which can be shared by the root nodes of the central layer. On the one hand, after obtaining the connection information of the terminal / edge nodes, the root nodes can store it on the disk; on the other hand, the root nodes can obtain the connection information of the terminal / edge nodes obtained by other root nodes from the disk. In this way, the root nodes can share information through the disk.

[0041] The edge node discovery method provided in this application will be described in detail below with reference to the accompanying drawings, through some embodiments and application scenarios.

[0042] See Figure 2 , Figure 2 This is one of the flowcharts of the edge node discovery method provided in the embodiments of this application. Figure 2 The edge node discovery method shown can be applied to root nodes. For example... Figure 2 As shown, the edge node discovery method may include the following steps:

[0043] Step 201: Receive the edge node acquisition request sent by the terminal.

[0044] In practice, the terminal can determine whether it has an edge node discovery requirement. If it determines that it does, it can send an edge node acquisition request to the root node it is connected to in order to obtain the edge node's connection information.

[0045] In some embodiments, a terminal can determine whether it needs edge node discovery by checking if a cell handover has occurred. Specifically, when a cell handover occurs, it can determine that it needs edge node discovery.

[0046] In other embodiments, the terminal can determine whether it has an edge node discovery need by judging whether the edge service quality of the current edge node meets the preset edge service quality requirements. Specifically, if the edge service quality of the current edge node does not meet the preset edge service quality requirements, it can be determined that it has an edge node discovery need.

[0047] Step 202: In response to the edge node acquisition request, the first edge node set is obtained by querying using the first network latency from the terminal to the root node, wherein the difference between the network latency from each edge node to the root node in the first edge node set and the first network latency is less than the first difference threshold; the root nodes corresponding to different network latencies may be the same or different.

[0048] After receiving an edge node acquisition request from a terminal, the root node can respond to the request and select an edge node for that terminal.

[0049] The distance between edge nodes and terminals affects the quality of edge services provided by the edge nodes to the terminals. Specifically, the closer the edge node is to the terminal, the better the quality of the edge service; the farther the edge node is to the terminal, the worse the quality of the edge service. Therefore, when the root node selects an edge node for the terminal, the distance between the edge node and the terminal can be considered to increase the probability that the selected edge node meets the edge computing needs of the terminal.

[0050] In this embodiment, the distance between the edge node and the terminal can be determined by the network latency from the edge node and the terminal to the root node, respectively. The smaller the difference between the network latency from the edge node to the root node and the network latency from the terminal to the root node, the smaller the distance between the edge node and the terminal; the larger the difference between the network latency from the edge node to the root node and the network latency from the terminal to the root node, the larger the distance between the edge node and the terminal.

[0051] Based on this, in step 202, an edge node can be selected for the terminal by comparing the network latency from the terminal to the root node (i.e., the first network latency) with the network latency from each edge node to the root node.

[0052] In practice, at least one difference threshold can be determined first. This threshold can be used to measure the distance between edge nodes and terminals. When the number of difference thresholds is greater than 1, the larger the difference threshold, the farther the distance between the edge node and the terminal, and vice versa. The first difference threshold can be the smallest difference threshold among the at least one difference threshold.

[0053] In some embodiments, the difference threshold can be preset. In other embodiments, the difference threshold can be determined based on the reference network latency, such as different difference thresholds being different percentages of the reference network latency, such as 10%, 20%, ..., 100% of the reference network latency.

[0054] Next, for each edge node, the difference between the network latency from that edge node to the root node and the first network latency can be calculated. Then, this difference is compared with a first difference threshold, and edge nodes with differences less than the first difference threshold are selected to obtain the first set of edge nodes. It can be understood that the edge nodes in the first set of edge nodes are the edge nodes closest to the terminal.

[0055] Furthermore, for edge nodes outside the first set of edge nodes, their network latency to the root node can be compared with a second difference threshold. Edge nodes with a difference less than the second difference threshold are selected to obtain another set of edge nodes. The second difference threshold can be any difference threshold greater than the first difference threshold. Similarly, the root node can query at least one set of edge nodes. Each set of edge nodes corresponds to a different difference threshold, which is the difference threshold used when selecting that set of edge nodes. For example, the difference threshold corresponding to the first set of edge nodes is the first difference threshold.

[0056] In this embodiment, the network latency from the terminal / edge node to the root node can be determined by the information transmission between the terminal / edge node and the root node. For example, the transmission time of information between the terminal / edge node and the root node can be determined as the network latency from the terminal / edge node to the root node.

[0057] The root node in the network latency from the terminal / edge node to the root node is the root node corresponding to that network latency. The root nodes corresponding to different network latencies may be the same or different.

[0058] It should be noted that in practical applications, the number of root nodes in the central layer can be greater than or equal to one. When the number of root nodes is greater than one, the root nodes transmitting information with different edge nodes / terminals can be different or the same. Therefore, the root nodes corresponding to the network latency from different edge nodes / terminals to the root node can be different or the same. For example: the network latency from the terminal to the root node is specifically the network latency from the terminal to root node a; the network latency from edge node 1 to the root node is specifically the network latency from edge node 1 to root node b; the network latency from edge node 2 to the root node is specifically the network latency from edge node 2 to root node c; and the network latency from edge node 3 to the root node is specifically the network latency from edge node 3 to root node a. However, since the distance difference between root nodes is relatively small compared to the distance between the terminal / edge node and the root node, even if the root nodes corresponding to the network latency from different edge nodes / terminals to the root node are different, it can still be used to measure the distance between different edge nodes / terminals.

[0059] Step 203: Send the connection information of each edge node in the first edge node set to the terminal, so that the terminal can use the connection information of the edge nodes in the first edge node set to establish a connection with the edge nodes in the first edge node set.

[0060] After obtaining the first set of edge nodes, the connection information of each edge node in the first set can be sent to the terminal, enabling the terminal to establish connections with the edge nodes in the first set using this connection information. Since the network latency from the edge nodes in the first set to the root node is close to the network latency from the terminal to the root node, the probability of the edge nodes meeting the terminal's edge computing needs can be increased, thereby improving the accuracy of edge node discovery.

[0061] In this embodiment of the edge node discovery method, after receiving an edge node acquisition request from a terminal, the root node can respond to the request and, using the first network latency from the terminal to the root node, query a first set of edge nodes. The difference between the network latency from each edge node in the first set to the root node and the first network latency is less than a first difference threshold, meaning the network latency from the edge nodes in the first set to the root node is close to the network latency from the terminal to the root node. Then, the connection information of each edge node in the first set is sent to the terminal, enabling the terminal to establish connections with the edge nodes in the first set using the received connection information. Since the network latency from the edge nodes in the first set to the root node is close to the network latency from the terminal to the root node, and the edge nodes in the first set are located close to the terminal, the probability of selecting edge nodes that meet the terminal's edge computing needs is increased, thereby improving the accuracy of edge node discovery.

[0062] In some embodiments, after obtaining the first set of edge nodes by utilizing the first network latency from the terminal to the root node, the method further includes:

[0063] The connection information of the terminal is sent to each edge node in the first edge node set, so that each edge node in the first edge node set can use the connection information of the terminal to establish a connection with the terminal.

[0064] In this embodiment, after the root node queries the first edge node set, it can, on the one hand, push the connection information of each edge node in the first edge node set to the terminal; on the other hand, it can push the terminal's connection information to each edge node in the first edge node set, so that the terminal and the edge nodes in the first edge node set can establish connections with each other through the pushed connection information. This not only helps to track the connection of network element devices along the path, but also increases the success rate of establishing a P2P direct connection between the terminal and the edge node. It also eliminates the need to open public IP addresses and ports separately for the edge nodes, allowing the edge nodes to reuse their existing public IP addresses for access.

[0065] In practice, after receiving the connection information from the peer, the terminal / edge node can use this information to send a connection establishment request to the peer. In some embodiments, the connection establishment request can be carried in a hello message, but it is not limited to this.

[0066] In some embodiments, the terminal / edge node may periodically send connection establishment requests to the peer to improve the success rate of P2P direct connection establishment.

[0067] In some embodiments, when the number of edge nodes in the first edge node set is greater than 1, the terminal can iterate through the pushed node information and send connection establishment requests to each edge node in the first edge node set.

[0068] Furthermore, the root node can also send indication information to the terminal to indicate the first arrangement order of each edge node in the first edge node set. The arrangement position of each edge node in the first arrangement order is determined based on the difference between the network latency from each edge node to the root node and the network latency from the terminal to the root node. The smaller the difference between the network latency from an edge node to the root node and the network latency from the terminal to the root node, the earlier the edge node is in the first arrangement order, and vice versa. In this case, the terminal can send connection establishment requests to each edge node in the first edge node set in a cyclical manner according to the first arrangement order. In this way, the terminal can prioritize establishing a connection with the nearest edge node, which can further improve the accuracy of edge node discovery.

[0069] In some embodiments, after receiving the pushed connection information, the terminal and edge node can use the port in the connection information pushed to the peer to establish a socket listening in advance before establishing a connection with the peer through the pushed connection information. This can improve the success rate of P2P direct connection.

[0070] In this embodiment, after the root node obtains the first set of edge nodes, it can push the connection information of the peer to the terminal and the edge nodes in the first set of edge nodes respectively. In this way, the terminal and the edge nodes in the first set of edge nodes can establish a connection with the peer through the pushed connection information, thereby improving the connection success rate between the terminal and the edge nodes.

[0071] This application does not limit the way the root node obtains the following information: connection information of terminal / edge nodes, and network latency from terminal / edge nodes to the root node.

[0072] In some embodiments, the connection information of the terminal / edge node can be obtained through manual configuration, collection, or querying from the disk.

[0073] In some embodiments, the network latency from the terminal / edge node to the root node can be obtained by calculation or by querying from the disk. For calculation, the latency can be calculated based on the transmission time of information actively sent from the terminal / edge node to the root node, or vice versa.

[0074] In some embodiments, prior to the edge node acquisition request sent by the receiving terminal, the method may further include:

[0075] Receive a first hello message sent by the first device, which includes the connection information of the first device;

[0076] In response to the first hello message, a second hello message is sent to the first device using the connection information of the first device, and a first timestamp when the second hello message is sent is recorded;

[0077] A response message is received from the first device in response to the second hello message sent by the first device, wherein the response message includes a second timestamp of the first device receiving the second hello message;

[0078] Calculate the difference between the first timestamp and the second timestamp to obtain the network latency from the first device to the root node;

[0079] The first device includes the terminal and each edge node in the first set of edge nodes.

[0080] In this embodiment, the terminal / edge node can pre-store the connection information of at least one root node. After going online, it can actively use the stored connection information of the root node to establish a connection with the corresponding root node.

[0081] In practice, after a terminal / edge node comes online, it can proactively send a hello message to the root node, and the hello message can carry the following information: its own device type (terminal or edge node); source IP (i.e., its own IP); destination IP (i.e., the root node's IP); source port number (i.e., its own port number); destination port number (i.e., the root node's port number); and the protocol between itself and the root node, such as UDP (User Datagram Protocol) or TCP (Transmission Control Protocol).

[0082] In this way, the root node can collect the connection information of the terminal / edge node without the need for manual configuration of the connection information of the terminal / edge node at the root node, thereby reducing labor costs.

[0083] In some implementations, after receiving a hello message from a terminal / edge node, the root node can send a response message to the terminal / edge node to inform it that it has successfully collected the connection information of the terminal / edge node. The response message can be a hello ok message, but is not limited to this.

[0084] After collecting the connection information of the terminal / edge nodes, the root node can proactively use the connection information of the terminal / edge nodes to send hello messages to the terminal / edge nodes in order to collect the network latency from the terminal / edge nodes to the root node.

[0085] In practice, after sending a hello message to a terminal / edge node, the root node can record the sending timestamp of that hello message and further, include that timestamp in the hello message itself. Upon receiving the hello message from the root node, the terminal / edge node can send a response message to the root node, including the receiving timestamp of the hello message in the response message, thus completing a hello interaction. In this way, the root node can calculate the network latency from the terminal / edge node to the root node based on the sending and receiving timestamps of the hello message.

[0086] In some implementations, the root node and the terminal / edge node can periodically perform hello interactions. For the multiple time differences calculated, the least squares method or arithmetic mean can be used to process the multiple time differences to obtain the network latency from the terminal / edge node to the root node. In this way, the accuracy of obtaining the network latency from the terminal / edge node to the root node can be improved.

[0087] In this embodiment, on the one hand, terminal / edge nodes can proactively report their connection information to the root node, thus eliminating the need for manual configuration of terminal / edge node connection information at the root node and reducing labor costs. On the other hand, the root node can proactively send hello messages to terminal / edge nodes to detect network latency from the terminal / edge node to the root node, thereby improving the reliability of obtaining network latency information from the terminal / edge node to the root node.

[0088] In other embodiments, when a terminal / edge node actively reports information via a hello message, it can record the sending timestamp of that hello message. When the root node receives the hello message, it can record the receiving timestamp and include it in the hello ok message before sending it to the terminal. In this way, the terminal can calculate the network latency from the terminal / edge node to the root node by calculating the transmission time of the hello message. Afterward, the terminal / edge node can report its own network latency to the root node to the root node. Thus, compared to the embodiments described above, the root node does not need to send hello messages to the terminal / edge node to obtain the network latency from the terminal / edge node to the root node, thereby saving signaling overhead.

[0089] After collecting connection information from terminal / edge nodes and network latency from terminal / edge nodes to the root node, the root node can store it on disk. This enables information sharing among root nodes, expands the selection range of edge nodes, and further improves the accuracy of edge node discovery.

[0090] See Figure 3 , Figure 3 This is the second flowchart of the edge node discovery method provided in the embodiments of this application. Figure 3 The edge node discovery method shown can be applied to terminals. For example... Figure 3 As shown, the edge node discovery method may include the following steps:

[0091] Step 301: Send an edge node acquisition request to the root node.

[0092] Step 302: Receive connection information of each edge node in the first edge node set sent by the terminal, wherein the first edge node set is obtained by the root node using the first network latency from the terminal to the root node, and the difference between the network latency from each edge node in the first edge node set to the root node and the first network latency is less than a first difference threshold; the root nodes corresponding to different network latencies may be the same or different.

[0093] Step 303: Use the connection information of the edge nodes in the first edge node set to establish a connection with the edge nodes in the first edge node set.

[0094] It should be noted that in practical applications, the terminal may successfully establish a connection with an edge node in the first set of edge nodes, or it may fail to establish a connection with an edge node in the first set of edge nodes.

[0095] For the former, the terminal can execute edge computing tasks through a successfully established connection with an edge node. Specifically, the edge node can establish an external service port based on the port it reports to the root node to execute edge computing tasks. Thus, by keeping the exposed service port consistent with the reported port, there's no need to report the port separately; the service port is directly retrieved from the socket. Furthermore, this port doesn't need to be open; a direct connection is achieved using NAT (Network Address Translation) hole punching. This improves the network connection reliability of the edge node, thereby enhancing the service reliability of the edge node.

[0096] For the latter, the terminal can use the connection information of the edge nodes in the edge node set corresponding to the second difference threshold to establish a connection with the edge nodes in the edge node set until the terminal successfully establishes a connection with at least one edge node, or it can traverse all edge node sets queried by the root node based on the first network latency.

[0097] In some embodiments, prior to sending the edge node acquisition request to the root node, the method further includes:

[0098] Using the pre-stored connection information of the root node, a first hello message including the connection information of the terminal is sent to the root node;

[0099] Receive the second hello message sent by the root node;

[0100] In response to the second hello message, a response message for the second hello message is sent to the root node, wherein the response message includes a second timestamp of the terminal receiving the second hello message, so that the root node can determine the first network latency based on the second timestamp.

[0101] It should be noted that, Figure 3 Method embodiments as a comparison with Figure 2 The implementation methods of the terminals corresponding to the method embodiments are described above. Therefore, the relevant parts can be referred to the relevant descriptions in the above method embodiments, and the same beneficial effects can be achieved. To avoid repetition, they will not be repeated here.

[0102] In some embodiments, after establishing a connection with the edge nodes in the first edge node set using the connection information of the edge nodes in the first edge node set, the method further includes:

[0103] Obtain the network latency from each edge node in the first set of edge nodes to the terminal;

[0104] Based on the first network latency, N edge nodes in the first edge node set are obtained by querying, wherein the network latency from each of the N edge nodes to the terminal is less than a latency threshold, the latency threshold is less than the first network latency, and N is a natural number;

[0105] When N is greater than or equal to 1, the edge computing task of the terminal is executed through the first edge node among the N edge nodes, wherein the network latency from the first edge node to the terminal is less than the network latency from the other edge nodes among the N edge nodes to the terminal.

[0106] In this embodiment, the network latency from the terminal / edge node to the root node can reflect the distance between the terminal / edge node and the root node. However, the following situation may exist: different terminals / edge nodes are close to the root node, but they are located in different directions from the root node. For example, the terminal may be located south of the root node, while the edge node is located north of the root node. In this case, the edge node that establishes a connection with the terminal may be far away from the terminal, and using this edge node to perform the terminal's edge computing tasks will result in poor edge service quality.

[0107] Therefore, in this embodiment, after establishing a connection with the edge nodes in the first edge set, the terminal can obtain the network latency from each edge node in the first edge node set to the terminal. The network latency from the edge node to the terminal can also be obtained through information transmission between the edge node and the terminal, as detailed in the aforementioned method for obtaining network latency, which will not be repeated here.

[0108] Then, the network latency from each edge node to the terminal is compared with the latency threshold to select N edge nodes in the first set of edge nodes that are closer to the terminal.

[0109] The latency threshold is less than the first network latency. In some implementations, the latency threshold can be preset; in other implementations, the latency threshold can be determined based on the first network latency, such as a certain percentage of the first network latency, but not limited to this.

[0110] If the network latency from an edge node to the terminal is less than the latency threshold, it indicates that the edge node and the terminal are relatively close; otherwise, it indicates that the edge node and the terminal are far apart.

[0111] Understandably, in practical applications, N may be greater than or equal to 1, meaning that there are edge nodes in the first set of edge nodes that are close to the terminal; or it may be equal to 0, meaning that there are no edge nodes in the first set of edge nodes that are close to the terminal.

[0112] For the former, the edge node with the smallest network latency to the terminal can be selected from N edge nodes, that is, the edge node with the smallest distance to the terminal, and the edge computing task can be executed through the edge node. In this way, the reliability of edge computing can be improved.

[0113] For the latter, after obtaining N edge nodes from the first edge node set based on the first network latency, the method further includes:

[0114] When N equals 0, the second edge node in the first edge set is added to the target edge node set, wherein the network latency from the second edge node to the terminal is less than the network latency from other edge nodes in the first edge node set to the terminal;

[0115] Traverse M edge node sets, wherein each of the M edge node sets is obtained by querying the root node using the first network latency, and the difference threshold corresponding to each edge node set in the M edge node sets is different, and M is a positive integer;

[0116] If, in the second set of the M edge nodes, the network latency from at least one edge node to the terminal is less than the latency threshold, the edge computing task of the terminal is executed through a third edge node among the at least one edge node, wherein the network latency from the third edge node to the terminal is less than the network latency from the other edge nodes among the at least one edge node to the terminal.

[0117] If the network latency from each edge node in the M edge node sets to the terminal is greater than or equal to the latency threshold, the edge computing task of the terminal is executed through the fourth edge node in the target edge node set; wherein the network latency from the fourth edge node to the terminal is less than the network latency from other edge nodes in the target edge node set to the terminal.

[0118] If there is no edge node in the first edge node set that is close to the terminal, the terminal can add the edge node with the smallest network latency from the first edge node set to the target edge node set.

[0119] In addition, the terminal can establish a connection with the edge node in the edge node set corresponding to the second smallest difference threshold among at least one difference threshold, and obtain the network latency from each edge node in the edge node set to the terminal, compare it with the latency threshold, and filter out the edge nodes in the edge node set that are closer to the terminal.

[0120] If there are edge nodes in the set of edge nodes that are close to the terminal, the terminal can perform edge computing tasks through the edge node that is closest to the terminal.

[0121] If there is no edge node in the edge node set that is close to the terminal, the edge node with the lowest network latency to the terminal in the edge node set can be added to the target edge node set.

[0122] This process continues until an edge node relatively close to the terminal is found, or until the entire set of edge nodes has been traversed. If, after traversing the entire set of edge nodes, no edge node relatively close to the terminal is found, the edge computing task can be performed using the edge node closest to the terminal in the target set of edge nodes.

[0123] In this embodiment, the terminal can further correct the edge nodes selected by the root node by obtaining the network latency from the edge nodes to the terminal, filter out the edge nodes that are closer to the terminal from the edge nodes selected by the root node, and perform edge computing tasks through the edge nodes that are closest to the terminal among these edge nodes. In this way, the execution reliability of edge computing tasks can be improved.

[0124] It should be noted that the various optional implementation methods described in the embodiments of this application can be combined with each other or implemented individually without conflict, and the embodiments of this application do not limit this.

[0125] For ease of understanding, the following example is provided:

[0126] In some embodiments, terminals and edge nodes can pre-configure the connection information of the root node. Since terminals and edge nodes are not aware of each other, they can discover and establish connections with each other by connecting to the root node and learning each other's public IP address and port number.

[0127] The following details the interaction process between the root node, edge nodes, and terminals:

[0128] 1. Hello, handshake.

[0129] Terminal / edge nodes can handshake with the root node (hello) to report their own device information, so that the root node knows which devices are currently online and their types.

[0130] When an edge node / terminal comes online, it can proactively send a "hello" message to the root node, allowing the root node to collect the edge node's / terminal's public IP address, port, and network transmission latency. The specific process is as follows: Figure 4 As shown:

[0131] 1. When an edge node / terminal comes online, it sends a hello message to the root node. The hello message contains the device type and a five-tuple (source IP, destination IP, source port, destination port, protocol);

[0132] 2. The root node responds with "hello ok";

[0133] 3. The root node actively sends a "hello" message to the edge node / terminal based on the received 5-tuple, while also carrying the current timestamp;

[0134] 4. After receiving the hello message, the edge node / terminal responds with hello ok, carrying the timestamp from the received hello message;

[0135] 5. When the root node receives the hello ok message, it records the public IP address, port number, and round-trip response latency of the current edge node / terminal connection.

[0136] Since the latency calculated for a single hello and hello ok interaction may not be accurate, nodes can send hello messages periodically in addition to the initial startup. The total latency can be calculated using the least squares method or the arithmetic mean, which can then be used to select the optimal edge node.

[0137] II. Node Discovery.

[0138] In this step, the terminal obtains the connection information of the edge nodes from the root node and attempts to connect.

[0139] Typically, regions with similar geographical proximity have roughly the same or similar latency to the root node. Based on this logic, nearby edge nodes are discovered. For details, please refer to [link to relevant documentation]. Figure 5 :

[0140] 1. The terminal obtains the connection information of the edge nodes from the root node.

[0141] 2. The root node sequentially obtains edge nodes by a certain positive or negative percentage difference in network latency (e.g., increasing by 10%, 20%), and queries multiple edge nodes whose latency differences are within a certain range.

[0142] 3. Based on the edge node information retrieved, the root node pushes the terminal's public IP address and port to the edge nodes in sequence; on the other hand, it pushes the queried edge node's public IP address and port to the terminal node.

[0143] 4. The terminal and edge node initiate connection establishment using the public IP address and port pushed to them, respectively.

[0144] This facilitates the tracking of network element connections along the path and helps establish direct P2P connections under NAT.

[0145] If a direct P2P connection cannot be established, start over from step 1, and obtain edge nodes by increasing the network latency percentage difference by a certain proportion.

[0146] In this process, the terminal and edge node can establish a socket listening in advance based on the source port used when the node hellos; the terminal and edge node can periodically and proactively establish connections or send messages to the public IP and port of the other end, which helps to improve the success rate of P2P direct connection. This is also the key point that it is not necessary to open a public IP for the edge node separately.

[0147] III. Edge node selection correction.

[0148] In a mesh network, simply calculating and selecting the optimal edge node based on the percentage delay error can lead to errors. For example, if a terminal is located south of the root node and an edge node is located north of the root node, with both having a 40ms delay to the root node and a delay error of less than 10%, simply calculating based on percentages might result in the southern terminal connecting to the northern edge node, thus selecting the farthest edge node. Therefore, a correction is needed: calculate the delay from the terminal node to the edge node. If the delay is greater than a certain percentage of the delay to the root node, the edge node is considered potentially not the optimal one, and the node with the next lower percentage delay is selected.

[0149] For detailed procedures, please refer to [link / reference]. Figure 6 In practice, the network latency from the terminal to the root node is used as a benchmark, fluctuating within a certain range. The terminal detects the network latency of edge nodes within a certain range, and selects the optimal or relatively optimal edge node accordingly.

[0150] In this embodiment, the root node can query the nearest edge node based on network transmission latency and send the query to the terminal to discover edge nodes in the network; the edge node can establish an external service capability port based on the source port used in the hello handshake message; the optimal edge node selection can be calculated based on the network latency from each terminal to the root node and by comparing the latency differences according to a certain ratio.

[0151] In this embodiment, the root node learns the network connection information of the edge nodes and notifies the terminal to discover nearby edge nodes. This method solves the problem that before a new edge node can be put online, it is necessary to perform a series of complex operations such as applying for a separate public IP address and configuring the network, thus enabling rapid online deployment.

[0152] Provided the edge data center has internet access, there's no need to apply for separate public IP addresses and ports for each edge node; existing public IP addresses can be reused for access. By self-learning the network information of edge nodes, terminals automatically discover edge nodes and establish connections without manual intervention, resulting in faster deployment and reduced manpower and physical costs. By calculating the network latency between terminals and edge nodes, the optimal edge node is dynamically selected, improving transmission stability and performance.

[0153] Based on the edge node discovery method provided in the above embodiments, this application also provides specific implementations of the edge node discovery device. Please refer to the following embodiments.

[0154] See Figure 7 The edge node discovery device provided in this application embodiment may include:

[0155] The first receiving module 701 is used to receive the edge node acquisition request sent by the terminal;

[0156] The first query module 702 is used to respond to the edge node acquisition request and use the first network latency from the terminal to the root node to query and obtain a first set of edge nodes, wherein the difference between the network latency from each edge node to the root node in the first set of edge nodes and the first network latency is less than a first difference threshold; the root nodes corresponding to different network latencies may be the same or different.

[0157] The first sending module 703 is used to send connection information of each edge node in the first edge node set to the terminal, so that the terminal can use the connection information of the edge nodes in the first edge node set to establish a connection with the edge nodes in the first edge node set.

[0158] In some embodiments, the apparatus further includes:

[0159] The second sending module is used to send the connection information of the terminal to each edge node in the first edge node set, so that each edge node in the first edge node set can use the connection information of the terminal to establish a connection with the terminal.

[0160] In some embodiments, the apparatus further includes:

[0161] The second receiving module is used to receive a first hello message sent by the first device, which includes the connection information of the first device;

[0162] The third sending module is used to respond to the first hello message, use the connection information of the first device to send a second hello message to the first device, and record the first timestamp when the second hello message is sent;

[0163] The third receiving module is used to receive a response message of the second hello message sent by the first device, wherein the response message includes a second timestamp of the first device receiving the second hello message;

[0164] The calculation module is used to calculate the difference between the first timestamp and the second timestamp to obtain the network latency from the first device to the root node;

[0165] The first device includes the terminal and each edge node in the first set of edge nodes.

[0166] Figure 7 The edge node discovery device shown can achieve Figure 2 To avoid repetition, the various processes implemented by the edge nodes in the method embodiment will not be described again here.

[0167] See Figure 8 The edge node discovery device provided in this application embodiment may include:

[0168] The fourth sending module 801 is used to send an edge node acquisition request to the root node;

[0169] The fourth receiving module 802 is used to receive connection information of each edge node in the first edge node set sent by the terminal. The first edge node set is obtained by the root node using the first network latency from the terminal to the root node, and the difference between the network latency from each edge node in the first edge node set to the root node and the first network latency is less than a first difference threshold. The root nodes corresponding to different network latencies may be the same or different.

[0170] The fifth receiving module is used to establish a connection with the edge nodes in the first edge node set by using the connection information of the edge nodes in the first edge node set.

[0171] In some embodiments, the apparatus further includes:

[0172] The fifth sending module is used to send a first hello message, including the connection information of the terminal, to the root node using the pre-stored connection information of the root node;

[0173] The sixth receiving module is used to receive the second hello message sent by the root node;

[0174] The sixth sending module is used to send a response message of the second hello message to the root node in response to the second hello message, wherein the response message includes a second timestamp of the terminal receiving the second hello message, so that the root node can determine the first network delay based on the second timestamp.

[0175] In some embodiments, the apparatus further includes:

[0176] The acquisition module is used to acquire the network latency from each edge node in the first edge node set to the terminal;

[0177] The query module is used to query N edge nodes in the first edge node set based on the first network latency, wherein the network latency from each of the N edge nodes to the terminal is less than a latency threshold, the latency threshold is less than the first network latency, and N is a natural number.

[0178] The first execution module is used to execute the edge computing task of the terminal through the first edge node among the N edge nodes when N is greater than or equal to 1, wherein the network latency from the first edge node to the terminal is less than the network latency from the other edge nodes among the N edge nodes to the terminal.

[0179] In some embodiments, the apparatus further includes:

[0180] An addition module is used to add a second edge node from the first edge set to a target edge node set when N equals 0, wherein the network latency from the second edge node to the terminal is less than the network latency from other edge nodes in the first edge node set to the terminal;

[0181] The traversal module is used to traverse M edge node sets, wherein the M edge node sets are all obtained by the root node using the first network latency query, and the difference threshold corresponding to each edge node set in the M edge node sets is different, and M is a positive integer;

[0182] The second execution module is configured to execute the edge computing task of the terminal through a third edge node in the at least one edge node in the second edge node set of the M edge node sets, provided that the network latency from at least one edge node to the terminal is less than the latency threshold. The network latency from the third edge node to the terminal is less than the network latency from any of the other edge nodes in the at least one edge node set to the terminal.

[0183] The third execution module is used to execute the edge computing task of the terminal through the fourth edge node in the target edge node set when the network latency from the edge node in each of the M edge node sets to the terminal is greater than or equal to the latency threshold; wherein the network latency from the fourth edge node to the terminal is less than the network latency from other edge nodes in the target edge node set to the terminal.

[0184] Figure 8 The edge node discovery device shown can implement the various processes implemented by the terminal in the method embodiment, and will not be described again here to avoid repetition.

[0185] Figure 9 A schematic diagram of the hardware structure for edge node discovery provided in an embodiment of this application is shown.

[0186] The edge node discovery device may include a processor 901 and a memory 902 storing computer program instructions.

[0187] Specifically, the processor 901 may include a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits that can be configured to implement the embodiments of this application.

[0188] Memory 902 may include mass storage for data or instructions. For example, and not limitingly, memory 902 may include a hard disk drive (HDD), floppy disk drive, flash memory, optical disk, magneto-optical disk, magnetic tape, or Universal Serial Bus (USB) drive, or a combination of two or more of these. Where appropriate, memory 902 may include removable or non-removable (or fixed) media. Where appropriate, memory 902 may be internal or external to the integrated gateway disaster recovery device. In a particular embodiment, memory 902 is non-volatile solid-state memory.

[0189] Memory may include read-only memory (ROM), random access memory (RAM), disk storage media devices, optical storage media devices, flash memory devices, and electrical, optical, or other physical / tangible memory storage devices. Therefore, typically, memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it is operable to perform the operations described with reference to the method according to one aspect of this disclosure.

[0190] The processor 901 reads and executes computer program instructions stored in the memory 902 to implement any of the edge node discovery methods in the above embodiments.

[0191] In one example, the edge node discovery device may also include a communication interface 909 and a bus 910. For example, Figure 9 As shown, the processor 901, memory 902, and communication interface 909 are connected through bus 910 and complete communication with each other.

[0192] The communication interface 909 is mainly used to realize communication between various modules, devices, units and / or equipment in the embodiments of this application.

[0193] Bus 910 includes hardware, software, or both, that couples components of an edge node discovery device together. For example, and not limitingly, the bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an Infinite Bandwidth Interconnect, a Low Pin Count (LPC) bus, a memory bus, a Microchannel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local (VLB) bus, or other suitable buses, or combinations of two or more of these. Where appropriate, bus 910 may include one or more buses. Although specific buses are described and illustrated in embodiments of this application, any suitable bus or interconnect is contemplated herein.

[0194] Furthermore, in conjunction with the edge node discovery methods described in the above embodiments, this application embodiment can provide a computer storage medium for implementation. This computer storage medium stores computer program instructions; when these computer program instructions are executed by a processor, they implement any of the edge node discovery methods described in the above embodiments.

[0195] It should be clarified that this application is not limited to the specific configurations and processes described above and shown in the figures. For the sake of brevity, detailed descriptions of known methods are omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of this application is not limited to the specific steps described and shown. Those skilled in the art can make various changes, modifications, and additions, or change the order of steps, after understanding the spirit of this application.

[0196] The functional blocks shown in the above-described structural diagram can be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, they can be, for example, electronic circuits, application-specific integrated circuits (ASICs), appropriate firmware, plug-ins, function cards, etc. When implemented in software, the elements of this application are programs or code segments used to perform the required tasks. Programs or code segments can be stored on a machine-readable medium or transmitted over a transmission medium or communication link via data signals carried on a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio frequency (RF) links, etc. Code segments can be downloaded via computer networks such as the Internet, intranets, etc.

[0197] It should also be noted that the exemplary embodiments mentioned in this application describe methods or systems based on a series of steps or apparatus. However, this application is not limited to the order of the above steps; that is, the steps can be performed in the order mentioned in the embodiments, or in a different order, or several steps can be performed simultaneously.

[0198] The aspects of this disclosure have been described above with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that each block in the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that these instructions, executable via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions / actions specified in one or more blocks of the flowchart illustrations and / or block diagrams. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field-programmable logic circuit. It is also understood that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can also be implemented by special-purpose hardware performing the specified functions or actions, or can be implemented by a combination of special-purpose hardware and computer instructions.

[0199] The above description is merely a specific implementation of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, modules, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. It should be understood that the protection scope of this application is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in this application, and these modifications or substitutions should all be covered within the protection scope of this application.

Claims

1. An edge node discovery method, applied to root nodes, characterized in that, include: Receive the edge node acquisition request sent by the terminal; In response to the edge node acquisition request, a first set of edge nodes is obtained by querying the first network latency from the terminal to the root node, wherein the difference between the network latency from each edge node to the root node in the first set of edge nodes and the first network latency is less than a first difference threshold; the root nodes corresponding to different network latencies may be the same or different. The terminal sends connection information of each edge node in the first edge node set to the terminal, so that the terminal can use the connection information of the edge nodes in the first edge node set to establish a connection with the edge nodes in the first edge node set.

2. The method according to claim 1, characterized in that, After obtaining the first set of edge nodes by utilizing the first network latency from the terminal to the root node, the method further includes: The connection information of the terminal is sent to each edge node in the first edge node set, so that each edge node in the first edge node set can use the connection information of the terminal to establish a connection with the terminal.

3. The method according to claim 1 or 2, characterized in that, Before the edge node acquisition request sent by the receiving terminal, the method further includes: Receive a first hello message sent by the first device, which includes the connection information of the first device; In response to the first hello message, a second hello message is sent to the first device using the connection information of the first device, and a first timestamp when the second hello message is sent is recorded; A response message is received from the first device in response to the second hello message sent by the first device, wherein the response message includes a second timestamp of the first device receiving the second hello message; Calculate the difference between the first timestamp and the second timestamp to obtain the network latency from the first device to the root node; The first device includes the terminal and each edge node in the first set of edge nodes.

4. An edge node discovery method, applied to a terminal, characterized in that, include: Send an edge node retrieval request to the root node; The receiving terminal sends connection information of each edge node in a first set of edge nodes, wherein the first set of edge nodes is obtained by the root node using the first network latency from the terminal to the root node, and the difference between the network latency from each edge node in the first set to the root node and the first network latency is less than a first difference threshold; the root nodes corresponding to different network latencies may be the same or different. The connection information of the edge nodes in the first edge node set is used to establish a connection with the edge nodes in the first edge node set.

5. The method according to claim 4, characterized in that, Before sending the edge node retrieval request to the root node, the method further includes: Using the pre-stored connection information of the root node, a first hello message including the connection information of the terminal is sent to the root node; Receive the second hello message sent by the root node; In response to the second hello message, a response message for the second hello message is sent to the root node, wherein the response message includes a second timestamp of the terminal receiving the second hello message, so that the root node can determine the first network latency based on the second timestamp.

6. The method according to claim 4, characterized in that, After establishing a connection with the edge nodes in the first edge node set using the connection information of the edge nodes in the first edge node set, the method further includes: Obtain the network latency from each edge node in the first set of edge nodes to the terminal; Based on the first network latency, N edge nodes in the first edge node set are obtained by querying, wherein the network latency from each of the N edge nodes to the terminal is less than a latency threshold, the latency threshold is less than the first network latency, and N is a natural number; When N is greater than or equal to 1, the edge computing task of the terminal is executed through the first edge node among the N edge nodes, wherein the network latency from the first edge node to the terminal is less than the network latency from the other edge nodes among the N edge nodes to the terminal.

7. The method according to claim 6, characterized in that, After obtaining N edge nodes from the first edge node set based on the first network latency, the method further includes: When N equals 0, the second edge node in the first edge set is added to the target edge node set, wherein the network latency from the second edge node to the terminal is less than the network latency from other edge nodes in the first edge node set to the terminal; Traverse M edge node sets, wherein each of the M edge node sets is obtained by querying the root node using the first network latency, and the difference threshold corresponding to each edge node set in the M edge node sets is different, and M is a positive integer; If, in the second set of the M edge nodes, the network latency from at least one edge node to the terminal is less than the latency threshold, the edge computing task of the terminal is executed through the third edge node among the at least one edge node, wherein the network latency from the third edge node to the terminal is less than the network latency from the other edge nodes among the at least one edge node to the terminal; If the network latency from each edge node in the M edge node sets to the terminal is greater than or equal to the latency threshold, the edge computing task of the terminal is executed through the fourth edge node in the target edge node set; wherein the network latency from the fourth edge node to the terminal is less than the network latency from other edge nodes in the target edge node set to the terminal.

8. An edge node discovery device, characterized in that, The device includes: The first receiving module is used to receive edge node acquisition requests sent by the terminal. The first query module is used to respond to the edge node acquisition request and use the first network latency from the terminal to the root node to query and obtain the first edge node set, wherein the difference between the network latency from each edge node to the root node in the first edge node set and the first network latency is less than the first difference threshold. The first sending module is used to send connection information of each edge node in the first edge node set to the terminal, so that the terminal can use the connection information of the edge nodes in the first edge node set to establish a connection with the edge nodes in the first edge node set.

9. An edge node discovery device, characterized in that, The device includes: The fourth sending module is used to send edge node acquisition requests to the root node; The fourth receiving module is used to receive connection information of each edge node in the first edge node set sent by the terminal, wherein the first edge node set is obtained by the root node using the first network latency from the terminal to the root node, and the difference between the network latency from each edge node in the first edge node set to the root node and the first network latency is less than a first difference threshold. The fifth receiving module is used to establish a connection with the edge nodes in the first edge node set by using the connection information of the edge nodes in the first edge node set.

10. An edge node discovery device, characterized in that, The device includes: a processor and a memory storing computer program instructions; the processor, when executing the computer program instructions, implements the edge node discovery method as described in any one of claims 1 to 7.

11. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer program instructions that, when executed by a processor, implement the edge node discovery method as described in any one of claims 1 to 7.

12. A computer program product, characterized in that, When the instructions in the computer program product are executed by the processor of the electronic device, the electronic device causes the electronic device to perform the edge node discovery method as described in any one of claims 1 to 7.

Images