A method, device, electronic device and storage medium for elastic large bandwidth splitting

By grouping, sorting and splitting the paths of source sink nodes in the operator backbone network, and combining with the CSPF algorithm, efficient allocation of large bandwidth is achieved, and the existing technology of low bandwidth splitting efficiency and low bandwidth utilization rate is solved. The problem ensures the uniform distribution of network traffic.

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

Patent Information

Application Number
CN202111645423.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-30
Publication Date
2024-11-12
Estimated Expiration
2041-12-30

AI Technical Summary

Technical Problem

The prior art is inefficient when splitting large bandwidth paths in operator backbone networks, with low maximum path bandwidth utilization, and the splitting method does not consider the residual bandwidth and network balance of the end-to-end link.

Method used

By obtaining all end-to-end paths between source sink end nodes, grouping, in-group sorting and inter-group sorting, large bandwidth splitting from large to small according to the order of the inter-group sorting according to the maximum satisfaction priority allocation or weight ratio , calculate the path using the CSPF algorithm to ensure the maximum bandwidth and hop constraints of the path.

Benefits of technology

The utilization rate of the remaining path bandwidth and the entire network bandwidth is improved, making the traffic distribution of the entire network more evenly, and solving the problems of low splitting efficiency and low link utilization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114338557B_ABST
    Figure CN114338557B_ABST
Patent Text Reader

Abstract

The present disclosure provides a method, device, electronic device and storage medium for elastic large bandwidth splitting, and relates to the field of computer software. The method includes traversing all paths between source and destination node pairs, and grouping all end-to-end paths between source and destination node pairs; sorting each grouped path within the group, and then sorting between groups; splitting the large bandwidth according to the sorting after the second round of reorganization, and splitting the elastic large bandwidth from large to small according to the maximum satisfaction priority allocation or according to the weight ratio. The technical solution disclosed in the present disclosure mainly solves the problem of how to use the collected network real-time links and the maximum remaining bandwidth of the path to achieve fast and effective splitting of elastic large bandwidth through the group inverted wedge bandwidth allocation method in the backbone network of the operator when the software defined network (SDN) controller is required to support elastic large bandwidth requirements, so that the whole network traffic is distributed as evenly as possible.
Need to check novelty before this filing date? Find Prior Art

Description

Background Art

[0002] When the SRv6 (Segment Routing IPv6, segment routing based on IPv6 forwarding plane) dedicated line service is opened in the backbone network of the operator, there is often a demand for elastic large bandwidth services, that is, the bandwidth requested by the user is greater than the maximum remaining bandwidth of all single paths in the network. At this time, it is necessary to realize the load sharing of large bandwidth traffic through the method of path splitting. For large bandwidth path splitting, the existing technical solution generally uses the exponential splitting method of 2, and the idea is as follows: first see whether two paths can meet the requirements. If not, split into 4 paths. If 4 paths cannot meet the requirements, split into 8 paths..., and split according to the number of 2, 4, 8, 16... This method is relatively inefficient. For example, if 16 paths cannot meet the requirements, but 17 paths can meet the requirements, the number of split SL (Segment-List) entries is 32 paths> the actual number of SLs required. In addition, the number of splits does not take into account the remaining bandwidth of the end-to-end link, and does not split from the perspective of network balance of the entire network.

[0003] 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

[0004] The present disclosure provides a flexible large bandwidth splitting method, device, electronic device and storage medium, which at least to a certain extent solve the problem of relatively low maximum path bandwidth utilization in the prior art.

[0005] 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.

[0006] According to one aspect of the present disclosure, a method for elastic large bandwidth splitting is provided, comprising: obtaining source and destination nodes; traversing all end-to-end paths between the source and destination nodes; grouping all end-to-end paths between the source and destination nodes; sorting each group path within the group; sorting the groups sorted within the group between groups; performing large bandwidth splitting according to the order after the inter-group sorting, and splitting the elastic large bandwidth from large to small according to the weight ratio.

