CN104429030B - Inform that the cooperation of two-way packet traffic engineering tunnel route and non-cooperation route LSP with signal - Google Patents
Inform that the cooperation of two-way packet traffic engineering tunnel route and non-cooperation route LSP with signal Download PDFInfo
- Publication number
- CN104429030B CN104429030B CN201380035471.XA CN201380035471A CN104429030B CN 104429030 B CN104429030 B CN 104429030B CN 201380035471 A CN201380035471 A CN 201380035471A CN 104429030 B CN104429030 B CN 104429030B
- Authority
- CN
- China
- Prior art keywords
- path
- lsp
- reverse
- message
- route
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
- H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
-
- 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
- H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/36—Backward learning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/825—Involving tunnels, e.g. MPLS
Abstract
Specific embodiment can enable to the arranging relative to label switched path (LSP)/tunnel that clearly cooperation of the mode to set up two-way packet traffic engineering (TE) tunnel route LSP and non-cooperation route LSP and it is informed with signal.Head-end node can by calculating before set up two-way packet traffic engineering tunnel to (being probably reverse) LSP, then inform two-way traffic engineering tunnel with signal using for example to the extension of associated RSVP (RSVP) Signalling method.The extension of the RSVP Signalling methods to being associated includes multiple additional association types of the extension affiliated partner delivered in RSVP PATHs, the RSVP PATHs are sent to endpoint node by preceding from head-end node to LSP, wherein, it is that cooperation route is also that non-cooperation route to the arranging of LSP and reverse LSP that additional association type is clearly identified preceding.
Description
Technical field
The disclosure relates in general to computer network, more particularly, to arranging two-way packet traffic in a computer network
Engineering (TE) tunnel.
Background technology
In entitled " Generalized Multiprotocol Label exchange (GMPLS) signal resource reservation protocol-flow of in January, 2003 issue
Engineering (RSVP-TE) extends (Generalized Multi-Protocol Label Switching (GMPLS) Signaling
Resourse ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions) " solicit
Expanding universal multiprotocol label switching (GMPLS) signaling extensions described in opinion (RFC) 3473 can be used to build up closing
Make two-way packet traffic engineering (TE) tunnel of route and inform two-way packet traffic engineering tunnel with signal.The example of two-way packet traffic engineering tunnel
It is two multiprotocol label switching (MPLS) TE label switched paths (LSP), wherein, one of MPLS TE LSP are preceding to LSP
(for example, the endpoint node in the tunnel is extended to from the head-end node of traffic engineering tunnel), and another MPLS TE LSP are reverse LSP (examples
Such as, head-end node is extended to from endpoint node).Alternately, associated RSVP (RSVP) Signalling method (
" the RSVP-TE extensions of associated bidirectional LSP in the internet draft in March in 2012 et al.<draft-ietf-
ccamp-mpls-tp-rsvpte-ext-associated-lsp-03>(RSVP-TE Extensions for Associated
Bidirectional LSPs<draft-ietf-ccamp-mpls-tp-rsvpte-ext-associated-lsp-03>) " in
Described) the two-way packet traffic engineering tunnel of cooperation route or non-cooperation route can be used to build up and the tunnel is informed with signal.
According to used herein, cooperation route before two-way packet traffic engineering tunnel is represented and uses same paths (example to LSP and reverse LSP
Such as, (one or more) same node point and (one or more) same link) bidirectional tunnel.On the contrary, non-cooperation route is double
Represented to packet traffic engineering tunnel and use two bidirectional tunnels of different paths (that is, forward direction LSP paths are different from reverse LSP paths).
Head-end node indicates the arranging of LSP to ensure to for example to one or more nodes of for example two-way packet traffic engineering tunnel
Reverse LSP carries out suitable signal transmission, treatment and controls, and this is probably beneficial.According to used herein, arrange and represent
LSP is for example configured to cooperation route or non-cooperation route；That is, the LSP of two-way traffic engineering tunnel is cooperation route also right and wrong
Cooperation route.Although system administration manager can be built for (one or more) node using RSVP signaling messages and object
One group of rule come determine LSP be cooperation route (or not being), but such structure may cause ambiguity and interoperability
Sex chromosome mosaicism, because different managers can build different rules to infer that LSP is cooperation route (or not being).
Brief description of the drawings
The embodiments herein can be better understood from by with reference to accompanying drawing with reference to being described below, in the drawings, phase
With label instruction is identical or functionally similar element, wherein：
Fig. 1 shows exemplary computer network；
Fig. 2 shows example endpoint/router；
Fig. 3 shows each several part of example signaling message；
Fig. 4 shows that example extends each several part of affiliated partner；And
Fig. 5 shows for setting up and to inform that the cooperation of two-way packet traffic engineering tunnel route LSP and non-cooperation route LSP with signal
Exemplary reduced program.
Example embodiment
General introduction
Specific embodiment can be enabled in the clearly mode of the arranging relative to label switched path (LSP)/tunnel
To set up and inform that the cooperation in two-way packet traffic engineering (TE) tunnel route LSP and non-cooperation route LSP with signal.Head end section
Point can set up two-way traffic engineering tunnel by calculating for preceding (one or more) path to (being probably reverse) LSP, then
With signal two-way traffic engineering tunnel is informed using the extension of RSVP (RSVP) Signalling method for example to being associated.One
In individual embodiment, the extension of the RSVP Signalling methods to being associated includes being carried the multiple additional pass in RSVP PATHs
Join the extension affiliated partner of type, the RSVP PATHs are sent to endpoint node by preceding from head-end node to LSP, wherein,
The arranging that additional association type clearly identifies the forward direction LSP and reverse LSP of two-way traffic engineering tunnel is that cooperation route is also non-cooperation road
By.
After RSVP PATHs are received, endpoint node can check the message object (including extension association it is right
As), and can be route using cooperation or non-cooperation route the additional association type of LSP and is used in combination setting up suitable reversely LSP
Signal informs the reverse LSP, to produce two-way traffic engineering tunnel.If for example, explicit route object (ERO) (that is, reverse ERO) is present
In RSVP PATHs, then endpoint node can inform reverse LSP using the ERO with signal, but regardless of association type.So
And, if ERO is not present in RSVP PATHs and association type is non-cooperation route, endpoint node can be calculated instead
The reverse LSP is informed to LSP and with signal.In addition, if ERO is not present in RSVP PATHs and association type is
Cooperation route, then whether endpoint node can check the PATH to determine record routing object (RRO) (that is, path RRO)
It is present in the message.If RRO is present, endpoint node can inform that cooperation route reverse LSP using RRO with signal.
On the other hand, if RRO is not present in RSVP route messages, endpoint node can attempt calculating reverse LSP (and afterwards
The reverse LSP is informed with signal).If reverse LSP (or afterwards with signal inform the reverse LSP), end segment can not be calculated
Point can send RSVP signalling errors with head-end node.
Specific embodiment
Computer network is the communication chain by transmitting data between end node (for example, personal computer and work station)
The geographically distributed set of the node that road and segmentation are interconnected.The network of many types is available, and Type Range is from local
Net (LAN) is to wide area network (WAN).LAN is general by positioned at the special of the general physical location of identical (for example, building or campus)
With privately owned communication link come connecting node.On the other hand, WAN typically passes through long-distance communication links (for example, common carrier phone
Line, optical beam path, Radio Link, synchronous optical network (SONET) or Synchronous Digital Hierarchy (SDH) link) connect geographically
Scattered node.Internet is the example of the WAN for connecting whole world heterogeneous networks, internet provide node on various networks it
Between global communication.These nodes are general logical according to predetermined protocol (for example, transmission control protocol/Internet protocol (TCP/IP))
The discrete frames or packet for crossing network exchange data are communicated.In this context, how agreement is interacted by definition node
One group rule composition.Computer network can also be interconnected every to extend by intermediate network node (for example, router)
Effective " size " of individual network.
Due to interconnect computer network management be heavy, therefore, it can using less groups of computer networks as
Routed domain or autonomous system are safeguarded.Network in autonomous system (AS) is typically coupled together by intradomain router,
And AS is generally subject to common authority, wherein, intradomain router is configured as running intra-area routes agreement.However, increasing energy
The interstitial content of enough exchange datas is desirable；In this case, the inter domain router of operation inter-domain routing protocol is used to mutually
Connect the node of each AS.And, each AS interconnection that will be operated under different management domains is desirable.According to this paper institutes
Use, AS, region or grade are commonly referred to as in " domain ", and interconnect the router of not same area and be commonly referred to as " border routing
Device ".
Fig. 1 shows exemplary computer network 100, and the exemplary computer network 100 schematically includes by as depicted
Node (for example, router) A-E of link interconnection.According to described herein, one or more tunnels can be with (for example, pass through
One or more intermediate nodes (for example, node B, C and D)) traversal head-end node (for example, node A) and endpoint node (for example,
Node D) between link, this will be understood by those skilled in the art that.Skilled artisan will also appreciate that the computer network
Using any number of node, router, link (for example, have any bandwidth value), and shown here can be regarded in network
Figure is for purposes of clarity.And, although it will further be appreciated by those of ordinary skill in the art that the disclosure is generally described, this public affairs
Open and can apply to such as customer network and provider's core net, these customer networks and provider's core net have provider and
Any network configuration in Provider edge router, single AS or domain or any network configuration through multiple AS or domain.
Can be using predetermined network agreement (for example, transmission control protocol/Internet protocol (TCP/IP), user datagram
Agreement (UDP), asynchronous transfer mode (ATM) agreement, frame relay protocol and/or the Internet packet exchange (IPX) agreement) calculating
Exchange data packets between the node of machine network 100.
Fig. 2 shows the example endpoint/router that can be used together with one or more embodiments described herein
200, for example, head-end node, endpoint node or intermediate node (LSR, " LSR ").The node can include passing through
One or more network interfaces 210, one or more processors 220 and memory 240 that system bus 250 is interconnected.
(one or more) network interface 210 comprises mean for being coupled to the physical link and/or Radio Link of network 100 to pass
The mechanizing circuit of transmission of data, electronic circuit and signaling circuit.(one or more) network interface can be configured with various
Different communication protocol (especially including TCP/IP, UDP, ATM, synchronous optical network (SONET), wireless protocols, frame relay, with
Too net and/or Fiber Distributed Data Interface (FDDI)) send and/or receive data.It should be noted that physical network interface
210 can be utilized to realize one or more virtual network interfaces, for example, for well-known to those skilled in the art virtual
Dedicated network (VPN) is accessed.
Memory 240 is included for storing the software program that is associated with embodiment described herein and data structure
Multiple storage locations, these storage locations can be by (one or more) processor 220 and (one or more) network interface 210
Addressing.(one or more) processor 220 can include necessary element or logic, and these elements or logic are suitable to runs software
Program and peration data structure are (for example, the route or mark of route/table 245 and traffic engineering database (TED) 247
Sign).Operating system 242 is come functionally particularly by the software process for calling support to be run on node and/or the operation of service
Organization node, each several part of operating system 242 is typically resident in memory 240, and is transported by (one or more) processor
OK.These software process and/or service can include that route service 244, RSVP (RSVP) services 246 and flow
Engineering (TE)/tunnel service 248.Can be come using other processors and type of memory (including various computer-readable mediums)
Store and run and be related to the programmed instruction of embodiment described herein, this is to those skilled in the art apparent
's.Although in addition, description herein explanation various processes/service, should take explicitly into account, various processes/service can be by
Module is embodied as, these modules are configured as according to embodiments described herein (for example, according to similar process/clothes
The function of business) operated.
Route service 244 includes computer executable instructions, and these computer executable instructions are by (one or more)
Reason device 220 runs to perform such as Interior Gateway Protocol (IGP) (for example, it will appreciated by a person of ordinary skill in the art taht open shortest path
Footpath preferential (OSPF) and Intermediate System-to-Intermediate System (IS-IS) and/or Border Gateway Protocol (BGP)) etc one or many
The function that individual Routing Protocol is provided.These functions can be configured as management route and table 245 (comprising for example for
Make the data that route and forwarding are determined).It should be noted that route service 244 can also carry out it is relevant with virtual routing protocols
Function, for example, it will be appreciated by those skilled in the art that maintenance VRF instance (not shown).
Multiprotocol label switching (MPLS) traffic engineering (TE) is had been developed that to meet such as guarantee available bandwidth or quick
The data networking requirements of recovery etc.MPLS TE are based on a series of by the IP/MPLS networks of LSR (LSR)
Constraint sets up end-to-end tunnel using modem label switching techniques.These tunnels are a kind of label switched path (LSP), therefore one
As be referred to as MPLSTE-LSP.The example of MPLS-TE can be in the entitled " RSVP-TE of 2001 12：The RSVP's of lsp tunnel
Extension (RSVP-TE：Extensions to RSVP for LSP Tunnels) " RFC 3209 in find.
Usually, tunnel is that a packet for agreement (head and data) is encapsulated in into another agreement with new head
Logical construction in the data field of packet.By this way, packaged data can be by otherwise cannot pass through
Network send.More importantly, tunnel creates transparent virtual network link between two network nodes, and the link is general
Will not be influenceed that (that is, physical network links or equipment are based only upon new head forwarding and are sealed by physical network links or equipment
The packet of dress).Although an example in tunnel is MPLS TE-LSP, other known tunnel establishing methods especially include two
Layer tunnel protocol (L2TP), PPTP (PPTP) and IP tunnel.
Some applications can merge unidirectional traffic, and these unidirectional traffics are configured as according to some " service quality "
(QoS) from the source (transmitter) in computer network to destination (receiver) the passing time sensitive flow in the network.This
Place, Internet resources can be reserved for unidirectional stream, to ensure that the QoS being associated with the data flow is maintained.Resource reservation
Agreement (RSVP) is so that application can reserve resource to obtain the Network Control Protocol of the special QoS of its data flow.RSVP with
Routing Protocol cooperates, and to be, for example, the reserved resource of data flow in computer network, is wanted so as to set up the data flow
The QoS grades asked." the RSVPs (RSVP) of RFC 2205 that RSVP is delivered in September, 1997 by R.Braden etc.
(Resource ReSerVation Protocol (RSVP) " in be defined.In the situation of traffic engineering application, RSVP signalings
Be used to build up TE-LSP (tunnel), and be used to obey the constraint required by a group along TE-LSP to router (for example,
Border router) pass on the path of various TE-LSP attributes, the TE-LSP may to be calculated by various modes.
Specifically, RSVP services 246 to realize RSVP and locate RSVP according to embodiment described herein comprising for disappearing
The computer executable instructions of breath.And, TE/ tunnel services 248 according to embodiment described herein comprising for realizing
The computer executable instructions of TE functions.The example of traffic engineering is described in RFC as described above 3209, and the date
For in January, 2003, entitled " Generalized Multiprotocol Label exchanges (GMPLS) signal resource reservation protocol-traffic engineering (RSVP-TE)
Extension (Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource
ReSerVation Protocol-Traffic Engineering (RSVP-TE) Extensions) " RFC 3473 and entitled
" Generalized Multiprotocol Label exchanges (GMPLS) signaling capability description (Generalized Multi-Protocol Label
Switching (GMPLS) Signaling Functional Description) " RFC 3471 in.TED 247 can be by
For storing the TE that Routing Protocol (for example, IGP, BGP and/or RSVP (for example, with TE described herein extensions)) is provided
Information.TED exemplarily can carry out maintenance and management by TE/ tunnel services 248.
Tunnel (for example, MPLS TE-LSP) is set up exemplarily to be related to：Calculate head-end node (LSR) to endpoint node it
Between path；Along the path sending signal；And change forwarding at node (including intermediate node (LSR)) place along the path
Form and/or database.Most preferably, measured according to some measurements (cost, length etc.), the path for being calculated is to meet institute
Have related LSP TE constrain or attribute (for example, required bandwidth, preference (avoid or the management including some links is constrained),
Priority and/or type) " most short " path.According to herein it is described further below, path computing can by head-end node or by
Endpoint node is performed.Various path calculation methods are available, including it will be appreciated by those skilled in the art that restricted shortest path
Footpath is preferential (CSPF).
Tunnel can be configured in individual domain (for example, region, grade or AS) or can also across multiple domains (for example,
Region, grade or AS), and can have guaranteed bandwidth under certain conditions.Illustratively, can be by using RSVP
(have Traffic Engineering extensions) (specifically, RSVP TE signaling messages) informs the tunnel with signal.It should be appreciated that using
RSVP is intended only as example, and can use other communication protocols according to embodiment described herein.
According to RSVP, for the request data stream (tunnel between transmitter (head-end node) and receiver (endpoint node)
Road), transmitter can be sent to reception RSVP path requests (path) message along path (for example, singlecast router) to descending
Device, indicates for example to be adapted to the required bandwidth of data flow together with other attributes for identifying transmitter and companion tunnel.Path disappears
Breath can include the various information on data flow, such as traffic characteristic including data flow.Always according to RSVP, receiver can be with
Tunnel is set up by the PATH with reservation request (Resv) message response transmitter between transmitter and receiver.Should
Resv message proceeds to transmitter along with flowing the jump of a jumper connection one (that is, along intermediate node) from the upward every trade of receiver.The Resv
Message can be included to be come for the reserved resource of data flow between transmitter and receiver along stream for intermediate node, confirms tunnel
The information of attribute and offer tunnel label.If the intermediate node in path between transmitter and receiver is directed to
The PATH or the Resv message in new reserved (tunnel) or reserved (tunnel) set up, and mistake is run into (for example, money
Source deficiency, failed network element etc.), then intermediate node generation path error or reservation error (PathErr or ResvErr, hereafter
Referred to as mistake) message and these error messages are forwarded to transmitter or receiver respectively.
Fig. 3 shows the (example of example signaling message 300 that can be used together with one or more embodiments described herein
Such as, the RSVP message in such as path, Resv or mistake etc) each several part.According to described herein, message 300 is especially wrapped
Containing common header 310 and one or more signaling protocol (RSVP) special objects 320, also including one or more TE LSP attributes
Object 330 and extension affiliated partner 400.Common header 310 can include source address 312 and destination-address 314, and expression disappears
The origin of breath 300 and the termination asked.Protocol specific objects 320 are comprising every kind of message 300 (for example, path, Resv, mistake
Deng) needed for object.For example, PATH can have transmitter template object, Tspec objects, previous dive object etc..It is another
Aspect, Resv message can have the special object 320 for label object, session object, filter spec objects etc..Separately
Outward, error message 300 (for example, PathErr or ResvErr) can also have such as is used to define the specific of type of error etc
Object 320.
TE LSP attributes objects 330 can include explicit route object (ERO) 332, record routing object (RRO) 334 with
And upstream label object 336.When ERO 332 is combined into RSVP PATHs, ERO 332 encapsulates node (that is, " jump ")
Cascade, this constitute explicitly routed path.Using ERO, the path that Tag switching RSVP-MPLS packet traffics are used can be pre-
First determine, these independent in path are in conventional IP paths.It is added in PATH by by RRO 334, transmitter node energy
Receive the information of the actual route on lsp tunnel traversal.That is, can be by road along each node of route/path
In RRO objects being recorded by information (for example, IP address of next-hop).The routing iinformation of both direction can be collected into RRO
In subobject (for example, reserved RRO of the path RRO of PATH and Resv message), and these subobjects are collectively constituted
Path RRO and reserved RRO.Transmitter node can also using RRO 334 come from network request on routed path change it is logical
Know.Upstream label object 336 may be added in PATH to support bidirectional LSP, as described herein.This area skill
The various methods that art personnel are understood can be used to produce ERO 332, the RRO 334 being comprised in the signaling message in tunnel
And upstream label object 336.
Although unidirectional tunnel is enough for some applications, other application can be used and be configured to meter
Calculation machine network transmits the bidirectional tunnel of some QoS flow amounts from transmitter to receiver.The example of two-way packet traffic engineering tunnel is two
MPLS TE LSP, wherein, one of MPLS TE LSP for it is preceding to LSP (for example, extending to the tunnel from the head-end node of traffic engineering tunnel
Endpoint node), and another MPLS TE LSP be reverse LSP (for example, extending to head-end node from endpoint node).Implementing
In example, TE head-end nodes can be accused generally by performing CSPF calculating first against both forward direction LSP and reverse LSP with signal
Know the bidirectional tunnel (two LSP) and control bidirectional tunnel.Illustratively, the constraint that CSPF is calculated can be directed to bandwidth, i.e.
Ensure for example to meet the minimum bandwidth requirement of one or more links.Allow treatment (admission process) (for example,
Call Admission Control (CAC) treatment) during, bandwidth constraint aspect can be performed and check to ensure that path once being accused with signal
Know, then the bandwidth asked is available.Once CSPF calculating has determined that one or more paths have may meet two-way tape
The availability that width is required, then head-end node and then can use letter using such as RSVP with path (and Resv) message
Number inform the bidirectional tunnel.
As it is used herein, for it is preceding be usually directed to the RSVP signalings of LSP pass through calculated forward direction LSP paths from
Head-end node terminad node sends RSVP PATHs, and then endpoint node returns to RSVP by the path head-end node
Resv message.Similarly, the signaling of reverse LSP is usually directed to and passes through the reverse LSP paths that are calculated from endpoint node head-end
Node transmitting path message, then by path return Resv message, the Resv message eventually arrives at end segment to head-end node
Point.It should be noted that if TE head-end nodes do not provide the ERO for reverse LSP, endpoint node can be held for reverse LSP
Row CSPF is calculated.
In embodiment, head-end node can include ERO 332 in PATH 300, wherein, ERO 332 is specified and divided
The path (that is, display (preferably) route) that group is traveled through by reverse LSP.Generally, TE head-end nodes are (for example, terminad section
Point) pass on the mode of reverse LSP for being calculated to be carried out by ERO 332.Once setting up traffic engineering tunnel, head-end node can pacify
Its local forwarding (for example, updating its route/table 245 and/or TED 247) is arranged to deliver packet traffic on forward direction.
That is, once traffic engineering tunnel is calculated and (for example, being handed over by RSVP paths and Resv message (such as by CSPF)
Change) informed with signal, then the arrangement of local forwarding be performed with by preceding to LSP carrier flow rates.
After PATH is received, TE endpoint nodes can create tunnel (that is, reverse LSP) on reversely, and use
Signal informs the reverse LSP.If ERO 332 is provided in PATH 300, TE endpoint nodes use ERO's 332
Content creates reverse LSP；Otherwise, TE endpoint nodes can create LSP by performing the CSPF reverse LSP of calculating determination.It
Afterwards, endpoint node for example sends the reverse LSP for being informed with signal and being calculated using RSVP message.In embodiment, end
End node is exchanged according to path/Resv message and sends RSVP PATHs 300 by via the path terminad node for being calculated
To inform the reverse LSP with signal.TE endpoint nodes then can arrange/update its local routing/table 245 and/or
TED 247 with reversely on deliver packet traffic.As a result, the LSP (forward direction LSP and reverse LSP) of bidirectional tunnel be created, by with
Signal is informed and is arranged.
Illustratively, referring again to Fig. 1, head-end node A can set up LSP (tunnels along the shown path to endpoint node D
Road) T1 (being represented by solid line), and endpoint node D can set up LSP (tunnel) T2 along to the shown path of head-end node A
(being illustrated by the broken lines), wherein, T1 and T2 is collectively forming two-way traffic engineering tunnel.Specifically, LSP/ tunnels T1 can in node A, B, C and
The path of the link between D in traverses network 100, and LSP/ tunnels T2 can between node D, C, E, B and A traverses network
The path of the link in 100.
In entitled " Generalized Multiprotocol Label exchange (GMPLS) signal resource reservation protocol-flow that in January, 2003 delivers
Engineering (RSVP-TE) extends (Generalized Multi-Protocol Label Switching (GMPLS) Signaling
Resourse ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions) " RFC
It is two-way that expanding universal multiprotocol label switching (GMPLS) signaling extensions described in 3473 can be used to build up cooperation route
Packet traffic engineering tunnel.As it is used herein, cooperation route two-way packet traffic engineering tunnel represents bidirectional tunnel, wherein, forward direction LSP and anti-
To the shared same paths of LSP (for example, (one or more) same node point and (one or more) same link).RFC 3473
(and RFC 3471) makes it possible for the signal set of signaling message to set up descending (forward direction) of bidirectional tunnel and up (anti-
Both to) data path (LSP), for example, a RSVP PATH is sent for preceding to both LSP and reverse LSP, and
One RSVP Resv message is sent for preceding to both LSP and reverse LSP.In one or more embodiments, such as this area
It will be understood by the skilled person that the foundation of bidirectional tunnel can be by suitable signaling message (for example, RSVP PATHs)
The upstream label object 336 of appearance is instructed to.
Alternately, associated RSVP (RSVP) Signalling method is (in the internet draft in March in 2012
Et al. " the RSVP-TE of associated bidirectional LSP extension<draft-ietf-ccamp-mpls-tp-rsvpte-ext-
associated-lsp-03>(RSVP-TE Extensions for Associated Bidirectional LSPs<
draft-ietf-ccamp-mpls-tp-rsvpte-ext-associated-lsp-03>) " described in) can be used to build
The two-way packet traffic engineering tunnel of vertical cooperation route or non-cooperation route.As described above, cooperation route two-way traffic engineering tunnel is directed to its forward direction
Both LSP and reverse LSP use same paths.On the contrary, non-cooperation route two-way packet traffic engineering tunnel representing using two differences
The bidirectional tunnel in path (that is, forward direction LSP paths are different from reverse LSP paths).Illustratively, as previously described herein,
Associated RSVP Signalling methods make it possible for for preceding each LSP in LSP and reverse LSP RSVP signalings (i.e.,
Path/Resv message exchanges) set up bidirectional tunnel.Specifically, associated RSVP Signalling methods can be used to (for example,
Bind or associate two independent unidirectional LSP by using the association type of extension affiliated partner 400) set up cooperation route
(or non-cooperation route) two-way packet traffic engineering tunnel.
Fig. 4 shows the example extension affiliated partner that can be used together with one or more embodiments described herein
400 each several part.Object 400 especially includes association type field 410, associated identifiers (ID) field 420, association source field
430th, global association source field 440, and alternatively include extension association id field 450.Such as described further below herein, pass
Connection type field 410 includes the value for indicating identified association type.Association id field 420 includes the node by initiating the association
The value assigned, when other fields delivered in the field and object 400 are combined, field unique mark association.Association
Source field 430 includes IPv4 or IPv6 addresses respectively, and the address is associated to the node for initiating the association.Global association source field
440 values comprising as, the value is that unique global identification is accorded with, and extends data, the number as association id field 450 is included
According to the additional information for being support unique mark.
In order to by two, reversely unidirectionally LSP binds associated bidirectional LSP/tunnel,<draft-ietf-ccamp-
mpls-tp-rsvpte-ext-associated-lsp-03>Field 410 for extension affiliated partner 400 lists following association
Type：
(1) bilateral associates bidirectional LSP (D)；With
(2) unilateral association bidirectional LSP (A).
Broadly, it is unilateral to arrange the configuration for representing bidirectional tunnel in the tunnel one end (for example, head-end node), including refer to
The attribute and Path Options of the type in fixed calculated path.That is, head-end node can before calculating to LSP and reversely
Tunnel is arranged before both LSP, and illustratively, head-end node can for example by using the ERO in PATH 300
332 pass on reverse LSP.The other end (for example, endpoint node) in the tunnel can be responded with RX path message, and conduct,
The tunnel can be informed with dynamic creation tunnel and with signal.
Bilateral is arranged and represents at the two ends in tunnel there is configuration；However, the amount of configuration may change.Herein, head end section
Point can configure arrange tunnel using it, and for preceding to the calculating of both LSP and reverse LSP execution route, and for anti-
ERO is provided to LSP.If head-end node indicates the path of reverse LSP by ERO, endpoint node can use what is calculated
Path.However, if head-end node does not indicate the path of reverse LSP by ERO, endpoint node can for example use message
One or more other objects utilize calculated path, or can arrange tunnel using its configuration, and perform
CSPF calculates to create the path of reverse LSP.
Illustratively, referring again to Fig. 1, head-end node A can be according to for example<draft-ietf-ccamp-mpls-tp-
rsvpte-ext-associated-lsp-03>The one side for being provided associates two-way arranging by LSP/ tunnels T1 (by solid line table
Show) and LSP/ tunnels T2 (being illustrated by the broken lines) arranged respectively as the forward direction LSP and reverse LSP of bidirectional tunnel, calculate and
Informed with signal.Alternately, the two-sided association bilateral for for example being provided according to associated RSVP Signalling methods is arranged, head end
LSP/ tunnels T1 can be arranged, calculated and be informed with signal by node A as preceding to LSP, and endpoint node D can be by LSP/
Tunnel T2 is arranged, calculated and informed with signal as the reverse LSP of bidirectional tunnel.
However,<draft-ietf-ccamp-mpls-tp-rsvpte-ext-associated-lsp-03>LSP is not provided
Cooperation route or the explicit instruction (for example, provided by association type) that arranges of non-cooperation route, this may cause not
With the Interoperability between manager, and these managers are caused to route LSP's on setting up cooperation route or non-cooperation
It is intended to.For example, it is assumed that including the extension He of affiliated partner 400 by the RSVP PATHs 300 that head-end node is sent to endpoint node
RRO 334, but do not include ERO 332.Not having ERO 332 in path 300 can indicate it should only to calculate anti-with terminad node
To LSP LSP is route as non-cooperation.And it is probably pipe that cooperation route LSP is set up using the RRO information in PATH 300
Manage the intention of device.Alternately, the intention of RRO 334 may carry out only record path without arranging cooperation route for administrative purposes
LSP.Such situation may cause ambiguity and can not clearly determine that LSP should be that cooperation route is also non-cooperation route.
As a result, indicating LSP to one or more nodes of two-way traffic engineering tunnel is route as cooperation or as non-cooperation
Route is arranged to ensure that carrying out appropriate signal to for example reverse LSP informs, processes and control, and this is beneficial.Although
System administration manager can build one group of rule to determine LSP using RSVP signaling messages and object for (one or more) node
Whether it is cooperation route, but such structure also can result in Interoperability, because different managers may build not
With rule come infer LSP whether be cooperation route.Such as another example, it is assumed that RSVP signaling messages and object include thering is extension
The RSVP PATHs 300 of affiliated partner 400, ERO 332 and RRO 334, wherein, the terminad nodes of ERO 332 are specified and are used for
(being calculated by head-end node) path (that is, the reverse LSP ERO) of reverse LSP, and RRO 334 records the preceding path to LSP
(that is, forward direction LSP path RRO).It should be noted that path specified in ERO can be counted by head-end node using such as CSPF
Calculate to determine.This group rule be able to will be comprised in preceding to the forward direction LSP path RRO in RSVP PATHs with given end node
Content be compared with the content of reverse LSP ERO.However, the method is probably fuzzy, because while this compare can be with
Display (for example, calculated by CSPF) route is identical, but manager may not yet using the path as cooperation road
By path.
In addition, this group rule can be with specified associations ID 420 (for example, tunnel sequence number) at the midpoint node of bidirectional tunnel
It is examined, to infer that LSP is that cooperation route is also that non-cooperation route, wherein, association ID 420 be carried before traversal to LSP and
In the extension affiliated partner 400 of the PATH 300 of reverse LSP.However, the method is also likely to be fuzzy, because while should
Display ID matchings are checked, so as to be inferred as cooperation route, but LSP may be non-cooperation route LSP, be traveled through in forward and backward
Occurs the situation during same paths.
The extension of the RSVP Signalling methods to being associated
Specific embodiment can enable to the arranging relative to LSP/ tunnels that clearly mode sets up two-way packet TE
The cooperation route LSP and non-cooperation route LSP in tunnel, and it is informed with signal.Two-way traffic engineering tunnel is illustratively wrapped
To LSP and reverse LSP before including.Head-end node can be set up double by calculating for the preceding path to (being probably reverse) LSP
To traffic engineering tunnel, then the extension of use example RSVP Signalling methods as described herein to being associated is two-way to be informed with signal
Traffic engineering tunnel.In embodiment, the extension of the RSVP Signalling methods to being associated includes being carried in RSVP PATHs 300
The extension affiliated partner 400 of multiple additional association types 410, the RSVP PATHs are sent by preceding from head-end node to LSP
To endpoint node, wherein, it is cooperation route also right and wrong to the arranging of LSP and reverse LSP that additional association type 410 is clearly identified preceding
Cooperation route.These additional association types 410 include：
Cooperation route bilateral associates bidirectional LSP (D)
The unilateral association bidirectional LSP (A) of cooperation route
Non- cooperation route bilateral associates bidirectional LSP (D)
The non-unilateral association bidirectional LSP (A) of cooperation route
Receive RSVP PATHs 300 when, endpoint node can check the message object (including extension affiliated partner
400) can be route, and using cooperation or non-cooperation route the additional association type 410 of LSP set up suitable reversely LSP
And the reverse LSP is informed with signal, to produce two-way traffic engineering tunnel.If for example, ERO 332 (for example, reversely ERO) is present in
In RSVP PATHs 300, then endpoint node can inform reverse LSP using the ERO with signal, but regardless of association type
410.If however, reversely ERO is not present in RSVP PATHs 300 and association type 410 is non-cooperation route (example
Such as, non-cooperation route two-sided association bidirectional LSP), then endpoint node can calculate the path of reverse LSP (for example, calculating reverse
The ERO of LSP), and inform the reverse LSP with signal.In addition, if reversely ERO is not present in RSVP PATHs 300 simultaneously
And association type 410 is cooperation route (for example, cooperation route two-sided association bidirectional LSP), then endpoint node can check the road
Footpath message come determine RRO 334 (for example, path RRO) whether there is in the message.If RRO is present, endpoint node can
To inform that cooperation route reverse LSP (for example, as recorded in RRO) with signal using path RRO.On the other hand, if
Path RRO is not present in RSVP route messages, then endpoint node can attempt calculating reverse LSP (and afterwards with signal pair
It is informed).If reverse LSP (or afterwards with signal informed it) can not be calculated, endpoint node can be to head
End node sends RSVP signalling errors.
According to one or more embodiments described herein, endpoint node can also check that received RSVP paths disappear
The object (including extension affiliated partner 400) of breath 300, and the additional pass of LSP can be route using cooperation route or non-cooperation
Connection type 410 is arranged, re-established, informed with signal and/or controls reverse LSP, with response to for example due to signalling error,
Re-optimization (that is, find more preferable path the need for) and/or path validation (that is, verifying path) and interruption/failure for occurring.Example
Such as, if reversely ERO is present in the RSVP PATHs 300 initiated by head-end node, endpoint node can be using reverse
Error message is relayed to initiation head-end node by ERO, and order head-end node processes the mistake.As it is used herein, initiating
Head-end node be configured as both direction execution route calculate node, and the head-end node of reality be directed to before to
The initiation head-end node or the endpoint node for reverse LSP of LSP.
Alternately, if path RRO is present in PATH 300, and association type 410 is cooperation route (example
Such as, cooperation route one side association bidirectional LSP), then endpoint node can first attempt to re-establish instead using such as path RRO
To LSP.However, if reverse LSP can not be re-established, endpoint node can be by failure (for example, signalling error or path are tested
Card mistake) notify to give initiation head-end node.Illustratively, endpoint node for example processes mistake by sending order head-end node
Error message (for example, path error message) gives notice of failure to initiation head-end node.And, if association type is non-conjunction
(for example, non-cooperation route two-sided association bidirectional LSP) is route, then endpoint node can calculate alternative for reverse LSP
Path, and with signal inform the path again.If reverse LSP can not be calculated, endpoint node can use such as mistake
Message gives notice of failure to initiation head-end node.
According to one or more embodiments described herein, midpoint node (that is, the node of bidirectional tunnel midpoint) can
To check the object (including extension affiliated partner 400) of RSVP signaling messages, and can be route using cooperation or non-cooperation road
By the additional association type 410 of LSP, should be at a direction to determine that RSVP signalling error message is (to actual head-end node)
Or sent in both direction (to head-end node and actual head-end node is initiated).As described above, in response to the midpoint of LSP
The bandwidth requirement met at node, head-end node can be informed preceding to LSP with signal.For example according to CAC treatment, bandwidth requirement
Subsequent examination is carried out by midpoint node, to remain to the amount of the asked flow of delivery before ensuring to LSP.Before being informed with signal to
During LSP, midpoint node can check the association type field 410 of extension affiliated partner 400, to determine that LSP associations are cooperation roads
By being also that non-cooperation route.If association is cooperation route (for example, cooperation route one side association bidirectional LSP), midpoint node
CAC treatment is can also carry out to check the bandwidth of reverse LSP.So, midpoint node can be (for example, setting up the reverse LSP phases
Between) incipient fault is checked, and notify to initiate head-end node, to allow that initiating head-end node attempts calculating alternative immediately
Path.
Illustratively, signalling error message can by midpoint node send to cooperation route LSP initiation head-end node and
Endpoint node is (for example, extremely initiate the RSVP of head-end node by sending to the RSVP error messages of actual head-end node and transmission
Notification message), wherein it is possible to just signalling error message is sent to actual head end section in the situation of non-cooperation route LSP only
Point.It should be noted that midpoint node is come using the association type 410 (rather than ID 420 is for example associated) of extension affiliated partner 400
Determine that LSP is that cooperation route is also non-cooperation route.Because in checking the preceding signaling message to LSP and reverse LSP of traversal
Association ID 420 be not enough to infer that LSP is that cooperation route is also non-cooperation route at midpoint node because non-cooperation route
LSP can travel through same paths in forward and backward.
Fig. 5 shows the cooperation for setting up two-way packet traffic engineering tunnel according to one or more embodiments described herein
Route LSP and non-cooperation route LSP and the exemplary reduced program informed with signal.Head-end node can by calculate before to
(being probably reverse) LSP sets up two-way traffic engineering tunnel.Head-end node may then pass through RSVP PATHs via forward direction LSP
Send to endpoint node to inform two-way traffic engineering tunnel with signal.PATH can include object, for example, specifying multiple additional passes
The extension affiliated partner of one of connection type, additional association type route or non-to LSP and reverse LSP before clearly identifying as cooperation
The arranging of cooperation route.
Program 500 starts from frame 505, and advances to frame 510, and at frame 510, endpoint node receives RSVP paths and disappears
Breath, and at frame 515, check and be used for setting up suitable reversely LSP and to the object (bag of its message informed with signal
Include extension affiliated partner), and produce two-way traffic engineering tunnel.At frame 520, endpoint node checks these objects to determine ERO (examples
Such as, reverse ERO) whether there is in RSVP PATHs.It is present in PATH in response to ERO, at frame 525, end
Node signal informs the reverse LSP specified by the ERO, and the program terminates at frame 565.However, not deposited in response to ERO
In being RSVP PATHs, at frame 530, endpoint node checks the extension affiliated partner of the message to determine the association of LSP
Whether type is non-cooperation route.It is non-cooperation route (that is, being) in response to association type, at frame 535, endpoint node is attempted
Calculate reverse LSP and it is informed with signal.In response to the trial and success at frame 540, the program terminates at frame 565.
It is unsuccessful in response to the trial at frame 540, i.e. endpoint node can not calculate reverse LSP or it is informed with signal, then exist
At frame 545, endpoint node head-end node sends RSVP signalling error message, and the program terminates at frame 565.However,
It is cooperation route (that is, no) in response to the association type at frame 530, then at frame 550, endpoint node checks RSVP PATHs
To determine that RRO (for example, path RRO) whether there is in PATH.Exist in response to path RRO, at frame 560, end
Node informs the reverse LSP being recorded in the RRO with signal using path RRO, and the program terminates at frame 565.
It is not present in RSVP PATHs in response to the RRO at frame 550, then at frame 535, endpoint node is attempted calculating reverse LSP
And it is informed with signal.In response to the trial and success at frame 540, the program terminates at frame 565.In response to frame
Trial at 540 is unsuccessful, and at frame 545, endpoint node head-end node sends RSVP signalling error message, and the program
Terminate at frame 565.
Advantageously, each embodiment described herein can be used to (for example, by enabling a node to only check
The association type 410 of the extension affiliated partner 400 delivered in RSVP PATHs 300 is (for example, non-cooperation route two-sided association pair
To LSP or non-cooperations route one side association bidirectional LSP), so as to avoid by head-end node to reverse LSP paths ERO information or preceding
Calculated to LSP paths RRO information and informed with signal) set up non-cooperation road bidirectional LSP.Embodiment described herein is also
(the example of association type 410 of the extension affiliated partner 400 that can be used to only be checked by endpoint node indicated by head-end node
Such as, cooperation route two-sided association bidirectional LSP or cooperation route one side association bidirectional LSP) set up cooperation route bidirectional LSP.Ring
Should be in it is determined that the cooperation route arranging type of LSP, endpoint node can be reverse with (for example, using forward path RRO information) calculating
LSP is simultaneously informed it with signal.It should be noted that checking the content of RRO in PATH can not cause that endpoint node is inferred
The cooperation route association type of LSP.
Embodiments described herein is additionally operable to set up two-way TE between the domain with cooperation route or non-cooperation route LSP
Tunnel, wherein, head-end node does not have complete (such as other domains) TE topological databases, without the reverse middle-end of calculating yet
To the ability in end path.Set up accordingly for bidirectional tunnel between such domain, midpoint boundary node can be used with reference to ERO
The additional association type 410 of LSP to be performed in reversely loose hop ERO expansions.The endpoint node of bidirectional tunnel can also be directed to
Cooperation route LSP and non-cooperation route LSP provides suitable processing locality, without will for information about be relayed to head-end node
Informing with signal reverse LSP, informed with signal again and to its re-optimization, so as to improve TE convergence and
Minimize flow loss.In addition, embodiment described herein is interoperability in multiple provider environments, because this is eliminated
The ambiguity of the association type of cooperation route or non-cooperation route LSP.
While there has been shown and described that example embodiment makes it possible to the arranging relative to LSP/ tunnels clearly
Mode sets up the cooperation route of two-way traffic engineering tunnel and non-cooperation route LSP and it is informed with signal, but it is to be understood that
Various other adaptations and modification can be made in the spirit and scope of the embodiments herein.Although for example, described herein
Embodiment in one or more embodiments can be directed to individual domain bidirectional LSP/tunnel, but teaching herein is equally applicable
Bidirectional LSP/tunnel between domain.Herein, head-end node can create the TE LSP paths in the multiple domains of traversal.However, head-end node
The internal routing information of special domain is not known；However, it may be desirable to the route that routing iinformation comes in specified path ERO.Therefore, head
End node may rely on abstract node loose in ERO, and midpoint boundary node can perform CSPF and calculate or for it
Special domain calculates LSP.Therefore, head-end node can send RSVP PATHs, and midpoint border router by preceding to LSP
ERO expansions can be performed to loose abstract node to calculate the path in its domain.Boundary node can also check that RSVP paths disappear
The association type 410 of the extension affiliated partner 400 in breath 300, to determine that LSP is that cooperation route is also that non-cooperation route.Pass through
Check association type field 410, boundary node can with it is simple, directly and clearly cooperation of the mode to determine LSP route
Or non-cooperation route is arranged, such that it is able to correspondingly arrange two-way traffic engineering tunnel.
Description above has been directed to specific embodiment.However, it is possible to reach some or all advantages of these embodiments
In the case of other made to described embodiment change and modifications, this will be apparent.For example, it should be clearly that examine
Worry, part described herein and/or element can be implemented as being coded in the calculating of one or more tangible (non-volatile)
Software on machine readable storage medium storing program for executing (for example, disk/CD etc.), the computer-readable recording medium has in computer, hardware, consolidates
The programmed instruction run on part or its combination.Therefore, this specification is not intended to limit embodiment hereof only with the mode of example
Scope.Therefore, the target of appended claims be covering enter embodiment hereof true spirit and scope in it is all so
Change and modifications.
Claims (15)
1. a kind of method for arranging bidirectional tunnel, including：
First path message is received at the endpoint node of the bidirectional tunnel, the first path message is passed through by head-end node
The forward path of the bidirectional tunnel is transmitted, the first path message include one or more objects, it is one or
Multiple objects are used to build up the reverse path of the bidirectional tunnel and the reverse path of the bidirectional tunnel are informed with signal；
Check one or more of objects of the first path message, with determine explicit route object ERO whether there is in
In the first path message；
It is present in the first path message in response to the ERO, the reverse road as specified by the ERO is informed with signal
Footpath；And
It is not present in the first path message in response to the ERO,
The extension affiliated partner of the message is checked, is that cooperation route is also non-cooperation road with the association type for determining the path
By；And
In response to the association type for non-cooperation route, calculate the reverse path and inform the reverse path with signal.
2. the method for claim 1, wherein the association type is that non-cooperation route two-sided association bidirectional LSP.
3. the method for claim 1, wherein the first path message disappears for first resource reservation protocol RSVP paths
Breath, and wherein, the bidirectional tunnel is bidirectional flow engineering traffic engineering tunnel.
4. the method for claim 1, wherein the forward path is preceding to label switching path LSP, and wherein,
The reverse path is reverse LSP.
5. the method for claim 1, wherein the ERO is reverse ERO.
6. the method for claim 1, wherein inform that the reverse path also includes with signal：
Second PATH is sent from the endpoint node to the head-end node by the reverse path；And
The return reserving message from the head-end node is received at the endpoint node.
7. the method for claim 1, also includes:
It is not present in the first path message in response to the ERO, and the association type is cooperation route,
Check one or more of objects of the first path message, with determine record routing object RRO whether there is in
In the first path message；And
It is present in the first path message in response to the RRO, the reverse road recorded in the RRO is informed with signal
Footpath.
8. method as claimed in claim 7, wherein, the RRO is path RRO.
9. method as claimed in claim 7, also includes：
It is not present in the first path message in response to the RRO, calculates the reverse path and inform institute with signal
State reverse path.
10. method as claimed in claim 9, also includes：
In response to calculating the reverse path not successfully or informing the reverse path with signal, from the endpoint node to described
Head-end node sends error message.
11. the method for claim 1, also include, are present in the first path message in response to the ERO：
Error message is relayed to the head-end node to respond the generation of failure.
A kind of 12. systems for arranging bidirectional tunnel, including：
Network interface, the network interface is connected to network, and the network interface is suitable to by the described two-way of the network
The forward path in tunnel receives the first path message sent by head-end node, and the first path message includes one or more
Object, one or more of objects are used to build up the reverse path of the bidirectional tunnel and inform the two-way tunnel with signal
The reverse path in road；
Processor, the processor is coupled in the network interface, and the processor is suitable to run at one or more
Reason；And
Memory, the memory is configured as one or more for the treatment of that storage can be run by the processor, works as institute
State one or more treatment when being run it is operable with：
Check one or more of objects of the first path message, with determine explicit route object ERO whether there is in
In the first path message；
It is present in the first path message in response to the ERO, the reverse road as specified by the ERO is informed with signal
Footpath；And
It is not present in the first path message in response to the ERO,
The extension affiliated partner of the message is checked, is that cooperation route is also non-cooperation road with the association type for determining the path
By；And
In response to the association type for non-cooperation route, calculate the reverse path and inform the reverse path with signal.
13. systems as claimed in claim 12, wherein, when it is one or more for the treatment of be run when, it is also operable with：
It is not present in the first path message in response to the ERO, and the association type is cooperation route, checks institute
One or more of objects of first path message are stated, to determine that record routing object RRO whether there is in the first via
In the message of footpath；And
It is present in the first path message in response to the RRO, the reverse road recorded in the RRO is informed with signal
Footpath.
14. systems as claimed in claim 13, wherein, when it is one or more for the treatment of be run when, it is also operable with：
It is not present in the first path message in response to the RRO, calculates the reverse path and inform institute with signal
State reverse path.
A kind of 15. equipment for arranging bidirectional tunnel, including：
Device for receiving first path message at the endpoint node of the bidirectional tunnel, the first path message is by head
End node is transmitted by the forward path of the bidirectional tunnel, and the first path message includes one or more objects,
One or more of objects are used to build up the reverse path of the bidirectional tunnel and inform the bidirectional tunnel with signal
Reverse path；
One or more of objects for checking the first path message, to determine whether explicit route object ERO deposits
It is the device in the first path message；
For being present in the first path message in response to the ERO, informed with signal reverse as specified by the ERO
The device in path；And
For being not present in the first path message in response to the ERO, the extension affiliated partner of the message is checked, with
The association type for determining the path be cooperation route be also non-cooperation route device；And
For being non-cooperation route in response to the association type, calculate the reverse path and inform the reverse road with signal
The device in footpath.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US13/541,572 | 2012-07-03 | ||
| US13/541,572 US8750310B2 (en) | 2012-07-03 | 2012-07-03 | Signaling co-routed and non co-routed LSPs of a bidirectional packet TE tunnel |
| PCT/US2013/048082 WO2014008080A1 (en) | 2012-07-03 | 2013-06-27 | Signaling co-routed and non co-routed lsps of a bidirectional packet te tunnel |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104429030A CN104429030A (en) | 2015-03-18 |
| CN104429030B true CN104429030B (en) | 2017-06-20 |
Family
ID=48803602
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201380035471.XA Active CN104429030B (en) | 2012-07-03 | 2013-06-27 | Inform that the cooperation of two-way packet traffic engineering tunnel route and non-cooperation route LSP with signal |
Country Status (4)
| Country | Link |
|---|---|
| US (3) | US8750310B2 (en) |
| EP (1) | EP2870736B1 (en) |
| CN (1) | CN104429030B (en) |
| WO (1) | WO2014008080A1 (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9001672B2 (en) | 2012-07-27 | 2015-04-07 | Alcatel Lucent | System, method and apparatus conforming path cost criteria across multiple ABRs |
| US20140269737A1 (en) * | 2013-03-15 | 2014-09-18 | Pradeep G. Jain | System, method and apparatus for lsp setup using inter-domain abr indication |
| US9210075B2 (en) * | 2013-10-08 | 2015-12-08 | Ciena Corporation | Method and apparatus for managing end-to-end consistency of bi-directional MPLS-TP tunnels via in-band communication channel (G-ACH) protocol |
| US9350605B2 (en) * | 2013-10-11 | 2016-05-24 | Ciena Corporation | Method and apparatus for multi-instance control plane for dynamic MPLS-TP tunnel management via in-band communication channel (G-ACH) |
| US10038625B2 (en) * | 2014-11-07 | 2018-07-31 | Cisco Technology, Inc. | Optimizing bidirectional traffic flows |
| CN106034076A (en) * | 2015-03-12 | 2016-10-19 | 中兴通讯股份有限公司 | Method and system for realizing path calculation, and path calculation node |
| US10637775B2 (en) | 2015-10-17 | 2020-04-28 | Cisco Technology, Inc. | Make-before-break mechanism for label switched paths |
| US10200253B2 (en) * | 2016-01-11 | 2019-02-05 | Futurewei Technologies, Inc. | Method of establishing relationships between sets of label switched paths and virtual networks |
| CN111669320B (en) * | 2016-12-20 | 2023-04-21 | 华为技术有限公司 | Method for processing message and network equipment |
| CN108880766A (en) * | 2017-05-10 | 2018-11-23 | 中兴通讯股份有限公司 | Signaling configuration method and device |
| US10673649B2 (en) | 2017-10-24 | 2020-06-02 | Cisco Technology, Inc. | Method and device for quality of service regulation |
| CN110380966B (en) * | 2018-04-13 | 2020-11-06 | 华为技术有限公司 | Method for discovering forwarding path and related equipment thereof |
| CN114650250A (en) * | 2020-12-18 | 2022-06-21 | 中国移动通信有限公司研究院 | Processing method, device, management and control system and network equipment of bidirectional segment routing tunnel |
| CN114915538A (en) * | 2021-01-29 | 2022-08-16 | 华为技术有限公司 | Fault detection method, network device and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102204190A (en) * | 2011-05-31 | 2011-09-28 | 华为技术有限公司 | A path creation method and a device thereof |
| CN102394768A (en) * | 2011-10-11 | 2012-03-28 | 中兴通讯股份有限公司 | Method and device for re-optimizing tunnel path |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3762749B2 (en) * | 2001-04-19 | 2006-04-05 | 富士通株式会社 | Restoration protection method and apparatus |
| CN1294728C (en) * | 2004-08-05 | 2007-01-10 | 华为技术有限公司 | Method and system for providing QoS assurance in edge router |
| US7420989B2 (en) * | 2004-09-30 | 2008-09-02 | Lucent Technologies Inc. | Technique for identifying backup path for shared mesh protection |
| FR2876525A1 (en) * | 2004-10-08 | 2006-04-14 | France Telecom | METHOD AND DEVICE FOR CREATING A TUNNEL IN A LABEL SWITCHED TELECOMMUNICATION NETWORK |
| US7489695B1 (en) * | 2004-10-12 | 2009-02-10 | Juniper Networks, Inc. | Automatic LSP stitching with protocol signaling |
| KR100693052B1 (en) * | 2005-01-14 | 2007-03-12 | 삼성전자주식회사 | Apparatus and method of fast reroute for mpls multicast |
| CN101326791B (en) * | 2005-10-14 | 2015-07-22 | 北方电讯网络有限公司 | Method and network for controlling Provider Backbone Transport (PBT) with Genreralized Multi-protocol Label Switching (GMPLS) |
| JP2008193395A (en) * | 2007-02-05 | 2008-08-21 | Fujitsu Ltd | Two-way path setting method, and communication system and node device for achieving it |
-
2012
- 2012-07-03 US US13/541,572 patent/US8750310B2/en active Active
-
2013
- 2013-06-27 CN CN201380035471.XA patent/CN104429030B/en active Active
- 2013-06-27 WO PCT/US2013/048082 patent/WO2014008080A1/en active Application Filing
- 2013-06-27 EP EP13739312.0A patent/EP2870736B1/en active Active
-
2014
- 2014-06-09 US US14/299,912 patent/US9083553B2/en active Active
-
2015
- 2015-06-10 US US14/735,971 patent/US9313145B2/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102204190A (en) * | 2011-05-31 | 2011-09-28 | 华为技术有限公司 | A path creation method and a device thereof |
| CN102394768A (en) * | 2011-10-11 | 2012-03-28 | 中兴通讯股份有限公司 | Method and device for re-optimizing tunnel path |
Also Published As
| Publication number | Publication date |
|---|---|
| US9313145B2 (en) | 2016-04-12 |
| US20150281115A1 (en) | 2015-10-01 |
| WO2014008080A1 (en) | 2014-01-09 |
| US20140010072A1 (en) | 2014-01-09 |
| US9083553B2 (en) | 2015-07-14 |
| EP2870736A1 (en) | 2015-05-13 |
| EP2870736B1 (en) | 2018-08-08 |
| CN104429030A (en) | 2015-03-18 |
| US8750310B2 (en) | 2014-06-10 |
| US20140286341A1 (en) | 2014-09-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104429030B (en) | Inform that the cooperation of two-way packet traffic engineering tunnel route and non-cooperation route LSP with signal | |
| KR102057980B1 (en) | Path Computing Element Central Controllers (PCECCs) for Network Services | |
| US7710902B2 (en) | Path diversity for customer-to-customer traffic | |
| CN101133408B (en) | Computation of a shortest inter-domain te-lsp across a set of autonomous systems | |
| US7920466B2 (en) | Protection of hierarchical tunnel head-end nodes | |
| US7710872B2 (en) | Technique for enabling traffic engineering on CE-CE paths across a provider network | |
| US8199642B2 (en) | Dynamically and efficiently forming hierarchical tunnels | |
| EP3002913B1 (en) | Tunnel establishment method, label allocation method, device, and network system | |
| CN101288266B (en) | Dynamic retrieval method and system of engineering label switching routing information among autonomous systems | |
| US7593340B2 (en) | Method and system for multi-domain route computation | |
| US8040797B2 (en) | Sliced tunnels in a computer network | |
| CN104718732B (en) | For to establish the method that path exchanges information between the two of communication network node | |
| CN100493022C (en) | Method for securing service quality in skeletal network of two-stage virtual special network | |
| WO2015024440A1 (en) | Method and system of obtaining link overhead value of ip link | |
| CN114205187A (en) | End-to-end path calculation method and device of MPLS-VPN (Multi-protocol Label switching-virtual private network) suitable for Option C cross-domain | |
| Nemtur | Failure recovery techniques over an MPLS network using OPNET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |