WO2018161754A1

WO2018161754A1 - Method and apparatus for recovering tunnel bandwidth resource

Info

Publication number: WO2018161754A1
Application number: PCT/CN2018/075400
Authority: WO
Inventors: 陈明春
Original assignee: 中兴通讯股份有限公司
Priority date: 2017-03-07
Filing date: 2018-02-06
Publication date: 2018-09-13
Also published as: CN108574646A

Abstract

Provided are a method and apparatus for recovering a tunnel bandwidth resource. The method comprises: when a new target link is to be created, if the remaining bandwidth resources are insufficient, starting from links maintaining the lowest priority among established links, choosing to dismantle a link with the least link data volume to be dismantled and the minimum link redundant bandwidth to be dismantled on the basis that a bandwidth required for the target link is sufficiently met; and newly creating the target link based on the bandwidth obtained by means of dismantling the link.

Description

Tunnel bandwidth resource recovery method and device

Technical field

The present disclosure relates to the field of communications, and in particular, to a tunnel bandwidth resource recovery method and apparatus.

Background technique

Traffic engineering ensures that all links are guaranteed bandwidth when establishing tunnels. On the basis of a certain interface bandwidth, it is possible to meet the requirements of all links. In this case, a more common method is to remove other links and use the bandwidth released to satisfy the current link. Establish the required guaranteed bandwidth. In the bearer network, a set of resource recovery principles is defined, and on this basis, a data management center is established to provide different traffic engineering use. When resources are insufficient, the basis for quickly recovering and preempting resources is provided.

Summary of the invention

The following is an overview of the topics detailed in this document. This Summary is not intended to limit the scope of the claims.

The present disclosure provides a tunnel bandwidth resource recovery method and apparatus for the problem of low efficiency of the current new link.

In one aspect, the present disclosure provides a tunnel bandwidth resource recovery method, including: when a new target link is created, when the remaining bandwidth resources are insufficient, the link with the lowest priority is selected from the established link, and the selection is started. On the basis of sufficient bandwidth for the target link, the link with the least amount of link data and the least redundant bandwidth of the link is removed, and the link is removed based on the bandwidth obtained by removing the link.

In an exemplary embodiment, the method further includes: prior to creating the target link, associating each retention priority of the established link with an ordered linked list, where the ordered linked list includes at least one Information about the established link and the allocated bandwidth of the link; the selection is based on the bandwidth required for the target link, and the minimum amount of link data is removed and the redundant bandwidth of the link is minimized. The link is removed, and the first chain of at least one to-be-removed link that meets the target link bandwidth requirement is searched for from the ordered list corresponding to the lowest priority priority in the established link. Combining the path, selecting a second link combination in which the number of links to be removed is the smallest in the first link combination, selecting a third link combination with the smallest redundant bandwidth in the second link combination, and removing the The link in the third link combination.

In an exemplary embodiment, the ordered list is sorted in the order of the link establishment priorities of the established links.

In an exemplary embodiment, when a new target link is created, in the case that the remaining bandwidth resources are insufficient, starting from the link with the lowest priority among the established links, the selection is sufficient to satisfy the target chain. On the basis of the required bandwidth of the road, the link with the least amount of link data and the least redundant link bandwidth is removed, including: when a new link is to be established within a bandwidth constraint, the remaining bandwidth resources are insufficient. In this case, the link with the lowest priority is maintained in the established link within the bandwidth constraint, and the minimum amount of link data is removed and the link redundancy is removed on the basis of sufficient bandwidth for the newly established link. The link with the smallest bandwidth is removed.

In an exemplary embodiment, when a new target link is created, in the case that the remaining bandwidth resources are insufficient, starting from the link with the lowest priority among the established links, the selection is sufficient to satisfy the target chain. On the basis of the required bandwidth of the road, the link with the least amount of link data and the least redundant link bandwidth is removed, including: when a new link of the first traffic class is to be established in the first bandwidth constraint, If the remaining bandwidth in the first bandwidth constraint is insufficient, and the sum of the borrowable bandwidth and the remaining bandwidth is still insufficient to meet the establishment requirement, determine whether the bandwidth in the first bandwidth constraint is borrowed by the second traffic category. The level of the second traffic class is lower than the level of the first traffic class; in the case that the second traffic class borrows the bandwidth in the first broadband constraint, starting from the second broadband constraint, sequentially determining Whether the bandwidth in the remaining bandwidth constraints corresponding to the other traffic categories is borrowed, and the judgment result is obtained, and the rank of the other traffic category is lower than the level of the second traffic category. And removal of redundancy in the least principle of minimum bandwidth constraints recovering the remaining bandwidth of the borrowed amount of bandwidth for each link is dismantled bandwidth constraints occupied bandwidth.