[0007] In one embodiment, the traversal of all end-to-end paths between source and destination nodes is specifically as follows: starting from the source, path exploration is performed respectively according to the adjacent nodes in the visible range. A path group set {SL1, SL2...SL i ...SL n}, n is the maximum number of paths starting from a single adjacent node, SL i =(R S ,R i ...Rj ...R D ), R S is the source node, R i is the neighboring node of the source node, R D is the sink node. If the source has only one adjacent node, start from the node with >= 2 fan-out nodes.

[0008] In one embodiment, the method of sorting each group path within a group is based on the maximum path bandwidth value of each end-to-end path. All paths starting from each adjacent node form a group, and the paths are sorted within the group according to the maximum path bandwidth. When the maximum path bandwidths are the same, the paths are sorted according to the number of hops (assuming that the path cost value and the path hop value are equal), and the path with a smaller hop value is sorted first.

[0009] Before reorganizing the paths at the top of each group, the bandwidth of the overlapping paths is judged and removed. If there are overlapping paths, the overlapping bandwidth needs to be removed from large to small and recalculated. Note that only the overlapping bandwidth at the top of each group needs to be removed at the beginning. The principle of removal is that small bandwidth gives way to large bandwidth, that is, the path with large bandwidth occupies the shared bandwidth first. After the shared bandwidth is removed from the path at the head of each group, the other paths in the group also need to be removed synchronously, and then they need to be reordered in the group to ensure that the paths participating in the reorganization are the optimal paths in the group.

[0010] In one embodiment, the inter-group sorting is to select the first path from each group, regroup into a new group, and sort again. Select the first path from different path groups, and sort again according to the maximum bandwidth of the path.

[0011] In one embodiment, before re-sorting, the bandwidth of the first path of each group needs to be deduplicated to determine whether there is link bandwidth overlap. If there is overlap, the overlapping bandwidth needs to be removed from large to small and recalculated. If a first path is no longer the optimal path in the original group after removing the overlapping bandwidth, it needs to be re-sorted in the original group to select the optimal path to participate in the reorganization between groups. This forms an inverted wedge sorting of the maximum bandwidth path, and the sorting principle is consistent with the principle of sorting within the group.

[0012] When there is a need for elastic large bandwidth splitting, it is possible to determine in advance whether the large bandwidth can be successfully split to see whether the required large bandwidth exceeds the sum of the maximum path bandwidth in the inverted wedge queue. If it exceeds, it cannot be successfully split, otherwise it can be successfully split. For bandwidth requirements that can be split, the bandwidth is allocated from large to small or by weight based on the inverted wedge sorting of the maximum bandwidth of the end-to-end path. If the remaining unallocated bandwidth is less than the maximum path bandwidth of the group, the remaining bandwidth is used as the split bandwidth value. According to the allocated bandwidth, the nodes passed by each end-to-end path are used as constraints, and the CSPF (Constrained Shortest Path First) algorithm is applied to calculate the path.

[0013] It should be noted that this technical method is not limited to bandwidth scenarios. If it is necessary to consider constraints such as path delay, path cost, total number of path hops, affinity attributes, etc., they can be included as path construction constraints and sorting dimensions, and multi-dimensional constraints and sorting can be performed.

[0014] In one embodiment, a flexible large bandwidth splitting method is applicable to scenarios where a source / destination node has only one neighboring node or all end-to-end paths share a link in the middle.

[0015] According to another aspect of the present disclosure, there is provided an elastic large bandwidth splitting device, comprising:

[0016] An acquisition module, used to acquire source and sink nodes;

[0017] A traversal module, used to respond to a request from a source node to transmit data to a sink node, and traverse all end-to-end paths between the source and sink nodes;

[0018] A grouping module, used for grouping all end-to-end paths between source and sink nodes;

[0019] The sorting module is used to sort each grouping path within the group and then sort between groups;

[0020] The splitting module is used to split the large bandwidth according to the order after the groups are sorted, and to split the elastic large bandwidth from large to small according to the maximum satisfaction priority allocation or the weight ratio.

[0021] In one embodiment, the elastic large bandwidth splitting device may further include the following modules:

[0022] A storage module, used to store detection information and ancillary information of multi-source heterogeneous data;

