WO2016004647A1

WO2016004647A1 - Dynamic path adjustment method and apparatus for link congestion

Info

Publication number: WO2016004647A1
Application number: PCT/CN2014/082623
Authority: WO
Inventors: 熊文柱; 何英军
Original assignee: 北京东土科技股份有限公司
Priority date: 2014-07-09
Filing date: 2014-07-21
Publication date: 2016-01-14
Also published as: CN104202246A

Abstract

A dynamic path adjustment method and apparatus for link congestion. In the method, when a label edge router cannot allocate an LSP for a bandwidth requirement of a pre-application link of a data packet to be sent currently, the label edge router determines each LSP to a destination address according to the bandwidth requirement and the destination address; determine whether the sum of reserved bandwidths of all LSPs meets the bandwidth requirement; if yes, use the reserved bandwidth of each LSP to send the data packet to be sent; otherwise, add the bandwidth requirement of the pre-application link of the data packet to be sent to a waiting queue. Whether the current bandwidth requirement can be met is determined according to the sum of reserved bandwidths of all determined LSPs, that is, the reserved bandwidth of each LSP is used as the bandwidth for transmitting the data packet, so that the bandwidth resource is efficiently used, the transmission efficiency of the data packet is improved, and the real-time requirement of data packet transmission is met.

Description

Method and device for adjusting dynamic path when link is congested. The present application claims to be submitted to the Chinese Patent Office on July 09, 2014, the application number is 201410325939.5, and the invention is a dynamic path adjustment method and device when the link is congested. Priority of Chinese Patent Application, the entire contents of which is incorporated herein by reference. The present invention relates to the field of industrial Ethernet technologies, and in particular, to a dynamic path adjustment method and apparatus when a link is congested. BACKGROUND OF THE INVENTION Protocol Label Switching (MPLS) Traffic Engineering (TE) combines MPLS technology and traffic engineering to establish resource reservation by establishing a Label Switched Path (LSP) tunnel to a specified path, so that network traffic bypasses the congested node and reaches equilibrium. The purpose of network traffic.

FIG. 1 is a schematic diagram of multiple LSP concurrent dynamic path calculations in the prior art. In FIG. 1, PE-1 and PE-2 are referred to as label edge routers (LERs), and P-1, P-2, and P-3 are called For the Label Switch Router (LSR).

Currently, when a well-known path computation component dynamically calculates a path, if there are multiple LSP tunnels concurrently, the LSP tunnels are R2-R3-R5-R6 and R2-R3-R4-R5-R6, respectively. Suppose there are three pre-application links, and the requested bandwidth is 30M, 25M, 40M, respectively. 35M will make the sum of bandwidth requirements of R2 to R3 exceed 100M.

The maximum bandwidth between the network nodes in Figure 1 above is 100M, and the bandwidth allocation between nodes is as shown in Figure 2. The bandwidth between R1 and R3, between R2 and R3, and between R6 and R7 is 100M, between R3 and R4, R4 and R6. The bandwidth between R3 and R6 is 50M, and the bandwidth between R3 and R5 and R5 and R6 is 70M.

When the bandwidth requirement of a pre-requested link is 80 M, the bandwidth of any LSP link cannot meet the bandwidth requirement of the pre-applied link. As a result, the current network structure cannot meet the requirements of the link. SUMMARY OF THE INVENTION In view of the above problems, the present invention has been made in order to provide a dynamic path adjustment method and apparatus for link congestion when overcoming the above problems or at least partially solving the above problems.

The embodiment of the invention provides a dynamic path adjustment method when a link is congested, and the method includes:

The label edge router determines, according to the bandwidth requirement of the pre-requested link of the data packet to be sent, that the CSPF algorithm cannot allocate the LSP label switching path for the bandwidth requirement;

The label edge router determines to send to the bandwidth request and the destination address of the data to be sent. Each LSP of the destination address;

Determining whether the sum of the reserved bandwidth of each LSP satisfies the bandwidth requirement of the pre-applied link;

And sending, by each of the LSPs, the data to be sent, when the sum of the reserved bandwidth of each LSP meets the bandwidth requirement of the pre-applied link;

Otherwise, the bandwidth requirement of the pre-application link to be sent is added to the waiting queue.

In the embodiment of the present invention, in order to use the bandwidth of each LSP reasonably, the transmission of the important data packet is ensured, and the sending of the to-be-sent data message by using each LSP includes:

Allocating weights for each LSP according to the reserved bandwidth of each LSP;

Dividing the bandwidth requirement of the pre-applied link according to the assigned weight;

The data packet corresponding to the bandwidth divided by the bandwidth requirement is transmitted by using each LSP.

Determining, by using the reserved bandwidth of the minimum hop LSP, the LSP that contains the minimum number of hops in each LSP; and

The bandwidth requirements of the remaining data packets are divided according to the determined reserved bandwidth of each of the other LSPs, and the corresponding data packets are transmitted by using each of the other LSPs.

In order to ensure the real-time transmission of the data, the sending the data to be sent by using each of the LSPs includes: dividing the bandwidth requirement into equal parts, and first dividing the bandwidth requirement by two;

When there is no LSP matching the bandwidth requirement after each halving, the bandwidth requirement is equally divided into 4;

When present, the LSP is used to transmit a data packet corresponding to each bandwidth requirement after 4 equal divisions;

When there is no LSP that matches the bandwidth requirement of each of the four equal parts, the bandwidth requirement is equally divided into eight, wherein the bandwidth requirement is performed according to the value of the differential service code point in the to-be-sent data message. Equally divided.

In order to ensure the integrity of the data and the integrity of the data, the method further includes: adding a label to the data packet transmitted by each LSP, the label is used to indicate another label. The edge router assembles the data packet transmitted by each LSP.

The embodiment of the invention provides a dynamic path adjustment device when the link is congested, and the device includes:

a determining module, configured to determine, according to the bandwidth requirement of the pre-requested link of the data packet to be sent, that the CSPF algorithm cannot allocate an LSP label switching path for the bandwidth requirement; according to the bandwidth requirement and the to-be-sent datagram The destination address of the text, determining each LSP sent to the destination address;

a determining module, configured to determine whether the sum of the reserved bandwidth of each LSP meets the bandwidth requirement of the pre-applied link; and the sending module is configured to: when the determining module determines the sum of the reserved bandwidth of each LSP, the pre-application is satisfied When the bandwidth of the link is required, the data packet to be sent is sent by using each LSP; a path adjustment module, configured to: when the determining module determines that the reserved bandwidth of each LSP does not satisfy the bandwidth requirement of the pre-applied link, adding the bandwidth requirement of the pre-application link to be sent to the waiting In the queue.

In the embodiment of the present invention, in order to reasonably use the bandwidth of each LSP to ensure the transmission of important data packets, the sending module is specifically configured to allocate weights for each LSP according to the reserved bandwidth of each LSP. Dividing the bandwidth requirement of the pre-requested link according to the weight of the allocation; and transmitting, by each LSP, a data packet corresponding to the bandwidth after the bandwidth requirement is divided.

In the embodiment of the present invention, in order to properly use the bandwidth of each LSP to ensure the transmission of important data packets, the sending module is specifically configured to determine an LSP that includes the minimum number of hops in each LSP, and uses the included The minimum bandwidth of the LSP is used to transmit the data packet; and the bandwidth requirement of the remaining data packets is divided according to the determined reserved bandwidth of each of the other LSPs, and corresponding to each of the other LSP transmissions is used. The data is 4 essays.

In order to ensure real-time transmission of the data packet, the sending module is specifically configured to divide the bandwidth requirement into equal parts, and first divide the bandwidth requirement into two; when there is no LSP matching the bandwidth requirement of each of the two equal parts The bandwidth requirement is divided into four equal parts; when present, the LSP is used to transmit data packets corresponding to each bandwidth requirement after 4 equal divisions; when there is no LSP matching the bandwidth requirement after each 4 equal divisions The bandwidth requirement is equally divided into eight, wherein the bandwidth requirement is equally divided between the value of the differential service code point in the to-be-sent data message.

In order to ensure the integrity of the data packet after the transmission, the device further includes: a label adding module, configured to add a label to the data packet transmitted by each LSP, the label is used to indicate another A label edge router assembles the data packet transmitted by each LSP.

The embodiment of the present invention provides a method and a device for adjusting a dynamic path when a link is congested. In this method, when a label edge router cannot allocate an LSP for a bandwidth requirement of a pre-requested link of a data packet to be sent, according to its bandwidth Determining, by the LSP, the LSP of the destination address, determining whether the sum of the reserved bandwidth of each LSP satisfies the bandwidth requirement, and when it is satisfied, sending the to-be-sent data packet by using each LSP; otherwise, The bandwidth requirement of the pre-application link of the to-be-sent packet is added to the waiting queue. In the embodiment of the present invention, according to the determined sum of the reserved bandwidths of each LSP, it is determined whether the current bandwidth requirement can be met, that is, each LSP reserved bandwidth is used as the bandwidth for transmitting the data packet, specifically, the datagram is performed. When the text is transmitted, the bandwidth requirement of the data packet can be divided according to the need, thereby effectively utilizing the bandwidth resource, improving the transmission efficiency of the data packet, and satisfying the real-time requirement of the data packet transmission.

The above description is only an overview of the technical solutions of the present invention, and the technical means of the present invention can be more clearly understood, and can be implemented in accordance with the contents of the specification, and the above and other objects, features and advantages of the present invention can be more clearly understood. Specific embodiments of the invention are set forth below. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a schematic diagram of multiple LSP concurrent dynamic path calculations in the prior art; FIG. 2 is a schematic diagram of bandwidth allocation between network nodes in FIG. 1;

