Edge node access method and device, storage medium and electronic device

By establishing connection links and clustering processing between edge nodes in the SASE distributed architecture, the target deployment location of the network service provision point is determined, and the problem of network service quality decline caused by the long distance between the user and the POP point is solved, and the network service quality is reduced is achieved. High-quality network services and efficient resource utilization.

CN115297015BActive Publication Date: 2024-11-12CHINA TELECOM CORP LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202210923860.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-08-02
Publication Date
2024-11-12
Estimated Expiration
2042-08-02

AI Technical Summary

Technical Problem

In the SASE distributed architecture, due to the long distance between the user and the POP point, the quality of network services is degraded and the access performance is affected.

Method used

By establishing a connection link between edge nodes, obtaining network quality information, clustering edge nodes according to preset node selection strategies, determining the target deployment location of the network service provision point, and connecting the edge node to this location on the Internet service provision point.

Benefits of technology

It realizes the deployment of network service provision points on demand based on the distribution and network conditions of edge nodes, so that edge nodes can obtain network service quality that matches their actual needs, improves the utilization rate of network service provision points, and avoids networks caused by low usage rates. Waste of service costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115297015B_ABST
    Figure CN115297015B_ABST
Patent Text Reader

Abstract

The present disclosure relates to the field of communication technology, and to an edge node access method and device, a computer-readable storage medium, and an electronic device, including: establishing a connection link between edge nodes, and obtaining network quality information of the connection link; clustering the edge nodes according to a preset node selection strategy based on the network quality information, so as to determine the target deployment position of a network service provider point from the corresponding position of the edge node according to the processing result; and accessing the edge node to the corresponding target deployment position according to the processing result. The present disclosure can deploy network service providers on demand according to the link status between edge nodes, improve network service quality, and reduce network service costs.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and more specifically, to an edge node access method, an edge node access device, a computer-readable storage medium, and an electronic device. Background Art

[0002] Secure Access Service Edge (SASE) is an emerging concept that integrates comprehensive wide-area networking functions and comprehensive network security functions to provide dynamic and secure access services for digital enterprises. To ensure that all network and security functions are available everywhere and deliver the best possible experience to all edges, SASE adopts a distributed architecture.

[0003] In the distributed architecture of SASE, network service provision points (POPs) close to the enterprise are used to provide users with low-latency services and improve access performance between nodes. However, in the application scenarios of SASE in related technologies, the user's server or client may be far away from the access POP point, which affects the quality of network services.

[0004] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention

[0005] The purpose of the present disclosure is to provide an edge node access method and device, a computer-readable storage medium and an electronic device, thereby at least to a certain extent overcoming the technical problem of reducing the quality of network services due to the long distance between the user and the POP access point.

[0006] Other features and advantages of the present disclosure will become apparent from the following detailed description, or may be learned in part by the practice of the present disclosure.

[0007] According to one aspect of the present disclosure, there is provided an edge node access method, including:

[0008] Establishing a connection link between edge nodes and obtaining network quality information of the connection link;

[0009] Based on the network quality information, clustering the edge nodes according to a preset node selection strategy, so as to determine the target deployment position of the network service provider point from the corresponding position of the edge node according to the processing result;

[0010] According to the processing result, the edge node is connected to a network service provision point at the corresponding target deployment location.

[0011] In an exemplary embodiment of the present disclosure, the establishing a connection link between edge nodes and acquiring network quality information of the connection link includes:

[0012] Establish connection links between the edge nodes;

[0013] Acquire network indicator information of the connection link, and determine weight information of the network indicator information according to a preset influence degree value of the network indicator information on the connection link;

[0014] For any of the connection links, a fusion calculation is performed based on each of the network indicator information and the corresponding weight information to obtain the network quality information of any of the connection links.

[0015] In an exemplary embodiment of the present disclosure, for any of the connection links, performing fusion calculation according to each of the network indicator information and the corresponding weight information to obtain the network quality information of any of the connection links includes:

[0016] Obtaining the indicator quantity value corresponding to each of the network indicator information;

[0017] For any of the connection links, a weighted fusion calculation is performed according to the quantity values ​​of each indicator and the corresponding weight information to obtain the network quality information of any of the connection links.

[0018] In an exemplary embodiment of the present disclosure, the network quality information is used to indicate the network quality between two edge nodes corresponding to the connection link;

[0019] The clustering process of the edge nodes based on the network quality information and according to a preset node selection strategy, so as to determine the target deployment position of the network service provider point from the corresponding position of the edge node according to the processing result, includes:

[0020] Randomly acquiring a target number of edge nodes as first centroid points according to the edge nodes, and obtaining a centroid set according to the first centroid points;

[0021] Based on the network quality between each of the edge nodes, a neighbor node set of each of the first centroids is obtained, wherein the network quality between the edge nodes in the neighbor node set and the corresponding first centroid is greater than a preset network quality threshold;

[0022] The following process is repeated until the centroid set does not change:

[0023] updating the neighbor node sets according to the first relationship between the neighbor node sets and the second relationship between the edge node and each of the neighbor node sets;

[0024] Based on the network quality between each edge node in the updated neighbor node set, re-obtain a second centroid point of the updated neighbor node set, and update the centroid set according to the second centroid point;

[0025] When the centroid set does not change, the corresponding position of the centroid point in the centroid set is determined as the target deployment position of the network service provider point.

