CN110267310B

CN110267310B - Link capacity adjusting method, device, system, controller and network node

Info

Publication number: CN110267310B
Application number: CN201810202001.2A
Authority: CN
Inventors: 张思栋; 占治国; 王强
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2018-03-12
Filing date: 2018-03-12
Publication date: 2022-04-22
Anticipated expiration: 2038-03-12
Also published as: WO2019174424A1; CN110267310A

Abstract

The invention discloses a method, a device, a system, a controller, a network node and a storage medium for adjusting link capacity, wherein the method comprises the following steps: determining an adjustment path corresponding to a link based on a traffic flow direction on the link, wherein the adjustment path represents an adjustment sequence of each node in the link; determining an adjustment strategy corresponding to the link based on the original capacity of the link and the target capacity to be adjusted; sending the adjustment path corresponding to the link and the adjustment strategy to each node in the link; and sending an adjustment notification message to a head node to trigger each node in the link to perform capacity adjustment based on the adjustment path and the adjustment strategy, wherein the head node is determined based on the adjustment path.

Description

Link capacity adjusting method, device, system, controller and network node

Technical Field

The present invention relates to the field of wireless communications, and in particular, to a method, an apparatus, a system, a controller, a network node, and a storage medium for adjusting an end-to-end link capacity in a Flexible Ethernet (FlexE) network.

Background

The FlexE technology is developed by the international organization for standardization Optical Internet Forum (OIF) in 3 months 2015, and formally shows through related technical documents in 3 months 2016. FlexE technology provides a generic mechanism to deliver a range of services at different Media Access Control (MAC) rates, such as: the method can transmit the service with a larger MAC rate, and also can transmit a plurality of services with a smaller MAC rate, and the transmitted service is not limited to the service with a single MAC rate.

The structural differences between FlexE and conventional ethernet are: the Flexe adds a Shim (Flexe Shim) between the MAC layer and the Physical Coding Sublayer (PCS), the function of the Shim is to construct a Calendar (Calendar) with the size of 20 x n 66b blocks, n is the number of bound Ethernet Physical interfaces (PHYs), and each 66b block represents a 5G time slot. On the multiplexing side, services with different MAC rates are loaded into 66b blocks with corresponding number according to the multiple relation with 5G. Each 20 66b blocks form a sub-table (sub-calenar), and the calenar with the size of 20 multiplied by n 66b blocks is distributed into n sub-calenar. For each sub-call, adding an overhead of 66b block every 20 × 1023 66b blocks, also called an overhead block, the overhead block is used to store the relevant mapping relations, such as the mapping relations between client traffic and time slots, wherein each sub-call is transmitted in a single 100G ethernet PHY. And at the demultiplexing side, n sub-callendars form a 20 Xn callendar with 66b blocks, and corresponding client services are extracted from the 66b blocks in the corresponding number according to the mapping relation stored in the overhead block.

Fig. 1 is a schematic diagram of an overhead field, and as shown in fig. 1, an overhead field includes 8 overhead blocks, each overhead block is 66b, and each overhead block is transmitted after a group of 20 × 1023 66b blocks, and one overhead block is transmitted, so that 8 times of transmission are required before an overhead field can be transmitted. In addition, because the two fields, Client terminal a and Client terminal B, represent two types of timeslot configurations of the Calendar, only one timeslot configuration can be implemented when transmitting one overhead field, and if the configuration of all timeslots is transmitted, the overhead fields with the number greater than or equal to that of the timeslots, such as 32 overhead fields, need to be transmitted.

As shown in fig. 1, which Calendar (Client Calendar a or Client Calendar B) is currently used is identified by the field C. The C field appears three times in the overhead field, each time the C field is 1bit, and the value of the C field is only 0 or 1. In general, during a Flexe frame (containing 8 overhead blocks), the C fields should all be the same; however, if there is an abnormal condition, for example, the C field takes 0 twice and 1 once, the value of the C field needs to be determined by means of most decisions. The C field with the value of 0 represents that the Client terminal A is used currently, and the C field with the value of 1 represents that the Client terminal B is used currently. Different Client calenar represent using different slot configurations (i.e., capacities).

If FlexE needs to perform a CALENDAR switch (i.e. capacity adjustment), for example, a current Client Calendar A is switched to a Client Calendar B, then the local node and the remote node perform an interactive negotiation through two fields of CR and CA in the overhead field. Here, CR denotes a Calendar switch Request (Calendar switch Request), and CA denotes a Calendar switch acknowledgement (Calendar switch Acknowledge). The node sets the CR value in the overhead field to 1, and after the remote node receives the CR value and completes corresponding preparation, the node sets the CA value in the Flexe overhead to 1. After the node receives the confirmation of the CA, the value of the C field is set to be 1 in the overhead field of the next Flexe frame, which indicates that the time slot configuration of the Client Calendar B is formally started to be used.

There is no problem with the above method if only a callback handover of two nodes is involved in the network. However, if the CALENDAR handover of multiple nodes is involved in the network, the data integrity will be affected by the handover sequence and handover mechanism of the nodes, and in severe cases, data packet loss, increased delay and increased jitter will be caused.

Disclosure of Invention

In order to solve the foregoing technical problems, embodiments of the present invention provide a method, an apparatus, a system, a controller, a network node, and a storage medium for adjusting link capacity.

The link capacity adjusting method provided by the embodiment of the invention comprises the following steps:

determining an adjustment path corresponding to a link based on a traffic flow direction on the link, wherein the adjustment path represents an adjustment sequence of each node in the link;

determining an adjustment strategy corresponding to the link based on the original capacity of the link and the target capacity to be adjusted;

sending the adjustment path corresponding to the link and the adjustment strategy to each node in the link;

and sending an adjustment notification message to a head node to trigger each node in the link to perform capacity adjustment based on the adjustment path and the adjustment strategy, wherein the head node is determined based on the adjustment path.

In this embodiment of the present invention, the determining an adjustment policy corresponding to the link based on the original capacity of the link and the target capacity to be adjusted includes:

if the original capacity is smaller than the target capacity, determining that the adjustment strategy corresponding to the link is a capacity increasing strategy;

and if the original capacity is larger than the target capacity, determining that the adjustment strategy corresponding to the link is a capacity reduction strategy.

In this embodiment of the present invention, if the adjustment policy is a capacity increase policy, the method further includes:

acquiring the residual capacity of each node in the link;

judging whether the residual capacity of each node in the link is larger than or equal to the difference value between the target capacity and the original capacity;