FIG. 3 is a schematic diagram of a dynamic path adjustment process when a link is congested according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of a dynamic path adjustment process when a link is congested according to Embodiment 1 of the present invention;

FIG. 5 is a schematic diagram of a dynamic path adjustment process when a link is congested according to Embodiment 2 of the present invention;

FIG. 6 is a schematic structural diagram of a dynamic path adjustment apparatus when a link is congested according to an embodiment of the present invention. detailed description

In order to effectively transmit data packets and meet the real-time requirements of the data packets, the embodiments of the present invention provide a dynamic path adjustment method and apparatus when the link is congested.

Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While the embodiments of the present invention have been shown in the drawings, it is understood that Rather, these embodiments are provided so that this disclosure will be more fully understood, and the scope of the disclosure can be fully disclosed to those skilled in the art.

The embodiments of the present invention will be described below with reference to the accompanying drawings.

FIG. 3 is a flowchart of a dynamic path adjustment when a link is congested according to an embodiment of the present invention, where the process includes the following steps:

S301: The label edge router determines, according to the bandwidth requirement of the pre-requested link of the data packet to be sent, that the label edge router allocates the LSP label switching path to the bandwidth requirement, and the label edge router according to the bandwidth requirement The destination address of the data packet is sent, and each LSP sent to the destination address is determined.

In the embodiment of the present invention, when the label edge router (LER) receives the bandwidth request of the pre-application link of the data packet to be sent, the CSPF algorithm allocates an LSP label switching path for the bandwidth requirement, and determines the pre-emption of each LSP. The dynamic path adjustment scheme provided by the embodiment of the present invention is used when the bandwidth of the pre-applied link is required to meet the bandwidth requirement of the pre-applied link.

S302: Determine whether the sum of the reserved bandwidth of each LSP meets the bandwidth requirement of the pre-applied link. When the determination result is yes, go to step S303; otherwise, go to step S304.

After each LSP is determined, the reserved bandwidth of each LSP is the minimum value of the remaining link bandwidth of each hop in the LSP, and the sum of the reserved bandwidth of each LSP is determined, and it is determined whether the sum of the reserved bandwidths is The bandwidth requirement is greater than the bandwidth of the pre-application link, that is, the data is transmitted through the sum of the reserved bandwidth of each LSP.

S303: Send the to-be-sent data packet by using each of the LSPs.

Specifically, when each LSP sends a data packet, the bandwidth requirement of the pre-applied link is divided according to the reserved bandwidth of each LSP, and is divided into multiple different sub-bandwidth requirements, and each LSP is transmitted. The data packet corresponding to the sub-bandwidth requirement can be used. When using each LSP to transmit data packets, all or part of the LSP may be used to transmit datagrams. Text.

For example, if the bandwidth requirement of the pre-application link is 80M, as shown in Figure 2, when the reserved bandwidth of each LSP is 50M, 50M, and 70M, the bandwidth requirement can be divided into 30M and 50M, and only two LSPs can be used for transmission. The data packet, or the bandwidth requirement is divided into 20M, 40M, 20M, and each LSP is used to transmit its data. Alternatively, the bandwidth requirement can be divided into four 20Μ, corresponding to each 20Μ transmission. When the data is 4, the corresponding LSP is implemented. In the embodiment of the present invention, the number of divided sub-bandwidth requirements is not limited, as long as the sum of the divided sub-bandwidth requirements is guaranteed to be the bandwidth requirement of the pre-applied link.

S304: Add a bandwidth requirement of the pre-application link to be sent to the waiting queue.

In the embodiment of the present invention, according to the determined sum of reserved bandwidths of each LSP, it is determined whether the current bandwidth requirement can be met, that is, each LSP reserved bandwidth is used as the bandwidth for transmitting the data, specifically for performing data. · When transmitting, the bandwidth requirement of the data packet can be divided according to the need, thereby effectively utilizing the bandwidth resource, improving the transmission efficiency of the data packet, and satisfying the real-time requirement of the data packet transmission.

In the embodiment of the present invention, after the current bandwidth requirement is divided into multiple sub-bandwidth requirements, the CSPF algorithm is used to determine whether there is an LSP matching the sub-bandwidth requirement for each sub-bandwidth requirement. For example, the current bandwidth requirement is 100M, and the bandwidth requirement is divided into 20Μ, 30Μ, and 50Μ. First, for the 20Μ sub-bandwidth requirement, the CSPF algorithm is used to determine whether there is an LSP matching the sub-bandwidth requirement. If yes, continue to target 30Μ. For the sub-bandwidth requirement, use the CSPF algorithm to determine whether there is an LSP that matches the sub-bandwidth requirement. If it does not exist, you need to add the bandwidth requirement of the pre-applied link to the waiting queue. If it exists, continue to be a 50M sub-band. The bandwidth requirement, the CSPF algorithm is used to determine whether there is an LSP matching the sub-bandwidth requirement, and if so, the data packet corresponding to each sub-bandwidth requirement is transmitted by using each determined LSP, and if not, the pre- The bandwidth requirement of the application link is added to the waiting queue.

