SD-WAN full-path management method and device based on multiple path segments, medium and product

Abstract

The invention discloses an SD-WAN full path management method and device based on multiple path segments, a medium and a product, and relates to the field of information transmission, and the method comprises the steps: obtaining basic data and 95th percentile traffic of each full path of an SD-WAN; establishing an association relationship between each full path and the path segment; determining effective total flow according to the path segment set corresponding to each full path and the corresponding charging mode; according to the path section cost cardinal number in the path section set corresponding to the full path, the 95th percentile flow of the corresponding full path on each path section and the effective total flow, determining the apportioned cost of the corresponding full path on the current path section, and determining the total cost of the full path; determining a resource price difference according to the full-path subscription cost table of the current full path and the total cost; and SD-WAN full-path management is carried out according to the resource price difference. According to the invention, automatic operation and maintenance, intelligent scheduling and service level guarantee of the SD-WAN can be improved.

Description

Technical Field

[0001] This application relates to the field of information transmission, and in particular to a method, device, medium and product for SD-WAN full path management based on multi-path segments. Background Technology

[0002] In the existing Software-Defined Wide Area Network (SD-WAN) architecture, multiple customers access the backbone network composed of multiple Point of Presence (PoPs) through their respective client devices (terminals) or Customer Premises Equipment (CPE). Because the backbone network is shared by multiple tenants, the communication path between any two CPEs (i.e., the "full path") is usually composed of multiple "path segments" (such as CPE-PoP, PoP-PoP links) connected in series. For example, the full path P1 (CPE1→CPE2) consists of S1 (CPE1-PoP1), S2 (PoP1-PoP2), S3 (PoP2-PoP3), and S4 (PoP3-CPE2); the full path P2 (CPE1→CPE3) consists of S5 (CPE1-PoP2), S3 (PoP2-PoP3), and S6 (PoP3-CPE3). S3 is a shared path segment, which is used by multiple full paths at the same time and carries the traffic of both P1 and P2. The above path segments are provided by different operators or cloud service providers and adopt different billing models - bandwidth monthly rental (e.g., 100Mbps fixed bandwidth, monthly rental of 8000 yuan) or traffic billing (e.g., 0.5 yuan / GB).

[0003] The current management of SD-WAN path costs mainly adopts the following methods: (1) Overall package pricing: a fixed monthly fee is charged to customers (e.g., RMB 5,000 per month for the entire path P1), but the cost of each path segment is not broken down internally, resulting in the inability to trace the source of costs; (2) Shared path segments adopt non-technical allocation rules: for example, for the shared segment S3, regardless of the actual traffic of P1 and P2, the cost is allocated on a 1:1 average basis, ignoring the dynamic characteristics of the actual consumption of network resources; (3) Lack of technical alignment mechanism with the operator's underlying billing model: for example, the cost of bandwidth monthly rental links is essentially a fixed expenditure, but if it is not allocated technically according to "effective usage" (e.g., 95th percentile traffic), it will lead to lightly loaded customers subsidizing heavily loaded customers, violating the principle of fair use; (4) No automated cost-benefit closed-loop system: the existing solution cannot automatically generate the accurate cost and profit and loss status of each full path based on real-time collected traffic data and billing rules, and thus cannot drive the controller to perform path reselection, bandwidth adjustment or customer quotation optimization.

[0004] It is evident that in SD-WAN scenarios with multi-tenancy, multi-path, and hybrid billing models, relying solely on business rules or static configurations will not achieve technical consistency in resource usage and cost allocation, thereby affecting network operation efficiency and service quality.

[0005] Therefore, there is an urgent need to provide an SD-WAN end-path management method or system to solve the technical bottlenecks of SD-WAN in resource metering, cost allocation and business decision support, and improve the automated operation and maintenance, intelligent scheduling and service level assurance of SD-WAN. Summary of the Invention

[0006] The purpose of this application is to provide a method, device, medium, and product for SD-WAN full-path management based on multi-path segments, which can improve the automated operation and maintenance, intelligent scheduling, and service level assurance of SD-WAN.