[0023] The control module is used to control the operation of the acquisition module, traversal module, grouping module, sorting module, splitting module and storage module.

[0024] According to another aspect of the present disclosure, there is provided a flexible large bandwidth splitting device, comprising:

[0025] At least one processor and a memory for communicating with the at least one processor; the memory stores commands that can be executed by the at least one processor, and the commands are executed by the at least one processor so that the at least one processor can execute a resilient large bandwidth splitting method as described in the first aspect above.

[0026] According to another 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, the method for elastic large bandwidth splitting as described in the first aspect is implemented.

[0027] According to another aspect of the present disclosure, a computer program product is provided, the computer program product comprising a computer program stored on a computer-readable storage medium, the computer program comprising program instructions, and when the computer program instructions are executed by a processor, the processor executes a resilient large bandwidth splitting method as described in the first aspect above.

[0028] The embodiments of the present disclosure provide a method, device, electronic device and storage medium for elastic large bandwidth splitting. After sorting within a group, sorting between groups is performed, and then large bandwidth splitting is performed according to the order after sorting between groups. The elastic large bandwidth is split from large to small according to the maximum satisfaction priority allocation strategy, which effectively improves the utilization rate of the remaining bandwidth of the path and the utilization rate of the bandwidth of the entire network, so that the traffic distribution of the entire network is more even.

[0029] 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

[0030] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure. Obviously, the accompanying drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without creative work.

[0031] Figure 1 This is an application scenario of an elastic large bandwidth splitting method provided by an exemplary embodiment of the present disclosure;

[0032] Figure 2 is a flow chart of a flexible large bandwidth splitting method provided by an exemplary embodiment of the present disclosure;

[0033] Figure 3It is a schematic diagram of path traversal from a source node to a sink node in a flexible large bandwidth splitting method provided by an exemplary embodiment of the present disclosure;

[0034] Figure 4 This is a schematic diagram of the first round of intra-group sorting and the second round of reorganization sorting of a flexible large bandwidth splitting method provided by an exemplary embodiment of the present disclosure;

[0035] Figure 5 It is a schematic diagram of elastic large bandwidth splitting of an elastic large bandwidth splitting method provided by an exemplary embodiment of the present disclosure;

[0036] Figure 6 This is a schematic diagram of a tenant entering the cloud through an operator backbone network SRv6 dedicated line service in an elastic large bandwidth splitting method provided by an exemplary embodiment of the present disclosure;

[0037] Figure 7 It is a schematic diagram of an inverted wedge-shaped bandwidth sorting of an elastic large bandwidth splitting method provided by an exemplary embodiment of the present disclosure;

[0038] Figure 8 It is a schematic diagram showing an inverted wedge-shaped bandwidth splitting process of an elastic large bandwidth splitting method provided by an exemplary embodiment of the present disclosure;

[0039] Fig. 9 This is a schematic diagram of elastic large bandwidth splitting in a scenario where a tenant accesses the cloud through an operator backbone network, in which an elastic large bandwidth splitting method is provided in an exemplary embodiment of the present disclosure;

[0040] Fig.10 This is a schematic diagram of a scenario in which a source / destination node has only one neighboring node in a method for elastic large bandwidth splitting provided by an exemplary embodiment of the present disclosure;

[0041] Fig.11 This is a schematic diagram of a scenario in which end-to-end paths of an elastic large bandwidth splitting method provided by an exemplary embodiment of the present disclosure share a link in the middle;

[0042] Fig.12 is a schematic diagram of an elastic large bandwidth splitting device provided by an exemplary embodiment of the present disclosure;

[0043] Fig.13 An elastic large bandwidth splitting device is provided by an exemplary embodiment of the present disclosure. DETAILED DESCRIPTION

[0044] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example 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 disclosure will be more comprehensive and complete and to fully convey the concepts of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0045] In addition, the accompanying drawings are only schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.

[0046] The solution provided by the present disclosure can effectively solve the three major problems of "how many paths the elastic large bandwidth should be split into, how much bandwidth should be allocated to each split path, and whether the corresponding path can be successfully calculated for each split bandwidth", and can be effectively applied to the operator's existing network.