The invention will now be described in detail by way of a specific embodiment.

As shown in Figure 2, PE-1 (R2) receives the bandwidth requirement of the pre-requested link of the data packet to be sent. The bandwidth requirement is 80M, and the data packet needs to be sent to PE-2 (R7). The PE1 determines each LSP to the destination address according to the destination address of the data packet, where the determined LSP includes: LSP1 (R2-R3-R6-R7), LSP2 (R2-R3-R4-R6) -R7) and LSP3 (R2-R3-R5-R6-R7), the reserved bandwidth of each LSP is 50M, 50M, and 70M, respectively, as the reserved bandwidth of each LSP cannot satisfy the data. The bandwidth requirement of the message, so the data cannot be transmitted using the solution in the prior art.

However, since the sum of the bandwidth reserved for each LSP (170M) is greater than the bandwidth requirement of the data, if the bandwidth is reserved according to each LSP, the bandwidth requirement is divided into multiple sub-bandwidth requirements, and the data packet can be real-time. The transmission goes out. For example, the bandwidth requirement may be divided into sub-bandwidth requirements of 50 Μ and 30 ,, that is, only two of LSP1, LSP2, and LSP3 need to be used to transmit data packets corresponding to the sub-bandwidth requirement. Alternatively, you can also divide the bandwidth requirement For the sub-bandwidth requirements of 30M, 20M, and 30M, LSP1, LSP2, and LSP3 are used to transmit data packets corresponding to the sub-bandwidth requirements.

FIG. 4 is a schematic diagram of a dynamic path adjustment process when a link is congested according to Embodiment 1 of the present invention, where the process includes the following steps:

S401: The label edge router determines, according to the bandwidth requirement of the pre-requested link of the data packet to be sent, that the label edge router allocates the LSP label switching path to the bandwidth requirement, and the label edge router according to the bandwidth requirement The destination address of the data packet is sent, and each LSP sent to the destination address is determined.

S402: Determine whether the sum of the reserved bandwidth of each LSP satisfies the bandwidth requirement of the pre-applied link. When the determination result is yes, go to step S403; otherwise, go to step S405.

S403: Determine an LSP that includes a minimum number of hops in each LSP, and transmit the data packet by using a reserved bandwidth of the LSP that includes the minimum hop count.

S404: The bandwidth requirement of the remaining data packets is divided according to the determined reserved bandwidth of each of the other LSPs, and the corresponding data packet is transmitted by using each of the other LSPs.

S405: Add the bandwidth requirement of the pre-application link to be sent to the waiting queue.

In the embodiment of the present invention, when it is determined that any of the LSPs cannot satisfy the bandwidth requirement of the data, in order to ensure real-time transmission of the data, the effective use of the network resources may be based on the determined pre-determination of each LSP. The sum of the bandwidth requirements is transmitted, and the data message is transmitted. In addition, in order to ensure that the data packet is transmitted at the fastest speed, the bandwidth requirement of the data packet is first divided according to the reserved bandwidth of the LSP containing the minimum number of hops, and a sub-bandwidth requirement and the minimum hopping are included after the partitioning. The reserved bandwidth of the LSP is the same, and the data packet corresponding to the sub-bandwidth requirement is transmitted by using the reserved bandwidth of the LSP with the minimum number of hops, and the remaining data is saved according to the reserved bandwidth of each of the other LSPs. The bandwidth requirements of the packets are divided, and the corresponding data packets are transmitted by each of the other LSPs.

As shown in Figure 2, PE-1 (R2) receives the bandwidth requirement of the pre-requested link of the data packet to be sent. The bandwidth requirement is 80Μ, and the data packet needs to be sent to ΡΕ-2 (R7). The PE1 determines each LSP to the destination address according to the destination address of the data packet, where the determined LSP includes: LSP1 (R2-R3-R6-R7), LSP2 (R2-R3-R4-R6) -R7) and LSP3 (R2-R3-R5-R6-R7), the reserved bandwidth of each LSP is 50Μ, 50Μ and 70Μ respectively as shown in Figure 2.

The LSP with the minimum number of hops is LSP1, and the reserved bandwidth of the LSP1 is 50Μ. Therefore, according to the bandwidth requirement of the data packet, the bandwidth requirement is divided into a 50-inch sub-bandwidth requirement, and the 50-sub-band bandwidth is transmitted by using LSP1. For the data packet corresponding to the demand, the bandwidth requirement of the remaining data packets is 30Μ. According to the reserved bandwidth of LSP2 and LPS3, only one of the LSPs may be used to transmit the remaining data packets, or the remaining data may be used. The bandwidth requirement of the packet is divided into two sub-bandwidth requirements of 10M and 20Μ, and the number corresponding to the two sub-bandwidth requirements is transmitted by using LSP2 and LPS3 respectively. According to the message.

In order to ensure that each data packet can be transmitted as soon as possible, in the embodiment of the present invention, each LSP is assigned a weight according to the number of hops included in each LSP and the reserved bandwidth of each LSP;

FIG. 5 is a flowchart of a dynamic path adjustment when a link is congested according to Embodiment 2 of the present invention, where the process includes the following steps:

S501: The label edge router determines, according to the bandwidth requirement of the pre-requested link of the data packet to be sent, that the label edge router allocates the LSP label switching path for the bandwidth requirement, and the label edge router according to the bandwidth requirement The destination address of the data packet is sent, and each LSP sent to the destination address is determined.

S502: Determine whether the sum of the reserved bandwidth of each LSP satisfies the bandwidth requirement of the pre-applied link. When the determination result is yes, proceed to step S503, otherwise, go to step S505.

S503: Assign a weight to each LSP according to the reserved bandwidth of each LSP.

S504: The bandwidth requirement of the pre-applied link is divided according to the weight of the allocated, and the data corresponding to the bandwidth that is divided by the bandwidth requirement is transmitted by each LSP.

S505: Add a bandwidth requirement of the pre-application link to be sent to the waiting queue.

Specifically, in the embodiment of the present invention, when it is determined that any of the LSPs cannot meet the bandwidth requirement of the data, in order to ensure real-time transmission of the data, the network resources can be effectively utilized, and each of the determined The sum of the reserved bandwidth requirements of the LSP, and the data packet is transmitted.

In addition, in order to ensure that each data packet can be transmitted as soon as possible, in the embodiment of the present invention, each LSP is assigned a weight according to the number of hops included in each LSP and the reserved bandwidth of each LSP. Specifically, when a weight is allocated to each LSP according to the hop count of the LSP and the reserved bandwidth of each LSP, when the LSP includes a small number of hops, the LSP is assigned a larger weight, when the LSP is When the reserved bandwidth is large, the LSP is assigned a larger weight. According to the allocated weight and the bandwidth requirement of the pre-application link, the bandwidth of the data transmitted by each LSP is determined, and the data packet corresponding to the bandwidth is transmitted by using the determined bandwidth.

As shown in Figure 2, LSP1 contains the fewest hops. LSP2 and LSP3 contain the same number of hops. The reserved bandwidth of LSP1 is 50Μ, the reserved bandwidth of LSP2 is 50Μ, and the reserved bandwidth of LSP3 is 70Μ. Therefore, it is allocated for LSP1. The weight can be 4, the weight assigned to LSP3 can also be 3, and the weight assigned to LSP2 can also be 2. According to the weight allocated for each LSP and the bandwidth requirement of the data packet, the bandwidth requirement is divided into multiple sub-bandwidth requirements, which are 40 Μ, 30 Μ, and 20 分别, respectively, and each LSP is used to transmit a datagram corresponding to each sub-bandwidth requirement. Text.

In the embodiment of the present invention, the bandwidth requirement of the pre-application link is allocated according to the DSCP value, and the DSCP value is A total of 64 values are calculated according to the channel strip divisible by 64, so 2, 4, and 8 can be used to equally divide the bandwidth requirement. Specifically, the dividing the bandwidth requirement into multiple sub-bandwidth requirements in the embodiment of the present invention includes:

Dividing the bandwidth requirements into equal parts, first dividing the bandwidth requirement by 2;

The above process of the present invention will now be described in conjunction with a specific embodiment.

The label edge router determines, according to the bandwidth requirement of the pre-requested link of the data packet to be sent, that the CSPF algorithm cannot allocate an LSP label switching path for the bandwidth requirement, and the bandwidth requirement is equally divided into two according to the CSPF algorithm. The available bandwidth of each LSP. If an LSP that satisfies the bandwidth requirement after the equalization can be found, the CSPF algorithm is used to determine the LSP.

Specifically, the label edge router maps the bandwidth requirement through the access control list (ACL) access control list rule according to the value of the differential service code point DSCP in the data packet corresponding to the bandwidth requirement, and determines the next value corresponding to the DSCP value. jump. DSCP uses 6bit, and the DSCP value ranges from 0 to 63. By typing the DSCP value, the terminal, such as the phone, Windows client, and server, can identify the traffic. ACL is a list of commands for routers and switch interfaces. It is used to control the incoming and outgoing packets of the port.

If the LSPs satisfying each sub-bandwidth requirement are respectively determined by halving the above-mentioned bandwidth requirements, if any of the LSPs that satisfy the sub-bandwidth requirement is not determined, the bandwidth requirement is equally divided into 4 times. Use the CSPF algorithm to find the available bandwidth and determine the LSP. If an LSP that satisfies the bandwidth requirement after the 4 equalization is found in each search, the CSPF algorithm is used to determine the LSP.

