WO2010025659A1 - Method, apparatus and system for admittance of label switching path - Google Patents

Abstract

A method, an apparatus and a system for admittance of a Label Switching Path(LSP) are disclosed by the embodiments. Way nodes add the reserved bandwidth information in a message. Access nodes compute and judge whether the following access conditions are satisfied according to the link bandwidth information issued by the way nodes: if the sum of the reserved bandwidth of each service type being not lower than the access priority and corresponding to the access LSP in the link adds  new access bandwidth request of the service type, and the results are all not larger than respective bandwidth restriction, then the LSP is allowed to be accessed; otherwise, the reserved bandwidth sum of each service type in the link is computed and added with the bandwidth sum which is newly accessed in the LSP, if the result is not larger than the largest reserved bandwidth of the link, then the LSP is allowed to be accessed. The invention can be applied to access the LSP burdening service flows of a plurality of service types through the link in the largest reserved distribution model.

Description

 The present invention claims to be filed on September 2, 2008, to the Chinese Patent Office, Application No. 200810146548. The Chinese patent application entitled "Admission Method and System for Label Switching Paths" Priority is hereby incorporated by reference in its entirety.

Technical field

 The present invention relates to the field of communications, and in particular, to a method, device, and system for accessing a label switched path.

Background technique

 During data communication, the router determines a path based on the source and destination ports of the packet. Packets with the same source and destination ports can be forwarded on this path to form a data stream. Traffic Engineer (TE) selects the path for traffic based on current network resource usage or special placement requirements for certain traffic.

 Mul t i-Protocol Label Swi tching (MPLS) refers to the existence of several nodes on the data transmission path. Each node stores an input/output tag mapping table. When the data stream flows into the node, the node is data. The stream is labeled with the next hop; and the Label Swi tched Path (LSP) is the label sequence of each node on the path from the source to the terminal. It can be said that the data transmission occurs on the LSP.

 MPLS TE combines MPLS technology with traffic engineering. If the source end wants to transmit voice services, first determine the load of each link in the current network, and the congestion node; then bypass the congestion node, select the link with less load, and establish an LSP from the source to the terminal. A part of the bandwidth resource is allocated to the LSP as a reserved bandwidth resource of the voice service. Similarly, bandwidth resources can be reserved for image services.

 DiffServ is a common service model for ensuring Quality of Service (Qos). Voice, image and other services are divided into different service levels, and network resources are allocated hierarchically.

DiffServ-Aware TE combines MPLS TE and DiffServ. DiffServ- Aware TE will Service traffic such as voice and image is divided into 8 service types (Class Type, CT); from CT0 to CT7, each CT is limited to the dedicated bandwidth that can be allocated; that is, different bandwidth constraints are imposed on different CTs (Bandwidth) Constraint, BC).

 Each CT is divided into eight priority levels by service level, from 0 (indicated by P0) to 7 (indicated by P7), with P0 having the highest priority and P7 having the lowest priority. Assuming that the CT type is CTc and the priority is Pk, it is expressed as TE-Class (CTc, Pk).

 The process of allocating reserved resources for the TE_Class (CTc, Pk) of an LSP by the DiffServ-Aware TE is:

 DiffServ-Aware TE determines the bandwidth constraint range of the CTO ~ CT7;

 Determining the service type of the TE-Class (CTc, Pk); the bandwidth constraint corresponding to the service type; selecting the link that meets the bandwidth requirement within the bandwidth constraint, establishing an LSP from the source to the terminal; A part of the bandwidth resource serves as the reserved bandwidth resource of the TE-Class (CTc, Pk) service.

 When the available bandwidth of a CT is tight, the traffic with the highest priority of the CT can preempt the bandwidth resources occupied by the lower priority traffic.

 RFC 3564 defines the "bandwidth constraint model" to represent the relationship between CT and BC. There are three types of bandwidth constraint models proposed by the industry: Maximum Allocation Bandwidth Constraints Model (MAM), Russian Dolls Bandwidth Constraints Model (RDM), and Max Allocation with Reservation Bandwidth Constraints Model. , MAR).

 The MAR model combines the advantages of the MAM and RDM models: When other CTs have no service access, a CT can occupy dedicated bandwidth allocated to other CTs, allowing bandwidth to be shared between CTs in the uncongested state of the link, thereby increasing bandwidth. Utilization: When other CTs have service access, the CT reclaims the dedicated bandwidth allocated to other CTs, and prohibits occupying the dedicated bandwidth of other CTs across the CT in the link congestion state, thereby ensuring the isolation of bandwidth between CTs.