[0047] The solution provided by the embodiments of the present disclosure involves technologies such as computer software, which are specifically described by the following embodiments:

[0048] Figure 1 It is an application scenario of elastic large bandwidth. P (Provider, operator router) is located in the backbone network and is responsible for establishing label switching paths and forwarding data packets through label switching. CE (Customer Edge, user edge device) can be a router, a switch or a host; PE is located in the backbone network (Provider Edge, operator edge router) and is the boundary between P and CE. PE is the edge router of the operator backbone network, which is equivalent to the label edge router (LER). The PE router connects the CE router and the P router and is the most important network node. The user's traffic flows into the user network through the PE router, or flows to the MPLS backbone network through the PE router. CE is the user-side router connected to the operator. The CE router provides service access to users by connecting to one or more PE routers. The CE router is usually an IP router, which establishes an adjacency relationship with the connected PE router. SDN-CONTROLLER (Software Defined Network Controller) periodically collects the utilization of each segment and calculates the optimal bandwidth path.

[0049] like Figure 2As shown, a flowchart of a method for elastic large bandwidth splitting provided by an exemplary embodiment of the present disclosure includes:

[0050] S201, obtaining source and sink nodes;

[0051] Among them, the source node refers to the network node that acts as the source to send the original data packet, and the destination node refers to the network node that acts as the receiver of the original data packet of the source. For two-way communication, the source node also serves as the destination node, and the destination node also serves as the source node.

[0052] S202, traversing all end-to-end paths between source and destination nodes;

[0053] Traversal means visiting each node from end to end once and only once along a path.

[0054] S203, grouping all end-to-end paths between source and sink nodes;

[0055] S204, sorting each grouping path within the group;

[0056] S205, performing inter-group sorting on the groups sorted within the groups;

[0057] S206, splitting the large bandwidth according to the order after the groups are sorted, and splitting the elastic large bandwidth from large to small according to the weight ratio.

[0058] By obtaining the real-time link remaining bandwidth information of the entire network, a real-time maximum path bandwidth array between source and destination nodes is constructed. After first grouping and performing two-dimensional sorting of the maximum path bandwidth and the number of path hops, the optimal path for each group is selected. Then a second round of sorting is performed between groups to form the optimal path sorting for the entire network. This effectively solves the problems of low splitting efficiency, low link utilization, and even inability to perform large bandwidth splitting caused by "blind testing" of elastic large bandwidth splitting.

[0059] Figure 3 This is a schematic diagram of path traversal from a source node to a sink node of a resilient large bandwidth splitting method provided by an exemplary embodiment of the present disclosure. With node a as the source node and node h as the sink node, a schematic diagram of path exploration is given; then, each traversed path is grouped. The groups are as follows: Group 1: 2(2,30,5), 1(2,1,2,8,5), 1(2,1,2,7,21), Group 2: 2(6,2,8,5), 2(6,2,7,21), Group 3: 3(9,3,8,5), 3(9,3,7,21), 9(9,24,21).

[0060] Figure 4This is a schematic diagram of the first round of intra-group sorting and the second round of reorganization sorting of a flexible large bandwidth splitting method provided by an exemplary embodiment of the present disclosure. The paths traversed by each "clone" are sorted within the group. The basis for sorting is the maximum path bandwidth value of each end-to-end path. For example, the maximum path bandwidth value of the path (2,1,2,7,21) is 1. The purpose of sorting is to select the path with the highest maximum path bandwidth in the group. The first ranked path of group 1 is 2 (2,30,5), the first ranked path of group 2 is 2 (6,2,8,5), and the first ranked path of group 3 is 9 (9,24,21). After a round of sorting of different groups, the path with the largest maximum path bandwidth from the source node to the destination node ranks first. At this time, it is necessary to select the first ranked path from each group, recombined into a new group, and sorted again. The order is 9 (9,24,21), 2 (2,30,5), and 2 (6,2,8,5).