if the residual capacity of each node in the link is greater than or equal to the difference value between the target capacity and the original capacity, executing the step of sending an adjustment notification message to the head node;

and if the residual capacity of each node in the link is smaller than the difference value between the target capacity and the original capacity, not executing the adjustment operation.

In this embodiment of the present invention, the capacity increasing policy is used to instruct each node in the link to perform the following operations:

if receiving the adjustment notification message, sending a schedule switching request (CR) message to a next hop node;

if the CR message is received, judging whether the target node is a tail node or not; if the target node is not the tail node, recording a CR message non-reply state mark, and sending the CR message to the next hop node; if the target node is a tail node, replying a schedule switching confirmation CA message to the previous hop node;

if the CA message is received, judging whether the target node is the first node; if the target node is not the head node, sending a capacity adjustment effective instruction to the next hop node, replying a CA message to the previous hop node and canceling a CR message non-reply state mark; if the target node is the first node, sending a capacity adjustment effective instruction to the next hop node;

and determining the next hop node and the previous hop node based on the corresponding adjustment paths of the links.

In this embodiment of the present invention, the capacity reduction policy is used to instruct each node in the link to perform the following operations:

if receiving the adjustment notification message, sending a CR message to a next hop node;

if receiving the CR message, sending a CA message to the previous hop node, and judging whether the target node is a tail node; if the target node is not the tail node, sending a CR message to a next hop node;

if the CA message is received, sending a capacity adjustment effective instruction to the next hop node;

acquiring adjustment information, wherein the adjustment information comprises an adjustment path and an adjustment strategy corresponding to a link;

and carrying out capacity adjustment on the target node based on the adjustment path corresponding to the link and the adjustment strategy.

In the embodiment of the invention, the adjusting strategy is a capacity increasing strategy;

the adjusting the capacity of the target node based on the adjustment path corresponding to the link and the adjustment policy includes:

if the CR message is received, judging whether the target node is a tail node or not; if the target node is not the tail node, recording a CR message non-reply state mark, and sending the CR message to the next hop node; if the target node is the tail node, replying the CA message to the previous hop node;

In the embodiment of the present invention, the method further includes:

and if the CA message is received and the target node is the first node, sending a capacity adjustment effective instruction to the next hop node, and then sending an adjustment success message to the controller.

In the embodiment of the invention, the adjusting strategy is a capacity reducing strategy;

In the embodiment of the present invention, the method further includes:

and if the capacity adjustment effective instruction is received and the target node is the tail node, sending an adjustment success message to the controller.

In the embodiment of the present invention, the method further includes:

and if the target node is not the first node and not the tail node, performing data cross processing on the service data of the receiving side and the service data of the transmitting side of the target node.

In the embodiment of the present invention, the method further includes:

and if the target node is successfully adjusted in the one-way capacity and the upstream capacity bandwidth and the downstream capacity bandwidth are inconsistent, performing rate matching processing on the service data of the receiving side and the service data of the transmitting side when performing data cross processing on the service data of the receiving side and the service data of the transmitting side.

In this embodiment of the present invention, the performing rate matching processing on the service data of the receiving side and the service data of the transmitting side includes:

and adjusting the rate of the service data of the receiving side to be consistent with the rate of the service data of the sending side, wherein the rate of the service data of the receiving side is smaller than the rate of the service data of the sending side.

In this embodiment of the present invention, the adjusting the rate of the service data at the receiving side to be consistent with the rate of the service data at the sending side includes:

for a data packet of the service data of the receiving side, inserting an idle block in the data packet to enable the rate of the service data of the receiving side to be matched with the rate of the service data of the transmitting side; alternatively, the first and second electrodes may be,

and for the data packet of the service data of the receiving side, inserting an idle block between adjacent data packets so as to enable the rate of the service data of the receiving side to be adapted to the rate of the service data of the transmitting side.

The link capacity adjusting device provided by the embodiment of the invention comprises:

a first determining unit, configured to determine, based on a traffic flow direction on a link, an adjustment path corresponding to the link, where the adjustment path indicates an adjustment order of each node in the link;

a second determining unit, configured to determine an adjustment policy corresponding to the link based on an original capacity of the link and a target capacity to be adjusted;

a sending unit, configured to send the adjustment path corresponding to the link and the adjustment policy to each node in the link;

a triggering unit, configured to send an adjustment notification message to a head node to trigger each node in the link to perform capacity adjustment based on the adjustment path and the adjustment policy, where the head node is determined based on the adjustment path.

In this embodiment of the present invention, the second determining unit is configured to determine, if the original capacity is smaller than the target capacity, that the adjustment policy corresponding to the link is a capacity increasing policy; and if the original capacity is larger than the target capacity, determining that the adjustment strategy corresponding to the link is a capacity reduction strategy.

In the embodiment of the present invention, the apparatus further includes:

an obtaining unit, configured to obtain a remaining capacity of each node in the link;

a judging unit, configured to judge whether a remaining capacity of each node in the link is greater than or equal to a difference between the target capacity and the original capacity;

the triggering unit is configured to execute the step of sending an adjustment notification message to the head node if the remaining capacity of each node in the link is greater than or equal to the difference between the target capacity and the original capacity;

the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring adjustment information which comprises an adjustment path and an adjustment strategy corresponding to a link;

and the adjusting unit is used for adjusting the capacity of the target node based on the adjusting path corresponding to the link and the adjusting strategy.

the adjusting unit is configured to: if receiving the adjustment notification message, sending a CR message to a next hop node;

In the embodiment of the present invention, the apparatus further includes:

and the notification unit is used for sending a successful adjustment message to the controller after the adjustment unit sends a capacity adjustment effective instruction to the next hop node if the adjustment unit receives the CA message and the target node is the first node.

In the embodiment of the present invention, the apparatus further includes:

and the notification unit is used for sending a successful adjustment message to the controller if the adjustment unit receives the capacity adjustment effective instruction and the target node is the tail node.

In the embodiment of the present invention, the apparatus further includes:

and the cross processing unit is used for performing data cross processing on the service data of the receiving side and the service data of the transmitting side of the target node if the target node is not the first node and not the tail node.

In this embodiment of the present invention, the cross processing unit is further configured to, if the target node is successfully adjusted in the unidirectional capacity and there is inconsistency between the upstream capacity bandwidth and the downstream capacity bandwidth, perform rate matching processing on the service data of the receiving side and the service data of the transmitting side when performing data cross processing on the service data of the receiving side and the service data of the transmitting side.

In this embodiment of the present invention, the cross processing unit is configured to adjust a rate of the service data of the receiving side to be consistent with a rate of the service data of the sending side, where the rate of the service data of the receiving side is smaller than the rate of the service data of the sending side.

In this embodiment of the present invention, the cross processing unit is configured to insert an idle block into a data packet of the service data at the receiving side, so that a rate of the service data at the receiving side is adapted to a rate of the service data at the transmitting side; or, for the data packet of the service data of the receiving side, inserting an idle block between adjacent data packets, so that the rate of the service data of the receiving side is adapted to the rate of the service data of the transmitting side.

The controller provided by the embodiment of the invention comprises the link capacity adjusting device.

The network node provided by the embodiment of the invention comprises the link capacity adjusting device.

The link capacity adjusting system provided by the embodiment of the invention comprises the controller and at least two network nodes, wherein,

the controller is connected with each network node, and a data channel is established between each network node according to the service flow direction.

The storage medium provided by the embodiment of the present invention stores thereon a computer program, and the computer program, when executed by a processor, implements the steps in the above-mentioned link capacity adjustment method.

In the technical scheme of the embodiment of the invention, based on the service flow direction on a link, an adjustment path corresponding to the link is determined, wherein the adjustment path represents the adjustment sequence of each node in the link; determining an adjustment strategy corresponding to the link based on the original capacity of the link and the target capacity to be adjusted; sending the adjustment path corresponding to the link and the adjustment strategy to each node in the link; and sending an adjustment notification message to a head node to trigger each node in the link to perform capacity adjustment based on the adjustment path and the adjustment strategy, wherein the head node is determined based on the adjustment path. By adopting the technical scheme of the embodiment of the invention, each node in the link is controlled by the controller, and an optimal adjustment strategy and an optimal adjustment sequence are provided according to the original capacity of the link, the target capacity to be adjusted and the service flow direction, so that a rapid, low-delay, low-cost and lossless link capacity adjustment (namely, CALENDAR switching) scheme is realized among a plurality of nodes.

Drawings

The drawings illustrate generally, by way of example, but not by way of limitation, various embodiments discussed herein.

FIG. 1 is a diagram of a Flexe overhead field;

fig. 2 is a first flowchart illustrating a link capacity adjustment method according to an embodiment of the present invention;

fig. 3 is a second flowchart illustrating a link capacity adjustment method according to an embodiment of the present invention;

fig. 4 is a third flowchart illustrating a link capacity adjustment method according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of a rate matching based insertion of an idle block;

FIG. 6 is a flow chart illustrating a link capacity increase according to an embodiment of the present invention;

FIG. 7 is a flow chart illustrating link capacity reduction according to an embodiment of the present invention;

FIG. 8 illustrates the success of increasing timeslots according to an embodiment of the present invention;

FIG. 9 is a first diagram illustrating an increase timeslot failure according to an embodiment of the present invention;

FIG. 10 is a second diagram illustrating an increase timeslot failure according to an embodiment of the present invention;

FIG. 11 is a diagram illustrating the success of deleting a slot according to an embodiment of the present invention;

FIG. 12 is a diagram illustrating a failed deletion of a timeslot according to an embodiment of the present invention;

FIG. 13 illustrates two ways of rate matching according to an embodiment of the present invention;

fig. 14 is a first schematic structural diagram of a link capacity adjustment apparatus according to an embodiment of the present invention;

fig. 15 is a schematic structural diagram of a link capacity adjustment apparatus according to an embodiment of the present invention;

fig. 16 is a schematic structural diagram of a link capacity adjustment system according to an embodiment of the present invention.

Detailed Description

So that the manner in which the features and aspects of the embodiments of the present invention can be understood in detail, a more particular description of the embodiments of the invention, briefly summarized above, may be had by reference to the embodiments, some of which are illustrated in the appended drawings.

The technical scheme of the embodiment of the invention is applied to a Flexe end-to-end link, and the capacity adjustment (namely, the CALENDAR switching) of each node in the end-to-end link is realized through the controller, so that the link capacity adjustment without service loss is realized.

Fig. 2 is a first schematic flow chart of a link capacity adjustment method according to an embodiment of the present invention, where the present embodiment is applied to a controller, and as shown in fig. 2, the link capacity adjustment method includes the following steps:

step 201: and determining an adjustment path corresponding to the link based on the traffic flow direction on the link, wherein the adjustment path represents the adjustment sequence of each node in the link.

In an embodiment of the invention, the network provides a controller for deciding how to perform link capacity adjustment. The controller can be an independent controller or can be integrated into a network management functional component. The controller manages all network nodes (also referred to as nodes for short), and senses the state of each node in real time, such as the capacity usage (used capacity, free capacity) of each node, the port number of each node, and the like. When the link capacity needs to be adjusted, all affected nodes are calculated according to the requirements of the current link adjustment, and then an adjustment sequence and an adjustment strategy which can meet the condition of service lossless are provided.

In one embodiment, the controller obtains a link capacity adjustment instruction for instructing to adjust an original capacity of the link to a target capacity. Here, the original capacity is the current capacity of the link, and the target capacity is the capacity to which the link needs to be adjusted.

In the embodiment of the present invention, the capacity of the link refers to a bandwidth of the link, and in an embodiment, the capacity of the link is a time slot of the link. It should be understood that in the case of a stable link, the bandwidth on the same link is the same. For example: node 1, node 2, node 3 are on the same link, then node 1, node 2, node 3, corresponding to the bandwidth, i.e. capacity, on that link is the same. For example, the slots used between the nodes are corresponding, for example, the transmitting side of the node 1 uses

slots

1 and 2, the receiving side of the node 2 also uses

slots

1 and 2, the transmitting side of the node 2 uses

slots

5 and 6, the receiving side of the node 3 also uses

slots

5 and 6, and the capacities of the node 1, the node 2, and the node 3 on the link are all 2 slots no matter which slot is used. It is worth noting that, because the same node uses different slots on the transmitting side and the receiving side, data cross processing needs to be performed on data on the transmitting side and data on the receiving side, for example, with node 2, slot1 and slot2 on the receiving side of node 2 need to be mapped to slot5 and slot6 on the transmitting side.

In the embodiment of the invention, the adjustment path corresponding to the link is determined based on the traffic flow direction on the link. For example, the link includes the following nodes: the service flow direction of the node 1, the node 2, the node 3, the node 4 and the node 5 is as follows: node 4 → node 1 → node 3 → node 2 → node 5, then the adjustment order is also: node 4 → node 1 → node 3 → node 2 → node 5.

Step 202: and determining an adjustment strategy corresponding to the link based on the original capacity of the link and the target capacity to be adjusted.

