WO2016078363A1 - 一种隧道约束信息的发送、接收方法及装置 - Google Patents

一种隧道约束信息的发送、接收方法及装置 Download PDF

Info

Publication number
WO2016078363A1
WO2016078363A1 PCT/CN2015/078790 CN2015078790W WO2016078363A1 WO 2016078363 A1 WO2016078363 A1 WO 2016078363A1 CN 2015078790 W CN2015078790 W CN 2015078790W WO 2016078363 A1 WO2016078363 A1 WO 2016078363A1
Authority
WO
WIPO (PCT)
Prior art keywords
loose
path
constraint
tunnel
points
Prior art date
Application number
PCT/CN2015/078790
Other languages
English (en)
French (fr)
Inventor
付志涛
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2016078363A1 publication Critical patent/WO2016078363A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks

Definitions

  • This paper deals with the field of data network communication, especially relates to the transmission scheme of tunnel constraint information in the tunnel establishment process of RSVP-TE tunnel.
  • RSVP-TE Resource Reservation Protocol-Traffic Engineer
  • MPLS Multiprotocol Label Switching
  • the service traffic is forwarded in a Traffic Engineer (TE) tunnel through four components: information release, path calculation, signaling interaction (RSVP-TE), and traffic forwarding.
  • TE Traffic Engineer
  • the tunnel path plan can be a strict path.
  • the tunnel is established, only the CSPF calculation is submitted at the head node, and the calculated path directly reaches the tail node of the tunnel.
  • Path constraints can be carried to downstream.
  • the tunnel is established between them. It may be a cross-area domain. It may be an Autonomous System. , autonomous system) domain, as shown in Figure 2 and Figure 3.
  • Autonomous System. autonomous system
  • these tunneled node-planned constraints need to be passed to the nodes of the respective downstream re-path computations.
  • the tunnel head node cannot use one calculation, and the path from the tunnel head node to the tail node of the tunnel is calculated once, and segmentation calculation is needed.
  • the display path of the tunnel must be loosely configured to the ABR (Area Border Router) (the R3 and R4 in Figure 2 are ABR nodes) or the Autonomous System Border Router (ASBR).
  • Node (nodes) R4, R8, and R12 in Figure 3 are ASBR nodes
  • the tunnel head node first calculates the path to the first loose node; then the first loose node performs the calculation, and counts to the second Loose nodes; the second loose node counts again, counting to the third loose node... until the tail node is counted. On each loose node, there is a process of calculating the road.
  • the present invention provides a method and a device for transmitting and receiving tunnel constraint information, so as to solve the problem that the deployment of all paths of the tunnel cannot be implemented in the related art.
  • a method for transmitting tunnel constraint information includes:
  • the head node When there is a loose point in the establishment of a tunnel, the head node sets the constraint between each two loose points in the tunnel, calculates the path from the head node to the first loose point, and passes the protocol packet. Transmitting the calculated path information between the head node to the first loose point and the constraint between each two loose points to each subsequent node, wherein between each of the two loose points Constraints are used for path exclusion for loose node path calculations.
  • the foregoing method further includes:
  • the step of transmitting, by the head node, a constraint condition between every two loose points to each subsequent node by using a protocol packet includes:
  • the head node carries the constraint condition between every two loose points through the explicit path object ERO of the protocol message.
  • the ERO of the protocol packet carries path information between every two loose points, and the newly added sub-object of the ERO carries a constraint condition between each two loose points.
  • a method for receiving tunnel constraint information includes:
  • the resource-based resource reservation protocol is used to resolve the protocol packet when the loose point in the RSVP-TE tunnel receives the protocol packet.
  • the loose point obtains the loose point and the nearest downstream loose point from the protocol packet If there is a constraint between the constraints, the obtained constraint is satisfied when the path is calculated at the loose point.
  • a device for transmitting tunnel constraint information includes:
  • the path processing unit at the sending end is configured to: when there is a loose point in the establishment of a tunnel, set a constraint condition between each two loose points in the tunnel, and calculate a path between the node and the first loose point. ;
  • a transmission unit configured to: transmit, by using a protocol packet, path information between the calculated node to the first loose point and a constraint condition between each two loose points to each subsequent node, where The constraint between each of the two loose points is used for path exclusion of the loose node path calculation.
  • the transmitting unit is configured to: carry the constraint condition between every two loose points by using an explicit path object ERO of the protocol message.
  • the transmitting unit is configured to: carry the path information between each two loose points by using the ERO of the protocol packet, and carry each two loose points through the newly added sub-object of the ERO. Constraints between.
  • a device for receiving tunnel constraint information includes:
  • Receiving a parsing unit configured to: receive a protocol packet, and parse the protocol packet;
  • the receiving end path processing unit is configured to: if the receiving parsing unit obtains a constraint condition between the loose point and the nearest downstream loose point from the protocol packet, when the path is calculated at the loose point, the The constraint obtained.
  • a computer readable storage medium storing computer executable instructions for performing the method of any of the above.
  • this paper can realize the constraint deployment of each path of the tunnel.
  • the calculated tunnel path is more in line with the requirements of the deployment.
  • FIG. 1 is a diagram of a single-domain network architecture of the related art
  • FIG. 2 is a network architecture diagram of a cross-area domain of the related art
  • FIG. 3 is a network architecture diagram of a related art across an AS domain
  • FIG. 4 is a schematic diagram of a format of a sub-object ERRS according to an embodiment of the present invention.
  • FIG. 5 is a flowchart of implementing tunnel constraint information transmission according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of a network architecture in an embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a device for transmitting RSVP-TE tunnel constraint information according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of a device for receiving RSVP-TE tunnel constraint information according to an embodiment of the present invention.
  • the inventors of the present application have proposed that the path calculation can be constrained using an object ERO (Exlucd Route Object) existing in RSVP-TE. Therefore, when the path calculation is performed by the loose node, the corresponding constraint information can be carried.
  • ERO Exlucd Route Object
  • This embodiment provides a method for sending RSVP-TE tunnel constraint information, which mainly includes the following operations:
  • the head node When there is a loose point in the establishment of a tunnel, the head node sets the constraint between each two loose points in the tunnel, calculates the path from the head node to the first loose point, and passes the protocol packet. Transmitting the calculated path information between the head node to the first loose point and the constraint between each two loose points to each subsequent node, wherein the constraint between each two loose points Path exclusion for loose node path calculations.
  • the protocol packet can be parsed. If a constraint exists between the loose point and the nearest downstream loose point, the obtained path is satisfied when the path is calculated at the loose point.
  • the constraint can be.
  • the constraint between every two loose points can be transmitted through the ERO in the protocol message.
  • the sub-object EXRS of the ERO object may be extended in RFC4874, and the EXRS is used to carry the constraint between each two loose points. condition.
  • the format of the new extended sub-object ERRS (Explicit Restrain Route Subobject) extended in this embodiment is as shown in FIG. 4. Among them, the information carried is as follows:
  • Type type defines the type of the sub-object, tentatively set to 34.
  • Reserved field Reserved field, padded with 0.
  • Hop Number indicates the maximum hop limit of the path calculation, 0 means no such constraint.
  • Cost Value indicates the maximum path cost constraint for path calculation. 0 means there is no such constraint.
  • Latency indicates the maximum delay constraint for path calculation, 0 means no such constraint.
  • Latency Variation indicates the maximum delay jitter constraint for path calculation, 0 means no such constraint.
  • the constraint range of ERRS is between two adjacent loose nodes.
  • the embodiment further provides a method for receiving RSVP-TE tunnel constraint information, which mainly includes the following operations:
  • the protocol packet is parsed.
  • the loose point obtains a constraint between the loose point and the nearest downstream loose point from the protocol packet, the obtained constraint is satisfied when the path is calculated at the loose point.
  • the method for transmitting and receiving RSVP-TE tunnel constraint information provided in this embodiment may be used in combination to implement the transmission process of the RSVP-TE tunnel constraint information.
  • the transmission process of the RSVP-TE tunnel constraint information by using the above two methods includes the following operations as shown in FIG. 5:
  • the determination of loose points is generally determined by the network topology and service requirements, and the tunnel path is planned by the operator.
  • the head node sets the constraint between every two loose points. After the head node calculates the path between the first loose point, the path information is in the form of a child object. Carrying in the ERO, at the same time, the constraint information between the subsequent two loose points is placed between the two loose point sub-objects in the form of the above-mentioned new sub-object ERRS.
  • the loose node After receiving the protocol packet, the loose node parses the ERO object, and finds that there is a constraint sub-object of the ERRS between the downstream loose points closest to the loose point. Then, when the loose node calculates the path, the ERRS is used as the node. Restrictions.
  • step 503 until the algorithm reaches the end node of the tunnel.
  • the scenario shown in Figure 3 is taken as an example to establish a tunnel from the AS1 domain to the AS3 domain (R1 ⁇ R12). From the existing network topology, only the AS2 domain can be traversed. When the tunnel is deployed, the path cost of the AS1 domain does not exceed 10. The path cost of the AS2 domain does not exceed 20. The path cost of the AS3 domain does not exceed 30. Because it is a spanned tunnel, the display path at the time of establishment must be loose to R4 in the AS1 domain, R5 in the AS2 domain, R8 in the AS2 domain, and R9 in the AS3 domain. The number on each link in the figure indicates the path value of the link.
  • the calculation can only calculate the path to R4, and the path cost of constraining this path is 10, and the path calculated at this time is R1 ⁇ R3 ⁇ R4, and the path cost of path R1 ⁇ R2 ⁇ R3 More than 10, so the conditions are not met.
  • the path information of R1 to R4 is encapsulated into the ERO, and the R5 loose point, the ERRS5to8, the R8 loose point, the R9 loose point, the ERRS9to12, and the R12 loose point are encapsulated in the subsequent one.
  • the ERO When the R3 and R4 nodes receive the PATH message, the ERO will send the local hop and then send it downstream.
  • R4 When R4 receives the PATH message, it finds that the next loose hop R5 does not calculate the path from ERO. At the same time, there is no ERRS constraint before R5. Therefore, when submitting the calculation path, calculate a reachable path. In the topology 3, there is only one path.
  • R5 When R5 receives the PATH message, it finds that the next loose hop R8 has path information, and there is a constraint of ERRS5to8 before the R8 sub-object. Therefore, when submitting the calculation path, the ERRS5to8 constraint information is submitted to the calculation path, and the calculation is performed.
  • the path is: R5 ⁇ R6 ⁇ R8 because the link cost of other paths is greater than the constraint value of 20.
  • the ERO information in the PATH message sent by R5 is:
  • the ERO When the R6 and R8 nodes receive the PATH message, the ERO will send the local hop and then send it downstream.
  • R8 When R8 receives the PATH message, it finds that the next loose hop R9 does not calculate the path from ERO. At the same time, there is no ERRS constraint before R9. Therefore, when submitting the calculation path, calculate a reachable path. In the topology 3, there is only one path.
  • R9 When R9 receives the PATH message, it finds that the next loose hop R12 does not have path information, and there is a constraint of ERRS9to12 before the R12 sub-object, so when submitting the calculation, it will The ERRS9to12 constraint information is submitted to the calculation path, and the calculated path is: R9 ⁇ R11 ⁇ R12, because the link cost of other paths is greater than the constraint value 30.
  • the ERO When the R11 node receives the PATH message, the ERO will send the local hop and then send it downstream.
  • the R12 node When the R12 node receives the PATH message, it finds that it is already the tunnel destination.
  • the PATH signaling (ie protocol packet) ends.
  • the path constrained by the entire path is: R1 ⁇ R3 ⁇ R4 ⁇ R5 ⁇ R6 ⁇ R8 ⁇ R9 ⁇ R11 ⁇ R12.
  • the entire path conforms to the cost constraint of each segment path of the head node.
  • a tunnel is established from the AS1 domain to the AS3 domain (R1 ⁇ R12). From the existing network topology, only the AS2 domain can be traversed.
  • the maximum delay of the path in the AS1 domain does not exceed 10.
  • the maximum delay of the path in the AS2 domain does not exceed 20.
  • the maximum delay of the path in the AS3 domain does not exceed 30. Because it is a spanned tunnel, the display path at the time of establishment must be loose to R4 in the AS1 domain, R5 in the AS2 domain, R8 in the AS2 domain, and R9 in the AS3 domain. The number on each link in the figure indicates the delay value of this link.
  • the calculation path can only calculate the path to R4, and the maximum delay for constraining this path is 10, and the path calculated at this time is R1 ⁇ R3 ⁇ R4, and the path R1 ⁇ R2 ⁇ R3 is the largest. The delay is over 10, so the conditions are not met.
  • the path information of R1 to R4 is encapsulated into the ERO, and the R5 loose point, the ERRS5to8, the R8 loose point, the R9 loose point, the ERRS9to12, and the R12 loose point are encapsulated in the subsequent one.
  • the ERO When the R3 and R4 nodes receive the PATH message, the ERO will send the local hop and then send it downstream.
  • R4 When R4 receives the PATH message, it finds that the next loose hop R5 does not calculate the path from ERO. At the same time, there is no ERRS constraint before R5. Therefore, when submitting the calculation path, calculate a reachable path. In the topology 3, there is only one path.
  • R5 When R5 receives the PATH message, it finds that the next loose hop R8 has path information, and there is a constraint of ERRS5to8 before the R8 sub-object. Therefore, when submitting the calculation path, the ERRS5to8 constraint information is submitted to the calculation path, and the calculation is performed.
  • the path is: R5 ⁇ R6 ⁇ R8 because the maximum delay of other paths is greater than the constraint value of 20.
  • the ERO information in the PATH message sent by R5 is:
  • the ERO When the R6 and R8 nodes receive the PATH message, the ERO will send the local hop and then send it downstream.
  • R8 When R8 receives the PATH message, it finds that the next loose hop R9 does not calculate the path from ERO. At the same time, there is no ERRS constraint before R9. Therefore, when submitting the calculation path, calculate a reachable path. In the topology 3, there is only one path.
  • R9 When R9 receives the PATH message, it finds that the next loose hop R12 does not have path information, and there is a constraint of ERRS9to12 before the R12 sub-object, so when submitting the calculation, it will The ERRS9to12 constraint information is submitted to the calculation path, and the calculated path is: R9 ⁇ R11 ⁇ R12, because the maximum delay of other paths is greater than the constraint value 30.
  • the ERO When the R11 node receives the PATH message, the ERO will send the local hop and then send it downstream.
  • the R12 node When the R12 node receives the PATH message, it finds that it is already the tunnel destination.
  • the PATH signaling (ie protocol packet) ends.
  • the path constrained by the entire path is: R1 ⁇ R3 ⁇ R4 ⁇ R5 ⁇ R6 ⁇ R8 ⁇ R9 ⁇ R11 ⁇ R12.
  • the entire path meets the constraint condition of the head node for each segment maximum delay.
  • the calculation path can only calculate the path to R4, and the maximum delay jitter of the constraint path is 10, and the calculated path at this time is R1 ⁇ R3 ⁇ R4, and the path R1 ⁇ R2 ⁇ R3 The maximum delay jitter exceeds 10, so the conditions are not met.
  • the path information of R1 to R4 is encapsulated into the ERO, and the R5 loose point, the ERRS5to8, the R8 loose point, the R9 loose point, the ERRS9to12, and the R12 loose point are encapsulated in the subsequent one.
  • the ERO When the R3 and R4 nodes receive the PATH message, the ERO will send the local hop and then send it downstream.
  • R4 When R4 receives the PATH message, it finds that the next loose hop R5 does not calculate the path from ERO. At the same time, there is no ERRS constraint before R5. Therefore, when submitting the calculation path, calculate a reachable path. In the topology 3, there is only one path.
  • R5 When R5 receives the PATH message, it finds that the next loose hop R8 has path information, and there is a constraint of ERRS5to8 before the R8 sub-object. Therefore, when submitting the calculation path, the ERRS5to8 constraint information is submitted to the calculation path, and the calculation is performed.
  • the path is: R5 ⁇ R6 ⁇ R8 because the maximum delay jitter of other paths is greater than the constraint value of 20.
  • the ERO information in the PATH message sent by R5 is:
  • the ERO When the R6 and R8 nodes receive the PATH message, the ERO will send the local hop and then send it downstream.
  • R8 When R8 receives the PATH message, it finds that the next loose hop R9 does not calculate the path from ERO. At the same time, there is no ERRS constraint before R9. Therefore, when submitting the calculation path, calculate a reachable path. In the topology 3, there is only one path.
  • R9 When R9 receives the PATH message, it finds that the next loose hop R12 does not have path information. When there is a constraint of ERRS9to12 before the R12 sub-object, when the calculation is submitted, the ERRS9to12 constraint information is submitted to the calculation path, and the calculated path is: R9 ⁇ R11 ⁇ R12, because the maximum delay jitter of other paths is Greater than the constraint value of 30.
  • the ERO When the R11 node receives the PATH message, the ERO will send the local hop and then send it downstream.
  • the R12 node When the R12 node receives the PATH message, it finds that it is already the tunnel destination.
  • the PATH signaling (ie protocol packet) ends.
  • the path constrained by the entire path is: R1 ⁇ R3 ⁇ R4 ⁇ R5 ⁇ R6 ⁇ R8 ⁇ R9 ⁇ R11 ⁇ R12.
  • the entire path conforms to the constraint condition of the head node for each segment maximum delay jitter.
  • a tunnel is established from the AS1 domain to the AS3 domain (R1 ⁇ R12). From the existing network topology, only the AS2 domain can be traversed. When the tunnel is deployed, the maximum number of hops in the AS1 domain does not exceed 1. The maximum number of hops in the AS2 domain does not exceed 1. The maximum number of hops in the AS3 domain does not exceed 1. Because it is a spanned tunnel, the display path at the time of establishment must be loose to R4 in the AS1 domain, R5 in the AS2 domain, R8 in the AS2 domain, and R9 in the AS3 domain.
  • the calculation can only calculate the path to R4, and the maximum hop count of the path is constrained to 1.
  • the calculated path is R1 ⁇ R4, and the maximum hop count of the path R1 ⁇ R2 ⁇ R3. If it is 2, the constraint value is exceeded, so the condition is not satisfied.
  • R4 When R4 receives the PATH message, it finds that the next loose hop R5 does not calculate the path from ERO. At the same time, there is no ERRS constraint before R5. Therefore, when submitting the calculation path, calculate a reachable path. In the 6 topology, there is only one path.
  • R5 When R5 receives the PATH message, it finds that the next loose hop R8 has path information, and there is a constraint of ERRS5to8 before the R8 sub-object. Therefore, when submitting the calculation path, the ERRS5to8 constraint information is submitted to the calculation path, and the calculation is performed.
  • the path is: R5 ⁇ R8 because the maximum number of hops of other paths is greater than the constraint value of 1.
  • the ERO information in the PATH message sent by R5 is:
  • the ERO When the R6 and R8 nodes receive the PATH message, the ERO will send the local hop and then send it downstream.
  • R8 When R8 receives the PATH message, it finds that the next loose hop R9 does not calculate the path from ERO. At the same time, there is no ERRS constraint before R9. Therefore, when submitting the calculation path, calculate a reachable path. In the 6 topology, there is only one path.
  • R9 When R9 receives the PATH message, it finds that the next loose hop R12 does not have path information, and there is a constraint of ERRS9to12 before the R12 sub-object. Therefore, when submitting the calculation path, the ERRS9to12 constraint information is submitted to the calculation path, and the calculation is performed.
  • the path that comes out is: R9 ⁇ R12 because the maximum number of hops of other paths is greater than the constraint value of 1.
  • the ERO When the R11 node receives the PATH message, the ERO will send the local hop and then send it downstream.
  • the R12 node When the R12 node receives the PATH message, it finds that it is already the tunnel destination.
  • the PATH signaling (ie protocol packet) ends.
  • the path constrained by the entire path is: R1 ⁇ R3 ⁇ R4 ⁇ R5 ⁇ R6 ⁇ R8 ⁇ R9 ⁇ R11 ⁇ R12.
  • the entire path meets the constraint condition of the head node for each maximum hop count.
  • the previous constraints of HopNumber, Cost Value, Latency, and Latency Variation are selected according to the actual deployment constraints, and one or more kinds of information may be selected between the two loose points as the constraints of the calculation. Accordingly, there is one or more information constraints in the ERRS, and the processing rules are the same as those of the above embodiment, and the description will not be repeated.
  • the embodiment provides a device for transmitting RSVP-TE tunnel constraint information, where the device can be placed in a head node, which includes at least the following units.
  • the sender path processing unit 71 is configured to: when there is a loose point in the establishment of a tunnel, set a constraint condition between each two loose points in the tunnel, and calculate the relationship between the node and the first loose point. path;
  • the transmitting unit 72 is configured to: transmit the calculated path information between the current node and the first loose point and the constraint condition between each two loose points to each subsequent node by using a protocol packet, where The constraint between each two loose points is used for path exclusion of loose node path calculations.
  • the foregoing transmission unit 72 can carry the constraint condition between every two loose points through the object ERO of the protocol message.
  • the path information between each two loose points is carried in the object ERO of the protocol packet, and the constraint between each two loose points is carried by the sub-object ERRS of the object ERO.
  • the embodiment further provides a receiving device for RSVP-TE tunnel constraint information, which can be placed in a loose point, which includes at least the following units:
  • the receiving parsing unit 81 is configured to: receive the protocol packet, and parse the protocol packet;
  • the receiving end path processing unit 82 is configured to: if the receiving parsing unit 81 obtains a constraint condition between the loose point and the nearest downstream loose point from the protocol packet, the obtained path is satisfied when the path is calculated at the loose point Restrictions.
  • the above-mentioned transmitting device and receiving device can respectively implement the transmitting method and the receiving method in the first embodiment. Therefore, the detailed operation of the device can be referred to the corresponding content in the foregoing embodiment 1, and details are not described herein again.
  • the above-mentioned transmitting device and receiving device can be used in addition to being used alone, so as to realize complete transmission of constraints between loose points, so that the calculated tunnel path is more in line with the requirements of deployment.
  • all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve.
  • the devices/function modules/functional units in the above embodiments may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices.
  • the device/function module/functional unit in the above embodiment When the device/function module/functional unit in the above embodiment is implemented in the form of a software function module and sold or used as a stand-alone product, it can be stored in a computer readable storage medium.
  • the above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.
  • the embodiment of the present invention can implement the constraint deployment of each path of the tunnel by extending the new sub-object.
  • the calculated tunnel path is more in line with the requirements of the deployment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种隧道约束信息的发送、接收方法及装置，涉及数据网络通讯领域。其中，隧道约束信息的发送方法，包括：当一条隧道建立中存在松散点时，头结点设置好该条隧道中每两个松散点之间的约束条件，计算头结点至第一个松散点之间的路径，并通过协议报文将所计算的头结点至第一个松散点之间的路径信息以及每两个松散点之间的约束条件传输给后续的每个结点，其中，每两个松散点之间的约束条件用于松散节点路径计算的路径排除。