[0061] Before sorting the groups after they are sorted within the group, it is necessary to remove the overlapping bandwidth of the first path of each group. If there is overlapping bandwidth in the path, remove the overlapping bandwidth from large to small and recalculate. If the first path of a group is no longer the optimal path in the group after removing the overlapping bandwidth, it is necessary to re-sort it within the original group to select the optimal path to participate in the sorting between groups. This forms an inverted wedge sorting of the maximum bandwidth path, and the sorting principle is the same as the principle of sorting within the group.

[0062] Figure 5 This is a schematic diagram of elastic large bandwidth splitting of an elastic large bandwidth splitting method provided by an exemplary embodiment of the present disclosure. After sorting within the group and between the groups, the optimal path sorting is 9 (9, 24, 21), 2 (2, 30, 5), 2 (6, 2, 8, 3 (3 = 5-2)). So far, through the solution provided by the present disclosure, the optimal path sorting of the entire network is formed, which effectively solves the problem of "blind test" caused by elastic large bandwidth splitting and improves splitting efficiency and link utilization.

[0063] In this embodiment, a scenario is given in which a tenant accesses the cloud through the operator's backbone network SRv6 dedicated line service. Figure 6 As shown in the figure, assume that the maximum physical bandwidth of each link is 10G, and all nodes are on the same routing plane. The traffic is from R1->R5. Assume that the remaining bandwidth does not consider the link congestion margin, and the link cost value and the path hop value are equal. Assume that there is a customer who needs elastic large bandwidth to allocate 11G large bandwidth. The specific large bandwidth splitting calculation process is as follows:

[0064] Starting from the source node R1, we explore paths according to the nodes R2, R3, and R4 in the visible range to form a path group, as shown in Table 1.

[0065]

[0066] Table 1

[0067] All paths starting from each adjacent node (R2, R3, R4) are grouped together and sorted by the maximum bandwidth of the path. When the maximum bandwidth is the same, they are sorted by the number of path hops, with the path with a smaller number of path hops being placed in front. After the first round of intra-group sorting, the results are shown in Table 2.

[0068]

[0069]

[0070] Table 2

[0071] The overlapping bandwidth of the paths before reorganization is removed from the first-ranked paths in different groups. For example, in Table 2, the optimal paths R1-R3-R4-R5 of the group with the neighboring node R4 and the group with the neighboring node R3 overlap. 5G bandwidth needs to be removed from R1-R4-R5, and the maximum bandwidth of its path becomes 3. After removing the 5G bandwidth, the overlapping path bandwidth of other paths in the {R4} group needs to be removed synchronously, and the path R1-R4-R5 will participate in the sorting in the group again. According to the calculation, R1-R4-R5 is still ranked first in the group with the neighboring node R4. The results after removing the overlapping bandwidth at the head of the group are shown in Table 3.

[0072]

[0073] Table 3

[0074] The optimal paths of the first teams in different groups are selected for reorganization and sorting. The idea of ​​sorting is the same as the sorting within the group. After the second round of reorganization and sorting between groups, the results are shown in Table 4.

[0075]

[0076] Table 4

[0077] The inverted wedge sorting based on the maximum bandwidth of the end-to-end path, such as Figure 7 As shown in the figure, the bandwidth is allocated from large to small. First, the allocation is carried out in the order of {R3 group: 5G}->{R4 group: 3G}->{R2 group: 3G}; 5G is allocated first, and the remaining 11-5=6G, and then 3G is allocated, and the remaining 6-3=3G. A three-way load sharing is formed: (R1-R3…R5):(R1-R4…R5):(R1-R2…R5)=5:3:3. The allocation process is as follows Figure 8 shown.

[0078] Starting from the visible node R3, the path R1-R3-R4-R5 (5-8-8) is calculated according to the CSPF algorithm with bandwidth 5G and node constraints (through R3).

[0079] Starting from the visible node R4, the path R1-R4-R5 (4-3) is calculated according to the CSPF algorithm with bandwidth 3G and node constraints (passing through R4).

[0080] Starting from the visible node R2, the path is calculated according to the CSPF algorithm with a bandwidth of 3G and node constraints (passing through R2), and the path is R1-R2-R3-R5 (6-3-3).