In another aspect, the present disclosure further provides a tunnel bandwidth resource recovery apparatus, including: a teardown module, configured to maintain a priority from an established link when a new target link is created, if the remaining bandwidth resources are insufficient. The lowest link starts, and the link with the least amount of link data and the least redundant bandwidth of the link is removed for removal on the basis of sufficient bandwidth for the target link; the new module is set to be based on the removal chain. The bandwidth obtained by the road creates the target link.

In an exemplary embodiment, the apparatus further includes: an establishing module, configured to: associate respective retention priorities of the established links with the ordered linked list before the new target link is created, the orderly The linked list includes at least one established link and information about the allocated bandwidth of the link; the teardown module is configured to: maintain the ordered order corresponding to the lowest priority from the established link The first link combination of at least one link to be removed that meets the bandwidth requirement of the target link is searched in the linked list, and the second link combination in which the number of links to be removed is the smallest in the first link combination is selected. The third link combination in which the redundant bandwidth is the smallest is selected in the second link combination, and the link in the third link combination is removed.

In an exemplary embodiment, the teardown module is configured to maintain in a link established within the bandwidth constraint when a new link is to be established within a bandwidth constraint, in case the remaining bandwidth resources are insufficient The link with the lowest priority starts, and the link with the least amount of link data and the smallest redundant bandwidth of the link is removed for removal based on the bandwidth required for the new link.

In an exemplary embodiment, the teardown module includes: a determining unit configured to: when a new link of the first traffic class is to be established in the first bandwidth constraint, the remaining bandwidth is insufficient in the first bandwidth constraint, and If the sum of the borrowable bandwidth and the remaining bandwidth is still insufficient to meet the establishment requirement, it is determined whether the bandwidth in the first bandwidth constraint is borrowed by the second traffic category, and the level of the second traffic category is lower than the a level of the first traffic class; a teardown unit configured to, when the second traffic class borrows the bandwidth in the first broadband constraint, start from the second broadband constraint, and sequentially determine the rest of the other traffic classes Whether the bandwidth in the bandwidth constraint is borrowed, and the judgment result is obtained. The rank of the other traffic category is lower than the level of the second traffic category, and the number of links that are removed in each bandwidth constraint of the occupied bandwidth is the least and the chain is removed. The principle of minimum road redundancy bandwidth recovers the borrowed bandwidth in the remaining bandwidth constraints.

Embodiments of the present disclosure also provide a computer readable storage medium storing computer executable instructions that, when executed by a processor, implement the methods described above.

The beneficial effects of the disclosure are as follows:

The embodiment of the present disclosure uses a common resource recovery principle in the process of establishing a link. When bandwidth resource preemption occurs, data structure entries can be quickly searched according to different traffic models, and then the optimal available resources can be quickly located. Bandwidth ensures the establishment of new links, and in the process, minimizes the impact on other services and minimizes waste of resources.

Other aspects will be apparent upon reading and understanding the drawings and detailed description.

DRAWINGS

FIG. 1 is a schematic diagram of bandwidth resource management in a traffic model;

2 is a schematic diagram of a preemption process of link resources when only one link exists between devices;

3 is a schematic diagram of multiple links between devices in an embodiment of the method of the present disclosure;

4 is a flowchart of a method for recovering a tunnel bandwidth resource in an embodiment of a method according to the present disclosure;

5 is a schematic diagram of an MPLS-TE traffic engineering model involved in an embodiment of the method of the present disclosure;

6 is a schematic diagram of an HP priority ordered list in an embodiment of the method of the present disclosure;

7 is a schematic diagram of a bandwidth data management model provided in an embodiment of the method of the present disclosure;

8 is a schematic diagram of a MAM allocation mode involved in an embodiment of the method of the present disclosure;

9 is a schematic diagram of a correspondence between BC and CT in a MAM model involved in an embodiment of the method according to the present disclosure;

10 is a schematic diagram of an internal data management model of a MAM constraint model involved in an embodiment of the method of the present disclosure;

11 is a schematic diagram of BC limitation of an RDM involved in an embodiment of the method of the present disclosure;

FIG. 12 is a structural block diagram of a tunnel bandwidth resource recovery apparatus provided in an embodiment of the present disclosure.

detailed description

Figure 1 depicts the process of bandwidth resource management in a traffic model. At the same time as the interface bandwidth allocation is initialized, a resource management data initialization table is established to record the initial guaranteed bandwidth. When a tunnel link (hereinafter referred to as a link) is established, the data management table is updated. When the bandwidth of the tunnel link is insufficient, the resource management table is queried whether there is a reclaimable bandwidth resource. If yes, the link is established. Otherwise, the link is established. The tunnel link failed.