[0007] To achieve the above objectives, this application provides the following solution: Firstly, this application provides a multi-path segment-based SD-WAN end-path management method, which includes: Obtain basic data for each full path of SD-WAN; the basic data includes: path segment cost base, billing mode, and full path subscription fee table; the billing mode includes: traffic billing mode or bandwidth monthly rental mode; Obtain the 95th percentile traffic for each full path on each path segment; the 95th percentile traffic is the average traffic after removing 5% burst peaks within the billing cycle; Establish the association between each full path and path segments, and determine the set of path segments corresponding to each full path; The effective total traffic is determined based on the set of path segments corresponding to each full path and the corresponding billing mode. The cost allocation of the corresponding full path in the current path segment is determined based on the cost base of the path segment in the set of path segments corresponding to the full path, the 95th percentile flow of the corresponding full path in each path segment, and the effective total flow. The total cost of the entire path is obtained by summing up the allocated costs of all path segments in the entire path. The resource surcharge is determined based on the current end-path subscription fee schedule and total cost; and SD-WAN end-path management is performed based on the resource surcharge.

[0008] Optionally, the process of obtaining basic data for each full path of the SD-WAN further includes: The basic data is preprocessed; the preprocessing includes: data format standardization, data cleaning, and data caching.

[0009] Optionally, establishing the association between each full path and path segments, and determining the set of path segments corresponding to each full path, specifically includes: Based on SD-WAN, the controller updates the real-time path topology relationship, updates the path segments of the entire path, and establishes the association relationship between each full path and path segments. A graph database is used to store the relationships.

[0010] Optionally, determining the effective total traffic based on the set of path segments corresponding to each full path and the corresponding billing mode specifically includes: If the billing mode is traffic-based billing, then the effective total traffic is the actual total traffic of the path segment within the billing period; If the billing model is bandwidth monthly rental model, the effective total traffic is the sum of the 95th percentile traffic of all full paths sharing the current path segment on the current path segment.

[0011] Optionally, the full-path subscription fee table includes: a unique full-path identifier, corresponding customer information, customer subscription fee, and billing cycle.

[0012] Optionally, the SD-WAN end-path management based on resource price differences specifically includes: When the resource price difference is negative, an alert is triggered, and the path is optimized or the customer's subscription fee is adjusted. When the resource price difference is positive, no action is taken.

[0013] Secondly, this application provides a multi-path segment-based SD-WAN end-path management device, the multi-path segment-based SD-WAN end-path management device comprising: The basic data acquisition module is used to acquire basic data for each full path of SD-WAN; the basic data includes: path segment cost base, billing mode, and full path subscription fee table; the billing mode includes: traffic billing mode or bandwidth monthly rental mode. The traffic acquisition module is used to obtain the 95th percentile traffic of each full path on each path segment; the 95th percentile traffic is the average traffic after removing 5% burst peaks within the billing cycle. The path segment association module is used to establish the association between each full path and path segments, and to determine the set of path segments corresponding to each full path. The effective total traffic determination module is used to determine the effective total traffic based on the set of path segments corresponding to each full path and the corresponding billing mode. The single-segment cost splitting module is used to determine the allocated cost of the corresponding full path in the current path segment based on the path segment cost base in the path segment set corresponding to the full path, the 95th percentile flow of the corresponding full path in each path segment, and the effective total flow. The full-path cost aggregation module is used to sum up the allocated costs of all path segments in the full path to obtain the total cost of the entire path. The resource price difference calculation module is used to determine the resource price difference based on the current full-path subscription fee table and total cost; and to perform SD-WAN full-path management based on the resource price difference.

[0014] Thirdly, this application provides a computer device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the aforementioned SD-WAN full path management method based on multiple path segments.

[0015] Fourthly, this application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the aforementioned SD-WAN full path management method based on multiple path segments.

[0016] Fifthly, this application provides a computer program product, including a computer program that, when executed by a processor, implements the aforementioned SD-WAN full path management method based on multiple path segments.

[0017] According to the specific embodiments provided in this application, this application has the following technical effects: This application provides a method, device, medium, and product for SD-WAN full-path management based on multiple path segments. It obtains basic data for each full path through the SD-WAN network architecture; determines the effective total traffic using 95th percentile traffic calculation, path topology mapping, and billing mode adaptability; realizes the technical correlation and dynamic mapping between network resource usage and cost; and determines the allocated cost of each path segment, i.e., clearly defining the cost proportion of each path segment; updates the shared segment allocation method based on 95th percentile traffic; determines the resource price difference based on the current full-path subscription fee table and total cost; and performs SD-WAN full-path management based on the resource price difference. This application achieves accurate full-path cost allocation and resource price difference quantification, thereby improving the automated operation and maintenance, intelligent scheduling, and service level assurance of SD-WAN. Attached Figure Description