If the above-mentioned bandwidth requirement is divided into 4, and the LSP that satisfies each sub-bandwidth requirement is determined by 4 times, if any one of the LSPs that meet the sub-bandwidth requirement is not determined, the bandwidth requirement is equally divided into 8 points. The CSPF algorithm is used to find the available bandwidth and determine the LSP. If the LSP that satisfies the bandwidth requirement after the 8 equalization is found in each search, the CSPF algorithm is used to determine the LSP.

If the above-mentioned bandwidth requirement is equally divided into 8 and the LSPs satisfying each sub-bandwidth requirement are respectively determined through 8 times, if any one of the LSPs that satisfy the sub-bandwidth requirement is not determined, the pre-supplied The bandwidth requirement of the application link is added to the waiting queue.

In the embodiment of the present invention, because a plurality of LSPs are used to transmit data packets, in order to ensure that the transmitted data packets can be integrated into a complete packet, a label is added to each data packet transmitted by the LSP, and the label is used for Instructing another label edge router to assemble the data message transmitted by each of the LSPs. As shown in Figure 2, the bandwidth requirement of the pre-application link of the current data packet is 80M. According to the prior art, the CSPF algorithm cannot allocate an available path for the payment requirement.

First, the bandwidth requirements are equally divided. The two sub-bandwidth requirements are 40M. The CSPF algorithm is used to calculate the LSPs that meet the sub-bandwidth requirements. If both are successful, the CSPF calculates two LSPs. They are A and B respectively. The label edge router LER maps the data packets with the DSCP value of 0-31 to A, and the data packets with the DSCP value of 32-63 are mapped to B by applying ACL rules.

If the process of determining the LSP that satisfies each sub-bandwidth requirement fails, the bandwidth requirement is divided into 4, and the four sub-bandwidth requirements are 20M, and the CSPF algorithm is used to calculate the LSP, and if the LSP is satisfied, If successful, CSPF calculates 4 LSPs, which are A, B, C, and D. The LER maps the data packets with the DSCP value of 0-15 to the A. The data packets with the DSCP value of 16-31 are applied to the B. The ACL rules are applied to the data packets with the DSCP value of 32-47. To C, the data packet with the DSCP value of 48-63 is mapped to D by applying an ACL rule.

If the process of determining the LSP that satisfies each sub-bandwidth requirement fails, the bandwidth requirement is equally divided into eight, and the eight sub-bandwidth requirements are 10 M, and the CSPF algorithm is used to calculate the LSPs that satisfy the sub-bandwidth requirement. If successful, CSPF calculates 4 LSPs, which are A, B, C, D, E, F, G, and H. The LER applies the ACL rule to the data packet with the DSCP value of 0-7, and applies the ACL rule to the data packet with the DSCP value of 8-15. The ACL rule mapping is applied to the data packet with the DSCP value of 16-23. In C, the ACL rule is applied to the data packet with the DSCP value of 24-31, and the ACL rule is applied to the data packet with the DSCP value of 32-39. The ACL rule is applied to the data packet with the DSCP value of 40-47. Mapped to F, the data packets with the DSCP value of 48-55 are mapped to G by ACL rules, and the data packets with the DSCP value of 56-63 are mapped to H by applying ACL rules.

If the process of determining the LSP satisfying each sub-bandwidth requirement fails, the bandwidth requirement of the pre-application link to be sent is added to the waiting queue.

MPLS includes: an information distribution component, a path computation component, a signaling component, and a traffic forwarding component. The information publishing component mainly uses the extended development shortest path first (OSPE-TE) to notify and acquire the network topology state information, and forms a link state database (LSDB) and a traffic engineering database (TEDB), wherein The LSDB is used for traditional Shortest Path First (SPF) calculations, and TEDB is used for routing calculations when establishing TE tunnels. OSPF-TE extends the support of the Type 10 link state advertisement based on the common OSPF, that is, the OPAQUE-LSA. The LSA can represent attributes such as the maximum link bandwidth, the maximum reserved link bandwidth, and the current reserved bandwidth. , thereby forming a corresponding TEDB.

The Label Edge Router (LER) calculates the in-home path of each LSP using the Constraint-Based Shortest Path First (CSPF) according to the information distribution component.

Currently, the industry mainly uses the Resource Reservation Protocol (RSVP-TE). Its main function is to establish LSPs based on path calculation parameters, reserve resources, and distribute labels. After the signaling component successfully establishes the LSP, the traffic forwarding component uses MPLS to perform data exchange and forwarding processing on the data packet.

Specifically, for the sub-bandwidth requirement, when the CSPF algorithm is used to find the LSP of the available bandwidth, the following takes the equalized bandwidth requirement as an example: The CSPF sub-task first creates a message queue for receiving the TE sub-task notification message. . The destination address and sub-bandwidth requirement of the two LSPs on the ingress LER are known to be 40M.