[0081] The whole splitting process is Fig. 9 As shown. Starting from the source node R1, the paths are explored according to the nodes R2, R3, and R4 in the visible range to form a path group. All paths from each adjacent node (R2, R3, and R4) are grouped together and sorted by the maximum bandwidth of the path. When the maximum bandwidth is the same, they are sorted by the number of path hops, with the path with the smaller number of path hops being ranked first. After the first round of intra-group sorting, the paths ranked first in different groups are calculated by removing the overlapping bandwidth of the paths before reorganization. For example, in Table 2, the optimal paths R1-R3-R4-R5 of the group R1-R4-R5 with the adjacent node R4 and the group R3 with the adjacent node R1-R3-R4-R5 overlap, and R1-R4-R5 needs to be removed by 5G, and its maximum path bandwidth becomes 3. After removing the 5G bandwidth, the other paths in the {R4} group need to be simultaneously removed from the overlapping path bandwidth, and the path R1-R4-R5 re-participates in the sorting within the group. According to the calculation, R1-R4-R5 still ranks first in the group with the adjacent node R4. Select the best path in the first queue of different groups for reorganization and sorting. The sorting idea is the same as the sorting within the group. After the second round of inter-group reorganization and sorting, the bandwidth is allocated from large to small based on the inverted wedge sorting of the maximum bandwidth of the end-to-end path. First, allocate in the order of {R3 group: 5G}->{R4 group: 3G}->{R2 group: 3G}; first allocate 5G, the remaining 11-5=6G, continue to allocate 3G, and the remaining 6-3=3G. Form a 3-way load sharing: (R1-R3…R5):(R1-R4…R5):(R1-R2…R5)=5:3:3. Starting from the visible node R3, the CSPF algorithm with bandwidth 5G and node constraints (through R3) is used to calculate the path R1-R3-R4-R5(5-8-8). Starting from the visible node R4, the CSPF algorithm with bandwidth 3G and node constraints (through R4) is used to calculate the path R1-R4-R5(4-3). Starting from the visible node R2, the path is calculated according to the CSPF algorithm with a bandwidth of 3G and node constraints (passing through R2), and the path is R1-R2-R3-R5 (6-3-3).

[0082] The technical method disclosed in the present invention is applicable to scenarios where a source / destination node has only one adjacent node or all end-to-end paths share a link in the middle.

[0083] For a scenario where the source / destination node has only one neighboring node, according to the technical solution provided by the present disclosure, the optimal path is R0-R1-R3-R4-R5-R6 (X-5-8-8-X), as follows: Fig.10 shown.

[0084] For a scenario where all end-to-end paths share a link in the middle, according to the technical solution provided by the present disclosure, the optimal path is R1-R3-R4-R5-R6-R7-R9 (5-8-8-3-9-9), as follows: Fig.11 shown.

[0085] Fig.12 An exemplary embodiment of the present application provides an elastic large bandwidth splitting device, in which the elastic large bandwidth splitting method device 1200 includes but is not limited to the following modules: an acquisition module 1210, a traversal module 1220, a grouping module 1230, a sorting module 1240, and a splitting module 1250.

[0086] Wherein, the acquisition module 1210 is used to acquire the source and sink nodes;

[0087] A traversal module 1220, configured to respond to a request from a source node to transmit data to a sink node, and traverse all end-to-end paths between the source and sink nodes;

[0088] A grouping module 1230, configured to group all end-to-end paths between source and sink nodes;

[0089] A sorting module 1240 is used to sort each grouping path within the group and then sort between the groups;

[0090] The splitting module 1250 is used to split the large bandwidth according to the order after the groups are sorted, and split the elastic large bandwidth from large to small according to the maximum satisfaction priority allocation or according to the weight ratio.

[0091] Preferably, the elastic large bandwidth splitting device 1200 may further include a storage module 1260 for storing detection information and auxiliary information of multi-source heterogeneous data;

[0092] Optionally, the elastic large bandwidth splitting device 1200 may further include a control module 1270 for controlling the operation of the acquisition module 1210, the traversal module 1220, the grouping module 1230, the sorting module 1240, the splitting module 1250, and the storage module 1260;