[0026] In an exemplary embodiment of the present disclosure, updating the neighbor node sets according to the first relationship between the neighbor node sets and the second relationship between the edge node and each of the neighbor node sets includes at least one of the following:

[0027] If there is a first neighbor node set included in the second neighbor node set, the centroid point corresponding to the first neighbor node set is removed from the centroid set;

[0028] If there is an outlier edge node that does not belong to any neighbor node set, add the outlier edge node to the centroid set, and obtain the neighbor node set of the outlier edge node;

[0029] If there is a cross-edge node belonging to at least two neighbor node sets, the cross-edge node is divided into a target neighbor node set corresponding to the highest network quality according to the network quality between the cross-edge node and the corresponding centroid points of the at least two neighbor node sets.

[0030] In an exemplary embodiment of the present disclosure, reacquiring a second centroid point of the updated neighbor node set based on the network quality between each edge node in the updated neighbor node set, and updating the centroid set according to the second centroid point includes:

[0031] According to the network quality between each two edge nodes in the updated neighbor node set, a maximum and minimum decision method is adopted to obtain a second centroid point of the updated neighbor node set;

[0032] The centroid set is updated according to the second centroid point corresponding to each of the updated neighbor node sets.

[0033] In an exemplary embodiment of the present disclosure, the step of connecting the edge node to a network service provider point at the corresponding target deployment location according to the processing result includes:

[0034] The edge node is connected to a network service providing point at a target deployment location determined by a corresponding centroid point of the neighbor node set to which it belongs.

[0035] In an exemplary embodiment of the present disclosure, before clustering the edge nodes according to a preset node selection strategy based on the network quality information to determine the target deployment position of the network service provider point from the corresponding position of the edge node according to the processing result, the method further includes:

[0036] Generate a network quality score matrix according to the network quality information of each of the connection links;

[0037] Among them, any element in the network quality score matrix is ​​used to indicate the network quality between two edge nodes of the corresponding connection link.

[0038] According to one aspect of the present disclosure, an edge node access device is provided, the device comprising:

[0039] A link establishment module, used to establish a connection link between edge nodes and obtain network quality information of the connection link;

[0040] a location determination module, configured to perform clustering processing on the edge nodes according to a preset node selection strategy based on the network quality information, so as to determine a target deployment location of a network service provider point from a corresponding location of the edge node according to the processing result;

[0041] A node access module is used to connect the edge node to a network service provision point at the corresponding target deployment location according to the processing result.

[0042] According to one aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, any one of the above methods is implemented.

[0043] According to one aspect of the present disclosure, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute any one of the above-mentioned methods by executing the executable instructions.

[0044] The edge node access method in the exemplary embodiment of the present disclosure, on the one hand, can cluster the edge nodes according to the network quality information between the edge nodes and the preset node selection strategy to determine the target deployment position of the network service provider point from the corresponding position of the edge node, and can deploy the network service provider point on demand according to the distribution of the edge nodes and the network status, so that the edge nodes can obtain the network service quality that meets their actual needs, and promote each edge node to have high-quality network services; on the other hand, since the edge nodes are not selected for access from the pre-provided network service provider points, but are deployed on demand according to the actual situation of the edge nodes, the utilization rate of the network service provider points can be improved while avoiding the waste of network service costs caused by the low utilization rate of the network service provider points; on the other hand, with the rapid development of the field of communication technology, the edge node access method of the embodiment of the present disclosure has practical significance for further promoting the development of low-latency services and high-performance and high-quality access application scenarios.

[0045] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] The above and other objects, features and advantages of the exemplary embodiments of the present disclosure will become readily understood by reading the detailed description below with reference to the accompanying drawings. In the accompanying drawings, several embodiments of the present disclosure are shown in an exemplary and non-limiting manner, in which:

[0047] Figure 1 An application scenario diagram according to an exemplary embodiment of the present disclosure is shown;

[0048] Figure 2 A flow chart of an edge node access method according to an exemplary embodiment of the present disclosure is shown;

[0049] Figure 3 A flowchart showing an implementation method of acquiring network quality information of a connection link according to an exemplary embodiment of the present disclosure is shown;

[0050] Figure 4 A schematic diagram of establishing an edge connection link according to an exemplary embodiment of the present disclosure is shown;

[0051] Figure 5 An implementation method for determining a target deployment location of a network service provision point according to an exemplary embodiment of the present disclosure is shown;

[0052] Figure 6 A schematic diagram of determining a target deployment location of a network service provision point according to an exemplary embodiment of the present disclosure is shown;

[0053] Figure 7A schematic diagram of connecting an edge node to a corresponding target deployment location according to an exemplary embodiment of the present disclosure is shown;

[0054] Figure 8 A schematic diagram of a network quality score matrix according to an exemplary embodiment of the present disclosure is shown;

[0055] Fig. 9 A schematic diagram of the architecture of an edge node access device according to an exemplary embodiment of the present disclosure is shown;

[0056] Fig.10 A block diagram of an electronic device according to an exemplary embodiment of the present disclosure is shown.

[0057] In the drawings, the same or corresponding reference numerals represent the same or corresponding parts. DETAILED DESCRIPTION

[0058] The exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that the present disclosure will be more comprehensive and complete and the concepts of the exemplary embodiments will be fully conveyed to those skilled in the art. The same reference numerals in the figures represent the same or similar structures, and thus their detailed description will be omitted.

[0059] In addition, the described features, structures or characteristics may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present disclosure. However, those skilled in the art will appreciate that the technical solutions of the present disclosure may be practiced without one or more of the specific details, or other methods, components, devices, steps, etc. may be adopted. In other cases, known structures, methods, devices, implementations or operations are not shown or described in detail to avoid blurring the various aspects of the present disclosure.

[0060] The block diagrams shown in the accompanying drawings are merely functional entities and do not necessarily correspond to physically independent entities. That is, these functional entities may be implemented in software form, or these functional entities or parts of functional entities may be implemented in one or more software hardened modules, or these functional entities may be implemented in different networks and / or processor devices and / or microcontroller devices.

[0061] In the related technologies in this field, in the distributed architecture of SASE, network service provision points (POP points) close to the enterprise are used to provide low-latency services to users and improve the access performance between nodes. However, in the SASE application scenarios of related technologies, POP points are often deployed in provincial administrative regions or certain large cities. However, from the user's perspective, the enterprise's servers or clients are not necessarily close to these determined POP points. Too long a distance may lead to a decline in network service quality and affect the user experience.

[0062] Based on this, in an exemplary embodiment of the present disclosure, a method for accessing an edge node is first provided. Figure 1 FIG. 1 is an application scenario diagram involved in the exemplary embodiment of the present disclosure. Figure 1 As shown, including deployed network service provision points (POPs) 110, 120, 130, and 140, edge nodes A, B, C, and D access SASE network resources by accessing corresponding network service provision points.

[0063] The number of network service provision points can be one or more, and the edge nodes can come from application scenarios such as corporate headquarters, branches, data centers, and remote offices. The edge nodes can be servers or terminal devices in the application scenarios, and the terminal devices can be smart phones, tablet computers, desktop computers, wearable electronic devices, etc., which are not limited here. After all edge nodes to be accessed are obtained, connection links between edge nodes are established, and the target deployment location of the network service provision point is determined from the corresponding position of the edge node based on the network quality information of the connection link, and each network service provision point is deployed.

[0064] It is worth mentioning that Figure 1 The number of edge nodes in the example is merely illustrative, and any number of edge nodes may be provided according to actual implementation requirements, and the present disclosure does not impose any special limitation on this.

[0065] like Figure 2 A flow chart of an edge node access method according to an embodiment of the present disclosure is shown. Figure 2 As shown, the edge node access method of the embodiment of the present disclosure may include steps S210 to S230:

[0066] Step S210: Establish connection links between edge nodes and obtain network quality information of the connection links.

[0067] In an exemplary embodiment of the present disclosure, an edge node is a node to be connected to a network. The edge nodes to be connected can be counted first, and then connection links between two edge nodes are established, and the network status of each connection link is measured to obtain network quality information of the connection link.

[0068] The network quality information is used to indicate the network quality between two edge nodes corresponding to the connection link. For example, the network quality information PL(i,j) is used to indicate the network quality from edge node i to edge node j, and the network quality information PL(j,i) is used to indicate the network quality from edge node j to edge node i, and PL(i,j)=(j,i).

[0069] It is worth noting that the network quality information of each connection link is determined based on the actual network status of the edge node and the network requirements of the edge node, such as network bandwidth, latency, jitter and other indicators. The relevant parameters that affect the quality of network services are all influencing factors for determining network quality information in the embodiments of the present disclosure.

[0070] Step S220: Based on the network quality information, edge nodes are clustered according to a preset node selection strategy, so as to determine the target deployment position of the network service provider point from the corresponding position of the edge node according to the processing result.

[0071] In an exemplary embodiment of the present disclosure, edge nodes are clustered based on network quality information, that is, the network quality between two edge nodes corresponding to each connection link, and each cluster center is used as the target deployment location of a network service provider point, and the edge nodes are connected to the target deployment location determined by the corresponding cluster center to establish a SASE network.

[0072] In the process of clustering edge nodes based on network quality information, clustering can be performed according to the quantity values ​​corresponding to the network quality information between the edge nodes, so that the edge nodes of each clustering result after clustering have network service quality that meets actual needs.

[0073] Step S230: according to the processing result, the edge node is connected to the network service provider point at the corresponding target deployment location.

[0074] In an exemplary embodiment of the present disclosure, edge nodes are clustered according to network quality information and a preset node selection strategy to obtain multiple cluster groups and centroid points (cluster centers) corresponding to the cluster groups. The centroid points are determined as target deployment positions, and then the edge nodes are connected to the target deployment positions determined by the centroid points of the cluster group to which the edge nodes belong.

[0075] Through the edge node access method in the embodiment of the present disclosure, on the one hand, according to the network quality information between the edge nodes, the edge nodes can be clustered according to the preset node selection strategy to determine the target deployment position of the network service provider point from the corresponding position of the edge node, and the network service provider point can be deployed on demand according to the distribution of the edge nodes and the network status, so that the edge nodes can obtain the network service quality that meets their actual needs, and each edge node has high-quality network service quality; on the other hand, since the edge nodes are not selected for access from the pre-provided network service provider points, but are deployed on demand according to the actual situation of the edge nodes, the utilization rate of the network service provider points is improved, while avoiding the waste of network service costs caused by the low utilization rate of the network service provider points; on the other hand, with the rapid development of the field of communication technology, the edge node access method in the embodiment of the present disclosure has practical significance for further promoting the development of low-latency services, high-performance and high-quality access application scenarios.

[0076] In an exemplary embodiment, in order to obtain network quality information of the connection link between edge nodes according to the actual network status and network service requirements of the edge nodes, the embodiment of the present disclosure also provides an implementation method for obtaining network quality information of the connection link. Establishing a connection link between edge nodes and obtaining network quality information of the connection link may include steps S310 to S330:

[0077] Step S310: Establish connection links between edge nodes.

[0078] like Figure 4 A schematic diagram of establishing an edge connection link according to an exemplary embodiment of the present disclosure is shown. Figure 4 After obtaining the edge nodes to be accessed through statistics, connection links between edge node pairs can be established, and the edge nodes are interconnected.

[0079] Step S320: Acquire network indicator information of the connection link, and determine weight information of the network indicator information according to a preset influence degree value of the network indicator information on the connection link.

[0080] After the connection link is established, the network status of each connection link is measured to obtain network indicator information, which includes but is not limited to network bandwidth, delay, jitter and other indicators that affect network service quality. For example, the network bandwidth can be measured to be 100 Mbps, 50 Mbps, etc., which are not listed here one by one.

[0081] In actual implementation, multiple indicator intervals of network indicator information can be pre-set according to access requirements, and each indicator has a corresponding impact degree value. Then the measured network indicator information is matched with the indicator interval to match the impact degree value corresponding to the matched target indicator interval, and then the weight information of the above network indicator information is determined according to the impact degree value.

[0082] Among them, the influence degree value is positively correlated with the weight value. The higher the influence degree value, the greater the weight value corresponding to the weight information of the network indicator information. On the contrary, if the influence degree value is lower, the weight value corresponding to the weight information of the network indicator information is smaller.

[0083] It should be noted that the weight information of the above network indicator information may also be customized with the goal of satisfying the network service quality requirements of the connection link.

[0084] Step S330: For any connection link, a fusion calculation is performed based on each network indicator information and the corresponding weight information to obtain the network quality information of any connection link.

[0085] For any connection link, the indicator quantity value corresponding to the network indicator information can be obtained, and then the network quality information of any connection link can be obtained by weighted fusion calculation based on all indicator quantity values ​​and corresponding weight information. Table 1 shows the corresponding relationship between the network indicator information of a connection link and the corresponding weight information. Referring to Table 1, the network quality information of the connection link is obtained by weighted fusion calculation of each indicator quantity value and the corresponding weight information: a×α1+b×β1+C×γ1.

[0086] Table 1

[0087]

[0088] It should be noted that Table 1 is merely illustrative, and the embodiments of the present disclosure may also include other network indicator information, such as packet loss, which is not particularly limited.

[0089] The network quality information obtained by fusion calculation is used to indicate the network quality scores of the two edge nodes corresponding to the connection link. The larger the corresponding value of the network quality information, the higher the network service quality between the two edge nodes corresponding to the connection link, and the higher the possibility that the two edge nodes become each other's neighbor nodes. On the contrary, the lower the network service quality between the two edge nodes corresponding to the connection link, the two edge nodes may be unreachable to each other.

[0090] By obtaining the network quality information of the connection link, the network status between the edge nodes to be accessed can be known before the network service provider point is deployed, thereby providing a reference for the subsequent determination of the target deployment location based on the actual network status of each edge node, so that the target deployment location can obtain network services that meet the actual network requirements for any edge node.

[0091] In an exemplary embodiment, a method for determining a target deployment location of a network service provider point is also provided. Based on network quality information, edge nodes are clustered according to a preset node selection strategy to determine the target deployment location of the network service provider point from the corresponding positions of the edge nodes according to the processing results, which may include steps S510 to S540:

[0092] Step S510: randomly obtaining a target number of edge nodes as first centroid points according to the edge nodes, and obtaining a centroid set according to the first centroid points.

[0093] After counting all edge nodes to be connected, a target number of edge nodes may be randomly selected from the edge nodes as first centroid points, so as to obtain a centroid set according to the first centroid points.

[0094] The target number can be determined according to the number of edge nodes to be accessed, and there is no special limitation on this.

[0095] Step S520: Based on the network quality between each edge node, a neighbor node set of each first centroid point is obtained.

[0096] The network quality between the edge node in the neighbor node set and the corresponding first centroid point is greater than a preset network quality threshold. After determining the first centroid point, the network quality between each edge node and the first centroid point, that is, the network quality information of the connection link corresponding to the edge node and the first centroid point can be obtained. The network quality information is compared with the preset network quality threshold to obtain the neighbor node set of each first centroid point according to the comparison result.

[0097] Exemplarily, the preset network quality threshold is PMAX, and the network quality information of any connection link is PL(i,j), which indicates the network quality from edge node i to first centroid j. If PL(i,j) is greater than PMAX, edge node i is a neighbor node of first centroid j, and a neighbor node set is generated based on all neighbor nodes of first centroid j. If PL(i,j) is less than PMAX, it can be regarded that edge node i and first centroid j are unreachable to each other.

[0098] Step S530: The centroid set updating process is executed repeatedly until the centroid set does not change.

[0099] The following update process can be repeated until the centroid set does not change:

[0100] 1) According to the first relationship between the neighbor node sets and the second relationship between the edge nodes and each neighbor node set, the neighbor node sets are updated.

[0101] Based on the first relationship and the second relationship, updating the neighbor node set includes at least one of the following situations:

[0102] Optionally, if there is a first neighbor node set included in the second neighbor node set, the centroid point corresponding to the first neighbor node set is removed from the centroid set.

[0103] Exemplarily, if the first neighbor node set of the first centroid point m is a subset of the second neighbor node set of the first centroid point n, the first centroid point m is removed from the centroid set.

[0104] Since the first neighbor node set is included in the second neighbor node set, subsequent operations on the centroid points corresponding to the first neighbor node set have no practical significance. By removing the centroid points corresponding to the first neighbor node set from the centroid set, the amount of computation for updating the centroid set is reduced, thereby improving processing efficiency.

[0105] Optionally, if there is an outlier edge node that does not belong to any neighbor node set, the outlier edge node is added to the centroid set, and the neighbor node set of the outlier edge node is obtained.

[0106] The existence of outlier edge nodes affects the computing efficiency. By taking the outlier edge nodes themselves as the centroid, the influence of the outlier edge nodes can be eliminated, further improving the processing efficiency.

[0107] Optionally, if there is a cross-edge node belonging to at least two neighbor node sets, the cross-edge node is divided into a target neighbor node set corresponding to the highest network quality according to the network quality between the cross-edge node and the corresponding centroid points of the at least two neighbor node sets.

[0108] For example, if there is a cross-edge node q that belongs to the first neighbor node and the second neighbor node set at the same time, in order to avoid an edge node belonging to the neighbor node sets of multiple first centroid points at the same time, the cross-edge node can be divided into the target neighbor node set corresponding to the highest network quality according to the first network quality between the cross-edge node and the first centroid point m corresponding to the first neighbor node set, and the second network quality between the cross-edge node and the first centroid point n corresponding to the second neighbor node set.

[0109] For example, if the first network quality is greater than the second network quality, the cross-edge node is divided into the first neighbor node set, otherwise it is divided into the second neighbor node set.

[0110] The cross-edge nodes are divided into the target neighbor node set corresponding to the highest network quality to avoid an edge node belonging to multiple first centroid points at the same time. At the same time, the cross-edge nodes are also divided into neighbor node sets that better meet the actual network needs to provide better network services for the cross-edge nodes.

[0111] Based on at least one of the above situations, the neighbor node set is updated to obtain an updated neighbor node set.

[0112] 2) Based on the network quality between each edge node in the updated neighbor node set, re-obtain the second centroid point of the updated neighbor node set, and update the centroid set according to the second centroid point.

[0113] After obtaining the updated neighbor node set, re-obtaining the second centroid point of the updated neighbor node set may include:

[0114] According to the network quality between the two edge nodes in the updated neighbor node set, the maximum and minimum decision method is adopted to obtain the second centroid point of the updated neighbor node set;

[0115] The centroid set is updated according to the second centroid point corresponding to each updated neighbor node set.

[0116] Among them, for any centroid point in the centroid set, the centroid point (second centroid point) of the neighbor node set corresponding to the centroid point is re-obtained using the maximum and minimum decision method. When making a decision using the maximum and minimum decision method, the network quality between any edge nodes in the neighbor node set corresponding to the centroid point is first obtained, and the edge node corresponding to the minimum network quality is obtained. Then, from the edge nodes corresponding to the minimum network quality, the edge node corresponding to the maximum network quality is obtained to determine the second centroid point of the neighbor node set corresponding to the centroid point.

[0117] By adopting the maximum and minimum decision-making method, decisions are made on the premise of avoiding network quality being lower than the actual needs of edge nodes. Regardless of the actual network quality between edge nodes, the basic network quality needs of each edge node can be ensured, thereby guaranteeing the quality of network services.

[0118] Step S540: When the centroid set does not change, the corresponding position of the centroid point in the centroid set is determined as the target deployment position of the network service provider point.

[0119] By repeating the above step S530 until the centroid set does not change, the position corresponding to the centroid point in the centroid set is determined as the target deployment position, and the edge node is connected to the network service provider point at the target deployment position determined by the centroid point corresponding to the neighbor node set.

[0120] Figure 6FIG. 1 is a schematic diagram showing a method of determining a target deployment location of a network service provider point according to an exemplary embodiment of the present disclosure. Figure 6 As shown, based on the network quality information, the edge nodes are clustered according to the preset node selection strategy, and the obtained centroid set is the edge nodes marked by the solid circle in the figure. The edge nodes falling into the same dotted box belong to the same neighbor node set, where the target deployment position of the network service provider point determined from the corresponding position of the edge node is the position corresponding to the solid circle (that is, the position corresponding to the centroid point in the centroid set), and the edge nodes in the same dotted box are connected to the target deployment position in the corresponding virtual circle to establish a SASE network.

[0121] like Figure 7 A schematic diagram of connecting edge nodes to corresponding target deployment locations according to an exemplary embodiment of the present disclosure is shown. There is no need to pre-deploy network service provision points, but rather to deploy on demand according to the actual network conditions of the edge nodes, so that each edge node obtains a network service quality that meets the requirements. Among them, the corresponding positions of edge nodes C and edge nodes B are determined as target deployment locations, and edge nodes C and edge nodes A are connected to the POP point deployed at the position of edge node C, and edge nodes B and edge nodes D are connected to the POP point deployed at the position of edge node B.

[0122] The disclosed embodiment can cluster edge nodes according to network quality information between edge nodes and a preset node selection strategy to determine the target deployment location of a network service provider point from the corresponding location of the edge node, and can deploy the network service provider point on demand according to the distribution of edge nodes and network conditions, so that the edge nodes can obtain network service quality that meets their actual needs, thereby enabling each edge node to have high-quality network service quality.

[0123] In an exemplary embodiment, a method for identifying network quality information is provided to improve the efficiency of determining a target deployment location. Before clustering edge nodes according to a preset node selection strategy based on network quality information to determine the target deployment location of a network service provider point from the corresponding position of the edge node according to the processing result, a network quality score matrix can also be generated according to the network quality information of each connection link. Any element in the network quality score matrix is ​​used to indicate the network quality between two edge nodes of the corresponding connection link.

[0124] For example, Figure 8 A schematic diagram of a network quality score matrix according to an exemplary embodiment of the present disclosure is shown as follows: Figure 8As shown, any element in the matrix is ​​used to indicate the network quality between the two edge nodes of the corresponding connection link, and the link corresponding to the element is determined according to the row and column position of the matrix where the element is located. For example, the connection link corresponding to the element PL(b,a) is the connection link between edge node a and edge node b determined by the first row and the second column. And PL(b,a) indicates the network quality between edge node a and edge node b.

[0125] By generating a network quality score matrix, the network quality between edge nodes can be quickly learned to improve the efficiency of clustering edge nodes based on network quality information and quickly obtain the target deployment location.

[0126] The following uses the edge node access method of the present disclosure in an application scenario as an example to illustrate the edge node access method of the present disclosure embodiment. All service terminals to be accessed are counted in advance, including corporate headquarters, branches, data centers, remote offices, and other service terminals, and connection links are established for the service terminals in pairs.

[0127] (1) Obtain network quality information of the connection link.

[0128] (2) Randomly generate k first centroid points from all the servers to be connected, and let the centroid set be K.

[0129] (3) For any first centroid k, based on the network quality between each server, obtain the neighbor node set Nk of the first centroid k.

[0130] Among them, at least one of the following can be performed to update the neighbor node set Nk:

[0131] a) If Then k′ is removed from the centroid set;

[0132] b) If for Then K = K∪{n}, and obtain the neighbor nodes of the outlier edge node n;

[0133] c) If node n∈N k ∩N k′ , then according to the cross edge nodes n and N k and N k′ The network quality between the corresponding centroid points, that is, according to the size of PL(n,k′) and PL(n,k), the cross-edge nodes are divided into the target neighbor node set corresponding to the highest network quality.

[0134] (4) For According to the network quality between the edge nodes, the second centroid of the neighbor node set is re-obtained so that the re-obtained second centroid satisfies:

[0135]

[0136] (5) Repeat steps (3) and (4) until the centroid set does not change, and determine the corresponding position of the centroid point in the determined centroid set as the target deployment position of the network service provider point in the SASE network. Other edge nodes that belong to the same neighbor node set as the edge node corresponding to the target deployment position are connected to the network service provider point at the corresponding target deployment position.

[0137] The edge node access method in the exemplary embodiment of the present disclosure can cluster the edge nodes according to the network quality information between the edge nodes and the preset node selection strategy, so as to determine the target deployment position of the network service provider point from the corresponding position of the edge node, and can deploy the network service provider point on demand according to the distribution of the edge nodes and the network status, so that the edge nodes can obtain the network service quality that meets their actual needs, and promote each edge node to have high-quality network service quality; because the edge node is not selected for access from the pre-provided network service provider points, but is deployed on demand according to the actual situation of the edge node, the utilization rate of the network service provider point is improved, and the waste of network service costs caused by the low utilization rate of the network service provider point is avoided; in addition, with the rapid development of the field of communication technology, the edge node access method of the embodiment of the present disclosure has practical significance for further promoting the development of low-latency service, high-performance and high-quality access application scenarios.

[0138] In addition, according to an exemplary embodiment of the present disclosure, an edge node access device is also provided, such as Fig. 9 As shown, the device 900 includes:

[0139] A link establishment module 910 is used to establish a connection link between edge nodes and obtain network quality information of the connection link;

[0140] A location determination module 920, configured to perform clustering processing on the edge nodes according to a preset node selection strategy based on the network quality information, so as to determine a target deployment location of a network service provider point from the corresponding locations of the edge nodes according to the processing result;

[0141] The node access module 930 is used to connect the edge node to the network service provision point at the corresponding target deployment location according to the processing result.

[0142] In an exemplary embodiment of the present disclosure, the link establishment module 910 may include:

[0143] A link establishing unit, used to establish connection links between the edge nodes;

[0144] An information acquisition unit, configured to acquire network indicator information of the connection link, and determine weight information of the network indicator information according to a preset influence degree value of the network indicator information on the connection link;

[0145] The fusion unit is used to perform fusion calculation on any of the connection links according to each of the network indicator information and the corresponding weight information to obtain the network quality information of any of the connection links.

[0146] In an exemplary embodiment of the present disclosure, the fusion unit is configured as follows:

[0147] Obtaining the indicator quantity value corresponding to each of the network indicator information;

[0148] For any of the connection links, a weighted fusion calculation is performed according to the quantity values ​​of each indicator and the corresponding weight information to obtain the network quality information of any of the connection links.