The shared bandwidth of the MAR model, that is, the bandwidth shared by each CT that is not allocated to any CT. In When the bandwidth resources are tight, each CT occupies the shared bandwidth by priority, and the high priority can preempt the bandwidth occupied by the traffic with lower priority.

 A single CT LSP, that is, an LSP can only transmit traffic of one CT. Multi-CT LSP, that is, one LSP can transmit traffic of multiple CTs, and each CT in multiple CT LSPs has the same priority.

 When the various bandwidth constraint model protocols are proposed, there is no multi-CT LSP technology. Therefore, the internal gateway protocol (IGP) broadcasts the link without bandwidth information (TE-Class Unreserved BW Sub-TLV, TE information). It is based on the single CT LSP technology. The TE information currently broadcast by the IGP contains the unreserved bandwidth information of each TE_Class (CT, Priority).

 The method for performing the admission calculation of the single CT LSP in the MAR model is as follows: H. The single CT LSP transmits a TE_Class (CT, Priority) traffic, and the TE-Class (CT, Priority) is obtained from the TE information broadcast by the IGP. The unreserved bandwidth information, when the unreserved bandwidth of the TE-Class (CT, Priority) satisfies the bandwidth requirement of the TE-Class (CT, Priority) of the CT LSP, the single CT LSP is allowed to access.

 If the multi-CT LSP is used for the admission calculation under the MAR model as described above: It is assumed that the multi-CTLSP transmits the traffic of TE-Class (CTm, Pi) and TE-Class (CTn, Pi). The TE-Class (CTm, Pi) bandwidth requirement is 5 OM; the TE-Class (CTn, Pi) bandwidth requirement is 40M. Obtained from the TE information of the IGP broadcast: The unreserved bandwidth of the TE-Class (CTm, Pi) is 50M, and the unreserved bandwidth of the TE-Class (CTn, Pi) is 40M. The unreserved bandwidth of the TE-Class (CTm, Pi) satisfies the bandwidth requirement of the TE-Class (CTm, Pi) of the multi-CTLSP; the unreserved bandwidth of the TE-Class (CTn, Pi) satisfies the TE_Class of the multi-CT LSP. The bandwidth requirement of (CTn, Pi), the multi-CT LSP is allowed to access.

However, the unreserved bandwidth of the link is actually 60M, which is smaller than the sum of the bandwidth requirements of the TE_Class (CTm, Pi) and TE-Class (CTn, Pi) of the multi-CT LSP, that is, the TE-Class (CTm, Pi) The unreserved bandwidth overlaps with the unreserved bandwidth of the TE-Class (CTn, Pi). The result of the admission calculation using this method is theoretically to satisfy the bandwidth requirement of the multi-CT LSP, but the bandwidth is actually implemented. It failed when reserved.

 Therefore, only knowing the specific shared bandwidth value of each TE_Clas s (CT, Pr iority) across the CT can avoid the shared bandwidth part being reused and successfully preserving the bandwidth for the multi-CT LSP.

 In the process of implementing the present invention, the inventors have found that at least the following problems exist in the prior art: At present, the TE information of the IGP broadcast is insufficient. When the multi-CT LSP is connected to the link of the MAR model, the TE information according to the current broadcast cannot be performed. Accurate access calculations. Summary of the invention

 The embodiments of the present invention provide a method, a device, and a system for permitting label switching paths, so that when multiple CT LSPs are connected to the link of the MAR model, accurate admission calculation can be performed.

 In order to achieve the above object, embodiments of the present invention use the following technical solutions:

 A method for accessing a label switched path, including:

 Receiving an access request of a label switching path that carries a service flow of at least two service types; acquiring a service type of the service flow carried by the label switching path in the access request, as an access service type;

 Obtaining a priority of the service flow carried by the label switching path in the access request, as an access priority;

 Obtaining a request access bandwidth of each access service type in the access request;

 Obtaining reserved bandwidth information on the link requested to be accessed in the local traffic engineering database, the maximum reservable bandwidth of the link, and the bandwidth constraint of each service type;

 Obtaining the sum of the reserved bandwidths of each access service type not lower than the access priority, and adding the sum of the reserved bandwidths to the requested access bandwidth of the access service type, and obtaining the result The total access bandwidth of the access service type;

 Determining whether the total access bandwidth of each access service type is not greater than the bandwidth constraint of the access service type, and if so, allowing the link to access the label switching path.

A node for admission of a label switched path, comprising: An access request receiving unit, configured to receive an access request of a label switching path that carries a service flow of at least two service types;

 a service type obtaining unit, configured to acquire a service type of a service flow carried by the label switching path in the access request, as an access service type;

 a priority acquiring unit, configured to acquire a priority of a service flow carried by the label switching path in the access request, as an access priority;

 a bandwidth information acquiring unit, configured to acquire a request access bandwidth of each service type in the access request, and obtain the reserved bandwidth information on the link that is requested to be accessed in the local traffic engineering database, and the link is maximum Reserve bandwidth, bandwidth constraints for each service type;

 a total bandwidth obtaining unit, configured to acquire a sum of reserved bandwidths of each access service type, not lower than an access priority; and summing the reserved bandwidths, plus the access service type Requesting access bandwidth, and obtaining the result as the total access bandwidth of the access service type;

 The access unit is configured to allow the link to access the label switching path when the total access bandwidth of each access service type is not greater than the bandwidth constraint of the access service type.

 An access system for a label switched path, including a node along the path and an access node;