In the embodiment of the invention, if the original capacity is smaller than the target capacity, the adjustment strategy corresponding to the link is determined to be a capacity increasing strategy; and if the original capacity is larger than the target capacity, determining that the adjustment strategy corresponding to the link is a capacity reduction strategy.

For example: and adjusting the capacity of the link from 5 slots to 4 slots, wherein the corresponding adjustment strategy is a capacity reduction strategy. For another example: and adjusting the capacity of the link from 4 slots to 5 slots, wherein the corresponding adjustment strategy is a capacity increasing strategy.

Step 203: and sending the adjustment path corresponding to the link and the adjustment strategy to each node in the link.

In the embodiment of the present invention, after the adjustment path corresponding to the link and the adjustment policy are sent to each node in the link, each node may determine a previous-hop node and a next-hop node relative to the node (hereinafter, referred to as a target node) according to the adjustment path. Each node can implement corresponding adjustment operation according to the adjustment strategy.

Step 204: and sending an adjustment notification message to a head node to trigger each node in the link to perform capacity adjustment based on the adjustment path and the adjustment strategy, wherein the head node is determined based on the adjustment path.

In the embodiment of the invention, if the adjustment strategy is a capacity increase strategy, the residual capacity of each node in the link is acquired; judging whether the residual capacity of each node in the link is larger than or equal to the difference value between the target capacity and the original capacity; and if the residual capacity of each node in the link is greater than or equal to the difference value between the target capacity and the original capacity, executing the step of sending an adjustment notification message to the head node. If the adjustment strategy is a capacity reduction strategy, the step of sending an adjustment notification message to the head node can be directly executed; and if the residual capacity of each node in the link is smaller than the difference value between the target capacity and the original capacity, not executing the adjustment operation.

In specific implementation, the CR message is a CR in FlexE, the CA message is a CA in FlexE, and the capacity adjustment validation instruction is a C field (i.e., a C bit in an overhead field) in FlexE.

Specifically, if receiving the adjustment notification message, sending a CR to the next hop node;

if receiving the CR, judging whether the node is a tail node or not; if the node is not the tail node, recording a CR non-reply state mark, and sending the CR to the next hop node; if the node is a tail node, replying CA to the previous hop node;

if receiving CA, judging whether the node is the first node; if the node is not the head node, C field data (C bit) is sent to the next hop node, a CA is replied to the previous hop node, and a CR non-replied state mark is cancelled; and if the node is the first node, transmitting the C field data to the next hop node.

In specific implementation, the CR message is a CR in FlexE, the CA message is a CA, and the capacity adjustment validation instruction is a C field (i.e., a C bit in the overhead field).

if receiving the CR, sending CA to the previous hop node, and judging whether the node is a tail node; if the node is not the tail node, sending a CR to a next hop node;

and if the CA is received, transmitting the C field data to the next hop node.

In the embodiment of the present invention, the target node refers to a node in a link that is performing capacity adjustment, and is referred to as the target node, the next-hop node refers to a next-hop node of the target node, and the previous-hop node refers to a previous-hop node of the target node.

In the technical solution of the embodiment of the present invention, since different calinders in the overhead field may represent different timeslot configurations, the link capacity adjustment may be implemented by switching the calinders, for example: the current node uses a first calendar (e.g., primary calendar) and needs to switch to a second calendar (e.g., backup calendar). The controller defines a switching sequence according to the service direction: a first node, a second node, …, an Nth node, a secondary tail node and a tail node; and the head node is informed to carry out clendar switching, and the capacity is adjusted hop by hop.

Fig. 3 is a schematic flow chart of a link capacity adjustment method according to an embodiment of the present invention, where the present embodiment is applied to a network node, as shown in fig. 3, the link capacity adjustment method includes the following steps:

step 301: and acquiring adjustment information, wherein the adjustment information comprises an adjustment path and an adjustment strategy corresponding to the link.

Step 302: and carrying out capacity adjustment on the target node based on the adjustment path corresponding to the link and the adjustment strategy.

In one embodiment, the adjustment policy is a capacity increase policy; correspondingly, the performing capacity adjustment on the target node based on the adjustment path corresponding to the link and the adjustment policy includes:

if receiving CA, judging whether the node is the first node; if the node is not the head node, C field data is sent to the next hop node, a CA is replied to the previous hop node, and a CR non-replied state mark is cancelled; and if the node is the first node, transmitting the C field data to the next hop node.

Here, if the CA message is received and the target node is the head node, the adjustment success message is sent to the controller after the capacity adjustment validation instruction is sent to the next hop node.

In another embodiment, the adjustment policy is a capacity turndown policy; correspondingly, the performing capacity adjustment on the target node based on the adjustment path corresponding to the link and the adjustment policy includes:

and if the CA is received, transmitting the C field data to the next hop node.

In the above scheme, if the capacity adjustment validation instruction is received and the target node is the tail node, an adjustment success message is sent to the controller.

For the two embodiments, if the target node is not the head node and not the tail node, the data cross processing is performed on the service data of the receiving side and the service data of the transmitting side of the target node.

In an embodiment, if the target node is successful in unidirectional time slot adjustment and there is inconsistency between an upstream time slot bandwidth and a downstream time slot bandwidth (that is, the local node receives C-field data and does not transmit C-field data, or the local node transmits C-field data and does not receive C-field data), when performing data interleaving processing on the service data of the receiving side and the service data of the transmitting side, performing rate matching processing on the service data of the receiving side and the service data of the transmitting side.

In the foregoing solution, the performing rate matching processing on the service data of the receiving side and the service data of the transmitting side includes:

Fig. 4 is a third schematic flowchart of a link capacity adjustment method according to an embodiment of the present invention, and as shown in fig. 4, the link capacity adjustment method includes the following steps:

step 401: the controller obtains configuration information for each node.

Step 402: the controller obtains a link capacity adjustment instruction. If the slot is added, step 403 is executed, and if the slot is deleted, step 417 is executed.

Step 403: judging whether the idle time slots of all the nodes are enough or not; if not, step 404 is executed, and if yes, step 405 is executed.

Step 404: and determining that the adjustment fails, and reporting an adjustment failure message to the controller.

Step 405: according to the service flow direction, the head node initiates a CR; step 406 and step 409 are performed simultaneously.

Step 406: the first node timer judges whether the time is out; if not, go to step 407; if yes, step 408 is performed.

Step 407: wait for a specified period and execute step 406.

Step 408: and determining that the adjustment fails, and reporting an adjustment failure message to the controller.