[0149] In an exemplary embodiment of the present disclosure, the network quality information is used to indicate the network quality between the two edge nodes corresponding to the connection link; the location determination module 920 may include:

[0150] A first acquisition unit is used to randomly acquire a target number of edge nodes as first centroid points according to the edge nodes, and obtain a centroid set according to the first centroid points;

[0151] A second acquisition unit is used to acquire a neighbor node set of each first centroid based on the network quality between each edge node, wherein the network quality between the edge nodes in the neighbor node set and the corresponding first centroid is greater than a preset network quality threshold;

[0152] The information processing unit is used to cyclically execute the following process until the centroid set does not change:

[0153] updating the neighbor node sets according to the first relationship between the neighbor node sets and the second relationship between the edge node and each of the neighbor node sets;

[0154] Based on the network quality between each edge node in the updated neighbor node set, re-obtain a second centroid point of the updated neighbor node set, and update the centroid set according to the second centroid point;

[0155] The information processing unit is further configured to determine, when the centroid set does not change, a position corresponding to a centroid point in the centroid set as a target deployment position of the network service provider point.

[0156] In an exemplary embodiment of the present disclosure, the information processing unit is configured to perform at least one of the following:

[0157] If there is a first neighbor node set included in the second neighbor node set, the centroid point corresponding to the first neighbor node set is removed from the centroid set;

[0158] If there is an outlier edge node that does not belong to any neighbor node set, add the outlier edge node to the centroid set, and obtain the neighbor node set of the outlier edge node;

[0159] If there is a cross-edge node belonging to at least two neighbor node sets, the cross-edge node is divided into a target neighbor node set corresponding to the highest network quality according to the network quality between the cross-edge node and the corresponding centroid points of the at least two neighbor node sets.

[0160] In an exemplary embodiment of the present disclosure, the information processing unit is further configured to:

[0161] According to the network quality between each two edge nodes in the updated neighbor node set, a maximum and minimum decision method is adopted to obtain a second centroid point of the updated neighbor node set;

[0162] The centroid set is updated according to the second centroid point corresponding to each of the updated neighbor node sets.

[0163] In an exemplary embodiment of the present disclosure, the node access module 930 is configured as follows:

[0164] The edge node is connected to a network service providing point at a target deployment location determined by a corresponding centroid point of the neighbor node set to which it belongs.

[0165] In an exemplary embodiment of the present disclosure, the edge node access device 900 may further include:

[0166] The matrix generation module is used to generate a network quality score matrix according to the network quality information of each connection link; wherein any element in the network quality score matrix is ​​used to indicate the network quality between two edge nodes of the corresponding connection link.

[0167] Since the specific details of each functional module (unit) of the edge node access device of the exemplary embodiment of the present disclosure have been described in detail in the inventive embodiment of the above-mentioned edge node access method, they will not be repeated here.

[0168] It should be noted that although several modules or units of the edge node access device are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0169] In addition, in the exemplary embodiment of the present disclosure, a computer storage medium capable of implementing the above method is also provided. A program product capable of implementing the above method of this specification is stored thereon. In some possible embodiments, various aspects of the present disclosure may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to perform the steps according to various exemplary embodiments of the present disclosure described in the above "Exemplary Method" section of this specification.

[0170] The embodiment of the present disclosure also provides a program product for implementing the above method, which can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto. In this document, a readable storage medium can be any tangible medium containing or storing a program, which can be used by or in combination with an instruction execution system, an apparatus or a device.

[0171] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0172] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0173] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0174] Program code for performing the operations of the present disclosure may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).

[0175] In addition, in an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided. It will be appreciated by those skilled in the art that various aspects of the present disclosure may be implemented as a system, method, or program product. Therefore, various aspects of the present disclosure may be specifically implemented in the following forms, namely: a complete hardware embodiment, a complete software embodiment (including firmware, microcode, etc.), or an embodiment combining hardware and software aspects, which may be collectively referred to herein as a "circuit", "module", or "system".

[0176] Refer to the following Fig.10 hereinafter describes the electronic device 1000 according to such an embodiment of the present disclosure. Fig.10 The electronic device 1000 shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0177] like Fig.10 As shown, the electronic device 1000 is in the form of a general computing device. The components of the electronic device 1000 may include but are not limited to: the at least one processing unit 1010, the at least one storage unit 1020, a bus 1030 connecting different system components (including the storage unit 1020 and the processing unit 1010), and a display unit 1040.

[0178] The storage unit stores program codes, which can be executed by the processing unit 1010, so that the processing unit 1010 executes the steps according to various exemplary embodiments of the present disclosure described in the above “Exemplary Method” section of this specification.

[0179] The storage unit 1020 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 1021 and / or a cache memory unit 1022 , and may further include a read-only memory unit (ROM) 1023 .

[0180] The storage unit 1020 may also include a program / utility 1024 having a set (at least one) of program modules 1025, such program modules 1025 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0181] Bus 1030 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0182] The electronic device 1000 may also communicate with one or more external devices 1100 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 1000, and / or may communicate with any device that enables the electronic device 1000 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 1050. Furthermore, the electronic device 1000 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) via a network adapter 1060. As shown, the network adapter 1060 communicates with other modules of the electronic device 1000 via a bus 1030. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 1000, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0183] Through the description of the above embodiments, it is easy for those skilled in the art to understand that the example embodiments described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the embodiment of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiment of the present disclosure.