MPLS-TE traffic engineering uses the available resources to establish an LSP (Label Switching Path) along the link to ensure that bandwidth is always guaranteed for specific traffic to avoid congestion in case of stability or failure. DS-TE enables MPLS-TE to sense the CoS (class of service), allows resources to be reserved according to the fine-grained CoS, and provides MPLS (Multi-Protocol Label Switching) fault tolerance at each CoS level. mechanism. By combining the functions of DiffServ (differentiated service) and TE (traffic-engineering), DS-TE can provide QoS (Quality of Service) guarantee to meet strict SLA (Service-Level Agreement). Level agreements), such as voice, ATM (Asynchronous Transfer Mode) and frame relay.

In the process of establishing an LSP, when the bandwidth cannot be met, one solution is to remove another established path and occupy the bandwidth resources allocated for it. This method is called preemption. In the process of preemption, how to quickly locate the optimal available link becomes a crucial link. At present, the recycling principles of different manufacturers are different, and there is no unified processing method, resulting in new Link establishment is inefficient.

The solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. The described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present disclosure without departing from the inventive scope are the scope of the disclosure.

First, the following example is used to illustrate how the present disclosure establishes a resource recovery principle in the process of tunnel link establishment.

As shown in Figure 2, a tunnel tunnel (link or path) 1 is established between device A and device C. The association between the establishment priority and the hold priority of the link is (3, 2). In tunnel2, if the tunnel is contending with the established tunnel link, the resource will be successful only if the priority of the tunnel is higher than that of the tunnel1 (the smaller the value is, the higher the priority is). As shown in Figure 2, the maximum reserved bandwidth between device A and device C is 20M, the bandwidth of the established tunnel1 is 15M, and the priority combination is (3, 2), so the current remaining available bandwidth is 5M. Create tunnel 2, the priority combination is (1,0), and the bandwidth is 18M. The remaining bandwidth cannot meet the requirements for tunnel2. In this case, tunnel1 with lower priority is removed to ensure that tunnel2 is successfully established.

The above example only shows the preemption rule when only one link exists between devices. However, in a real network, devices often carry a large number of links. As shown in Figure 3, the maximum reserved bandwidth of all links is 60M, currently contains 4 links, has been allocated 60M, now the new link tunnel5 needs bandwidth 15M, priority combination is (2,1), bandwidth resources are insufficient. According to the above principles, the newly established link can only preempt the established link according to the priority. Tunnel 2, tunnel 3, and tunnel 4 in Figure 3 are the links that meet the preemption condition. produce:

In the first case, the link with the lowest priority is selected to be removed. Assume that it is removed from tunnel4. Since tunnel4 occupies 20M bandwidth, only the tunnel4 can be removed to meet the bandwidth requirement.

The second case: the link with the lowest priority is selected to be removed. Assume that the tunnel 3 is removed from the tunnel. As the tunnel 3 occupies 10 Mbits of bandwidth, the bandwidth cannot be met. The tunnel 4 is removed and the bandwidth is met.

The third case: randomly removes the link with a lower priority than the newly created link until the bandwidth requirement of the new link is met. Assuming that the tunnel2 is removed, it is possible to remove both tunnel2 and tunnel3.

The fourth case: randomly removes the link with lower priority than the new link until the bandwidth requirement of the new link is met. Assuming that you are removing from tunnel2, you may remove tunnel2 and tunnel4 at the same time.

The above several cases are analyzed one by one as follows:

The lowest priority link was removed, and a total of 20M links were removed with a redundant bandwidth of 5M.

The lowest priority link was removed, and two 30M links were removed with a redundant bandwidth of 15M.

The lowest priority and lower priority links were removed, and two 20M links were removed with a redundant bandwidth of 5M.

The lowest and lower priority links were removed, and two 30M links were removed with a redundant bandwidth of 15M.

From the above analysis, if there are too many links to be removed, the number of services affected will also increase. If the priority of the removed link is not the lowest, it will affect the service with higher priority. Therefore, it is considered in the present disclosure. The first case described above is the best result. The removal link has the lowest priority, the number of removed links is the least, and the redundant bandwidth of the removed link is the smallest.

In summary, in terms of bandwidth preemption, the present disclosure proposes the following three resource recovery principles from the perspective of minimizing the impact on existing services and rational utilization of resources:

The path with the lowest priority is the first choice for preemption;

The total number of paths removed is the least;

The removed path has the least redundant bandwidth.