Step 409: receiving a node of the CR, and judging whether the node is a tail node or not; if not, go to step 410; if yes, step 411 is performed.

Step 410: the node continues to send a CR to the next hop node and proceeds to step 409.

Step 411: the tail node replies to the CA to the previous hop node.

Step 412: and the node receiving the CA replies the C bit to the next hop node.

Step 413: judging whether the node sending the C bit is the first node; if so, go to step 414; if not, step 415 is performed.

Step 414: and canceling the first node timer, determining that the adjustment is successful, and reporting an adjustment success message to the controller.

Step 415: and carrying out data crossing and rate matching on the service data of the receiving side and the service data of the sending side.

Step 416: the CA is sent to the previous hop node and step 412 is performed.

Step 417: according to the service flow direction, the head node initiates a CR; step 418 and step 421 are performed simultaneously.

Step 418: the tail node timer judges whether the time is overtime, if not, step 419 is executed; if so, step 410 is performed.

Step 419: wait for a specified period and execute step 418.

Step 420: and determining that the adjustment fails, and reporting an adjustment failure message to the controller.

Step 421: the node receiving the CR replies CA; step 422 and step 425 are performed simultaneously.

Step 422: judging whether the node receiving the CR is a tail node, if so, executing a step 423; if not, step 424 is performed.

Step 423: the node does not need to send a CR to the next hop node.

Step 424: the node continues to send a CR to the next hop node and proceeds to step 421.

Step 425: and the node receiving the CA sends the C bit to the next hop node.

Step 426: judging whether the node receiving the C bit is a tail node or not, if so, executing a step 427; if not, step 428 is performed.

Step 427: and canceling the tail node timer, determining that the adjustment is successful, and reporting an adjustment success message to the controller.

Step 428: and carrying out data crossing and rate matching on the service data of the receiving side and the service data of the sending side.

In the technical solution of the embodiment of the present invention, for the case of increasing the time slot (corresponding to the above-mentioned steps 403 to 416), first, a CR is sent from the first node, and after the second node receives the CR, if the node is not the end node, the non-reply state flag of the CR is recorded, and the CR is continuously sent to the next hop node of the second node; until the tail end node receives the CR, after the tail end node receives the CR, the tail end node judges that the node is a tail node, replies the CA, does not need to send the CR to a next hop node any more, after the returned CA is received by a secondary tail node, the secondary tail node starts to send C field (C bit) switching, and continues to reply the CA to a previous hop node of the self according to the non-reply state mark of the CR recorded before the self, and cancels the non-reply state mark of the CR, at the moment, the time slots of the secondary tail node and the tail node are added firstly; the flow is carried out in sequence until the first node receives the CA returned by the second node, the first node judges that the first node is the first node, the CA does not need to be returned to the previous-hop node any more, the C field is sent to the second node, and the end-to-end time slot is added; after the flow is finished sequentially hop by hop, the first node returns a result to the controller, and the controller updates the time slot using state of the network node.

In the technical scheme of the embodiment of the invention, a CR is sent from a first node, a second node replies a CA after receiving the CR, the first node sends a C field to the second node after receiving the CA replied by the second node, and at the moment, the time slot of the first node and the time slot of a second first node are deleted firstly; the second node judges whether the second node is a tail node or not, and if the second node is not the tail node, the second node continues to send a CR to the next hop node of the second node; the process is carried out in sequence until the tail node receives the CR sent by the secondary tail node; the tail node judges that the tail node is the tail node, replies CA without sending CR to the next hop node, and the secondary tail node sends C field to the tail node after receiving the CA sent by the tail node, and the end-to-end time slot is deleted; after the flow is finished hop by hop in sequence, the tail node returns a result to the controller according to the received C field, and the controller updates the time slot using state of the network node.

In the above process, if each node does not execute its own flow correctly, it will send a regulation failure message to the controller.

In the above-mentioned solution of the embodiment of the present invention, after the node at the home end and the node at the opposite end complete the callback switching, if the node at the opposite end is not the node at the head and the tail ends, the service data at the receiving side and the transmitting side are crossed, and the crossing process needs to perform rate matching, and in the matching process, no matter the process of adding or deleting a time slot, the rate matching is performed from the service data with less time slots to the service data with more time slots, and in the case of no data block, an idle (idle) block is inserted to complete the purpose of rate matching, and one data structure is as shown in fig. 5.

Fig. 6 is a schematic flow chart of link capacity increase according to an embodiment of the present invention, as shown in fig. 6, including the following steps:

step 601: the controller transmits a notification message of the link addition slot to the head node.

Step 602: the head node sends the CR to the next hop node; step 603 and step 606 are performed simultaneously.

Step 603: the head node timer determines whether the timer has timed out, if not, step 604 is executed, and if yes, step 605 is executed.

Step 604: wait for a specified period and execute step 603.

Step 605: and determining that the adjustment fails, and reporting an adjustment failure message to the controller.

Step 606: and the node receives the message and judges according to the type of the node. If yes, go to step 607; if the intermediate node is the intermediate node, go to step 610, and if the end node is the end node, go to step 614.

Step 607: the type of the received message is determined, and if yes, step 608 is executed.

Step 608: c bit is replied to the next hop node.

Step 609: and canceling the first node timer, determining that the adjustment is successful, and reporting an adjustment success message to the controller.

Step 610: judging the type of the received message, if the type is C bit, executing step 611; if yes, go to step 612; if yes, go to step 613.

Step 611: the receiving side and the transmitting side perform data interleaving and rate matching, and step 606 is performed.

Step 612: the CR is sent to the next hop node and step 606 is performed.

Step 613: and sending the CA to the previous hop node, sending the C bit to the next hop node, and executing the step 606.

Step 614: judging the type of the received message, if the type is CR, executing step 615; if so, go to step 616.

Step 615: replying the CA to the previous hop node, go to step 606.

Step 616: and adjusting the data service time slot of the receiving side.

Fig. 7 is a schematic flow chart of link capacity reduction according to an embodiment of the present invention, as shown in fig. 7, including the following steps:

step 701: the controller sends a notification message of the link deletion time slot to the head node.

Step 702: the head node sends the CR to the next hop node; step 703 and step 706 are performed simultaneously.

Step 703: the tail node timer determines whether it is time out, if not, step 704 is executed, and if yes, step 705 is executed.

Step 704: wait for a specified period and execute step 703.

Step 705: and determining that the adjustment fails, and reporting an adjustment failure message to the controller.