The path node is configured to add reserved bandwidth information of each defined service type and priority combination to the internal gateway protocol message; send the internal gateway protocol message to the access node; And an access request for receiving a label switching path of a service flow carrying at least two service types; acquiring a service type of the service flow carried by the label switching path in the access request, as an access service type; The priority of the service flow carried by the label switching path in the access request as the access priority; obtaining the requested access bandwidth of each access service type in the access request; and acquiring the local traffic engineering database The bandwidth information, the maximum reservable bandwidth of the link, and the bandwidth constraint of each service type are reserved on the link requesting access; the reserved bandwidth is obtained when each access service type is not lower than the access priority. Sum, the sum of the reserved bandwidth, plus the request access bandwidth of the access service type, and the obtained result is used as the access type access Total bandwidth; the total access bandwidth of each access service type is not greater than the access service type The bandwidth is allowed to allow the link to access the label switched path.

 In the embodiment of the present invention, the node along the way adds the reserved bandwidth information to the internal gateway protocol packet; the access node may calculate according to the reserved bandwidth information provided by the packet and the requested bandwidth information of the label switched path requested to be accessed. If the bandwidth of the access service type is required to be reserved after accessing the label switching path, it is determined whether the bandwidth required for each access service type after accessing the label switching path is not greater than Bandwidth constraints for the respective service type; if yes, access to the label switched path is allowed. In the process of calculation and judgment, the problem that the shared bandwidth is repeatedly occupied is avoided, and the effect of accurately performing the admission calculation of the bearer label switching path is achieved.

DRAWINGS

 In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below. Obviously, the drawings in the following description are only It is a certain embodiment of the present invention, and other drawings can be obtained from those skilled in the art without any inventive labor.

 FIG. 1 is a schematic diagram of a method for extending link bandwidth information according to an embodiment of the present invention; FIG.

 2 is a structural diagram of an extended TLV according to an embodiment of the present invention;

 3 is a schematic diagram of a method for acquiring link bandwidth information according to an embodiment of the present invention;

 4 is a schematic diagram of an admission method of a label switching path according to an embodiment of the present invention;

 FIG. 5 is a schematic diagram of another method for admission of a label switching path according to an embodiment of the present invention; FIG.

 FIG. 6 is a schematic structural diagram of a node for admission of a label switching path according to an embodiment of the present invention; FIG. 7 is a structural diagram of an admission system of a label switching path according to an embodiment of the present invention.

detailed description

 The method and system for extending link bandwidth information, acquiring link bandwidth information, and label switching path according to an embodiment of the present invention are described in detail below with reference to the accompanying drawings.

 As shown in FIG. 1, a method for extending link bandwidth information includes:

101. Add, in the internal gateway protocol packet, the reserved bandwidth information of the defined service type and its priority combination; Add a value field in the message; add reserved bandwidth information of each defined service type and its priority combination in the value field.

 Adding an extended TLV to the IGP packet, where the TLV includes a Type field, a Length field, and a value (Va lue) field (the newly added TLV format is as shown in FIG. 2); To preserve undefined fields. The Length field is filled with the length of the Va lue field in bytes. Add the reserved bandwidth information of each TE-Clas s in the Va lue field. The reserved bandwidth information is added to the Va lue field in the order of TE-Clas s O, TE-Clas s TE-Clas s 2 TE-Clas s 7.

 102. Broadcast the internal gateway protocol packet, so that the access node performs the admission calculation and determination of the label switching path according to the reserved bandwidth information in the packet.

 The method for extending the bandwidth information of the link provided by the embodiment of the present invention adds the reserved bandwidth information of each defined service type and its priority to the internal gateway protocol packet, and broadcasts the packet in the specified network. . Therefore, the link bandwidth information of the internal gateway protocol packet is expanded, so that the access node can accurately calculate the access based on the reserved bandwidth information provided by the internal gateway protocol packet.

 As shown in FIG. 3, a method for obtaining link bandwidth information includes:

 301. Receive an internal gateway protocol packet.

 302. Obtain link bandwidth information in the internal gateway protocol packet, where the link bandwidth information includes reserved bandwidth information on the link.

 The link bandwidth information further includes: unreserved bandwidth information, maximum reservable bandwidth of the link, and bandwidth constraint of each service type.

 303. Add the link bandwidth information to a local traffic engineering database.

The method for obtaining link bandwidth information provided by the embodiment of the present invention obtains link bandwidth information in the packet by receiving an internal gateway protocol packet, where the link bandwidth information includes reserved bandwidth information on the link. Add the link bandwidth information to the local traffic engineering database. Therefore, accurate admission calculation can be performed according to the reserved bandwidth information of the acquired link. As shown in FIG. 4, a method for accessing a label switching path includes:

 401. Receive an access request of a label switching path that carries a service flow of at least two service types.