[0018] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0019] Figure 1This is a schematic diagram of a multi-path segment-based SD-WAN full path management method according to an embodiment of this application; Figure 2 This is a diagram illustrating the entire path in SD-WAN; Figure 3 This is a schematic diagram of the structure of an SD-WAN end-path management device based on multiple path segments according to an embodiment of this application; Detailed Implementation

[0020] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0021] To make the above-mentioned objectives, features and advantages of this application more apparent and understandable, the application will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0022] In one exemplary embodiment, such as Figure 1 As shown, a multi-path segment-based SD-WAN end-path management method is provided, which includes the following steps S101 to S107. Wherein: S101, Obtain basic data for each full path of SD-WAN; the basic data includes: path segment cost base, billing mode, and full path subscription fee table; the billing mode includes: traffic billing mode or bandwidth monthly rental mode. like Figure 2 As shown, the full path P1 (CPE1→CPE2) consists of S1 (CPE1-PoP1), S2 (PoP1-PoP2), S3 (PoP2-PoP3), and S4 (PoP3-CPE2); the full path P2 (CPE1→CPE3) consists of S5 (CPE1-PoP2), S3 (PoP2-PoP3), and S6 (PoP3-CPE3); S3 is a shared path segment, a path segment used by multiple full paths simultaneously, carrying traffic from both P1 and P2. As a specific implementation, the path segment billing system is used to connect to the billing interfaces of operators / cloud providers / O&M systems to obtain path segment billing details (such as bills and API data) and obtain the path segment cost base for each path segment (such as 8,000 yuan for S3), which serves as the benchmark cost source for cost allocation. The path segment cost base includes: unique path segment identifiers (such as S1 and S2), billing parameters (such as "actual total traffic and unit price" for traffic billing, and "subscribed bandwidth and monthly unit price" for bandwidth monthly rental). The billing data of operators / cloud providers / O&M systems is synchronized through scheduled tasks (such as every morning) and the data is verified (such as verifying whether "actual total traffic × unit price" is consistent with the total bill amount). As a specific implementation, the customer order data (such as contracts and payment records) of the customer subscription system are used to connect with the customer order system to obtain the subscription fee paid by the customer for each full path, which is used as the revenue benchmark for resource price difference calculation; the full path subscription fee table includes: a unique identifier for the full path (such as P1), corresponding customer information (such as customer ID and name), customer subscription fee (such as 5,000 yuan / month for P1) and billing cycle (such as the 1st of each month to the end of the month).

[0023] In addition, the customer subscription system supports linkage with the ERP system. When customer subscription fees are adjusted (such as renewal price increases), the data is synchronized to the core processing layer in real time to ensure the timeliness of price difference calculation.

[0024] To ensure data consistency in subsequent modules, S101 and later also include: The basic data is preprocessed; the preprocessing includes: data format standardization, data cleaning, and data caching.

[0025] The pretreatment process is as follows: (1) Data format standardization: unify data from different sources into JSON format (e.g., path segment data format: {"segment_id":"S3","cost":8000,"billing_mode":"bandwidth_monthly"}); (2) Data cleaning: Remove invalid data (such as records with negative traffic values ​​or empty cost bases) and fill in missing data (such as filling in temporary traffic gaps in a certain path segment using historical averages). (3) Data caching: The standardized data is stored in a distributed cache (such as Redis) for subsequent modules to read quickly (the cache is valid for 1 hour to avoid frequent access to the original data source).

[0026] S102, obtain the 95th percentile traffic of each full path on each path segment; the 95th percentile traffic is the average traffic after removing 5% burst peaks within the billing cycle. As a specific implementation, traffic acquisition devices (deployed at the network edge such as CPE and PoP nodes) are used to collect the 95th percentile traffic of each full path in each path segment; that is, to obtain real-time network traffic data (such as path segment traffic sampled every 5 minutes) and determine the matrix of the 95th percentile traffic of the full path and path segments. The matrix of the 95th percentile traffic includes: the unique identifier of the full path (such as P1, P2), the path segments contained in the full path (such as P1 containing S1, S2, S3, S4), and the 95th percentile traffic of the full path in each path segment (such as the traffic of P1 in S3 = 150GB).