Step 706: and the node receives the message and judges according to the type of the node. If yes, go to step 707; if the intermediate node is the intermediate node, step 709 is executed, and if the tail node is the tail node, step 713 is executed.

Step 707: the type of the received message is determined, and if yes, step 708 is performed.

Step 708: c bit is replied to the next hop node.

Step 709: judging the type of the received message, if the type is C bit, executing step 710; if yes, go to step 711; if yes, go to step 712.

Step 710: and the receiving side and the transmitting side perform data interleaving and rate matching.

Step 711: replying the CA to the previous hop node, sending the CR to the next hop node, and executing step 706.

Step 712: and C bit is sent to the next hop node, and step 706 is executed.

Step 713: judging the type of the received message, if so, executing step 714; if so, go to step 715.

Step 714: replying the CA to the previous hop node, go to step 706.

Step 715: and canceling the timer, determining that the adjustment is successful, and reporting an adjustment success message to the controller.

The technical solution of the embodiments of the present invention is further described below with reference to specific application examples.

Application example 1

As shown in FIG. 8, the network has four nodes, PE1, P1, P2, and PE 2. The data flow for link a is from left to right. The bandwidth of link a was originally configured with 3 slots and now needs to be adjusted to 4 slots. The adjustment is finally successful, since all nodes have enough time slots. The specific process is as follows:

1. the controller will calculate all affected nodes according to the instruction for the time slot number of the link to be adjusted, see if there is any residual time slot in the end-to-end link, if the calculated residual bandwidth of the link allows, then start the link capacity adjustment.

PE1 sends CR to P1; after receiving the CR, the P1 sends the CR to the P2; after receiving the information, the P2 sends CR to the PE 2;

PE2 reverts CA to P2; after receiving the CA, the P2 replies to the P1 and sends the C bit to the PE 2; after receiving the CA replied by the P2, the P1 replies the CA to the PE1 and simultaneously sends the C bit to the P2;

after P2 sends C bit to PE2, the service data time slot of the P2 sending side is adjusted to 4 slots; because the service data of the receiving side of the P2 is 3 slots, the service data of the receiving side of the P2 and the service data of the transmitting side are subjected to data intersection, and rate matching is needed until the service data of the receiving side completes slot adjustment (that is to say, the time slot adjustment needs to be waited for to receive the C bit sent by the P1);

4.1 there are two specific implementations of rate matching, as shown in FIG. 13:

1) an idle block is inserted between an S block (the first block of a packet) and a T block (the last block of a packet), that is: the advantage of this scheme is that the latency is minimal, with the insertion of idle blocks within the data packet.

2) Inserting an idle block between the T block and the S block, namely: the scheme of inserting idle blocks between data packets has the advantage that the data format is standard and can be supported by both the transmitting and receiving nodes.

5, after P1 sends C bit to P2, the service data time slot of P1 sending side is adjusted to 4 slots; because the service data of the receiving side of P1 is 3 slots, the service data of the receiving side of P1 and the service data of the transmitting side are subjected to data intersection, and rate matching is needed until the service data of the receiving side completes slot adjustment (that is to say, the time slot adjustment needs to be waited for to receive the C bit sent by PE 1);

5.1 there are two specific implementations of rate matching, as shown in FIG. 13:

1) an idle block is inserted between the S block and the T block.

2) An idle block is inserted between the T block and the S block.

PE1 sends C bit to P1; the PE1 sending side service data time slot is adjusted to 4 slots; the P1 receive side traffic data slots are adjusted to 4 slots.

Application example two

As shown in FIG. 9, the network has four nodes, PE1, P1, P2, and PE 2. The data flow for link a is from left to right. The bandwidth of link a was originally configured with 3 slots and now needs to be adjusted to 4 slots. Since the P2 node has not enough time slots, the adjustment eventually fails. The specific process is as follows:

1. the controller calculates all affected nodes according to the time slot number of the link to be adjusted by the instruction, and judges whether the end-to-end link has residual time slots or not, the calculated residual bandwidth of the link is not allowed, the adjustment is directly terminated, and the adjustment finally fails.

Application example three

As shown in FIG. 10, the network has four nodes, PE1, P1, P2, and PE 2. The data flow for link a is from left to right. The bandwidth of link a was originally configured with 3 slots and now needs to be adjusted to 4 slots. Since the P1 node is abnormal and does not reply CA, PE1 does not receive CA, and the adjustment finally fails. The specific process is as follows:

3. under normal conditions, PE2 reverts CA to P2; p2 replies to P1 with CA after receiving; p1 receives the request and replies CA to PE 1; because of the exception, P1 nodes do not reply to CA, so head node PE1 does not receive CA, and after waiting for a period of time, head node PE1 notifies the controller that the adjustment failed.

4. The controller records the "adjustment failed" information.

Application example four

As shown in FIG. 11, the network has four nodes, PE1, P1, P2, and PE 2. The data flow for link a is from left to right. The original configuration of link a is 4 slots, which now needs to be adjusted to 3 slots. The adjustment is finally successful. The specific process is as follows:

1. the controller can directly start the link capacity adjustment according to the instruction;

PE1 sends CR to P1; after receiving the message, the P1 replies CA to PE1 and sends CR to P2;

3, P2 replies CA to P1 after receiving CR, and sends CR to PE2 at the same time;

after receiving CR, PE2 replies CA to P2;

5, after receiving the CA sent by the P1, the PE1 sends a C bit to the P1; the PE1 sending side service data time slot is adjusted to 3 slots;

after P1 receives the C bit sent by PE1, the service data time slot of the P1 receiving side is adjusted to 3 slots; because the service data of the P1 sending side is 4 slots, the service data of the P1 receiving side and the service data of the sending side are subjected to data intersection, and rate matching is needed until the time slot adjustment of the service data of the sending side is completed (that is to say, the time slot adjustment is waited to be performed until the P1 sends C bit to the P2);

6.1 there are two specific implementations of rate matching, as shown in FIG. 13:

1) an idle block is inserted between the S block and the T block.

2) An idle block is inserted between the T block and the S block.

7, after the P1 receives the CA sent by the P2, the P1 sends a C bit to the P2; the P1 sending side service data time slot is adjusted to 3 slots;

8, after the P2 receives the C bit sent by the P1, the service data of the P2 receiving side is adjusted to 3 slots; because the service data of the P2 sending side is 4 slots, the service data of the P2 receiving side and the service data of the sending side are subjected to data intersection, and rate matching is needed until the service data of the sending side completes slot adjustment (that is, the time is to be waited for the sending P2 to send the C bit to the PE 2);

8.1 there are two specific implementations of rate matching, as shown in FIG. 13:

1) an idle block is inserted between the S block and the T block.

2) An idle block is inserted between the T block and the S block.

9, after the P2 receives the CA sent by the PE2, the P2 sends a C bit to the PE 2; the P2 sending side service data time slot is adjusted to 3 slots;

after PE2 receives the C bit sent by P2, the service data of the receiving side of PE2 is adjusted to 3 slots;

application example five

As shown in FIG. 12, the network has four nodes, PE1, P1, P2, and PE 2. The data flow for link a is from left to right. The original configuration of link a is 4 slots, which now needs to be adjusted to 3 slots. Due to the exception of the P2 node, no C bit is sent to PE2, resulting in the final failure of the adjustment. The specific process is as follows:

2. if the situation is normal, the subsequent steps are consistent with the previous embodiment; but an exception occurs, the P2 node does not send the C field; causing the tail node to not receive the C field last;

3. and the tail node reports the controller, and the adjustment fails.

4. The controller records the "adjustment failed" information.

Fig. 14 is a schematic structural diagram of a link capacity adjustment apparatus according to an embodiment of the present invention, as shown in fig. 14, the apparatus includes:

a first determining unit 1401, configured to determine, based on a traffic flow direction on a link, an adjustment path corresponding to the link, where the adjustment path indicates an adjustment order of each node in the link;

a second determining unit 1402, configured to determine an adjustment policy corresponding to the link based on the original capacity of the link and the target capacity to be adjusted;

a sending unit 1403, configured to send the adjustment path corresponding to the link and the adjustment policy to each node in the link;

a triggering unit 1404, configured to send an adjustment notification message to a head node to trigger each node in the link to perform capacity adjustment based on the adjustment path and the adjustment policy, where the head node is determined based on the adjustment path.

In an embodiment, the second determining unit 1402 is configured to determine, if the original capacity is smaller than the target capacity, that the adjustment policy corresponding to the link is a capacity increasing policy; and if the original capacity is larger than the target capacity, determining that the adjustment strategy corresponding to the link is a capacity reduction strategy.

In one embodiment, the apparatus further comprises:

an obtaining unit 1405, configured to obtain remaining capacity of each node in the link;

a determining unit 1406, configured to determine whether a remaining capacity of each node in the link is greater than or equal to a difference between the target capacity and the original capacity;

the triggering unit 1404 is configured to execute the step of sending an adjustment notification message to the head node if the remaining capacity of each node in the link is greater than or equal to the difference between the target capacity and the original capacity; and if the residual capacity of each node in the link is smaller than the difference value between the target capacity and the original capacity, not executing the adjustment operation.

In one embodiment, the capacity up-scaling policy is used to instruct each node in the link to:

In one embodiment, the capacity reduction policy is used to instruct each node in the link to:

Those skilled in the art will understand that the implementation functions of each unit in the link capacity adjustment device shown in fig. 14 can be understood by referring to the related description of the link capacity adjustment method. The functions of the units in the link capacity adjustment apparatus shown in fig. 14 may be implemented by a program running on a processor, or may be implemented by specific logic circuits.

In addition, an embodiment of the present invention further provides a controller, where the controller includes a processor and a memory, where the memory stores functional units shown in fig. 14, and the processor is capable of implementing functions of the functional units.

Fig. 15 is a schematic structural diagram of a link capacity adjustment apparatus according to an embodiment of the present invention, and as shown in fig. 15, the apparatus includes:

an obtaining unit 1501, configured to obtain adjustment information, where the adjustment information includes an adjustment path and an adjustment policy corresponding to a link;

an adjusting unit 1502 is configured to perform capacity adjustment on a target node based on an adjustment path corresponding to the link and the adjustment policy.

In one embodiment, the adjustment policy is a capacity increase policy;

the adjusting unit 1502 is configured to: if receiving the adjustment notification message, sending a CR message to a next hop node;

In one embodiment, the apparatus further comprises:

a notifying unit 1503, configured to send an adjustment success message to the controller after the adjusting unit sends a capacity adjustment validation instruction to the next hop node if the adjusting unit receives the CA message and the target node is the head node.

In one embodiment, the adjustment policy is a capacity reduction policy;

In one embodiment, the apparatus further comprises:

a notifying unit 1503, configured to send an adjustment success message to the controller if the adjusting unit receives the capacity adjustment validation instruction and the target node is the tail node.

In one embodiment, the apparatus further comprises:

and an intersection processing unit 1504, configured to perform data intersection processing on the traffic data of the receiving side and the traffic data of the transmitting side of the target node if the target node is not the head node and is not the tail node.

In an embodiment, the interleaving processing unit 1504 is further configured to, if the target node performs the unidirectional time slot adjustment successfully and there is inconsistency between the upstream time slot bandwidth and the downstream time slot bandwidth, perform rate matching processing on the traffic data of the receiving side and the traffic data of the transmitting side when performing data interleaving processing on the traffic data of the receiving side and the traffic data of the transmitting side.

In an embodiment, the cross processing unit 1504 is configured to adjust a rate of the traffic data of the receiving side to be consistent with a rate of the traffic data of the transmitting side, where the rate of the traffic data of the receiving side is smaller than the rate of the traffic data of the transmitting side.

In an embodiment, the interleaving unit 1504 is configured to insert idle blocks into a data packet of the traffic data of the receiving side, so that the rate of the traffic data of the receiving side is adapted to the rate of the traffic data of the transmitting side; or, for the data packet of the service data of the receiving side, inserting an idle block between adjacent data packets, so that the rate of the service data of the receiving side is adapted to the rate of the service data of the transmitting side.

Those skilled in the art will understand that the implementation functions of each unit in the link capacity adjustment device shown in fig. 15 can be understood by referring to the related description of the link capacity adjustment method. The functions of the units in the link capacity adjustment apparatus shown in fig. 15 may be implemented by a program running on a processor, or may be implemented by specific logic circuits.

In addition, an embodiment of the present invention further provides a network node, where the network node includes a processor and a memory, where the memory stores functional units shown in fig. 15, and the processor is capable of implementing functions of the functional units.

Fig. 16 is a schematic structural diagram of a link capacity adjustment system according to an embodiment of the present invention, and as shown in fig. 16, the link capacity adjustment system includes: a controller 1601, at least one network node 1602. The controller 1601 is connected to each of the network nodes 1602, and a data channel is established between the network nodes 1602 according to a traffic flow direction; wherein the content of the first and second substances,