Description

一种隧道约束信息的发送、接收方法及装置 技术领域
本文涉及数据网络通讯领域，尤其涉及一种RSVP-TE隧道在隧道建立过程中的隧道约束信息的传输方案。
背景技术
RSVP-TE(Resource Reservation Protocol-Traffic Engineer，基于流量工程的资源预留协议)是一种基于MPLS(MultiProtocol Label Switching，多协议标签交换)的流量工程技术。通过信息发布、路径计算、信令交互(RSVP-TE)、流量的转发四个部件实现业务流量在TE(Traffic Engineer，流量工程)隧道中的转发。
现在的网络，特别是金融数据的传输，对路径的选择有着严格的要求，比如传输链路的代价、延时、抖动等。所以在隧道建立的时候，这些约束条件都需要提交给CSPF(Constrained Shortest Path First，约束最短路径优先)计算单元进行约束计算。这些约束条件在一些情况下需要传递给下游节点。
如图1所示，对于在单域的隧道，隧道路径规划可以是严格的路径，这样隧道建立的时候，只在头结点提交一次CSPF计算，计算的路径直接到达隧道尾节点，这样所有的路径约束可以不用携带给下游。
但随着现在网络越来越复杂，城市和城市之间，运营商和运营商之间各自有网络，他们之间建立隧道，可能是跨Area(区域)域，有可能是跨AS(Autonomous System，自治系统)域，如图2和图3所示。为了规划每个域路径允许的最大链路代价、最大延时和抖动，需要将这些在隧道头结点规划好的约束条件传递到各自下游再次路径计算的节点。事实上，对于跨域隧道，隧道头结点不能够利用一次算路，将隧道头结点至隧道尾节点的路径一次计算出来，需要进行分段计算。如图2和图3所示，隧道的显示路径必须配置松散到ABR(Area Border Router，区域边界路由器)(图2中的R3和R4都是ABR节点)或者ASBR(Autonomous System Border Router，自治系 统边界路由器)节点(图3中的R4，R8，R12都是ASBR节点)，隧道头结点先计算路径到第一个松散节点；再在第一个松散节点进行算路，算至第二个松散节点；第二个松散节点再次算路，算至第三个松散节点…直至算到尾节点。在每个松散节点上，都有一个算路的过程。
发明内容
本文提供一种隧道约束信息的发送、接收方法及装置，以解决相关技术中无法实现隧道的所有路径的部署的问题。
一种隧道约束信息的发送方法，包括：
当一条隧道建立中存在松散点时，头结点设置好该条隧道中每两个松散点之间的约束条件，计算头结点至第一个松散点之间的路径，并通过协议报文将所计算的头结点至第一个松散点之间的路径信息以及每两个松散点之间的约束条件传输给后续的每个结点，其中，所述每两个松散点之间的约束条件用于松散节点路径计算的路径排除。
可选地，上述方法还包括：
收到所述协议报文的松散点，解析所述协议报文，若从中获取到本松散点与最近的下游松散点之间存在约束条件，则在本松散点计算路径时，满足所获取的约束条件。
可选地，上述方法中，所述头结点通过协议报文将每两个松散点之间的约束条件传输给后续的每个结点的步骤包括：
所述头结点通过协议报文的显式路径对象ERO携带每两个松散点之间的约束条件。
可选地，上述方法中，所述协议报文的ERO携带每两个松散点之间的路径信息，通过ERO的新增子对象携带每两个松散点之间的约束条件。
一种隧道约束信息的接收方法，包括：
基于流量工程的资源预留协议RSVP-TE隧道中的松散点收到协议报文时，解析所述协议报文；
如果所述松散点从所述协议报文中获取到本松散点与最近的下游松散点 之间存在约束条件，则在本松散点计算路径时，满足所获取的约束条件。
一种隧道约束信息的发送装置，包括：
发送端路径处理单元，设置为：在一条隧道建立中存在松散点时，设置好该条隧道中每两个松散点之间的约束条件，计算本结点至第一个松散点之间的路径；
传输单元，设置为：通过协议报文将所计算的本结点至第一个松散点之间的路径信息以及每两个松散点之间的约束条件传输给后续的每个结点，其中，所述每两个松散点之间的约束条件用于松散节点路径计算的路径排除。
可选地，上述装置中，所述传输单元是设置为：通过协议报文的显式路径对象ERO携带每两个松散点之间的约束条件。
可选地，上述装置中，所述传输单元是设置为：通过所述协议报文的ERO携带每两个松散点之间的路径信息，通过ERO的新增子对象携带每两个松散点之间的约束条件。
一种隧道约束信息的接收装置，包括：
接收解析单元，设置为：接收协议报文，并解析所述协议报文；
接收端路径处理单元，设置为：若所述接收解析单元从所述协议报文中获取到本松散点与最近的下游松散点之间存在约束条件，则在本松散点计算路径时，满足所获取的约束条件。
一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行上述任一项的方法。
本文通过扩展新的子对象，可以实现隧道的每段路径的约束的部署。计算出来的隧道路径更为符合部署的要求。
附图概述
图1为相关技术的单域网络架构图；
图2为相关技术的跨Area域的网络架构图；
图3为相关技术的跨AS域的网络架构图；
图4为本发明实施例中子对象ERRS的格式示意图；
图5为本发明实施例实现隧道约束信息传输的流程图；
图6为本发明实施例中的网络架构示意图；
图7为本发明实施例的RSVP-TE隧道约束信息的发送装置示意图；
图8为本发明实施例的RSVP-TE隧道约束信息的接收装置示意图。
本发明的实施方式
下文将结合附图对本发明的实施方式进行详细说明。需要说明的是，在不冲突的情况下，本申请的实施例和实施例中的特征可以任意相互组合。
实施例1
本申请发明人提出，可以使用RSVP-TE中已有的对象ERO(Exlucde Route Object，显式路径对象)对路径计算进行约束。从而实现在松散节点进行路径计算的时候，可以携带相应的约束信息。
本实施例提供一种RSVP-TE隧道约束信息的发送方法，主要包括如下操作：
当一条隧道建立中存在松散点时，头结点设置好该条隧道中每两个松散点之间的约束条件，计算头结点至第一个松散点之间的路径，并通过协议报文将所计算的头结点至第一个松散点之间的路径信息以及每两个松散点之间的约束条件传输给后续的每个结点，其中，每两个松散点之间的约束条件用于松散节点路径计算的路径排除。
而收到上述协议报文的松散点，可以解析该协议报文，若从中获取到本松散点与最近的下游松散点之间存在约束条件，则在本松散点计算路径时，满足所获取的约束条件即可。
上述方法中，每两个松散点之间的约束条件可以通过协议报文中的ERO传输。
可选地，ERO携带每两个松散点之间的路径信息时，可以在RFC4874中扩展ERO对象的子对象EXRS，EXRS用于携带每两个松散点之间的约束 条件。本实施例中扩展的新的子对象ERRS(Explicit Restrain Route Subobject)的格式如图4所示。其中，携带的信息如下：
L位：如果为0，表示必须满足这些约束条件，如果为1，表示应该尽量满足这些约束条件。
Type类型：定义子对象的type类型，暂定为34。Reserved字段：保留字段，填充0。
Hop Number：表示路径计算的最大跳数约束，0表示没有该约束。
Cost Value：表示路径计算的最大路径代价约束，0表示没有该约束。
Latency：表示路径计算的最大时延约束，0表示没有该约束。
Latency Variation：表示路径计算的最大延时抖动约束，0表示没有该约束。
ERRS的约束范围是相邻两个松散节点之间。
本实施例再提供一种RSVP-TE隧道约束信息的接收方法，主要包括如下操作：
RSVP-TE隧道中的松散点收到协议报文时，解析该协议报文；
如果松散点从该协议报文中获取到本松散点与最近的下游松散点之间存在约束条件，则在本松散点计算路径时，满足所获取的约束条件。
在实际应用中，本实施例中所提供的RSVP-TE隧道约束信息的发送以及接收方法可以结合使用，从而实现RSVP-TE隧道约束信息的传输过程。
采用上述两种方法实现RSVP-TE隧道约束信息的传输过程如图5所示包括如下操作：
501，确定一条隧道建立是否需要存在松散点。
其中，松散点的确定，一般是由网络拓扑以及业务需要，由运营商规划隧道路径。
502，如果存在松散点，头结点设置好每两个松散点之间的约束条件。在头结点计算好到第一个松散点之间的路径之后，将路径信息以子对象的形式 携带在ERO中，同时，后续两两松散点之间的约束信息以上述新增子对象ERRS形式放置于两个松散点子对象之间。
如果一条隧道中没有松散点，那么隧道在头结点算路可以直接算到隧道尾节点。这种情况没有后续的松散点约束的携带问题。
503，松散节点接收到协议报文之后解析ERO对象，发现离本松散点最近的下游松散点之间存在ERRS的约束子对象，那么在本松散节点算路的时候，将此ERRS作为本节点的约束条件。
504，重复503的步骤，直至算路到达隧道尾节点。
下面再以图3所示场景为例，从AS1域建立一条隧道到AS3域(R1→R12)。从现有的网络拓扑来说，只能穿越AS2域。部署隧道的时候，希望AS1域内的路径代价不要超过10，AS2域的路径代价不要超过20，AS3域的路径代价不要超过30。由于是跨越的隧道，建立时的显示路径必须松散到AS1域的R4、AS2域的R5、AS2域的R8和AS3域的R9。图中每条链路上的数字表示这段链路的路径代价值。
根据上述发送方法的规划，R5和R8两个松散点之间存在最大链路代价的约束，可以以ERRS的形式存在于ERO中。为了便于却区分，我们命名为ERRS5to8，R9和R12两个松散点之间也存在最大链路代价的约束，也是以ERRS的形式存在于ERO中，我们命名为ERRS9to12。由于部署隧道时只关注路径代价，所以ERRS5to8和ERRS5to8中，Hop Number、Latency、Latency Variation均为0，Cost Value分别为20、30。
在头结点R1上，算路只能计算到R4的路径，同时约束这段路径的路径代价为10，这个时候计算出来的路径为R1→R3→R4，路径R1→R2→R3的路径代价超过了10，所以不满足条件。在R1发送的PATH消息封装ERO的时候，将R1至R4的路径信息封装至ERO中，后续一次封装R5松散点，ERRS5to8，R8松散点，R9松散点，ERRS9to12，R12松散点。
R1至R4路径信息
R5(LOOSE)
ERRS5to8
R8(LOOSE)
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R3和R4节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R4接收到PATH消息时，从ERO中发现到下一个松散跳R5并未算出路径，同时在R5之前也没有ERRS的约束，所以在提交算路的时候，算出一条可达路径即可，在图3拓扑中，只有唯一一条路径。
R5接收到PATH消息时，发现到下一个松散跳R8并有路径信息，同时在R8子对象之前有ERRS5to8的约束，所以在提交算路的时候，将ERRS5to8约束信息提交到算路中，计算出来的路径为：R5→R6→R8，因为其他路径的链路代价都大于约束值20。
R5发出的PATH消息中的ERO信息为：
R5至R8的路径信息
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R6和R8节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R8接收到PATH消息时，从ERO中发现到下一个松散跳R9并未算出路径，同时在R9之前也没有ERRS的约束，所以在提交算路的时候，算出一条可达路径即可，在图3拓扑中，只有唯一一条路径。
R9接收到PATH消息时，发现到下一个松散跳R12并未有路径信息，同时在R12子对象之前有ERRS9to12的约束，所以在提交算路的时候，将 ERRS9to12约束信息提交到算路中，计算出来的路径为：R9→R11→R12，因为其他路径的链路代价都大于约束值30。
R11节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R12节点在接收PATH消息处理掉时候，发现已经是隧道目的地。PATH信令(即协议报文)结束。
整条路径约束的路径为：R1→R3→R4→R5→R6→R8→R9→R11→R12。
通过在协议报文中携带两两松散节点之间的路径代价约束信息，使得整条路径符合头结点对每段路径代价约束条件。
仍以图3所示场景为例，从AS1域建立一条隧道到AS3域(R1→R12)。从现有的网络拓扑来说，只能穿越AS2域。部署隧道的时候，希望AS1域内路径的最大时延不要超过10，AS2域内路径的最大时延不要超过20，AS3域内路径的最大时延不要超过30。由于是跨越的隧道，建立时的显示路径必须松散到AS1域的R4、AS2域的R5、AS2域的R8和AS3域的R9。图中每条链路上的数字表示这段链路的时延值。
根据上述发送方法的规划，R5和R8两个松散点之间存在最大时延的约束，以ERRS的形式存在于ERO中，为了便于却区分，我们命名为ERRS5to8，R9和R12两个松散点之间也存在最大时延的约束，也是以ERRS的形式存在于ERO中，我们命名为ERRS9to12。由于部署隧道时只关注最大时延，所以ERRS5to8和ERRS5to8中，Hop Number、Cost Value、Latency Variation均为0，Latency分别为20、30。
在头结点R1上，算路只能计算到R4的路径，同时约束这段路径的最大时延为10，这个时候计算出来的路径为R1→R3→R4，路径R1→R2→R3的最大时延超过了10，所以不满足条件。在R1发送的PATH消息封装ERO的时候，将R1至R4的路径信息封装至ERO中，后续一次封装R5松散点，ERRS5to8，R8松散点，R9松散点，ERRS9to12，R12松散点。
R1至R4路径信息
R5(LOOSE)
ERRS5to8
R8(LOOSE)
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R3和R4节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R4接收到PATH消息时，从ERO中发现到下一个松散跳R5并未算出路径，同时在R5之前也没有ERRS的约束，所以在提交算路的时候，算出一条可达路径即可，在图3拓扑中，只有唯一一条路径。
R5接收到PATH消息时，发现到下一个松散跳R8并有路径信息，同时在R8子对象之前有ERRS5to8的约束，所以在提交算路的时候，将ERRS5to8约束信息提交到算路中，计算出来的路径为：R5→R6→R8，因为其他路径的最大时延都大于约束值20。
R5发出的PATH消息中的ERO信息为：
R5至R8的路径信息
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R6和R8节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R8接收到PATH消息时，从ERO中发现到下一个松散跳R9并未算出路径，同时在R9之前也没有ERRS的约束，所以在提交算路的时候，算出一条可达路径即可，在图3拓扑中，只有唯一一条路径。
R9接收到PATH消息时，发现到下一个松散跳R12并未有路径信息，同时在R12子对象之前有ERRS9to12的约束，所以在提交算路的时候，将 ERRS9to12约束信息提交到算路中，计算出来的路径为：R9→R11→R12，因为其他路径的最大时延都大于约束值30。
R11节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R12节点在接收PATH消息处理掉时候，发现已经是隧道目的地。PATH信令(即协议报文)结束。
整条路径约束的路径为：R1→R3→R4→R5→R6→R8→R9→R11→R12。
通过在协议报文中携带两两松散节点之间的最大时延约束信息，使得整条路径符合头结点对每段最大时延的约束条件。
以图3所示场景为例，从AS1域建立一条隧道到AS3域(R1→R12)。从现有的网络拓扑来说，只能穿越AS2域。部署隧道的时候，希望AS1域内路径的最大时延抖动不要超过10，AS2域内路径的最大时延抖动不要超过20，AS3域内路径的最大时延抖动不要超过30。由于是跨越的隧道，建立时的显示路径必须松散到AS1域的R4、AS2域的R5、AS2域的R8和AS3域的R9。图中每条链路上的数字表示这段链路的时延抖动值。
根据上述的规划，R5和R8两个松散点之间存在最大时延抖动的约束，以ERRS的形式存在于ERO中，为了便于却区分，我们命名为ERRS5to8，R9和R12两个松散点之间也存在最大时延抖动的约束，也是以ERRS的形式存在于ERO中，我们命名为ERRS9to12。由于部署隧道时只关注最大时延抖动，所以ERRS5to8和ERRS5to8中，Hop Number、Cost Value、Latency均为0，Latency Variation分别为20、30。
在头结点R1上，算路只能计算到R4的路径，同时约束这段路径的最大时延抖动为10，这个时候计算出来的路径为R1→R3→R4，路径R1→R2→R3的最大时延抖动超过了10，所以不满足条件。在R1发送的PATH消息封装ERO的时候，将R1至R4的路径信息封装至ERO中，后续一次封装R5松散点，ERRS5to8，R8松散点，R9松散点，ERRS9to12，R12松散点。
R1至R4路径信息
R5(LOOSE)
ERRS5to8
R8(LOOSE)
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R3和R4节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R4接收到PATH消息时，从ERO中发现到下一个松散跳R5并未算出路径，同时在R5之前也没有ERRS的约束，所以在提交算路的时候，算出一条可达路径即可，在图3拓扑中，只有唯一一条路径。
R5接收到PATH消息时，发现到下一个松散跳R8并有路径信息，同时在R8子对象之前有ERRS5to8的约束，所以在提交算路的时候，将ERRS5to8约束信息提交到算路中，计算出来的路径为：R5→R6→R8，因为其他路径的最大时延抖动都大于约束值20。
R5发出的PATH消息中的ERO信息为：
R5至R8的路径信息
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R6和R8节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R8接收到PATH消息时，从ERO中发现到下一个松散跳R9并未算出路径，同时在R9之前也没有ERRS的约束，所以在提交算路的时候，算出一条可达路径即可，在图3拓扑中，只有唯一一条路径。
R9接收到PATH消息时，发现到下一个松散跳R12并未有路径信息，同 时在R12子对象之前有ERRS9to12的约束，所以在提交算路的时候，将ERRS9to12约束信息提交到算路中，计算出来的路径为：R9→R11→R12，因为其他路径的最大时延抖动都大于约束值30。
R11节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R12节点在接收PATH消息处理掉时候，发现已经是隧道目的地。PATH信令(即协议报文)结束。
整条路径约束的路径为：R1→R3→R4→R5→R6→R8→R9→R11→R12。
通过在信令(即协议报文)中携带两两松散节点之间的最大时延抖动约束信息，使得整条路径符合头结点对每段最大时延抖动的约束条件。
最后，以图6所示场景为例，从AS1域建立一条隧道到AS3域(R1→R12)。从现有的网络拓扑来说，只能穿越AS2域。部署隧道的时候，希望AS1域内路径的最大跳数不超过1，AS2域内路径的最大跳数不超过1，AS3域内路径的最大跳数不超过1。由于是跨越的隧道，建立时的显示路径必须松散到AS1域的R4、AS2域的R5、AS2域的R8和AS3域的R9。
根据上述的规划，R5和R8两个松散点之间存在最大跳数的约束，以ERRS的形式存在于ERO中，为了便于却区分，我们命名为ERRS5to8，R9和R12两个松散点之间也存在最大跳数的约束，也是以ERRS的形式存在于ERO中，我们命名为ERRS9to12。由于部署隧道时只关注最大跳数，所以ERRS5to8和ERRS5to8中Cost Value、Latency、Latency Variation均为0，HopNumber分别为1、1。
在头结点R1上，算路只能计算到R4的路径，同时约束这段路径的最大跳数为1，这个时候计算出来的路径为R1→R4，路径R1→R2→R3的最大跳数为2，超过了约束值，所以不满足条件。在R1发送的PATH消息封装ERO的时候，将R1至R4的路径信息封装至ERO中，后续一次封装R5松散点，ERRS5to8，R8松散点，R9松散点，ERRS9to12，R12松散点。
R1至R4路径信息
R5(LOOSE)
ERRS5to8
R8(LOOSE)
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R4接收到PATH消息时，从ERO中发现到下一个松散跳R5并未算出路径，同时在R5之前也没有ERRS的约束，所以在提交算路的时候，算出一条可达路径即可，在图6拓扑中，只有唯一一条路径。
R5接收到PATH消息时，发现到下一个松散跳R8并有路径信息，同时在R8子对象之前有ERRS5to8的约束，所以在提交算路的时候，将ERRS5to8约束信息提交到算路中，计算出来的路径为：R5→R8，因为其他路径的最大跳数都大于约束值1。
R5发出的PATH消息中的ERO信息为：
R5至R8的路径信息
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R6和R8节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R8接收到PATH消息时，从ERO中发现到下一个松散跳R9并未算出路径，同时在R9之前也没有ERRS的约束，所以在提交算路的时候，算出一条可达路径即可，在图6拓扑中，只有唯一一条路径。
R9接收到PATH消息时，发现到下一个松散跳R12并未有路径信息，同时在R12子对象之前有ERRS9to12的约束，所以在提交算路的时候，将ERRS9to12约束信息提交到算路中，计算出来的路径为：R9→R12，因为其他路径的最大跳数都大于约束值1。
R11节点在接收PATH消息处理掉时候，ERO会分别弹掉本地跳之后，往下游发送。
R12节点在接收PATH消息处理掉时候，发现已经是隧道目的地。PATH信令(即协议报文)结束。
整条路径约束的路径为：R1→R3→R4→R5→R6→R8→R9→R11→R12。
通过在信令(即协议报文)中携带两两松散节点之间的最大跳数约束信息，使得整条路径符合头结点对每段最大跳数的约束条件。
另外，在实际应用中，前面的HopNumber、Cost Value、Latency、Latency Variation四种约束信息，根据实际部署约束需要，可以在两两松散点之间选取一种或者多种信息作为算路的约束。相应地，在ERRS中就存在一种或者多种信息约束，处理的规则和上述实施例一致，不再重复展开描述。
实施例2
如图7所示，本实施例提供一种RSVP-TE隧道约束信息的发送装置，该装置可以置于头结点中，其至少包括如下单元。
发送端路径处理单元71，设置为：在一条隧道建立中存在松散点时，设置好该条隧道中每两个松散点之间的约束条件，计算本结点至第一个松散点之间的路径；
传输单元72，设置为：通过协议报文将所计算的本结点至第一个松散点之间的路径信息以及每两个松散点之间的约束条件传输给后续的每个结点，其中，每两个松散点之间的约束条件用于松散节点路径计算的路径排除。
上述传输单元72可以通过协议报文的对象ERO携带每两个松散点之间的约束条件。可选地，在协议报文的对象ERO中携带每两个松散点之间的路径信息，再通过对象ERO的子对象ERRS携带每两个松散点之间的约束条件。
另外，如图8所示，本实施例再提供一种RSVP-TE隧道约束信息的接收装置，其可以置于松散点中，其至少包括如下单元：
接收解析单元81，设置为：接收协议报文，并解析该协议报文；
接收端路径处理单元82，设置为：若接收解析单元81从协议报文中获取到本松散点与最近的下游松散点之间存在约束条件，则在本松散点计算路径时，满足所获取的约束条件。
上述发送装置和接收装置可以分别实现上述实施例1中的发送方法和接收方法，故上述装置的详细操作可以参见上述实施例1的相应内容，在此不再赘述。另外，上述发送装置和接收装置除了可以单独使用外，也可以配合使用，以实现松散点之间的约束条件完整传输，从而使计算出来的隧道路径更为符合部署的要求。
本领域普通技术人员可以理解上述实施例的全部或部分步骤可以使用计算机程序流程来实现，所述计算机程序可以存储于一计算机可读存储介质中，所述计算机程序在相应的硬件平台上(如系统、设备、装置、器件等)执行，在执行时，包括方法实施例的步骤之一或其组合。
可选地，上述实施例的全部或部分步骤也可以使用集成电路来实现，这些步骤可以被分别制作成一个个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。
上述实施例中的装置/功能模块/功能单元可以采用通用的计算装置来实现，它们可以集中在单个的计算装置上，也可以分布在多个计算装置所组成的网络上。
上述实施例中的装置/功能模块/功能单元以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。上述提到的计算机可读取存储介质可以是只读存储器，磁盘或光盘等。
工业实用性
本发明实施例通过扩展新的子对象，可以实现隧道的每段路径的约束的部署。计算出来的隧道路径更为符合部署的要求。

Claims (10)

  1. 一种隧道约束信息的发送方法，包括：
    当一条隧道建立中存在松散点时，头结点设置好该条隧道中每两个松散点之间的约束条件，计算头结点至第一个松散点之间的路径，并通过协议报文将所计算的头结点至第一个松散点之间的路径信息以及每两个松散点之间的约束条件传输给后续的每个结点，其中，所述每两个松散点之间的约束条件用于松散节点路径计算的路径排除。
  2. 如权利要求1所述的方法，还包括：
    收到所述协议报文的松散点，解析所述协议报文，若从中获取到本松散点与最近的下游松散点之间存在约束条件，则在本松散点计算路径时，满足所获取的约束条件。
  3. 如权利要求1或2所述的方法，其中，所述头结点通过协议报文将每两个松散点之间的约束条件传输给后续的每个结点的步骤包括：
    所述头结点通过协议报文的显式路径对象ERO携带每两个松散点之间的约束条件。
  4. 如权利要求3所述的方法，其中，
    所述协议报文的ERO携带每两个松散点之间的路径信息，通过ERO的新增子对象携带每两个松散点之间的约束条件。
  5. 一种隧道约束信息的接收方法，包括：
    基于流量工程的资源预留协议RSVP-TE隧道中的松散点收到协议报文时，解析所述协议报文；
    如果所述松散点从所述协议报文中获取到本松散点与最近的下游松散点之间存在约束条件，则在本松散点计算路径时，满足所获取的约束条件。
  6. 一种隧道约束信息的发送装置，包括：
    发送端路径处理单元，设置为：在一条隧道建立中存在松散点时，设置好该条隧道中每两个松散点之间的约束条件，计算本结点至第一个松散点之 间的路径；
    传输单元，设置为：通过协议报文将所计算的本结点至第一个松散点之间的路径信息以及每两个松散点之间的约束条件传输给后续的每个结点，其中，所述每两个松散点之间的约束条件用于松散节点路径计算的路径排除。
  7. 如权利要求6所述的装置，其中：
    所述传输单元是设置为：通过协议报文的显式路径对象ERO携带每两个松散点之间的约束条件。
  8. 如权利要求7所述的装置，其中，
    所述传输单元是设置为：通过所述协议报文的ERO携带每两个松散点之间的路径信息，通过ERO的新增子对象携带每两个松散点之间的约束条件。
  9. 一种隧道约束信息的接收装置，包括：
    接收解析单元，设置为：接收协议报文，并解析所述协议报文；
    接收端路径处理单元，设置为：若所述接收解析单元从所述协议报文中获取到本松散点与最近的下游松散点之间存在约束条件，则在本松散点计算路径时，满足所获取的约束条件。
  10. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行权利要求1-5任一项的方法。