[0027] The 95th percentile flow rate of the entire path in each path segment is determined as follows: Step 1: Sort the traffic data of a certain path segment (e.g., 8640 data points sampled every 5 minutes within a month) from largest to smallest; Step 2: Remove the top 5% of peak data (8640 × 5% = 432); Step 3: Take the maximum value among the remaining data as the 95th percentile flow (to avoid short-term bursts of traffic interference). In this application, the SD-WAN controller is connected to both the CPE and PoP, and traffic data is acquired through a collection protocol. The data sampling frequency is configurable (default 5 minutes / time), and local preprocessing (such as sorting and removing peaks) is performed by the edge computing node to reduce the computing pressure.

[0028] S103, Establish the association between each full path and path segments, and determine the set of path segments corresponding to each full path; S103 specifically includes: S31, based on the real-time path topology relationship of the controller of SD-WAN (records the physical connection relationship of path segments, such as S1 connecting CPE1 and PoP1, S2 connecting PoP1 and PoP2), updates the path segments of the whole path (such as when the route of P1 is adjusted from "S1→S2→S3" to "S1→S7→S3", automatically replaces S2 with S7), and establishes the association relationship between each whole path and path segment. S32 uses a graph database (such as Neo4j) to store the relationships, resulting in a full path-path segment association table, as shown in Table 1; where nodes are "full path" and "path segment", and edges are "containment" relationships (such as P1→S1, P1→S2), supporting quick querying of all path segments contained in a full path.

[0029] Table 1

[0030] S104, determine the effective total traffic based on the set of path segments corresponding to each full path and the corresponding billing mode; S104 specifically includes: S41. If the billing mode is the traffic billing mode, then the effective total traffic is the actual total traffic of the path segment within the billing period, such as the effective total traffic = the actual total traffic of the segment (consistent with operator billing). S42, if the billing mode is bandwidth monthly rental mode, then the effective total traffic is the sum of the 95th percentile traffic of all full paths sharing the current path segment on the current path segment. If S3 is charged according to fixed bandwidth, the effective total traffic = the sum of the 95th percentile traffic of all full paths in this segment (to avoid the amortization of idle costs); S105. Based on the cost base of the path segment in the set of path segments corresponding to the full path, the 95th percentile traffic of the corresponding full path in each path segment, and the effective total traffic, determine the cost allocation of the corresponding full path in the current path segment. That is, calculate the cost allocation of each full path in each path segment it contains according to the "traffic ratio" to solve the problem of fair allocation of shared path segments. The allocated cost of the entire path in a certain path segment = the total cost of that path segment × (95th-order traffic of the entire path in that segment ÷ the total effective traffic of that segment); depending on the method of determining the effective traffic, S105 is also divided into two scenarios, namely: Scenario 1: The path segment is "charged by traffic" (e.g., S2). Step 1: Determine the cost base for this route segment (e.g., S2 = 250 yuan); Step 2: Determine the effective total traffic of this path segment = the actual total traffic counted by the operator (e.g., the actual total traffic of S2 = 500GB). Step 3: Calculate the allocated cost of a certain full path in this segment = cost base of the path segment × (95th flow of the full path in this segment ÷ total effective flow); for example, the allocated cost of P1 in S2 = 250 × (200 ÷ 500) = 100 yuan.

[0031] Scenario 2: The path segment is "bandwidth monthly fee" (e.g., S3). Step 1: Determine the cost base for this route segment (e.g., S3 = 8000 yuan); Step 2: Determine the effective total traffic of this path segment = the sum of the 95th percentile traffic of all full paths sharing this segment (e.g., if S3 is shared by P1 and P2, the effective total traffic = 150 + 250 = 400 GB). Step 3: Calculate the allocated cost of a certain full path in this segment = cost base of the path segment × (95th flow of the full path in this segment ÷ total effective flow); for example, the allocated cost of P1 in S3 = 8000 × (150 ÷ ​​400) = 3000 yuan.

[0032] For example, S3 is the monthly bandwidth fee, with a total cost of 8,000 yuan; P1's 95th-th traffic on S3 is 150GB, and P2's 95th-th-th traffic on S3 is 250GB. S3's effective total flow = 150 + 250 = 400 GB; The cost allocated to P1 in S3 = 8000 × (150 ÷ ​​400) = 3000 yuan; The cost allocated to P2 in S3 = 8000 × (250 ÷ 400) = 5000 yuan; S105 supports multi-threaded parallel computing (the allocated cost of each path segment is calculated independently); for shared path segments (such as S3), a distributed lock ensures the accuracy of the total traffic during concurrent computing of multiple full paths; the output includes "allocated cost + calculation basis" (such as the calculation process of "8000×(150 / 400)" for the allocated cost of P1 in S3), which facilitates auditing, as shown in Table 2: Table 2