When using the above three resource recovery principles for resource recovery, look up and confirm in the order of the above three principles.

Based on the above-mentioned resource recovery principle proposed in the present disclosure, the tunnel bandwidth resource recovery method provided by the present disclosure will be described in detail through the following embodiments.

Method embodiment

This embodiment provides a tunnel bandwidth resource recovery method, and FIG. 4 is a flowchart of the method. As shown in FIG. 4, the method includes the following processing:

Step 401: When a new target link is created, if the remaining bandwidth resources are insufficient, starting from the link with the lowest priority in the established link, and selecting the bandwidth required for the target link, Demolition of the link with the least amount of link data and the smallest redundant bandwidth of the removed link;

Step 402: Create a new target link based on the bandwidth obtained by removing the link.

The above steps 401 to 402 are a general tunnel bandwidth resource recovery method. The following uses the different traffic engineering models to illustrate the use of the method.

The MPLS-TE traffic engineering model is shown in Figure 5. A certain TE bandwidth is allocated on the interface. Each new tunnel is allocated a certain amount of bandwidth. Multiple LSPs can be set up on each tunnel. There is a priority combination between the tunnels to establish a priority and maintain priority combination (SP, HP). ), wherein the SP is used to indicate the establishment of the priority, and the HP is used to indicate that the priority is maintained. According to the principle of the lowest priority preemption, in the process of establishing the chain, the item management is performed according to the priority category, and in the case that the remaining bandwidth is insufficient, To ensure that a link with a lower priority can be found, a link with a higher priority cannot be used. As shown in Figure 6, the HP priority ordered list, priority HP1> HP2> HP3> HP4> HP5> HP6> HP7, if there is insufficient bandwidth in HP1, you can preempt the bandwidth from HP7 to HP2 priority list.

According to the principle of removing the minimum link and the principle of minimizing the redundancy, the present embodiment records a sorting situation of the bandwidth of the same priority on the basis of the priority entry shown in FIG. 6. In this embodiment, The management method of the ordered linked list is adopted, that is, each priority node is linked with an ordered list of bandwidths, and the bandwidth data management model obtained based on this is shown in FIG. 7 .

Based on the bandwidth data management module shown in FIG. 7, the MPLS-TE traffic engineering model tunnel bandwidth resource recovery method may be specifically processed as follows:

Before the new target link is created, the respective retention priorities of the established links are associated with the ordered linked list, and the ordered linked list includes at least one established link and information about the allocated bandwidth of the link; Selecting the link with the least amount of link data and the minimum link redundancy bandwidth to be removed, including maintaining the lowest priority priority from the established link, based on the bandwidth required to meet the target link. Corresponding to the first linked combination of at least one to-be-removed link that meets the target link bandwidth requirement, the corresponding ordered list is selected to filter out the minimum number of links to be removed in the first link combination. a second link combination, in which the third link combination with the smallest redundant bandwidth is selected, and the link in the third link combination is removed, wherein the ordered link is in accordance with the established link The order of the build chain priorities is sorted.

Based on the model shown in FIG. 7, when the remaining bandwidth is insufficient, the low-priority (ie, corresponding) bandwidth ordering list (ie, the above-mentioned ordered list) is searched for, and the appropriate link is preempted according to the preemption principle. The current preemption action occurs only when a dynamic TE tunnel is established. To ensure that the removed link can be quickly determined when the preemption occurs, performance problems should also be considered. For the search for a detachable link, the complexity is O(n) when searching in a sequential order. When there are a large number of links, the search performance is low, which may cause the new link to fail, and the half-search (also called the binary point). The complexity is found to be O(log ₂ n), so a binary search algorithm is employed in this embodiment. When the bandwidth of a path cannot meet the bandwidth requirements of the new link, multiple links are split to meet the bandwidth requirement. Assume that there are n selectable links. The number of link paths to be removed is m (1 ≤ m). ≤n), the worst case will traverse the combination C(n,m) times. After fixing m-1 paths, the search of the mth path uses a half-fold search to improve query performance and put the link combination that satisfies the condition. In an ordered list, the linked list is sorted according to the size of the redundant bandwidth. Finally, the group with the smallest redundant bandwidth is selected as the selection result. If the combination with the redundant bandwidth of 0 is found in the search process, the combination is directly returned. result.

The model in Figure 7 can meet the bandwidth resource recovery calculation of MPLS-TE traffic engineering. When the link is removed, MPLS-TE does not consider which services are carried on the link, and cannot distinguish the service class. DS-TE engineering can distinguish between different types of traffic and impose different bandwidth limits on different types of traffic. The traffic class CT ranges from CT0 to CT7. Generally, CT7 is the traffic with the strictest QoS requirements, and CT0 is the best-effort traffic. Here, the bandwidth constraint corresponding to traffic class CT0-CT7 is defined as BC0-BC7. The bandwidth constraint (BC) relationship corresponding to the traffic class (CT) is different in different constraint models. The following describes the tunnel bandwidth resource recovery method provided by this embodiment based on two common bandwidth constraint models:

MAM (Maximum Allocation Model):

The MAM maps a BC into a CT. The link bandwidth is simply allocated between different CTs. Take 3 CTs as an example. The MAM allocation mode is shown in Figure 8. The constraints of MAM are as follows:

The maximum reserved bandwidth is the sum of the individual bandwidth constraints BC;

Assuming that two bandwidth constraints, BC _i and BC _j (i<j), are set, they are satisfied that the bandwidth between BC _i and BC _j must not be used with each other. The constraints of the MAM model are relatively simple. If a bandwidth is insufficient when a new tunnel is established in each BC, the bandwidth resources need to be preempted in the BC. For example, as shown in Figure 9, the LSPs of all the tunnels in each BC are mapped to the same CT. The LSPs carried on BC0 are all CT0, and the LSPs carried on BC1 are CT1. . When resource preemption occurs, resource preemption between tunnels occurs in the same BC, ensuring that traffic of other categories is not affected. For the MAM constraint model, the internal data management model is shown in Figure 10. Each BC is managed independently. The tunnels in each BC are the same CT. In the event of resource preemption, in the same BC, according to the above three The principle of resource recovery is to recycle bandwidth resources. The specific processing flow is as follows:

When a new link is to be established within a bandwidth constraint, in the case where the remaining bandwidth resources are insufficient, the link with the lowest priority is maintained in the established link within the bandwidth constraint, and the selection is sufficient to satisfy the new link. On the basis of the required bandwidth, the link with the least amount of link data and the smallest redundant bandwidth of the link is removed for removal.

RDM (Russian Dolls Model, Russian doll model)

The RDM model allows shared bandwidth between CTs. The direct constraints of BC are as follows:

Max-te-resv-bw≥BC0≥BC1≥BC2≥BC3≥BC4≥BC5≥BC6≥BC7;

Assuming that two bandwidth constraints, BC _i and BC _j (i<j), are set, they satisfy the following two conditions:

BC _j bandwidth to be guaranteed, if BC _j of unused bandwidth, BC _i can use; that is to say, in BC _i BC _j using the bandwidth, while the remaining BC _j insufficient bandwidth allocation, to the allocated BC _i recycling, to ensure the bandwidth utilization of BC _j .

BC _j must not use the bandwidth of BC _i .

Taking 3 CTs as an example, the BC limit of RDM is shown in Figure 11. The bandwidth of BC2 is only allowed to be used by CT2. The traffic of CT2 is BC2. The traffic of BC1 is allowed to be used by CT1 and CT2. The maximum of CT1 can be BC2. When CT2 is used. When it is insufficient, the bandwidth of CT1 is recovered.

Since the bandwidth between BCs in this model can be shared, when the CT has insufficient bandwidth in the same BC, it is also considered whether the bandwidth of the BC has been low-level CT (low-level CT is lower than BC). Corresponding to CT). Each BC has a guaranteed bandwidth when it is allocated. When the sum of the used bandwidth and the remaining available bandwidth in the BC is less than the guaranteed bandwidth, it indicates that the BC bandwidth has been occupied by the low-level CT at this time. On the other hand, if the sum of the used bandwidth and the remaining bandwidth in the BC is greater than the guaranteed bandwidth, it indicates that the CT in the BC occupies a bandwidth of a high-level CT (high-low-level CT, that is, a level higher than a CT corresponding to the BC). It can be seen that a bandwidth constraint management table between BCs is to be established to quickly calculate and search for occupants for bandwidth recovery when resource sharing occurs, as shown in Table 1 and Table 2 below.

Table 1

TYPETYPE	max-bandwidthMax-bandwidth	guaranteed-bwGuaranteed-bw	used-bwUsed-bw	remained-bwMetic-bw
BC0BC0	20M20M	10M10M	0M0M	10M10M
BC1BC1	10M10M	5M5M	0M0M	5M5M
BC2BC2	5M5M	5M5M	0M0M	5M5M

Table 2

TYPETYPE	max-bandwidthMax-bandwidth	guaranteed-bwGuaranteed-bw	used-bwUsed-bw	remained-bwMetic-bw
BC0BC0	20M20M	10M10M	15M15M	0M0M
BC1BC1	10M10M	5M5M	0M0M	0M0M
BC2BC2	5M5M	5M5M	0M0M	5M5M

Among them, Table 1 is a bandwidth management constraint table, which is an initialization table. Table 2 shows the update of each entry data when the low-level CT occupies a high-level CT bandwidth. The meaning of each field in the entry is as follows:

Max-bandwidth

Indicates that the maximum bandwidth available for BC _i (0 ≤ _i ≤ 7) is to satisfy the first constraint of the RDM;

Guaranteed-bw

The guaranteed bandwidth, that is, the bandwidth that is guaranteed to be allocated to CT _i and cannot be preempted by other CTs, is in accordance with the constraints of RDM: guarannteed-bw _i = BC _{j -} BC _i (i < j).

Used-bw

The bandwidth actually allocated to the corresponding CT _i application in BC _i is not considered for the bandwidth shared by other CTs, that is, used-bw _i = ∑ CT _i .

Retaind-bw

Guaranneteed-bw _i deducts the remaining value after the bandwidth occupied by CT _i and CT _j .

When CT _i has a link-building requirement, the process of allocating bandwidth is as follows:

The first case: if the remaining bandwidth of BC _i can meet the bandwidth requirement of CT _i , the used bandwidth and remaining bandwidth attribute of BC _i , that is, the bandwidth of CT _i is obtained from BC _i .

The second case: if the remaining bandwidth of BC _i cannot meet the bandwidth requirement of CT _i , then whether the remaining bandwidth of BC _j (j>i) is satisfied, and when the remaining bandwidth can be satisfied, the remaining bandwidth of BC _j is updated. The bandwidth used by BC _i , that is, the bandwidth of CT _i is borrowed from the guaranteed bandwidth of BC _j . At this time, there is a case where high-level CT bandwidth is occupied.

The third case: However, when a query has to CB _7, the remaining bandwidth is found to not meet the requirements of the CT _i, it is checked whether the attribute used-bw _i _I BC is less than guarannteed-bw _i, when less than described BC _{If i} has borrowed bandwidth from other BCs, check the relationship between used-bw and guaranteed-bw from BC _i-1 to the low priority direction until BC _k (k<i) is found to have used-bw>guaranteed-bw , indicating that its corresponding CT borrows the bandwidth resources of BC _i , and BC _k may also have the bandwidth borrowed by other BCs, so continue to traverse backwards until it finds the “originator” BC _j (ie borrowing other BC bandwidth resources) Priority BC). In this embodiment, BC _j may also be a plurality of BCs, and then the bandwidth attributes from BC _j to BC _k to BC _i are regression updated. Firstly, it is necessary to recover BC _j borrowing resources to ensure that BC _k can meet the requirements of its own CT chain building, and then release the bandwidth borrowed by BC _k to BC _i to meet the chain building of CT _i . In this embodiment, it may not be necessary. The bandwidth borrowed by BC _k is released to BC _i . When recovering the borrowed resources of BC _j , look up the resource management entries established by the corresponding BC, as shown in Figure 10, and find the lowest priority tunnel that meets the principle of resource recovery for recycling.

If the bandwidth requirements of CT _i cannot be met through the above three cases, the corresponding tunnel establishment is unsuccessful.

Based on the foregoing analysis, the method for implementing the tunnel bandwidth resource recovery in this embodiment based on the RDM model specifically includes the following process: when a new link of the first traffic class is to be established in the first bandwidth constraint, the remaining bandwidth in the first bandwidth constraint If the sum of the borrowable bandwidth and the remaining bandwidth is still insufficient to meet the establishment requirement, determine whether the bandwidth in the first bandwidth constraint is borrowed by the second traffic category, and the second traffic class has a lower level than the first traffic. Level of the category; in the case that the second traffic class borrows the bandwidth in the first broadband constraint, starting from the second broadband constraint, sequentially determining whether the bandwidth in the remaining bandwidth constraints corresponding to the other traffic classes is borrowed, and obtaining the judgment result, the other The level of the traffic class is lower than the level of the second traffic class, and the borrowed bandwidth in the remaining bandwidth constraints is recovered on the principle that the number of removed links in each bandwidth constraint of the occupied bandwidth is the smallest and the redundant bandwidth of the removed link is minimized.

The embodiment of the present disclosure establishes a set of general traffic bandwidth management model, which is composed of different data structure entries. When resource preemption occurs, data structure entries are quickly searched according to different traffic models, which can quickly locate the optimal available resources, ensure the establishment of new links, and realize the impact on other services in the process. Minimization and minimization of resource waste.

Device embodiment