[0093] It should be noted that, since an elastic large bandwidth splitting device in this embodiment and an elastic large bandwidth splitting method in any of the above embodiments are based on the same inventive concept, the corresponding contents in the method embodiment are also applicable to the system embodiment and will not be described in detail here.

[0094] Fig.13 An elastic large bandwidth splitting device is provided by an exemplary embodiment of the present application. The device-oriented multi-source heterogeneous data identification and detection device 1300 can be any type of terminal, such as a mobile phone, a game console, a tablet computer, an e-book reader, smart glasses, an MP4 (Moving Picture Experts Group Audio Layer IV) player, a smart home device, an AR (Augmented Reality) device, a VR (Virtual Reality) device and other mobile terminals, or the elastic large bandwidth splitting device 1300 can also be a personal computer (Personal Computer, PC), such as a laptop computer and a desktop computer, etc., a mobile phone, a tablet computer, a personal computer, etc.

[0095] The elastic large bandwidth splitting device 1300 may be installed with an application for providing an elastic large bandwidth splitting.

[0096] Preferably, the elastic large bandwidth splitting device 1300 includes: one or more processors 1310 and a memory 1320, Fig.13 A processor 1310 is taken as an example.

[0097] The processor 1310 and the memory 1320 may be connected via a bus or other means. Fig.13 Take the example of connecting via a bus.

[0098] The memory 1320 is a non-transitory computer-readable storage medium that can be used to store non-transitory software programs, non-transitory computer executable programs and modules, such as program instructions / modules corresponding to the device-oriented multi-source heterogeneous data recognition and detection device 1300 in an embodiment of the present invention, for example, Fig.12 The acquisition module 1210, traversal module 1220, grouping module 1230, sorting module 1240, and splitting module 1250 shown in the figure. The processor 1310 executes various functional applications and data processing of an elastic large bandwidth splitting device 1200 by running non-transient software programs, instructions, and modules stored in the memory 1320, that is, an elastic large bandwidth splitting method of the above method embodiment is implemented.

[0099] The memory 1320 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required by at least one function; the data storage area may store data created according to the use of a flexible large bandwidth splitting device 1200, etc. In addition, the memory 1320 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage devices. In some embodiments, the memory 1320 may optionally include a memory remotely arranged relative to the processor 1310, and these remote memories may be connected to the flexible large bandwidth splitting device 1200 via a network.

[0100] Optionally, the above-mentioned network connection can be a wireless network or a wired network using standard communication technology and / or protocols. The network is usually the Internet, but it can also be any network, including but not limited to a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a mobile, wired or wireless network, a dedicated network or any combination of a virtual private network). In some embodiments, the data exchanged through the network is represented by technologies and / or formats including Hyper Text Mark-up Language (HTML), Extensible Markup Language (XML), etc. In addition, conventional encryption technologies such as Secure Socket Layer (SSL), Transport Layer Security (TLS), Virtual Private Network (VPN), Internet Protocol Security (IPsec) can also be used to encrypt all or some links. In other embodiments, customized and / or dedicated data communication technologies can also be used to replace or supplement the above-mentioned data communication technologies.

[0101] The one or more units are stored in the memory 1320, and when executed by the one or more processors 1310, perform a flexible large bandwidth splitting method in any of the above method embodiments. Figure 2 Steps S1 to S6 of the method are implemented Fig.12 The functions of modules 1210-1270 in.

[0102] The embodiment of the present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are executed by one or more processors, for example, Fig.13 The processor 1310 of the embodiment of the present invention may execute the elastic large bandwidth splitting method in the embodiment of the present invention, for example, executing the above-described Figure 2 Steps S1 to S6 of the method are implemented Fig.12 The functions of modules 1210-1270 in.

[0103] The embodiment of the present invention further provides a computer program product, the computer program product comprising a computer program stored on a computer-readable storage medium, the computer program comprising program instructions, when the program instructions are executed by a computer, for example, Fig.13 A processor 1310 in the embodiment of the present invention executes the above-described elastic large bandwidth splitting method. For example, the above-described Figure 2 Steps S1 to S6 of the method are implemented Fig.12 The functions of modules 1210-1270 in.