[0033] S106, sum up the allocated costs of all path segments in the entire path to obtain the total cost of the entire path; The processing procedure for S106 is as follows: Grouped by "Full Path ID", the allocated costs of all path segments included in the full path are summed up, and the "Full Path Total Cost Table" is shown in Table 3. Table 3

[0034] Verification: The cumulative result must be consistent with the sum of the costs allocated to each path segment (e.g., the total cost of P1 = S1 allocation + S2 allocation + S3 allocation + S4 allocation) to avoid calculation errors.

[0035] For example, P1 includes S1, S2, S3, and S4; Cost allocation for each segment: S1=50 yuan, S2=100 yuan, S3=3000 yuan, S4=50 yuan; Total cost of P1 = 50 + 100 + 3000 + 50 = 3200 yuan.

[0036] S107 determines the resource price difference (profit / loss) based on the current full-path subscription fee table and total cost, providing data support for operational decisions; and performs SD-WAN full-path management based on the resource price difference.

[0037] Resource price difference = customer subscription fee - total cost of the entire path (positive number means profit, negative number means loss); for example, the resource price difference of P1 = 5000 (subscription fee) - 3200 (total cost) = 1800 yuan (profit).

[0038] S107 supports summarizing price differences by customer, route type (such as cross-border / domestic), and time period (such as the last 30 days) to generate multi-dimensional reports, as shown in Table 4; Table 4

[0039] When the resource price difference is negative, an alert is triggered (such as pushing an alarm to the operations platform), and the path is optimized or the customer's subscription fee is adjusted. When the resource price difference is positive, no action is taken.

[0040] For example, P1 customer subscription fee = 5000 yuan, P1 total cost = 3200 yuan; P1 resource price difference = 5000 - 3200 = 1800 yuan (profit).