The embodiment provides a tunnel bandwidth resource recovery device, which can be used to implement the tunnel broadband resource recovery method involved in the foregoing method embodiment, and FIG. 12 is a structural block diagram of the device 120, as shown in FIG. Device 120 includes the following components:

The module 121 is configured to set a link with the lowest priority from the established link when the remaining bandwidth resource is insufficient, and select a bandwidth sufficient to meet the required bandwidth of the target link. On the basis of the removal, the link with the least amount of link data and the least redundant link bandwidth is removed for removal;

The new module 122 is configured to create a new target link based on the bandwidth obtained by tearing down the link.

The apparatus 120 provided in this embodiment may further include:

Establishing a module, configured to associate each retention priority of the established link with the ordered linked list before the new target link is established, and the ordered linked list includes at least one established link and the link is allocated. According to the creation module, the removal module is configured to: start to find the link to be removed from the ordered list corresponding to the lowest priority priority of the established link, and after the search is successful, The discovered link is removed; wherein the ordered list is sorted according to the link establishment priority of the established link.

In a specific embodiment, the teardown module 121 is configured to maintain a priority in the established link within the bandwidth constraint when a new link is to be established within a bandwidth constraint, in the event that the remaining bandwidth resources are insufficient. The lowest link starts, and the link with the least amount of link data and the smallest redundant bandwidth of the link is removed for removal on the basis of sufficient bandwidth for the new link.

In another specific example, the removing module 121 includes:

The determining unit is configured to: when a new link of the first traffic class is to be established in the first bandwidth constraint, the remaining bandwidth is insufficient in the first bandwidth constraint, and the sum of the borrowable bandwidth and the remaining bandwidth is still insufficient to satisfy If the requirement is established, determining whether the bandwidth in the first bandwidth constraint is borrowed by the second traffic class, the level of the second traffic class is lower than the level of the first traffic class; and the removing unit is configured to borrow the first in the second traffic class. In the case of the bandwidth in the broadband constraint, starting from the second broadband constraint, it is sequentially determined whether the bandwidth in the remaining bandwidth constraints corresponding to the other traffic classes is borrowed, and the judgment result is obtained, and the rank of the other traffic class is lower than the level of the second traffic class. The borrowed bandwidth in the remaining bandwidth constraints is recovered on the principle that the number of removed links in each bandwidth constraint of the occupied bandwidth is the smallest and the redundant bandwidth of the removed link is minimized.

Those of ordinary skill in the art will appreciate that all or some of the steps, systems, and functional blocks/units of the methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be composed of several physical The components work together. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on a computer readable medium, which may include computer storage media (or non-transitory media) and communication media (or transitory media). As is well known to those of ordinary skill in the art, the term computer storage medium includes volatile and nonvolatile, implemented in any method or technology for storing information, such as computer readable instructions, data structures, program modules or other data. Sex, removable and non-removable media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridge, magnetic tape, magnetic disk storage or other magnetic storage device, or may Any other medium used to store the desired information and that can be accessed by the computer. Moreover, it is well known to those skilled in the art that communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and can include any information delivery media. .

While the exemplary embodiments of the present disclosure have been disclosed for illustrative purposes, those skilled in the art will recognize that various modifications, additions and substitutions are possible, and the scope of the present disclosure should not be limited to the embodiments described above.

Industrial applicability

The embodiment of the present disclosure establishes a set of general traffic bandwidth management model, which is composed of different data structure entries. When resource preemption occurs, data structure entries are quickly searched according to different traffic models, which can quickly locate the optimal available resources, ensure the establishment of new links, and realize the impact on other services in the process. Minimize and minimize waste of resources.

Claims

A tunnel bandwidth resource recovery method includes:

When a new target link is created, if the remaining bandwidth resources are insufficient, the link with the lowest priority is maintained from the established link, and the bandwidth is selected to be sufficient to meet the required bandwidth of the target link. The link with the least amount of link data and the least redundant link bandwidth is removed (401);

The target link is created (402) based on the bandwidth obtained by tearing down the link.
The method of claim 1 wherein the method further comprises:

Before each of the target links is created, each retention priority of the established link is associated with an ordered list, and the ordered list includes at least one established link and the link is allocated. Information about the bandwidth;

The selection is performed on the basis of the bandwidth required for the target link, and the link with the least amount of link data and the least redundant bandwidth of the link is removed, including:

The first link combination of at least one to-be-removed link that satisfies the target link bandwidth requirement is searched for from the ordered linked list corresponding to the lowest-priority priority in the established link, and the selected The second link combination with the smallest number of links needs to be removed in the first link combination, and the third link combination with the smallest redundant bandwidth is selected in the second link combination, and the third link combination is removed. link.
The method according to claim 2, wherein the ordered list is sorted in the order of the link establishment priorities of the established links.
The method according to claim 1, wherein when the new target link is newly created, in the case that the remaining bandwidth resources are insufficient, the link having the lowest priority is maintained from the established link, and the selection is sufficient. Based on the required bandwidth of the target link, the link with the least amount of link data removed and the minimum redundant bandwidth of the link is removed (401), including:

When a new link is about to be established within a bandwidth constraint, in the case where the remaining bandwidth resources are insufficient, the link with the lowest priority is maintained in the established link within the bandwidth constraint, and the selection is sufficient to satisfy the new link. On the basis of the required bandwidth of the road, the link with the least amount of link data removed and the minimum redundant bandwidth of the link is removed for removal.
The method according to claim 1, wherein when the new target link is newly created, in the case that the remaining bandwidth resources are insufficient, the link having the lowest priority is maintained from the established link, and the selection is sufficient. Based on the required bandwidth of the target link, the link with the least amount of link data removed and the minimum redundant bandwidth of the link is removed (401), including:

When a new link of the first traffic class is to be established in the first bandwidth constraint, the remaining bandwidth in the first bandwidth constraint is insufficient, and the sum of the borrowable bandwidth and the remaining bandwidth is still insufficient to satisfy the establishment requirement. Determining whether the bandwidth in the first bandwidth constraint is borrowed by the second traffic class, the level of the second traffic class being lower than the level of the first traffic class;

When the second traffic class borrows the bandwidth in the first broadband constraint, starting from the second broadband constraint, sequentially determining whether the bandwidth in the remaining bandwidth constraints corresponding to the other traffic classes is borrowed, and obtaining a determination result The rank of the other traffic class is lower than the level of the second traffic class, and the rest is recovered according to the principle that the number of removed links in each bandwidth constraint of the occupied bandwidth is the smallest and the redundant bandwidth of the link is minimized. The bandwidth borrowed in the bandwidth constraint.
A tunnel bandwidth resource recovery device (120) includes:

The module (121) is removed, and when a new target link is created, if the remaining bandwidth resources are insufficient, the link with the lowest priority is maintained from the established link, and the selection is sufficient to satisfy the target link. On the basis of the required bandwidth, remove the link with the least amount of link data and remove the link with the least redundant bandwidth to remove it;

The new module (122) is configured to create the target link based on the bandwidth obtained by dismantling the link.
The device (120) of claim 6, wherein the device (120) further comprises:

Establishing a module, configured to: prior to creating the target link, associate each retention priority of the established link with an ordered list, where the ordered list includes at least one established link and Information about the bandwidth allocated by the link;

The removal module (121) is configured to:

The first link combination of at least one to-be-removed link that satisfies the target link bandwidth requirement is searched for from the ordered linked list corresponding to the lowest-priority priority in the established link, and the selected The second link combination with the smallest number of links needs to be removed in the first link combination, and the third link combination with the smallest redundant bandwidth is selected in the second link combination, and the third link combination is removed. link.
The apparatus (120) according to claim 7, wherein the ordered list is sorted in the order of the link establishment priorities of the established links.
The device (120) according to claim 6, wherein the removal module (121) is configured to:

When a new link is about to be established within a bandwidth constraint, in the case where the remaining bandwidth resources are insufficient, the link with the lowest priority is maintained in the established link within the bandwidth constraint, and the selection is sufficient to satisfy the new link. On the basis of the required bandwidth of the road, the link with the least amount of link data removed and the minimum redundant bandwidth of the link is removed for removal.
The device (120) according to claim 6, wherein the removal module (121) comprises:

The determining unit is configured to: when a new link of the first traffic class is to be established in the first bandwidth constraint, the remaining bandwidth is insufficient in the first bandwidth constraint, and the sum of the borrowable bandwidth and the remaining bandwidth is still insufficient to satisfy If the requirement is established, determining whether the bandwidth in the first bandwidth constraint is borrowed by the second traffic class, where the level of the second traffic class is lower than the level of the first traffic class;

Demolition unit, configured to determine, in the second traffic class, the bandwidth in the first broadband constraint, starting from the second broadband constraint, sequentially determining whether the bandwidth in the remaining bandwidth constraints corresponding to other traffic classes is Borrowing, obtaining a judgment result, the level of the other traffic class is lower than the level of the second traffic class, and the number of links that are removed in each bandwidth constraint of the occupied bandwidth is the smallest and the redundant bandwidth of the link is minimized. The principle recovers the borrowed bandwidth in the remaining bandwidth constraints.
A computer readable storage medium storing computer executable instructions that, when executed by a processor, implement the method of any of claims 1-5.