PCT/CN2015/078790 2014-11-21 2015-05-12 一种隧道约束信息的发送、接收方法及装置 WO2016078363A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410675842.7 2014-11-21
CN201410675842.7A CN105681190A (zh) 2014-11-21 2014-11-21 一种隧道约束信息的发送、接收方法及装置

Publications (1)

Publication Number Publication Date
WO2016078363A1 true WO2016078363A1 (zh) 2016-05-26

Family

ID=56013210

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/078790 WO2016078363A1 (zh) 2014-11-21 2015-05-12 一种隧道约束信息的发送、接收方法及装置

Country Status (2)

Country Link
CN (1) CN105681190A (zh)
WO (1) WO2016078363A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108667751B (zh) * 2017-03-27 2022-01-11 中兴通讯股份有限公司 一种时延信息的通告方法及装置
CN109729006B (zh) * 2017-10-27 2021-08-31 中兴通讯股份有限公司 一种报文处理方法和装置、计算机可读存储介质
CN112468353B (zh) * 2019-09-09 2023-11-21 华为数字技术（苏州）有限公司 一种网络可达性检测方法及装置
CN115834463A (zh) * 2021-09-16 2023-03-21 中兴通讯股份有限公司 路径计算方法、装置、网络控制器和存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101222407A (zh) * 2008-01-23 2008-07-16 中兴通讯股份有限公司 避免松散节点自动环路的方法
CN101453407A (zh) * 2007-12-03 2009-06-10 华为技术有限公司 路由器及路径消息处理的方法
CN102647340A (zh) * 2012-03-22 2012-08-22 中兴通讯股份有限公司 Rsvp-te隧道中的松散节点及其路径计算方法
US8634292B2 (en) * 2007-02-28 2014-01-21 Cisco Technology, Inc. Sliced tunnels in a computer network

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1306737C (zh) * 2003-08-29 2007-03-21 华为技术有限公司 获得智能光网络中松散路由的约束路径的方法和装置
CN100372337C (zh) * 2004-05-31 2008-02-27 华为技术有限公司 一种实现跨域约束路由的选路方法
CN1707978B (zh) * 2004-06-11 2011-08-24 华为技术有限公司 获得智能光网络中松散路由的约束路径的方法和装置
CN101237399A (zh) * 2007-09-28 2008-08-06 华为技术有限公司 获取标签交换路径的方法、系统和设备
CN101471853B (zh) * 2007-12-29 2012-02-29 华为技术有限公司 一种路由计算方法、单元及系统
CN101616063B (zh) * 2008-06-26 2012-02-08 华为技术有限公司 一种路由路径建立方法、系统和装置
CN101984595B (zh) * 2010-11-03 2012-08-15 北京星网锐捷网络技术有限公司 跨区域流量工程隧道建立方法、系统及装置
US20130232193A1 (en) * 2012-03-04 2013-09-05 Zafar Ali Control-Plane Interface Between Layers in a Multilayer Network
US9001672B2 (en) * 2012-07-27 2015-04-07 Alcatel Lucent System, method and apparatus conforming path cost criteria across multiple ABRs
EP3038303B1 (en) * 2013-09-26 2018-09-19 Huawei Technologies Co., Ltd. Establishment method and device of a cross-domain path
CN105515982A (zh) * 2014-10-20 2016-04-20 中兴通讯股份有限公司 一种隧道路径计算的方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8634292B2 (en) * 2007-02-28 2014-01-21 Cisco Technology, Inc. Sliced tunnels in a computer network
CN101453407A (zh) * 2007-12-03 2009-06-10 华为技术有限公司 路由器及路径消息处理的方法
CN101222407A (zh) * 2008-01-23 2008-07-16 中兴通讯股份有限公司 避免松散节点自动环路的方法
CN102647340A (zh) * 2012-03-22 2012-08-22 中兴通讯股份有限公司 Rsvp-te隧道中的松散节点及其路径计算方法