[0041] The results of S107 are presented to users (operations staff and customers) in a visual and interactive manner through the operations platform / customer portal, and support data export and decision analysis. Specifically, it displays "path segment allocated cost," "total cost of the entire path," and "resource price difference" in the form of dashboards, tables, and charts (e.g., P2's loss warning is marked in red); it supports querying cost breakdown details by dimensions such as the entire path, path segment, and customer (e.g., querying all shared entire paths of S3 and their respective allocated costs); it provides path optimization suggestions (e.g., for the loss-making P2, it suggests "reducing S3's traffic usage" or "adjusting the subscription fee to over 5300 yuan"); it supports exporting calculation results to Excel, PDF, and other formats for financial auditing or customer reconciliation. It adopts a B / S architecture (Web frontend + backend API), with the frontend using ECharts for visualization and the backend providing a RESTful API for data querying, supporting second-level response times for millions of data points.

[0042] The following example illustrates this: Example 1 Step 1: Calculate the total cost of each path segment (e.g., S3 = 8000 yuan); Step 2: Determine which segments the entire path includes (e.g., P1 includes S1-S4), and collect the 95th-order traffic for each segment; Step 3: Calculate the allocated cost for each segment using the "single-segment cost splitting algorithm"; Step 4: Calculate the total cost of the entire path using the "full path aggregation algorithm"; Step 5: Calculate the resource price difference (profit / loss) using the "price difference algorithm"; Example 2 The scene parameters are shown in Tables 5 and 6: Table 5

[0043] Table 6

[0044] The calculation process is as follows: (1) Cost breakdown of a single segment: S2 (flow metering): P1 allocation = 250 × (200 ÷ 500) = 100 yuan; S3 (bandwidth monthly fee): P1 shared = 3000 yuan, P2 shared = 5000 yuan; S6 (flow metering): P2 allocation = 240 × (200 ÷ 400) = 120 yuan.

[0045] (2) Total cost of the entire route: P1 = S1(50) + S2(100) + S3(3000) + S4(50) = 3200 yuan; P2 = S5(80) + S3(5000) + S6(120) = 5200 yuan.

[0046] (3) Resource price difference: P1: 5000 - 3200 = 1800 yuan (profit); P2: 5000-5200=-200 yuan (loss).

[0047] This application has the following beneficial effects (1) Cost traceability: The total cost of the entire path can be broken down into each path segment (e.g., of the 3200 yuan in P1, S3 accounts for 3000 yuan), and the path segments with high costs are clearly identified; (2) Fair sharing: Shared segments are allocated according to the actual traffic ratio (e.g., 8,000 yuan for S3, less for P1 if it uses less), to avoid "paying more for less use"; (3) Profit and loss are clear at a glance: the difference between "subscription fee and actual cost" can be calculated directly (e.g., P2 loses 200 yuan), and the price can be adjusted or the path can be changed accordingly; (4) Automatic adaptation to changes: When adding / deleting path segments in the full path, the system automatically recalculates the cost and price difference without requiring manual rule changes.

[0048] Based on the same inventive concept, this application also provides a multi-path segment-based SD-WAN end-path management device for implementing the aforementioned multi-path segment-based SD-WAN end-path management method. The solution provided by this device is similar to the implementation described in the above method. Therefore, the specific limitations of one or more multi-path segment-based SD-WAN end-path management device embodiments provided below can be found in the limitations of the multi-path segment-based SD-WAN end-path management method described above, and will not be repeated here.

[0049] In one exemplary embodiment, such as Figure 3 As shown, a multi-path segment-based SD-WAN end-path management device is provided, comprising: The basic data acquisition module is used to acquire basic data for each full path of SD-WAN; the basic data includes: path segment cost base, billing mode, and full path subscription fee table; the billing mode includes: traffic billing mode or bandwidth monthly rental mode. The traffic acquisition module is used to obtain the 95th percentile traffic of each full path on each path segment; the 95th percentile traffic is the average traffic after removing 5% burst peaks within the billing cycle. The path segment association module is used to establish the association between each full path and path segments, and to determine the set of path segments corresponding to each full path. The effective total traffic determination module is used to determine the effective total traffic based on the set of path segments corresponding to each full path and the corresponding billing mode. The single-segment cost splitting module is used to determine the allocated cost of the corresponding full path in the current path segment based on the path segment cost base in the path segment set corresponding to the full path, the 95th percentile flow of the corresponding full path in each path segment, and the effective total flow. The full-path cost aggregation module is used to sum up the allocated costs of all path segments in the full path to obtain the total cost of the entire path. The resource price difference calculation module is used to determine the resource price difference based on the current full-path subscription fee table and total cost; and to perform SD-WAN full-path management based on the resource price difference.

[0050] like Figure 3 As shown, the basic data acquisition module and the traffic acquisition module provide basic input for the core processing layer, ensuring the accuracy and real-time nature of the data source; The raw data between the above modules is synchronized in real time through API interfaces, triggering standardization and cleaning of the data access layer. After the standardized data is written to the cache, the path segment association module is triggered to perform mapping updates through event notifications (such as Kafka messages). After the mapping relationship of the path segment association module is updated, the single-segment cost splitting module is triggered to recalculate the allocated cost, which in turn triggers full-path cost aggregation and resource price difference calculation in sequence. After the resource price difference calculation is completed, it is synchronized to the operation platform / customer portal in real time to ensure that users see the latest results.

[0051] In one exemplary embodiment, a computer device is provided, which may be a server or a terminal. The computer device includes a processor, memory, input / output interfaces (I / O), and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is connected to the system bus via the I / O interfaces. The processor of the computer device provides computing and control capabilities. The memory of the computer device includes non-volatile storage media and internal memory. The non-volatile storage media stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The I / O interfaces of the computer device are used for exchanging information between the processor and external devices. The communication interface of the computer device is used for communication with external terminals via a network connection. When the computer program is executed by the processor, it implements a multi-path segment-based SD-WAN full-path management method.

[0052] In one exemplary embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described method embodiments.

[0053] In one exemplary embodiment, a computer-readable storage medium is provided storing a computer program that, when executed by a processor, implements the steps in the above-described method embodiments.

[0054] In one exemplary embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above-described method embodiments.

[0055] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of the relevant data must comply with relevant regulations.

[0056] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments described above. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM).

[0057] The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to these.

[0058] In this application, all actions to acquire signals, information, or data are carried out in compliance with the relevant data protection laws and policies of the country where the location is situated, and with the authorization granted by the owner of the relevant device.