The service type of the service flow carried by the label switching path in the access request is obtained as an access service type.

 403. Obtain a priority of a service flow carried by the label switching path in the access request, as an access priority.

 404. Obtain a request access bandwidth of each access service type in the access request.

 405. Obtain reserved bandwidth information, maximum reservable bandwidth of the link, and bandwidth constraint of each service type on the link that is requested to be accessed in the local traffic engineering database.

 406. Acquire a sum of reserved bandwidths of each access service type when not lower than the access priority;

407. The sum of the reserved bandwidths to be obtained is added to the requested access bandwidth of the access service type, and the obtained result is used as the total access bandwidth of the access service type.

 408. Determine whether the total access bandwidth of each access service type is not greater than a bandwidth constraint of the access service type.

 409. If yes, allow the link to access the label switching path.

 The method for obtaining a label switching path according to the embodiment of the present invention calculates, by accessing the label switching path, each access according to the obtained reserved bandwidth information and the requested bandwidth information of the label switching path that is requested to be accessed. The bandwidth required to be reserved for the service type; determining whether the bandwidth required for each access service type is not greater than the bandwidth constraint of the respective service type after accessing the label switching path; if yes, allowing the connection Enter the label switching path. During the calculation and judging process, the problem that the shared bandwidth is repeatedly occupied is avoided, and the effect of accurately performing the admission calculation of the bearer label switching path is achieved.

 As shown in FIG. 5, a method for accessing a label switching path includes:

 501. Receive an access request of a label switched path carrying a service flow of at least two service types; for example, receiving an access request of an LSP carrying a service flow of two service types.

502. Obtain a service type of a service flow carried by a label switching path in the access request, where For access service type;

 For example, if the service type of the service flow carried by the LSP that is requested to access is CT0 and CT1, CT0 and CT1 are access service types.

 503. Obtain a priority of a service flow carried by the label switching path in the access request, as an access priority.

 For example, the priority of the service flow carried by the LSP is P3, and P3 is the access priority.

504. Obtain a request access bandwidth of each access service type in the access request, and determine a request access bandwidth of the TE_Class<CTO, P3> carried by the LSP as a Request [TE-Class<CTO, P3> ], determining that the request access bandwidth of the ΤΕ-Class<CT1, Ρ3> carried by the LSP is Request [TE-Class<CTl, P3>].

 505. Obtain reserved bandwidth information, maximum reservable bandwidth of the link, and bandwidth constraint of each service type on the link that is requested to be accessed in the local traffic engineering database.

 The link bandwidth information is obtained from the local traffic engineering database, including the bandwidth model, the bandwidth constraint (BC) of each service type, and the reserved bandwidth information of each TE-Class of the link.

 506. Acquire each of the access service types, and the sum of the reserved bandwidths when the access priority is not lower than the access priority; the access service type CT0, the reserved bandwidth that is not lower than the access priority P3.

Reserved [TE-Class<CT0, Py>] (y <= 3).

 Therefore, for the access service type CTO, the sum of the reserved bandwidths not lower than the access priority P3 is ∑Reserved[TE-Class<CTO, Py>] (y <= 3).

 Access service type CT1, reserved bandwidth not lower than access priority P3 is Reserved [TE-Class<CTl, Py>] (y <= 3).

 Therefore, for the access service type CT1, the sum of the reserved bandwidths not lower than the access priority P3 is ∑Reserved[TE-Class<CTl,Py>] (y <= 3).

 507. The sum of the reserved bandwidths to be obtained, plus the requested access bandwidth of the access service type, and the obtained result is used as the total access bandwidth of the access service type;

Access service type CT0, not less than the sum of reserved bandwidth of access priority P3 plus access service The request access bandwidth of the service type CTO is

 ∑Reserved[TE-Class<CTO, Py>] + Request [TE-Class<CTO, P3>] (y <= 3). Therefore, the total access bandwidth of the access service type CTO is

 ∑Reserved[TE-Class<CTO, Py>] + Request [TE-Class<CTO, P3>] (y <= 3). Access service type CT1, not less than the access priority P3, the sum of reserved bandwidth plus the access service type CT1 request access bandwidth is

 ∑ Reserved [TE-Class<CTl, Py>] + Reques t [TE-Class<CTl, P3>] (y <= 3). Therefore, the total access bandwidth of the access service type CT1 is

 ∑ Reserved [TE-Class<CTl, Py>] + Reques t [TE-Class<CTl, P3>] (y <= 3).

508. Determine whether the total access bandwidth of each access service type is not greater than a bandwidth constraint of the access service type.

 Determine whether the access bandwidth of CT0 and CT1 is not greater than its bandwidth constraint BC0.

BC1;

 If the total access bandwidth of the access service types CT0 and CT1 is not greater than the bandwidth constraints BC0 and BC1, that is, ∑Reserved[TE—Class<CT0, Py>] + Request [TE-Class<CTO, P3>] <= BCO (y <= 3) , and ∑Reserved[TE- Class<CTl, Py>]+ Request [TE-Class<CTl, P3>] <= BC1 (y <= 3) ,

 Then skip to step 511;

 Otherwise, if the total access bandwidth of the at least one access service type is greater than the bandwidth constraint of the service type, proceed to step 509.

 509. Obtain a sum of reserved bandwidths of all service types;

 The reserved bandwidth of each access service type needs to be determined, which may be:

 If an access service type is not lower than the access priority, the total bandwidth occupied is greater than the bandwidth constraint of the access service type, and the reserved bandwidth of the access service type is the access service type. The total bandwidth occupied when not lower than the access priority;

The access service type, when not lower than the access priority, the total bandwidth occupied includes The access service type requests access bandwidth.

 For example, if the access service type CTx (x=0, 1) is not lower than the access priority P3, the total bandwidth occupied is ∑ Reserved [TE-Class<CTx, Py>] + Request [TE-Class <CTx, P3>] (y <= 3);

 If the access service type CTx is not lower than the access priority P3, the total bandwidth occupied is greater than the bandwidth constraint BCx of the access service type CTx, that is, ∑ Reserved [TE-Class<CTx, Py>] + Request [TE- Class <CTx, P3>] > BCx (y <= 3),

 Then the access service type CTx reserved bandwidth Ax is ∑Reserved[TE- Class<CTx, Py>] + Request [TE-Class<CTx, P3>] (y <= 3).

 Or, if an access service type, at all priorities, the total bandwidth occupied is less than the bandwidth constraint of the access service type, the reserved bandwidth of the access service type is the access service type, and all priorities are Level, the total bandwidth occupied;

 The access service type, at all priorities, the total bandwidth occupied includes the requested access bandwidth of the access service type.

 For example, if the access service type CTx (x=0, 1), at all priorities, the total bandwidth occupied is ∑Reserved[TE—Class<CTx, Pi>] + Request [TE—Class<CTx, P3> ] ( 0 <= i <= 7).

 If access service type CTx, at all priorities, the total bandwidth occupied is less than the bandwidth constraint BCx of access service type CTx, ie [ Reserved [TE-Class<CTx, Pi>] + Request [TE- Class < CTx, P3>] < BCx ( 0 <= i <= 7),

 Then the access service type CTx reserved bandwidth Ax is ∑Reserved[TE_Class<CTx, Pi>] + Request [TE-Class <CTx, P3>] ( 0 <= i <= 7 ).

Or, if an access service type is not lower than the access priority, the total bandwidth occupied is not greater than the bandwidth constraint of the access service type, and the total bandwidth occupied at all priorities is not If the bandwidth constraint is less than the access service type, the reserved bandwidth of the access service type is a bandwidth constraint of the access service type. For example, if the access service type CTx is not lower than the access priority P3, the total bandwidth occupied is not greater than the bandwidth constraint BCx of the access service type CTx, and the total bandwidth occupied at all priorities. Not less than the bandwidth constraint BCx of the access service type CTx, ie [ Reserved [TE-Class<CTx, Py>] + Request [TE- Class <CTx, P3>] <= BCx (y <= 3 ) JL∑Reserved[ TE-Class<CTx, Pi>] + Request [TE-Class<CTx, P3>] > = BCx ( 0 <= i <= 7 ), then the reserved bandwidth Ax of the access service type CTx is BCx.

 In addition, the reserved bandwidth of each non-access service type on the link needs to be determined, which may be: if a non-access service type is not lower than the access priority, the total occupied bandwidth is greater than the non-access The bandwidth of the access service type, the reserved bandwidth of the non-access service type is the non-access service type, and the total bandwidth occupied when the access priority is not lower than the access priority;

 For example, when the non-access service type CTz (z≠0, 1) is not lower than the access priority P3, the total bandwidth occupied is ∑Reserved[TE-Class<CTz, Py>] (y <= 3 );

 If the non-access service type CTz is not lower than the access priority P3, the total bandwidth occupied is greater than the bandwidth constraint BCz of the non-access service type CTz, that is, ∑ Reserved [TE-Class<CTz, Py>] > BCz (y <= 3 ),

 The non-access service type CTz's reserved bandwidth Bz is ∑Reserved[TE-Class<CTz,Py>] (y <= 3).

 Or, if a non-access service type, at all priorities, the total bandwidth occupied is less than the bandwidth constraint of the non-access service type, the reserved bandwidth of the non-access service type is the non-access service type. , the total bandwidth occupied at all priorities;

 For example, the non-access service type CTz (z≠0, 1), at all priorities, the total bandwidth occupied is ∑Reserved[TE- Class<CTz, Pi>] ( 0 <= i <= 7 ).

 If the non-access service type CTz, at all priorities, the total bandwidth occupied is less than the bandwidth constraint BCz of the non-access service type CTz, ie ∑Reserved[TE- Class<CTz, Pi>] < BCz ( 0 < = i <= 7),

The reserved bandwidth Bz of the non-access service type CTz is ∑Reserved[TE-Class<CTz, Pi>] ( 0 <= i <= 7).

 Or, if a non-access service type is not lower than the access priority, the total bandwidth occupied is not greater than the bandwidth constraint of the non-access service type, and the total bandwidth occupied at all priorities The bandwidth constraint of the non-access service type is not less than the bandwidth constraint of the non-access service type, and the reserved bandwidth of the non-access service type is the bandwidth constraint of the non-access service type.

 For example, if the non-access service type CTz is not lower than the access priority P3, the total bandwidth occupied is not greater than the bandwidth constraint BCz of the non-access service type CTz, and is occupied at all priorities. The total bandwidth is not less than the non-access service type CTz bandwidth constraint BCz, ie ∑ Reserved [TE— Class<CTz, Py>] <=BCz( y<= 3 ) and ∑ Reserved [TE— Class<CTz, Pi>] > = BCz ( 0 <= i <= 7), then the reserved bandwidth Bz of the non-access service type CTz is BCz.

 After determining the access bandwidth of each access service type and each non-access service type, the sum of the reserved bandwidths of all access service types plus the sum of the reserved bandwidths of all non-access service types is obtained for all service types. The sum of bandwidth.

 For example, it is determined that the sum of reserved bandwidths A of all access service types is ∑Ax (x=0, 1), and the sum of reserved bandwidths B of all non-access service types is ΣΒζ(ζ≠0, 1), which is obtained for all service types. The sum of reserved bandwidth is Α+Β.

 510. Determine whether the sum of reserved bandwidths of all service types is not greater than a maximum reservable bandwidth of the link.

 For example, determine whether the sum of reserved bandwidths (Α+Β) for all service types is not greater than the maximum reservable bandwidth of the link.

 511. If yes, allow the link to access the label switching path.

 For example, if the total access bandwidth of the access service types CT0, CT1 is not greater than its bandwidth constraints BC0, BC1, the link is allowed to access the LSP.

 Alternatively, if the sum of reserved bandwidths (A+B) of all service types is not greater than the maximum reservable bandwidth of the link, the link is allowed to access the LSP.

512. Otherwise, the link is not allowed to access the label switched path. For example, if the sum of reserved bandwidths (A+B) of all service types is greater than the maximum reservable bandwidth of the link, the link is not allowed to access the LSP.

 The method for obtaining a label switching path according to the embodiment of the present invention calculates, by accessing the label switching path, each access according to the obtained reserved bandwidth information and the requested bandwidth information of the label switching path that is requested to be accessed. The bandwidth required to be reserved for the service type; determining whether the bandwidth required for each access service type is not greater than the bandwidth constraint of the respective service type after accessing the label switching path; if yes, allowing the connection Enter the label switching path. During the calculation and judging process, the problem that the shared bandwidth is repeatedly occupied is avoided, and the effect of accurately performing the admission calculation of the bearer label switching path is achieved. In addition, when the total access bandwidth of the at least one access service type is greater than the bandwidth constraint of the service type, the sum of the reserved bandwidths of all service types is calculated, and it is determined whether the total reserved bandwidth of all service types is not greater than the link maximum Leave the bandwidth, if yes, allow access to the label switched path, otherwise, access to the label switched path is not allowed. In the process of calculation and judgment, the problem that the shared bandwidth is repeatedly occupied is avoided, so that the admission calculation of the bearer label switching path can be further accurately performed.

 The embodiment of the present invention further provides a node for accessing a label switching path, as shown in FIG. 6, including:

 An access request receiving unit 601, configured to receive an access request of a label switching path that carries a service flow of at least two service types;

 The service type obtaining unit 602 is configured to obtain a service type of the service flow carried by the label switching path in the access request, as an access service type.

 The priority obtaining unit 603 is configured to obtain a priority of the service flow carried by the label switching path in the access request, as an access priority.

 The bandwidth information obtaining unit 604 is configured to acquire the requested access bandwidth of each service type in the access request, and obtain the reserved bandwidth information on the link that is requested to be accessed in the local traffic engineering database, and the link is the largest. Bandwidth can be reserved, bandwidth constraints for each service type;

The total bandwidth obtaining unit 605 is configured to acquire each access service type, not lower than the access priority. The sum of the reserved bandwidths; and the sum of the reserved bandwidths, plus the requested access bandwidth of the access service type, and the obtained result is used as the total access bandwidth of the access service type;

 The access unit 606 is configured to allow the link to access the label switching path when the total access bandwidth of each access service type is not greater than the bandwidth constraint of the access service type.

 In addition, the total bandwidth obtaining unit 605 is further configured to obtain a sum of reserved bandwidths of all service types when a total access bandwidth of the at least one access service type is greater than a bandwidth constraint of the access service type;

 The access unit 606 is further configured to allow the link to access the label switching path when the total reserved bandwidth of all service types is not greater than a maximum reservable bandwidth of the link.

 Further, the node further includes:

 An information adding unit, configured to add reserved bandwidth information of a defined service type and its priority combination in an internal gateway protocol message;

 The message broadcast unit is configured to broadcast the internal gateway protocol message, so that the access node performs the access calculation and determination of the label switching path according to the reserved bandwidth information in the internal gateway protocol message.

The node provided by the embodiment of the present invention calculates that each access service type needs to be reserved after accessing the label switching path according to the obtained reserved bandwidth information and the requested bandwidth information of the label switched path that is requested to be accessed. The bandwidth that is required to be reserved for each access service type after accessing the label switching path is not greater than the bandwidth constraint of the respective service type; if yes, the access to the label switching path is allowed. . In the process of calculation and judgment, the problem that the shared bandwidth is repeatedly occupied is avoided, and the effect of accurately performing the admission calculation of the bearer label switching path is achieved. In addition, when the total access bandwidth of the at least one access service type is greater than the bandwidth constraint of the service type, the sum of the reserved bandwidths of all service types is calculated, and it is determined whether the total reserved bandwidth of all service types is not greater than the link maximum Leave the bandwidth, if yes, allow access to the label switched path, otherwise, access to the label switched path is not allowed. In the process of calculation and judgment, the problem that the shared bandwidth is repeatedly occupied is avoided, so that the bearer label can be further accurately performed. Change the access calculation of the path.

 An embodiment of the present invention further provides a label switching path admission system, as shown in FIG. 7, including a path node 701 and an access node 702;

 The path node 701 is configured to add reserved bandwidth information of each defined service type and priority combination to the internal gateway protocol message; and send the message to the access node 702;

 The access node 702 is configured to receive an access request of a label switching path that carries a service flow of at least two service types, and obtain a service type of the service flow carried by the label switching path in the access request, as an access a service type; obtaining a priority of a service flow carried by the label switching path in the access request, as an access priority; acquiring a request access bandwidth of each access service type in the access request; and acquiring The bandwidth information of the link that is requested to be accessed in the local traffic engineering database, the maximum reservable bandwidth of the link, and the bandwidth constraint of each service type; obtaining the access service type is not lower than the access priority The sum of the reserved bandwidths, the sum of the reserved bandwidths, plus the requested access bandwidth of the access service type, and the obtained result is used as the total access bandwidth of the access service type; When the total access bandwidth of the access service type is not greater than the bandwidth constraint of the access service type, the link is allowed to access the label switching path.

 In addition, the access node 702 is further configured to acquire a sum of reserved bandwidths of all service types when the total access bandwidth of the at least one access service type is greater than the bandwidth constraint of the access service type; When the sum of reserved bandwidths of the type is not greater than the maximum reservable bandwidth of the link, the link is allowed to access the label switched path.

 In addition, the access node 702 is further configured to add the reserved bandwidth information of the defined service type and its priority in the internal gateway protocol packet, and broadcast the internal gateway protocol packet to facilitate the access node. And performing admission calculation and determination of the label switching path according to the reserved bandwidth information in the internal gateway protocol packet.

The access control system of the label switching path provided by the embodiment of the present invention adds the reserved bandwidth information to the internal gateway protocol packet by the node along the path; the reserved bandwidth information and link provided by the access node according to the packet Maximum reservable bandwidth, bandwidth constraints for each service type on the link, and requests The requested bandwidth information of the accessed label switching path is used for the calculation and judgment of the label switching path. During the calculation and judgment process, the problem that the shared bandwidth is repeatedly occupied can be avoided, and the effect of accurately performing the admission calculation of the bearer label switching path is achieved.

 A person skilled in the art can understand that all or part of the process of implementing the above embodiment method can be completed by a computer program to instruct related hardware, and the program can be stored in a computer readable storage medium. In execution, the flow of an embodiment of the methods as described above may be included. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), or a Random Acces s Memory (RAM).

 The above is only the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope of the present invention. It should be covered by the scope of the present invention. Therefore, the scope of the invention should be determined by the scope of the appended claims.

Claims

Claim  A method for accessing a label switching path, comprising:  Receiving an access request of a label switching path carrying a service flow of at least two service types; acquiring a service type of the service flow carried by the label switching path in the access request, as an access service type;  Obtaining a priority of the service flow carried by the label switching path in the access request, as an access priority level;  Obtaining a request access bandwidth of each access service type in the access request;  Obtaining reserved bandwidth information on the link requested to be accessed in the local traffic engineering database, the maximum reservable bandwidth of the link, and the bandwidth constraint of each service type;  Obtaining the sum of the reserved bandwidths of each access service type not lower than the access priority, and adding the sum of the reserved bandwidths to the requested access bandwidth of the access service type, and obtaining the result The total access bandwidth of the access service type;  Determining whether the total access bandwidth of each access service type is not greater than the bandwidth constraint of the access service type, and if so, allowing the link to access the label switching path.  The method for admission of a label switched path according to claim 1, further comprising: acquiring all if a total access bandwidth of the at least one access service type is greater than a bandwidth constraint of the access service type The sum of reserved bandwidth for the service type;  Determining whether the sum of reserved bandwidths of all service types is not greater than a link maximum reservable bandwidth; if yes, allowing the link to access the label switching path.  The method for obtaining a label switching path according to claim 2, wherein the sum of the reserved bandwidths of all the service types is specifically:  Determine the reserved bandwidth for each access service type;  Determine the reserved bandwidth for each non-access service type; The sum of the reserved bandwidths of all access service types, plus the sum of the reserved bandwidths of all non-access service types, is the sum of the reserved bandwidths of all service types. The method for granting a label switching path according to claim 3, wherein the determining the reserved bandwidth of each access service type includes:  If the total bandwidth occupied by an access service type is not lower than the access priority, which is greater than the bandwidth constraint of the access service type, the reserved bandwidth of the access service type is not lower than the access service type. The total bandwidth occupied when accessing the priority;  Or, if the total bandwidth occupied by an access service type at all priorities is less than the bandwidth constraint of the access service type, the reserved bandwidth of the access service type is when the access service type is at all priorities. Total bandwidth occupied;  Or, if the total bandwidth occupied by an access service type is not lower than the access priority, not greater than the bandwidth constraint of the access service type, and the total bandwidth occupied at all priorities is not less than the connection. The bandwidth constraint of the incoming service type is the bandwidth constraint of the access service type.  The method for the admission of the label switching path according to claim 4, wherein the total bandwidth occupied by the access service type is not lower than the access priority, specifically: Request access bandwidth of the access service type;  The total bandwidth occupied by the access service type, at all the priorities, is specifically: the requested access bandwidth of the access service type.  The method for granting a label switching path according to claim 3, wherein the determining the reserved bandwidth of each non-access service type includes:  If the total bandwidth occupied by a non-access service type is not lower than the access priority, which is greater than the bandwidth constraint of the non-access service type, the reserved bandwidth of the non-access service type is the non-access service type. The total bandwidth occupied when not less than the access priority;  Or, if a non-access service type, the total bandwidth occupied by all the priorities is smaller than the bandwidth constraint of the non-access service type, the reserved bandwidth of the non-access service type is the non-access service type at all The total bandwidth occupied by the priority; Or, if the non-access service type is not lower than the total bandwidth occupied by the access priority, If the bandwidth of the non-access service type is greater than the bandwidth of the non-access service type, and the total bandwidth occupied by the non-access service type is not less than the bandwidth constraint of the non-access service type, the reserved bandwidth of the non-access service type is the non-access The bandwidth constraint of the service type.  The method for accessing a label switching path according to any one of claims 1-6, further comprising:  Adding reserved bandwidth information of the defined service type and its priority combination in the internal gateway protocol message;  The internal gateway protocol packet is broadcasted, so that the access node performs the admission calculation and determination of the label switching path according to the reserved bandwidth information in the internal gateway protocol packet.  The method for the admission of the label switching path according to claim 7, wherein the intra-gateway protocol packet adds the reserved bandwidth information of the defined service type and its priority, which specifically includes:  Adding a value field in the internal gateway protocol;  The reserved bandwidth information of the defined service type combined with its priority is added to the value field. 9. A node for admission of a label switched path, comprising:  An access request receiving unit (601), configured to receive an access request of a label switching path that carries a service flow of at least two service types;  a service type obtaining unit (602), configured to acquire a service type of a service flow carried by the label switching path in the access request, as an access service type;  a priority obtaining unit (603), configured to acquire a priority of a service flow carried by the label switching path in the access request, as an access priority;  The bandwidth information obtaining unit (604) is configured to acquire a request access bandwidth of each service type in the access request, and obtain reserved bandwidth information and a link on the link that is requested to be accessed in the local traffic engineering database. The maximum reservable bandwidth of the road and the bandwidth constraint of each service type; a total bandwidth obtaining unit (605), configured to acquire a sum of reserved bandwidths of each access service type, not lower than an access priority; and add the reserved bandwidth to the access Type of service Requesting access bandwidth, and obtaining the result as the total access bandwidth of the access service type;  The access unit (606) is configured to allow the link to access the label switching path when the total access bandwidth of each access service type is not greater than the bandwidth constraint of the access service type.  The node according to claim 9, wherein the total bandwidth obtaining unit (605) is further configured to: use a bandwidth constraint of the at least one access service type to be greater than a bandwidth constraint of the access service type. Get the sum of reserved bandwidth for all service types;  The access unit (606) is further configured to allow the link to access the label switching path when the total reserved bandwidth of the all service types is not greater than a maximum reservable bandwidth of the link.  The node according to claim 9 or 10, further comprising:  An information adding unit, configured to add reserved bandwidth information of a defined service type and its priority in an internal gateway protocol message;  And a message broadcast unit, configured to broadcast the internal gateway protocol message, so that the access node performs the admission calculation and determination of the label switching path according to the reserved bandwidth information in the internal gateway protocol message.  12. An access system for a label switched path, comprising: an edge node (701) and an access node (702) according to any one of claims 9 to 11;  The path node (701) is configured to add reserved bandwidth information of each defined service type and priority combination to the internal gateway protocol message; and send the internal gateway protocol report to the access node (702) Text.