[0184] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to the exemplary embodiments of the present disclosure, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.

[0185] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses, or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary technical means in the art that are not disclosed in the present disclosure. The description and examples are to be considered exemplary only, and the true scope and spirit of the present disclosure are indicated by the claims.

Claims

1. An edge node access method, characterized in that: include: Establishing a connection link between edge nodes and obtaining network quality information of the connection link; Based on the numerical value corresponding to the network quality information, clustering the edge nodes to obtain a plurality of cluster centers, and using each of the cluster centers as a target deployment location of a network service provision point; The edge node is connected to a network service provision point at the target deployment location determined by the corresponding cluster center.

2. The method according to claim 1, characterized in that The establishing of a connection link between edge nodes and obtaining network quality information of the connection link includes: Establish connection links between the edge nodes; Acquire network indicator information of the connection link, and determine weight information of the network indicator information according to a preset influence degree value of the network indicator information on the connection link; For any of the connection links, a fusion calculation is performed based on each of the network indicator information and the corresponding weight information to obtain the network quality information of any of the connection links.

3. The method according to claim 2, characterized in that For any of the connection links, performing fusion calculation according to each of the network indicator information and the corresponding weight information to obtain the network quality information of any of the connection links includes: Obtaining the indicator quantity value corresponding to each of the network indicator information; For any of the connection links, a weighted fusion calculation is performed according to the quantity values ​​of each indicator and the corresponding weight information to obtain the network quality information of any of the connection links.

4. The method according to claim 1, characterized in that: The network quality information is used to indicate the network quality between the two edge nodes corresponding to the connection link; The clustering of the edge nodes based on the numerical value corresponding to the network quality information to obtain a plurality of cluster centers, and using each of the cluster centers as a target deployment location of a network service provision point, includes: Randomly acquiring a target number of edge nodes as first centroid points according to the edge nodes, and obtaining a centroid set according to the first centroid points; Based on the network quality between each of the edge nodes, a neighbor node set of each of the first centroids is obtained, wherein the network quality between the edge nodes in the neighbor node set and the corresponding first centroid is greater than a preset network quality threshold; The following process is repeated until the centroid set does not change: updating the neighbor node sets according to the first relationship between the neighbor node sets and the second relationship between the edge node and each of the neighbor node sets; Based on the network quality between each edge node in the updated neighbor node set, re-obtain a second centroid point of the updated neighbor node set, and update the centroid set according to the second centroid point; When the centroid set does not change, the corresponding position of the centroid point in the centroid set is determined as the target deployment position of the network service provider point.

5. The method according to claim 4, characterized in that The updating of the neighbor node sets according to the first relationship between the neighbor node sets and the second relationship between the edge node and each of the neighbor node sets includes at least one of the following: If there is a first neighbor node set included in the second neighbor node set, the centroid point corresponding to the first neighbor node set is removed from the centroid set; If there is an outlier edge node that does not belong to any neighbor node set, add the outlier edge node to the centroid set, and obtain the neighbor node set of the outlier edge node; If there is a cross-edge node belonging to at least two neighbor node sets, the cross-edge node is divided into a target neighbor node set corresponding to the highest network quality according to the network quality between the cross-edge node and the corresponding centroid points of the at least two neighbor node sets.

6. The method according to claim 4, characterized in that The re-obtaining a second centroid point of the updated neighbor node set based on the network quality between each edge node in the updated neighbor node set, and updating the centroid set according to the second centroid point, comprises: According to the network quality between each two edge nodes in the updated neighbor node set, a maximum and minimum decision method is adopted to obtain a second centroid point of the updated neighbor node set; The centroid set is updated according to the second centroid point corresponding to each of the updated neighbor node sets.

7. The method according to claim 4, characterized in that The step of connecting the edge node to a network service provision point at the target deployment location determined by the corresponding cluster center includes: The edge node is connected to a network service providing point at a target deployment location determined by a corresponding centroid point of the neighbor node set to which it belongs.

8. The method according to any one of claims 1 to 7, characterized in that Before clustering the edge nodes based on the numerical values ​​corresponding to the network quality information to obtain a plurality of cluster centers and using each of the cluster centers as a target deployment location of a network service provider point, the method further includes: Generate a network quality score matrix according to the network quality information of each of the connection links; Among them, any element in the network quality score matrix is ​​used to indicate the network quality between two edge nodes of the corresponding connection link.

9. An edge node access device, characterized in that: include: A link establishment module, used to establish a connection link between edge nodes and obtain network quality information of the connection link; A location determination module, configured to cluster the edge nodes based on the numerical values ​​corresponding to the network quality information to obtain a plurality of cluster centers, and use each of the cluster centers as a target deployment location of a network service provision point; A node access module is used to connect the edge node to a network service provision point at the target deployment location determined by the corresponding cluster center.

10. A computer-readable storage medium having a computer program stored thereon, wherein the computer program implements the method according to any one of claims 1 to 8 when executed by a processor.

Citation Information

Patent Citations

  • Wireless router deployment method and device, storage medium and electronic equipment

    CN109743741A

  • Synthetic request injection to generate metadata at points of presence for cloud security enforcement

    US11184403B1

  • High availability solutions for a secure access service edge application

    US11375005B1

  • Managing Application Access Controls And Routing In Cloud Computing Platforms

    US20220200957A1