[0059] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0060] This document uses specific examples to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the methods and core ideas of this application. Furthermore, those skilled in the art will recognize that, based on the ideas of this application, there will be changes in the specific implementation methods and application scope. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A multi-path segment-based SD-WAN end-path management method, characterized in that, The SD-WAN end-path management method based on multi-path segments includes: Obtain basic data for each full path of SD-WAN; the basic data includes: path segment cost base, billing mode, and full path subscription fee table; the billing mode includes: traffic billing mode or bandwidth monthly rental mode; Obtain the 95th percentile traffic for each full path on each path segment; the 95th percentile traffic is the average traffic after removing 5% burst peaks within the billing cycle; Establish the association between each full path and path segments, and determine the set of path segments corresponding to each full path; The effective total traffic is determined based on the set of path segments corresponding to each full path and the corresponding billing mode. The cost allocation of the corresponding full path in the current path segment is determined based on the cost base of the path segment in the set of path segments corresponding to the full path, the 95th percentile flow of the corresponding full path in each path segment, and the effective total flow. The total cost of the entire path is obtained by summing up the allocated costs of all path segments in the entire path. The resource surcharge is determined based on the current end-path subscription fee schedule and total cost; and SD-WAN end-path management is performed based on the resource surcharge.

2. The SD-WAN end-path management method based on multi-path segments according to claim 1, characterized in that, The process of obtaining basic data for each full path of SD-WAN then includes: The basic data is preprocessed; the preprocessing includes: data format standardization, data cleaning, and data caching.

3. The SD-WAN end-path management method based on multi-path segments according to claim 1, characterized in that, The process of establishing the association between each full path and path segments, and determining the set of path segments corresponding to each full path, specifically includes: Based on SD-WAN, the controller updates the real-time path topology relationship, updates the path segments of the entire path, and establishes the association relationship between each full path and path segments. A graph database is used to store the relationships.

4. The SD-WAN end-path management method based on multi-path segments according to claim 1, characterized in that, The determination of the effective total traffic based on the set of path segments corresponding to each full path and the corresponding billing mode specifically includes: If the billing mode is traffic-based billing, then the effective total traffic is the actual total traffic of the path segment within the billing period; If the billing model is bandwidth monthly rental model, the effective total traffic is the sum of the 95th percentile traffic of all full paths sharing the current path segment on the current path segment.

5. The SD-WAN end-path management method based on multi-path segments according to claim 1, characterized in that, The full-path subscription fee table includes: a unique identifier for the entire path, corresponding customer information, customer subscription fees, and billing cycles.

6. The SD-WAN end-path management method based on multi-path segments according to claim 5, characterized in that, The aforementioned SD-WAN end-to-end management based on resource price differences specifically includes: When the resource price difference is negative, an alert is triggered, and the path is optimized or the customer's subscription fee is adjusted. When the resource price difference is positive, no action is taken.

7. A multi-path segment-based SD-WAN end-path management device, characterized in that, The multi-path segment-based SD-WAN end-path management device includes: The basic data acquisition module is used to acquire basic data for each full path of SD-WAN; the basic data includes: path segment cost base, billing mode, and full path subscription fee table; the billing mode includes: traffic billing mode or bandwidth monthly rental mode. The traffic acquisition module is used to obtain the 95th percentile traffic of each full path on each path segment; the 95th percentile traffic is the average traffic after removing 5% burst peaks within the billing cycle. The path segment association module is used to establish the association between each full path and path segments, and to determine the set of path segments corresponding to each full path. The effective total traffic determination module is used to determine the effective total traffic based on the set of path segments corresponding to each full path and the corresponding billing mode. The single-segment cost splitting module is used to determine the allocated cost of the corresponding full path in the current path segment based on the path segment cost base in the path segment set corresponding to the full path, the 95th percentile flow of the corresponding full path in each path segment, and the effective total flow. The full-path cost aggregation module is used to sum up the allocated costs of all path segments in the full path to obtain the total cost of the entire path. The resource price difference calculation module is used to determine the resource price difference based on the current full-path subscription fee table and total cost; and to perform SD-WAN full-path management based on the resource price difference.

8. A computer device, comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that the processor executes the computer program to implement the SD-WAN full path management method based on any one of claims 1-6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the computer program implements the SD-WAN full path management method based on multiple path segments as described in any one of claims 1-6.

10. A computer program product, comprising a computer program, characterized in that, When executed by a processor, the computer program implements the SD-WAN full path management method based on multiple path segments as described in any one of claims 1-6.

Images