[0104] A program product for implementing the above method according to an embodiment of the present invention is described, 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 invention is not limited thereto, and 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.

[0105] 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.

[0106] 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.

[0107] 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.

[0108] Program code for performing the operations of the present invention 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).

[0109] Optionally, the client of the application installed in different devices 1300 is the same, or the client of the application installed on the two devices 1300 is the client of the same type of application on different control system platforms. Based on the different terminal platforms, the specific form of the client of the application can also be different, for example, the application client can be a mobile client, a PC client or a World Wide Web (Web) client.

[0110] Those skilled in the art will appreciate that the number of the above-mentioned devices 1300 may be more or less. For example, the above-mentioned terminal may be only one, or the above-mentioned terminals may be dozens or hundreds, or more. The embodiment of the present application does not limit the number of terminals and device types.

[0111] It should be noted that the above figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above 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.

[0112] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".

[0113] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation 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, including 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 implementation of the present disclosure.

[0114] It should be noted that, although several modules or units of the device for action execution 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. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0115] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0116] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This application is intended to cover any modification, use or adaptation of the present disclosure, which follows the general principles of the present disclosure and includes common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the appended claims.

Claims

1. A flexible large bandwidth splitting method, It is characterized in that include: Get the source and sink nodes; Traverse all end-to-end paths between source and destination nodes; Grouping all end-to-end paths between source and sink end nodes; Sort each grouping path within the group; Sort the groups after they are sorted within the group; The large bandwidth is split according to the order of the groups, and the elastic large bandwidth is split from large to small according to the weight ratio.

2. According to claim 1, a flexible large bandwidth splitting method, It is characterized in that The intra-group sorting of each grouping path comprises: Each grouped path is sorted within the group according to the maximum path bandwidth value of each end-to-end path.

3. The elastic large bandwidth splitting method according to claim 1, It is characterized in that The inter-group sorting of the groups after the intra-group sorting comprises: Pick the first path from each group, reassemble them into a new group, and sort them again.

4. The elastic large bandwidth splitting method according to claim 2, It is characterized in that When the maximum path bandwidth values ​​are the same, the paths are sorted according to the path hop count, with the path with the smaller path hop count being placed in front.

5. According to the elastic large bandwidth splitting method described in claim 3, before the groups sorted within the group are sorted between groups, it is necessary to remove the overlapping bandwidth of the first path of each group.

6. According to the elastic large bandwidth splitting method of claim 5, the overlapping bandwidth removal processing is performed on the first path of each packet. include: If there is overlapping bandwidth in the first path of the group, remove the overlapping bandwidth from the largest to the smallest and recalculate; If the first path of a group is no longer the optimal path in the group after removing the overlapping bandwidth, the group is reordered to select the optimal path to participate in the sorting between groups.

7. An elastic large bandwidth splitting device, It is characterized in that Includes the following modules: An acquisition module, used to acquire source and sink nodes; A traversal module, used to respond to a request from a source node to transmit data to a sink node, and traverse all end-to-end paths between the source and sink nodes; A grouping module, used for grouping all end-to-end paths between source and sink nodes; A sorting module is used to sort each grouping path within the group, and to sort the groups after the sorting within the group between groups; The splitting module is used to split the large bandwidth according to the order after the groups are sorted, and split the elastic large bandwidth from large to small according to the weight ratio.

8. The elastic large bandwidth splitting device according to claim 7, It is characterized in that The following modules may also be included: A storage module, used to store detection information and ancillary information of multi-source heterogeneous data; The control module is used to control the operation of the acquisition module, traversal module, grouping module, sorting module, splitting module and storage module.

9. A flexible large bandwidth splitting electronic device, It is characterized in that include: at least one processor and a memory for being communicatively coupled to the at least one processor; The memory stores commands executable by the at least one processor, and the commands are executed by the at least one processor so that the at least one processor can execute the elastic large bandwidth splitting method described in any one of claims 1 to 5.

10. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the computer program is executed by a processor, the elastic large bandwidth splitting method described in any one of claims 1 to 5 is implemented.