The TE sub-task starts the timer and periodically notifies the CSPF subtask. According to the input parameters: destination address and sub-bandwidth requirement, an optimal path is calculated. The timer is cancelled until it succeeds. Because the number is determined twice, the TE needs to start the secondary timer and calculate two corresponding optimal paths LSPA and LSPB.

Based on the above input parameter information and the locally saved LSDB and TEDB, the CSPF calculates an optimal LSPA: R3--R6, and updates the corresponding TEDB information in the process. If the calculation fails, the TEDB information is rolled back. In addition, OSPF can only modify the OPAQUE-LSA generated by itself and update and forward the OPAQUE-LSA generated by other devices. Therefore, you can modify the local TEDB of PE-1 or PE-2.

When the CSPF calculates the LSPB, the reserved bandwidth of the 70M bandwidth of the R5 is 30M. Therefore, the remaining 30M interface bandwidth of the R5 cannot meet the requirements, so their optimal paths are: R3-R4 - R6. Similar to the above steps, update the TEDB information. If the calculation fails, the TEDB information is rolled back. The TE subtask passes the established path and related information returned by the CSPF subtask to the RSVP subtask, and RSVP completes the real resource reservation.

FIG. 6 is a schematic structural diagram of a dynamic path adjustment apparatus when a link is congested according to an embodiment of the present disclosure, where the apparatus includes:

The determining module 61 is configured to determine, according to the bandwidth requirement of the pre-requested link of the data packet to be sent, that the CSPF algorithm cannot allocate an LSP label switching path for the bandwidth requirement, according to the bandwidth requirement and the to-be-sent data 4, the destination address of the text, determining each LSP sent to the destination address;

The determining module 62 is configured to determine whether the sum of the reserved bandwidth of each LSP meets the bandwidth requirement of the pre-applied link, and the sending module 63 is configured to: when the determining module determines that the sum of the reserved bandwidth of each LSP meets the When the bandwidth requirement of the link is requested, the data packet to be sent is sent by using each LSP;

The path adjustment module 64 is configured to: when the determining module determines that the bandwidth of the reserved bandwidth of each LSP does not meet the bandwidth requirement of the pre-applied link, add the bandwidth requirement of the pre-application link to be sent to the Waiting in the queue.

The sending module 63 is specifically configured to allocate weights to each of the LSPs according to the reserved bandwidth of each LSP; and divide bandwidth requirements of the pre-applied links according to the allocated weights; The LSP transmits the data packet corresponding to the bandwidth after the bandwidth requirement is divided.

The sending module 63 is specifically configured to determine an LSP that includes a minimum number of hops in each LSP, and use the reserved bandwidth that includes the minimum hop LSP to transmit the data packet; and according to the determined each other Reserved bandwidth of the LSP, will remain The data needs to be divided into the bandwidth requirements of the data, and the corresponding data is transmitted by each of the other LSPs. The sending module 63 is specifically configured to divide the bandwidth requirement into two equal parts, and first divide the bandwidth requirement into two parts. When there is no LSP matching the bandwidth requirement of each of the two equal parts, the bandwidth requirement is equally divided into four. When present, the LSP is used to transmit data packets corresponding to each bandwidth requirement after 4 equal divisions; when there is no LSP matching the bandwidth requirement after each 4 equal divisions, the bandwidth requirement is equally divided into 8 The bandwidth requirement is equally divided according to the value of the differential service code point in the data to be transmitted.

The device also includes:

The label adding module 65 is configured to add a label to the data packet transmitted by each LSP, where the label is used to indicate that another label edge router assembles the data packet transmitted by each LSP.

The algorithms and displays provided herein are not inherently related to any particular computer, virtual system, or other device. Various general-purpose systems can also be used with the teaching based on the teachings herein. According to the above description, the structure required to construct such a system is obvious. Moreover, the invention is not directed to any particular programming language. It is to be understood that the present invention may be embodied in a variety of programming language, and the description of the specific language has been described above in order to disclose the preferred embodiments of the invention.

Numerous specific details are set forth in the description provided herein. However, it is understood that the embodiments of the invention may be practiced without these specific details. In some instances, well known methods, structures, and techniques have not been shown in detail so as not to obscure the description.

Similarly, it is to be understood that in the above description of the exemplary embodiments of the present invention, the various features of the present invention are sometimes grouped together into a single embodiment. , diagram, or description of it. However, the method disclosed is not to be interpreted as reflecting the intention that the claimed invention requires more features than those recited in the claims. Rather, as the following claims reflect, inventive aspects reside in less than all features of the single embodiments disclosed herein. Therefore, the claims following the specific embodiments are hereby explicitly incorporated into the embodiments, each of which A separate embodiment of the invention.