Also Published As

Publication number Publication date
CN105681190A (zh) 2016-06-15

Similar Documents

Publication Publication Date Title
US8817591B2 (en) Inter-domain signaling to update remote path computation elements after a call set-up failure
US9444712B2 (en) Bandwidth on-demand services in multiple layer networks
EP2870736B1 (en) Signaling co-routed and non co-routed lsps of a bidirectional packet te tunnel
JP5759637B2 (ja) リング型ネットワークのラベル・スイッチ・パスを作成する方法、関連するデバイス、及び通信システム
US9210075B2 (en) Method and apparatus for managing end-to-end consistency of bi-directional MPLS-TP tunnels via in-band communication channel (G-ACH) protocol
EP2135393B1 (en) Ethernet spanning tree provision
CN110417651B (zh) 一种隧道建立方法、装置及系统
WO2017211164A1 (zh) 一种确定跨域标签交换路径隧道的方法、设备和系统
CN108881017B (zh) 改变多路径标签交换路径中每跳带宽约束的方法及路由器
WO2016078363A1 (zh) 一种隧道约束信息的发送、接收方法及装置
CN102647340A (zh) Rsvp-te隧道中的松散节点及其路径计算方法
EP4250669A1 (en) Packet forwarding method, electronic device, and storage medium
US9215136B2 (en) Aggregated delivery of tunnel fault messages on common ethernet segments
WO2018177256A1 (zh) 一种时延信息的通告方法及装置
CN107347034B (zh) 链路信息的处理方法及装置、系统
WO2016061932A1 (zh) 一种隧道路径计算的方法及装置
CN102957614A (zh) 一种动态路由的实现方法和装置
JP4522955B2 (ja) マルチキャストポイントツーポイント（ｍｐ２ｐ）マルチプロトコルラベルスイッチング（ｍｐｌｓ）トラヒックエンジニアリング（ｔｅ）通信システム
CN104283813B (zh) 一种处理rsvp-te信令的方法及系统
CN109729006B (zh) 一种报文处理方法和装置、计算机可读存储介质
CN103067271A (zh) 双向路径的实现方法及装置
WO2024152527A1 (zh) 路由方法及其装置、存储介质、计算机程序产品
Xia Research on signaling mechanism based on convergence network
WO2017004747A1 (zh) 一种网络中路径计算的方法、装置及系统
Wu et al. Recovery from control plane failures in the RSVP-TE signaling protocol

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15861784

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15861784

Country of ref document: EP

Kind code of ref document: A1