a controller 1601, configured to determine an adjustment path corresponding to a link based on a traffic flow direction on the link, where the adjustment path indicates an adjustment order of each node in the link; determining an adjustment strategy corresponding to the link based on the original capacity of the link and the target capacity to be adjusted; sending the adjustment path corresponding to the link and the adjustment strategy to each node in the link; and sending an adjustment notification message to a head node to trigger each node in the link to perform capacity adjustment based on the adjustment path and the adjustment strategy, wherein the head node is determined based on the adjustment path.

A network node 1602, configured to obtain adjustment information, where the adjustment information includes an adjustment path and an adjustment policy corresponding to a link; and carrying out capacity adjustment on the target node based on the adjustment path corresponding to the link and the adjustment strategy.

In one embodiment, the adjustment policy is a capacity increase policy; the network node 1602, configured to send a CR message to a next hop node if the adjustment notification message is received; if the CR message is received, judging whether the target node is a tail node or not; if the target node is not the tail node, recording a CR message non-reply state mark, and sending the CR message to the next hop node; if the target node is the tail node, replying the CA message to the previous hop node; if the CA message is received, judging whether the target node is the first node; if the target node is not the head node, sending a capacity adjustment effective instruction to the next hop node, replying a CA message to the previous hop node and canceling a CR message non-reply state mark; if the target node is the first node, sending a capacity adjustment effective instruction to the next hop node; and determining the next hop node and the previous hop node based on the corresponding adjustment paths of the links.

In another embodiment, the adjustment policy is a capacity turndown policy; the network node 1602, configured to send a CR message to a next hop node if the adjustment notification message is received; if receiving the CR message, sending a CA message to the previous hop node, and judging whether the target node is a tail node; if the target node is not the tail node, sending a CR message to a next hop node; if the CA message is received, sending a capacity adjustment effective instruction to the next hop node; and determining the next hop node and the previous hop node based on the corresponding adjustment paths of the links.

Those skilled in the art will appreciate that the functions of the controller 1601 and each network node 1602 in this embodiment may be understood with reference to the foregoing description of the link capacity adjustment method.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

Accordingly, the embodiment of the present invention further provides a storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps in the link capacity adjustment method described above.

The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.

Claims

1. A method for link capacity adjustment, the method comprising:

sending an adjustment notification message to a head node to trigger each node in the link to perform capacity adjustment based on the adjustment path and the adjustment policy, wherein the head node is determined based on the adjustment path;

the determining an adjustment strategy corresponding to the link based on the original capacity of the link and the target capacity to be adjusted includes:

if the original capacity is larger than the target capacity, determining that the adjustment strategy corresponding to the link is a capacity reduction strategy;

the capacity increasing strategy is used for instructing each node in the link to execute the following operations:

wherein the next hop node and the previous hop node are determined based on the adjustment path corresponding to the link;

the capacity reduction strategy is used for instructing each node in the link to execute the following operations:

2. The method of claim 1, wherein if the tuning policy is a capacity tuning policy, the method further comprises:

acquiring the residual capacity of each node in the link;

3. A method for link capacity adjustment, the method comprising:

based on the adjustment path corresponding to the link and the adjustment strategy, carrying out capacity adjustment on the target node;

when the adjustment policy is a capacity increase policy, the adjusting the capacity of the target node based on the adjustment path corresponding to the link and the adjustment policy includes:

when the adjustment policy is a capacity reduction policy, the adjusting the capacity of the target node based on the adjustment path corresponding to the link and the adjustment policy includes:

4. The method of claim 3, further comprising:

5. The method of claim 4, further comprising:

6. The method according to any one of claims 3 to 5, further comprising:

7. The method of claim 6, further comprising:

8. The method of claim 7, wherein the performing rate matching processing on the traffic data of the receiving side and the traffic data of the transmitting side comprises:

9. The method of claim 8, wherein the adjusting the rate of the traffic data of the receiving side to be consistent with the rate of the traffic data of the transmitting side comprises:

10. A link capacity adjustment apparatus, the apparatus comprising:

a second determining unit, configured to determine an adjustment policy corresponding to the link based on an original capacity of the link and a target capacity to be adjusted, where the second determining unit is further configured to determine, if the original capacity is smaller than the target capacity, that the adjustment policy corresponding to the link is a capacity increasing policy; if the original capacity is larger than the target capacity, determining that the adjustment strategy corresponding to the link is a capacity reduction strategy;

11. The apparatus of claim 10, further comprising:

12. A link capacity adjustment apparatus, the apparatus comprising:

an adjusting unit, configured to perform capacity adjustment on a target node based on an adjustment path corresponding to the link and the adjustment policy;

when the adjustment policy is a capacity increase policy, the adjusting unit is configured to: if receiving the adjustment notification message, sending a CR message to a next hop node;

when the adjustment policy is a capacity reduction policy, the adjustment unit is configured to: if receiving the adjustment notification message, sending a CR message to a next hop node;

13. The apparatus of claim 12, further comprising:

14. The apparatus of claim 12, further comprising:

15. The apparatus of any one of claims 12 to 14, further comprising:

16. The apparatus of claim 15, wherein the interleaving unit is further configured to, if the unidirectional capacity adjustment of the target node is successful and there is inconsistency between an upstream capacity bandwidth and a downstream capacity bandwidth, perform rate matching processing on the traffic data of the receiving side and the traffic data of the transmitting side when performing data interleaving processing on the traffic data of the receiving side and the traffic data of the transmitting side.

17. The apparatus of claim 16, wherein the interleaving unit is configured to adjust a rate of the traffic data of the receiving side to be consistent with a rate of the traffic data of the transmitting side, and wherein the rate of the traffic data of the receiving side is smaller than the rate of the traffic data of the transmitting side.

18. The apparatus of claim 17, wherein the interleaving unit is configured to insert idle blocks into a data packet of the service data of the receiving side, so that a rate of the service data of the receiving side is adapted to a rate of the service data of the transmitting side; or, for the data packet of the service data of the receiving side, inserting an idle block between adjacent data packets, so that the rate of the service data of the receiving side is adapted to the rate of the service data of the transmitting side.

19. A controller, characterized in that it comprises a link capacity adjustment device according to any one of claims 10 to 11.

20. A network node, characterized in that the network node comprises the link capacity adjustment apparatus according to any one of claims 12 to 18.

21. A link capacity adjustment system, characterized in that the link capacity adjustment system comprises a controller according to claim 19, and at least two network nodes according to claim 20, wherein,

22. A storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps in the link capacity adjustment method of any one of claims 1 to 2 or the steps in the link capacity adjustment method of any one of claims 3 to 9.