Those skilled in the art will appreciate that the modules in the devices of the embodiments can be adaptively changed and placed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and further they may be divided into a plurality of sub-modules or sub-units or sub-components. In addition to such features and/or at least some of the processes or units being mutually exclusive, any combination of the features disclosed in the specification, including the accompanying claims, the abstract and the drawings, and any methods so disclosed may be employed. Or combine all the processes or units of the device. Each feature disclosed in the specification (including the accompanying claims, the abstract and the drawings) may be replaced by alternative features that provide the same, equivalent or similar purpose.

In addition, those skilled in the art will appreciate that, although some embodiments described herein include certain features that are not included in other embodiments, and other features, combinations of features of different embodiments are intended to be within the scope of the present invention. Different embodiments are formed and formed. For example, in the following claims, any one of the claimed embodiments can be used in any combination.

The various component embodiments of the present invention may be implemented in hardware, or in a software module running on one or more processors, or in a combination thereof. It should be understood by those skilled in the art that a microprocessor or a digital signal processor (DSP) can be used in practice to implement dynamic path adjustment devices, some of the terminal devices and systems when the link is congested according to an embodiment of the present invention. Or some or all of the features of all components. The invention can also be implemented as a device or device program (e.g., a computer program and a computer program product) for performing some or all of the methods described herein. Such a program implementing the present invention may be stored on a computer readable shield or may have the form of one or more signals. Such signals may be downloaded from an Internet website, provided on a carrier signal, or provided in any other form.

It is to be noted that the above-described embodiments are illustrative of the present invention and are not intended to limit the scope of the invention, and those skilled in the art can devise alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as a limitation. The word "comprising" does not exclude the presence of elements or steps that are not listed in the claims. The word "a" or "an" preceding a component does not exclude the presence of a plurality of such elements. The invention can be implemented by means of hardware comprising thousands of different elements and by means of a suitably programmed computer. In the unit claims enumerating the thousands of devices, thousands of these devices may be embodied by the same hardware item. The use of the words first, second, and third does not indicate any order. These words can be interpreted as names.

It is apparent that those skilled in the art can make various modifications and variations to the invention without departing from the spirit and scope of the invention. Thus, it is intended that the present invention cover the modifications and the modifications

Claims

Rights request

A method for adjusting a dynamic path when a link is congested, characterized in that the method comprises:

Determining, by the label edge router, each LSP sent to the destination address according to the bandwidth requirement and the destination address of the to-be-sent data;

2. The method according to claim 1, wherein the transmitting the data message to be sent by using each of the LSPs comprises:

The bandwidth requirement of the pre-applied link is divided according to the weight of the allocation, and each LSP is used to transmit the data packet corresponding to the bandwidth after the bandwidth requirement.

The method of claim 1, wherein the sending the data message to be sent by using each of the LSPs includes:

The method of claim 1, wherein the sending, by the each LSP, the to-be-sent data message comprises:

The method according to any one of claims 1 to 4, wherein the method further comprises: A label is added to the data packet transmitted by each LSP, and the label is used to instruct another label edge router to assemble the data packet transmitted by each LSP.

6. A dynamic path adjustment apparatus when a link is congested, wherein the apparatus comprises:

a determining module, configured to determine whether the sum of the reserved bandwidth of each LSP meets the bandwidth requirement of the pre-applied link; and the sending module is configured to: when the determining module determines the sum of the reserved bandwidth of each LSP, the pre-application is satisfied When the bandwidth of the link is required, the data packet to be sent is sent by using each LSP;

a path adjustment module, configured to: when the determining module determines that the reserved bandwidth of each LSP does not satisfy the bandwidth requirement of the pre-applied link, adding the bandwidth requirement of the pre-application link to be sent to the waiting In the queue.

The device according to claim 6, wherein the sending module is configured to allocate weights to each of the LSPs according to the reserved bandwidth of each LSP; The bandwidth requirement of the pre-application link is divided; the data corresponding to the bandwidth after the bandwidth requirement is transmitted by each LSP.

The device according to claim 6, wherein the sending module is specifically configured to determine an LSP that includes a minimum number of hops in each LSP, and use the reserved bandwidth that includes the minimum hop LSP Transmitting the data packet; and dividing the bandwidth requirement of the remaining data packet according to the determined reserved bandwidth of each of the other LSPs, and transmitting the corresponding data packet by using each of the other LSPs.

The device of claim 6, wherein the sending module is specifically configured to divide the bandwidth requirement into equal parts, first dividing the bandwidth requirement by 2; when there is no equalization with each 2 When the bandwidth requirement matches the LSP, the bandwidth requirement is equally divided into 4; when it exists, the data corresponding to each bandwidth requirement after the LSP is transmitted by 4 is divided into 4; when there is no equalization with each 4; When the bandwidth requirement matches the LSP, the bandwidth requirement is equally divided into eight, wherein the bandwidth requirement is equally divided according to the value of the differential service code point in the to-be-sent data message.

The device according to any one of claims 6 to 9, wherein the device further comprises: a label adding module, configured to add a label to the data packet transmitted by each LSP, the label is used to indicate Another label edge router assembles the data message transmitted by each LSP.