CN105681190A - Tunnel restraint information sending, receiving method and device - Google Patents
Tunnel restraint information sending, receiving method and device Download PDFInfo
- Publication number
- CN105681190A CN105681190A CN201410675842.7A CN201410675842A CN105681190A CN 105681190 A CN105681190 A CN 105681190A CN 201410675842 A CN201410675842 A CN 201410675842A CN 105681190 A CN105681190 A CN 105681190A
- Authority
- CN
- China
- Prior art keywords
- loose
- path
- point
- tunnel
- constraints
- 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.)
- Pending
Links
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
Abstract
The invention discloses a tunnel restraint information sending, receiving method and device and relates to the field of data network communication. The tunnel restraint information sending method disclosed by the invention comprises following steps of when there are loose points in building a tunnel, setting the restraint condition between every two loose points in the tunnel by a head node; calculating a route from the head node to a first loose point; transmitting the calculated route information from the head node to the first loose point and the restraint condition between every two loose points to each follow-up node through protocol messages, wherein the restraint condition between every two loose points is used for route exclusion in calculating the loose point route. The invention also discloses a tunnel restraint information receiving method and tunnel restraint information sending and receiving device. According to the technical solution provided by the invention, the restraint of each segment of route can be deployed through extending a new sub-object; and the calculated tunnel route conforms to the deployment demand better.
Description
Technical field
The present invention relates to data network communication field, specifically, be the transmission plan of a kind of RSVP-TE tunnel tunnel constraint information in tunnel establishment procedure.
Background technology
RSVP-TE (ResourceReservationProtocol-TrafficEngineer, logic based MINLP) is a kind of Technology of Traffic Engineering based on MPLS. By information issue, path computing, Signalling exchange (RSVP-TE), flow forward four parts realize service traffics forwarding in traffic engineering tunnel.
The transmission of present network, particularly finance data, has strict requirement to the selection in path, the cost of such as transmission link, time delay, shake etc. So when tunnel is set up, these constraintss are required for submitting to CSPF computing unit and carry out constraint calculating. These constraintss need to pass to downstream node in some cases.
As it is shown in figure 1, for the tunnel at single domain, tunnel path planning can be strict path, time such tunnel is set up, only submitting to a CSPF to calculate at head node, the path of calculating directly arrives tunnel tail node, and so all of path constraint can be carried to downstream.
But along with present network becomes increasingly complex, between city and city, between operator and operator, each own network, sets up tunnel between them, it may be possible to across Area territory, it may be possible to across AS territory, as shown in Figures 2 and 3. In order to plan maximum link cost, maximum delay and the shake that path, each territory allows, it is necessary to these to be delivered to the node of respective downstream path computing again in the constraints that tunnel head node is planned. It is true that for cross-domain tunnel, tunnel head node can not utilize once calculates road, is once calculated in the path of tunnel head node to tunnel tail node, it is necessary to carry out segmentation calculating. As shown in Figures 2 and 3, the showing paths of tunnel must configure loose to ABR (R3 and the R4 in Fig. 2 is ABR node) or the ASBR node (R4 in Fig. 3, R8, R12 are ASBR nodes), tunnel head node first calculates path to first loose nodes;Carry out calculating road at first loose nodes again, calculate to second loose nodes; Second loose nodes calculates road again, calculates to the 3rd loose nodes ... until calculating tail node. On each loose nodes, all processes on You Yigesuan road.
Constraints between each loose point above-mentioned is carried to downstream loose nodes but without relevant object at present, can calculate by constrained path when road loose counting.
Summary of the invention
The technical problem to be solved is to provide sending, receiving method and the device of a kind of tunnel constraint information, with the problem solving to realize the deployment in all paths in tunnel in prior art.
In order to solve above-mentioned technical problem, the invention discloses the sending method of a kind of tunnel constraint information, including:
When a tunnel exists at loose in setting up, head node sets the constraints between the loose point of each two in this tunnel, calculate head node to the path between first loose point, and by protocol massages, the constraints between the routing information between computed head node to first loose point and the loose point of each two is transferred to follow-up each node, wherein, the constraints between the loose point of described each two is got rid of for the path of loose nodes path computing.
Alternatively, said method also includes:
Receiving the loose point of described protocol massages, resolve described protocol massages, if therefrom getting Existence restraint condition between the loose point of this loose point and nearest downstream, then, when this loose calculating path, meeting acquired constraints.
Alternatively, in said method, the constraints between loose for each two point is transferred to follow-up each node by protocol massages and refers to by described head node:
Described head node carries the constraints between the loose point of each two by the explicit path object ERO of protocol massages.
Alternatively, in said method, the ERO of described protocol massages carries the routing information between the loose point of each two, carries the constraints between the loose point of each two by the newly-increased subobject of ERO.
The invention also discloses the method for reseptance of a kind of tunnel constraint information, including:
When loose point in logic based MINLP RSVP-TE tunnel receives protocol massages, resolve described protocol massages;
If described loose point gets Existence restraint condition between the loose point of this loose point and nearest downstream from described protocol massages, then, when this loose calculating path, meet acquired constraints.
The invention also discloses the dispensing device of a kind of tunnel constraint information, including:
Path processing unit, when having at loose in tunnel is set up, sets the constraints between the loose point of each two in this tunnel, calculates this node to the path between first loose point;
Transmission unit, by protocol massages, the constraints between loose to the routing information between loose for this computed node to first point and each two point is transferred to follow-up each node, wherein, the constraints between the loose point of described each two is got rid of for the path of loose nodes path computing.
Alternatively, in said apparatus, the constraints between loose for each two point is transferred to follow-up each node by protocol massages and refers to by described transmission unit:
Described transmission unit carries the constraints between the loose point of each two by the explicit path object ERO of protocol massages.
Alternatively, in said apparatus, described transmission unit carries the routing information between the loose point of each two by the ERO of described protocol massages, carries the constraints between the loose point of each two by the newly-increased subobject of ERO.
The invention also discloses the reception device of a kind of tunnel constraint information, including:
Receive resolution unit, receive protocol massages, and resolve described protocol massages;
Path processing unit, if described reception resolution unit gets Existence restraint condition between the loose point of this loose point and nearest downstream from described protocol massages, then, when this loose calculating path, meets acquired constraints.
Technical scheme is by extending new subobject, it is possible to achieve the deployment of the constraint in every section of path in tunnel. The tunnel path calculated more meets the requirement of deployment.
Accompanying drawing explanation
Fig. 1 is existing single domain network Organization Chart;
Fig. 2 is the existing network architecture diagram across Area territory;
Fig. 3 is the existing network architecture diagram across AS territory;
Fig. 4 is the form schematic diagram of subobject ERRS in the embodiment of the present invention;
Fig. 5 is the flow chart that the embodiment of the present invention realizes tunnel constraint information transmission;
Fig. 6 is the network architecture schematic diagram in the embodiment of the present invention.
Detailed description of the invention
For making the object, technical solutions and advantages of the present invention clearly understand, below in conjunction with accompanying drawing, technical solution of the present invention is described in further detail. It should be noted that when not conflicting, embodiments herein and the feature in embodiment can arbitrarily be mutually combined.
Embodiment 1
Present inventor proposes, it is possible to use in RSVP-TE, path computing is retrained by existing object ERO (ExlucdeRouteObject). Thus realizing when loose nodes carries out path computing, it is possible to carry corresponding constraint information.
Based on above-mentioned thought, the present embodiment provides the sending method of a kind of RSVP-TE tunnel constraint information, mainly includes following operation:
When a tunnel exists at loose in setting up, head node sets the constraints between the loose point of each two in this tunnel, calculate head node to the path between first loose point, and by protocol massages, the constraints between the routing information between computed head node to first loose point and the loose point of each two is transferred to follow-up each node, wherein, the constraints between the loose point of each two is got rid of for the path of loose nodes path computing.
And receive the loose point of above-mentioned protocol massages, it is possible to resolving this protocol massages, if therefrom getting Existence restraint condition between the loose point of this loose point and nearest downstream, then when this loose calculating path, meeting acquired constraints.
In said method, the constraints between the loose point of each two can pass through the ERO transmission in existing protocol message.
Preferably, when ERO carries the routing information between the loose point of each two, it is possible in RFC4874, subobject EXRS, the EXRS of extension ERO object are for carrying the constraints between the loose point of each two. In the present embodiment extension new subobject ERRS (ExplicitRestrainRouteSubobject), concrete form as shown in Figure 4. Wherein, each information carried is as follows:
L position: if being 0, represents and must is fulfilled for these constraints, if being 1, expression should meet these constraints as far as possible.
Type type: the type type of definition subobject, fixing tentatively is 34. Reserved field: reserved field, fills 0.
HopNumber: representing the maximum hop count constraint of path computing, 0 represents not this constraint.
CostValue: representing the maximum path cost constraint of path computing, 0 represents not this constraint.
Latency: representing the maximum delay constraint of path computing, 0 represents not this constraint.
LatencyVariation: represent the maximum delay jitter restriction of path computing, 0 represents not this constraint.
The restriction range of ERRS is between adjacent two loose nodes.
The present embodiment reoffers the method for reseptance of a kind of RSVP-TE tunnel constraint information, mainly includes following operation:
When loose point in RSVP-TE tunnel receives protocol massages, resolve this protocol massages;
If loose point gets Existence restraint condition between the loose point of this loose point and nearest downstream from this protocol massages, then, when this loose calculating path, meet acquired constraints.
Be noted that in actual applications, the transmission of the RSVP-TE tunnel constraint information provided in the present embodiment and method of reseptance can in conjunction with use, thus realizing the transmitting procedure of RSVP-TE tunnel constraint information.
Specifically, the transmitting procedure that above two method realizes RSVP-TE tunnel constraint information is adopted to include following operation as shown in Figure 5:
501, it is determined that a tunnel is set up the need of there is loose point.
Wherein, the determination of loose point, it is usually by network topology and service needed, operator plans tunnel path.
502, if there is loose point, head node sets the constraints between the loose point of each two. After the path that head node calculates between first loose point, routing information is carried in ERO with the form of subobject, meanwhile, follow-up constraint information between loose point between two is placed between two loose some subobjects with above-mentioned newly-increased subobject ERRS form.
If one tunnel does not have loose point, then road is calculated at head node in tunnel directly can calculate tunnel tail node. What this situation did not have a follow-up loose constraint carries problem.
503, loose nodes resolves ERO object after receiving protocol massages, it has been found that there is the constraint subobject of ERRS between the loose point in downstream that this loose point is nearest, then when this loose nodes calculates road, using this ERRS constraints as this node.
504, repeat the step of 503, until calculating arrival tunnel, road tail node.
Below again for scene shown in Fig. 3, set up a tunnel from AS1 territory to AS3 territory (R1 → R12). From existing network topology, AS2 territory can only be passed through. When disposing tunnel, it is desirable to the path cost in AS1 territory does not exceed the path cost in 10, AS2 territories and do not exceed the path cost in 20, AS3 territories and do not exceed 30. Due to the tunnel being across, the R9 in R8 and the AS3 territory in R5, AS2 territory in necessary loose R4, AS2 territory to AS1 territory that shows paths when setting up. In figure, the numeral in each of the links represents the path cost value of this section of link.
, there is the constraint of maximum link cost between the loose point of R5 and R8 two, it is possible to be present in ERO with the form of ERRS in the planning according to above-mentioned sending method. For the ease of but distinguishing, there is also the constraint of maximum link cost, be also be present in ERO with the form of ERRS between our the loose point of called after ERRS5to8, R9 and R12 two, we are called after ERRS9to12. Owing to only focusing on path cost when disposing tunnel, so in ERRS5to8 and ERRS5to8, HopNumber, Latency, LatencyVariation are 0, CostValue respectively 20,30.
On head node R1, calculating road and can only calculate the path of R4, the path cost simultaneously retraining this section of path is 10, and the path calculated this time is R1 → R3 → R4, and the path cost of path R1 → R2 → R3 has exceeded 10, so being unsatisfactory for condition.When the R1 PATH message sent encapsulation ERO, the routing information of R1 to R4 is encapsulated to ERO, follow-up once the encapsulation loose point of R5, ERRS5to8, the loose point of R8, the loose point of R9, ERRS9to12, the loose point of R12.
R1 to R4 routing information
R5(LOOSE)
ERRS5to8
R8(LOOSE)
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R3 and R4 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
When R4 receives PATH message, from ERO, it is found to next loose hop R5 does not calculate path, simultaneously also without the constraint of ERRS before R5, so when submitting calculation road to, calculate a reachable path, in Fig. 3 topology, an only unique paths.
When R5 receives PATH message, it is found to next loose hop R8 and has routing information, before R8 subobject, there is the constraint of ERRS5to8 simultaneously, so when submitting calculation road to, ERRS5to8 constraint information is submitted in calculation road, the path calculated is: R5 → R6 → R8, because the link cost in other paths both is greater than binding occurrence 20.
ERO information in the PATH message that R5 sends is:
The routing information of R5 to R8
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R6 and R8 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
When R8 receives PATH message, from ERO, it is found to next loose hop R9 does not calculate path, simultaneously also without the constraint of ERRS before R9, so when submitting calculation road to, calculate a reachable path, in Fig. 3 topology, an only unique paths.
When R9 receives PATH message, it is found to next loose hop R12 and does not have routing information, before R12 subobject, there is the constraint of ERRS9to12 simultaneously, so when submitting calculation road to, ERRS9to12 constraint information is submitted in calculation road, the path calculated is: R9 → R11 → R12, because the link cost in other paths both is greater than binding occurrence 30.
R11 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
R12 node is when receiving PATH Message Processing and falling, it has been found that be tunnel destination. PATH signaling (i.e. protocol massages) terminates.
The path of whole piece path constraint is: R1 → R3 → R4 → R5 → R6 → R8 → R9 → R11 → R12.
By carrying path cost constraint information between loose nodes between two in protocol massages so that whole piece path meets a node to every section of path cost constraints.
Still for scene shown in Fig. 3, set up a tunnel from AS1 territory to AS3 territory (R1 → R12). From existing network topology, AS2 territory can only be passed through. When disposing tunnel, it is desirable in AS1 territory, the maximum delay in path does not exceed the maximum delay in path in 10, AS2 territories and do not exceed the maximum delay in path in 20, AS3 territories and do not exceed 30. Due to the tunnel being across, the R9 in R8 and the AS3 territory in R5, AS2 territory in necessary loose R4, AS2 territory to AS1 territory that shows paths when setting up. In figure, the numeral in each of the links represents the time delay value of this section of link.
Planning according to above-mentioned sending method, the constraint of maximum delay is there is between the loose point of R5 and R8 two, it is present in ERO with the form of ERRS, for the ease of but distinguishing, we are called after ERRS5to8, there is also the constraint of maximum delay between the loose point of R9 and R12 two, be also be present in ERO with the form of ERRS, we are called after ERRS9to12. Owing to only focusing on maximum delay when disposing tunnel, so in ERRS5to8 and ERRS5to8, HopNumber, CostValue, LatencyVariation are 0, Latency respectively 20,30.
On head node R1, calculating road and can only calculate the path of R4, the maximum delay simultaneously retraining this section of path is 10, and the path calculated this time is R1 → R3 → R4, and the maximum delay of path R1 → R2 → R3 has exceeded 10, so being unsatisfactory for condition. When the R1 PATH message sent encapsulation ERO, the routing information of R1 to R4 is encapsulated to ERO, follow-up once the encapsulation loose point of R5, ERRS5to8, the loose point of R8, the loose point of R9, ERRS9to12, the loose point of R12.
R1 to R4 routing information
R5(LOOSE)
ERRS5to8
R8(LOOSE)
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R3 and R4 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
When R4 receives PATH message, from ERO, it is found to next loose hop R5 does not calculate path, simultaneously also without the constraint of ERRS before R5, so when submitting calculation road to, calculate a reachable path, in Fig. 3 topology, an only unique paths.
When R5 receives PATH message, it is found to next loose hop R8 and has routing information, before R8 subobject, there is the constraint of ERRS5to8 simultaneously, so when submitting calculation road to, ERRS5to8 constraint information is submitted in calculation road, the path calculated is: R5 → R6 → R8, because the maximum delay in other paths both is greater than binding occurrence 20.
ERO information in the PATH message that R5 sends is:
The routing information of R5 to R8
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R6 and R8 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
When R8 receives PATH message, from ERO, it is found to next loose hop R9 does not calculate path, simultaneously also without the constraint of ERRS before R9, so when submitting calculation road to, calculate a reachable path, in Fig. 3 topology, an only unique paths.
When R9 receives PATH message, it is found to next loose hop R12 and does not have routing information, before R12 subobject, there is the constraint of ERRS9to12 simultaneously, so when submitting calculation road to, ERRS9to12 constraint information is submitted in calculation road, the path calculated is: R9 → R11 → R12, because the maximum delay in other paths both is greater than binding occurrence 30.
R11 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
R12 node is when receiving PATH Message Processing and falling, it has been found that be tunnel destination. PATH signaling (i.e. protocol massages) terminates.
The path of whole piece path constraint is: R1 → R3 → R4 → R5 → R6 → R8 → R9 → R11 → R12.
By carrying maximum delay constraint information between loose nodes between two in protocol massages so that whole piece path meets the node constraints to every section of maximum delay.
For scene shown in Fig. 3, set up a tunnel from AS1 territory to AS3 territory (R1 → R12). From existing network topology, AS2 territory can only be passed through. Dispose tunnel time, it is desirable in AS1 territory path maximum delay shake do not exceed path in 10, AS2 territories maximum delay shake do not exceed path in 20, AS3 territories maximum delay shake do not exceed 30. Due to the tunnel being across, the R9 in R8 and the AS3 territory in R5, AS2 territory in necessary loose R4, AS2 territory to AS1 territory that shows paths when setting up. In figure, the numeral in each of the links represents the delay variation value of this section of link.
According to above-mentioned planning, the constraint of maximum delay shake is there is between the loose point of R5 and R8 two, it is present in ERO with the form of ERRS, for the ease of but distinguishing, we are called after ERRS5to8, there is also the constraint of maximum delay shake between the loose point of R9 and R12 two, be also be present in ERO with the form of ERRS, we are called after ERRS9to12.Owing to only focusing on maximum delay shake when disposing tunnel, so in ERRS5to8 and ERRS5to8, HopNumber, CostValue, Latency are 0, LatencyVariation respectively 20,30.
On head node R1, calculating road and can only calculate the path of R4, the maximum delay simultaneously retraining this section of path is dithered as 10, and the path calculated this time is R1 → R3 → R4, and the maximum delay shake of path R1 → R2 → R3 has exceeded 10, so being unsatisfactory for condition. When the R1 PATH message sent encapsulation ERO, the routing information of R1 to R4 is encapsulated to ERO, follow-up once the encapsulation loose point of R5, ERRS5to8, the loose point of R8, the loose point of R9, ERRS9to12, the loose point of R12.
R1 to R4 routing information
R5(LOOSE)
ERRS5to8
R8(LOOSE)
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R3 and R4 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
When R4 receives PATH message, from ERO, it is found to next loose hop R5 does not calculate path, simultaneously also without the constraint of ERRS before R5, so when submitting calculation road to, calculate a reachable path, in Fig. 3 topology, an only unique paths.
When R5 receives PATH message, it is found to next loose hop R8 and has routing information, before R8 subobject, there is the constraint of ERRS5to8 simultaneously, so when submitting calculation road to, ERRS5to8 constraint information is submitted in calculation road, the path calculated is: R5 → R6 → R8, because the maximum delay shake in other paths both is greater than binding occurrence 20.
ERO information in the PATH message that R5 sends is:
The routing information of R5 to R8
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R6 and R8 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
When R8 receives PATH message, from ERO, it is found to next loose hop R9 does not calculate path, simultaneously also without the constraint of ERRS before R9, so when submitting calculation road to, calculate a reachable path, in Fig. 3 topology, an only unique paths.
When R9 receives PATH message, it is found to next loose hop R12 and does not have routing information, before R12 subobject, there is the constraint of ERRS9to12 simultaneously, so when submitting calculation road to, ERRS9to12 constraint information is submitted in calculation road, the path calculated is: R9 → R11 → R12, because the maximum delay shake in other paths both is greater than binding occurrence 30.
R11 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
R12 node is when receiving PATH Message Processing and falling, it has been found that be tunnel destination. PATH signaling (i.e. protocol massages) terminates.
The path of whole piece path constraint is: R1 → R3 → R4 → R5 → R6 → R8 → R9 → R11 → R12.
By carrying maximum delay jitter restriction information between loose nodes between two in signaling (i.e. protocol massages) so that whole piece path meets the constraints that every section of maximum delay is shaken by a node.
Finally, for scene shown in Fig. 6, set up a tunnel from AS1 territory to AS3 territory (R1 → R12). From existing network topology, AS2 territory can only be passed through. Dispose tunnel time, it is desirable in AS1 territory the maximum hop count in path less than the maximum hop count in path in 1, AS2 territory less than the maximum hop count in path in 1, AS3 territory less than 1. Due to the tunnel being across, the R9 in R8 and the AS3 territory in R5, AS2 territory in necessary loose R4, AS2 territory to AS1 territory that shows paths when setting up.
According to above-mentioned planning, the constraint of maximum hop count is there is between the loose point of R5 and R8 two, it is present in ERO with the form of ERRS, for the ease of but distinguishing, we are called after ERRS5to8, there is also the constraint of maximum hop count between the loose point of R9 and R12 two, be also be present in ERO with the form of ERRS, we are called after ERRS9to12. Owing to only focusing on maximum hop count when disposing tunnel, so CostValue, Latency, LatencyVariation are 0, HopNumber respectively 1,1 in ERRS5to8 and ERRS5to8.
On head node R1, calculating road and can only calculate the path of R4, the maximum hop count simultaneously retraining this section of path is 1, and the path calculated this time is R1 → R4, and the maximum hop count of path R1 → R2 → R3 is 2, has exceeded binding occurrence, so being unsatisfactory for condition. When the R1 PATH message sent encapsulation ERO, the routing information of R1 to R4 is encapsulated to ERO, follow-up once the encapsulation loose point of R5, ERRS5to8, the loose point of R8, the loose point of R9, ERRS9to12, the loose point of R12.
R1 to R4 routing information
R5(LOOSE)
ERRS5to8
R8(LOOSE)
R9(LOOSE)
ERRS9to12
R12(LOOSE)
When R4 receives PATH message, from ERO, it is found to next loose hop R5 does not calculate path, simultaneously also without the constraint of ERRS before R5, so when submitting calculation road to, calculate a reachable path, in Fig. 3 topology, an only unique paths.
When R5 receives PATH message, it is found to next loose hop R8 and has routing information, before R8 subobject, there is the constraint of ERRS5to8 simultaneously, so when submitting calculation road to, ERRS5to8 constraint information is submitted in calculation road, the path calculated is: R5 → R8, because the maximum hop count in other paths both is greater than binding occurrence 1.
ERO information in the PATH message that R5 sends is:
The routing information of R5 to R8
R9(LOOSE)
ERRS9to12
R12(LOOSE)
R6 and R8 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
When R8 receives PATH message, from ERO, it is found to next loose hop R9 does not calculate path, simultaneously also without the constraint of ERRS before R9, so when submitting calculation road to, calculate a reachable path, in Fig. 3 topology, an only unique paths.
When R9 receives PATH message, it is found to next loose hop R12 and does not have routing information, before R12 subobject, there is the constraint of ERRS9to12 simultaneously, so when submitting calculation road to, ERRS9to12 constraint information is submitted in calculation road, the path calculated is: R9 → R12, because the maximum hop count in other paths both is greater than binding occurrence 1.
R11 node is when receiving PATH Message Processing and falling, and ERO after bullet falls local jumping respectively, can send toward downstream.
R12 node is when receiving PATH Message Processing and falling, it has been found that be tunnel destination. PATH signaling (i.e. protocol massages) terminates.
The path of whole piece path constraint is: R1 → R3 → R4 → R5 → R6 → R8 → R9 → R11 → R12.
By carrying maximum hop count constraint information between loose nodes between two in signaling (i.e. protocol massages) so that whole piece path meets the node constraints to every section of maximum hop count.
Additionally, in actual applications, tetra-kinds of constraint informations of HopNumber, CostValue, Latency, LatencyVariation above, retrain needs according to actual deployment, it is possible to choose one or more information between loose point as the constraint calculating road between two. Correspondingly, existing for that one or more are information constrained in ERRS, the rule of process is consistent with above-described embodiment, is not repeated to launch to describe.
Embodiment 2
The present embodiment provides the dispensing device of a kind of RSVP-TE tunnel constraint information, and this device can be placed in a node, and it at least includes following each unit.
Path processing unit, when having at loose in tunnel is set up, sets the constraints between the loose point of each two in this tunnel, calculates this node to the path between first loose point;
Transmission unit, by protocol massages, the constraints between loose to the routing information between loose for this computed node to first point and each two point is transferred to follow-up each node, wherein, the constraints between the loose point of each two is got rid of for the path of loose nodes path computing.
Above-mentioned transmission unit can carry the constraints between the loose point of each two by the object ERO of protocol massages. Preferably, carrying the routing information between the loose point of each two in the object ERO of protocol massages, the subobject ERRS again through object ERO carries the constraints between the loose point of each two.
It addition, the present embodiment reoffers the reception device of a kind of RSVP-TE tunnel constraint information, it can be placed in loose point, and it at least includes following each unit:
Receive resolution unit, receive protocol massages, and resolve this protocol massages;
Path processing unit, if receiving resolution unit to get Existence restraint condition between the loose point of this loose point and nearest downstream from protocol massages, then, when this loose calculating path, meets acquired constraints.
Above-mentioned dispensing device and reception device can realize the sending method in above-described embodiment 1 and method of reseptance respectively, therefore the operation in detail of said apparatus may refer to the corresponding contents of above-described embodiment 1, does not repeat them here. It addition, above-mentioned dispensing device and reception device are except can be used alone, it is also possible to the use of, to realize the constraints complete transmission between loose point, so that the tunnel path calculated more meets the requirement of deployment.
One of ordinary skill in the art will appreciate that all or part of step in said method can be carried out instruction related hardware by program and complete, described program can be stored in computer-readable recording medium, such as read only memory, disk or CD etc. Alternatively, all or part of step of above-described embodiment can also use one or more integrated circuit to realize. Correspondingly, each module/unit in above-described embodiment can adopt the form of hardware to realize, it would however also be possible to employ the form of software function module realizes. The application is not restricted to the combination of the hardware and software of any particular form.
The above, be only the preferred embodiments of the present invention, be not intended to limit protection scope of the present invention. All within the spirit and principles in the present invention, any amendment of making, equivalent replacement, improvement etc., should be included within protection scope of the present invention.
Claims (9)
1. the sending method of a tunnel constraint information, it is characterised in that including:
When a tunnel exists at loose in setting up, head node sets the constraints between the loose point of each two in this tunnel, calculate head node to the path between first loose point, and by protocol massages, the constraints between the routing information between computed head node to first loose point and the loose point of each two is transferred to follow-up each node, wherein, the constraints between the loose point of described each two is got rid of for the path of loose nodes path computing.
2. the method for claim 1, it is characterised in that the method also includes:
Receiving the loose point of described protocol massages, resolve described protocol massages, if therefrom getting Existence restraint condition between the loose point of this loose point and nearest downstream, then, when this loose calculating path, meeting acquired constraints.
3. method as claimed in claim 1 or 2, it is characterised in that the constraints between loose for each two point is transferred to follow-up each node by protocol massages and refers to by described head node:
Described head node carries the constraints between the loose point of each two by the explicit path object ERO of protocol massages.
4. method as claimed in claim 3, it is characterised in that
The ERO of described protocol massages carries the routing information between the loose point of each two, carries the constraints between the loose point of each two by the newly-increased subobject of ERO.
5. the method for reseptance of a tunnel constraint information, it is characterised in that including:
When loose point in logic based MINLP RSVP-TE tunnel receives protocol massages, resolve described protocol massages;
If described loose point gets Existence restraint condition between the loose point of this loose point and nearest downstream from described protocol massages, then, when this loose calculating path, meet acquired constraints.
6. the dispensing device of a tunnel constraint information, it is characterised in that including:
Path processing unit, when having at loose in tunnel is set up, sets the constraints between the loose point of each two in this tunnel, calculates this node to the path between first loose point;
Transmission unit, by protocol massages, the constraints between loose to the routing information between loose for this computed node to first point and each two point is transferred to follow-up each node, wherein, the constraints between the loose point of described each two is got rid of for the path of loose nodes path computing.
7. device as claimed in claim 6, it is characterised in that the constraints between loose for each two point is transferred to follow-up each node by protocol massages and refers to by described transmission unit:
Described transmission unit carries the constraints between the loose point of each two by the explicit path object ERO of protocol massages.
8. device as claimed in claim 7, it is characterised in that
Described transmission unit carries the routing information between the loose point of each two by the ERO of described protocol massages, carries the constraints between the loose point of each two by the newly-increased subobject of ERO.
9. the reception device of a tunnel constraint information, it is characterised in that including:
Receive resolution unit, receive protocol massages, and resolve described protocol massages;
Path processing unit, if described reception resolution unit gets Existence restraint condition between the loose point of this loose point and nearest downstream from described protocol massages, then, when this loose calculating path, meets acquired constraints.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410675842.7A CN105681190A (en) | 2014-11-21 | 2014-11-21 | Tunnel restraint information sending, receiving method and device |
| PCT/CN2015/078790 WO2016078363A1 (en) | 2014-11-21 | 2015-05-12 | Methods and apparatuses for sending and receiving tunnel constraint information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410675842.7A CN105681190A (en) | 2014-11-21 | 2014-11-21 | Tunnel restraint information sending, receiving method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105681190A true CN105681190A (en) | 2016-06-15 |
Family
ID=56013210
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410675842.7A Pending CN105681190A (en) | 2014-11-21 | 2014-11-21 | Tunnel restraint information sending, receiving method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105681190A (en) |
| WO (1) | WO2016078363A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018177256A1 (en) * | 2017-03-27 | 2018-10-04 | 中兴通讯股份有限公司 | Method and device for announcing delay information |
| CN109729006A (en) * | 2017-10-27 | 2019-05-07 | 中兴通讯股份有限公司 | A kind of message processing method and device, computer readable storage medium |
| CN112468353A (en) * | 2019-09-09 | 2021-03-09 | 华为数字技术（苏州）有限公司 | Network accessibility detection method and device |
| WO2023040503A1 (en) * | 2021-09-16 | 2023-03-23 | 中兴通讯股份有限公司 | Path calculation method and apparatus, network controller and storage medium |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1592159A (en) * | 2003-08-29 | 2005-03-09 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
| CN1705292A (en) * | 2004-05-31 | 2005-12-07 | 华为技术有限公司 | Route selection method for implementing cross-domain constraint-based routing |
| CN1707978A (en) * | 2004-06-11 | 2005-12-14 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
| CN101222407A (en) * | 2008-01-23 | 2008-07-16 | 中兴通讯股份有限公司 | Method for evading loose node automatic loop circuit |
| CN101237399A (en) * | 2007-09-28 | 2008-08-06 | 华为技术有限公司 | Method, system and device for getting label switching path |
| CN101471853A (en) * | 2007-12-29 | 2009-07-01 | 华为技术有限公司 | Route calculation method, unit and system |
| CN101616063A (en) * | 2008-06-26 | 2009-12-30 | 华为技术有限公司 | A kind of routed path method for building up, system and device |
| CN101984595A (en) * | 2010-11-03 | 2011-03-09 | 北京星网锐捷网络技术有限公司 | Method, system and device for building trans-regional flow engineering tunnel |
| CN102647340A (en) * | 2012-03-22 | 2012-08-22 | 中兴通讯股份有限公司 | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node |
| CN102752186A (en) * | 2011-04-20 | 2012-10-24 | 中兴通讯股份有限公司 | Method and system for selecting path, and nodes |
| US20130232193A1 (en) * | 2012-03-04 | 2013-09-05 | Zafar Ali | Control-Plane Interface Between Layers in a Multilayer Network |
| US20140029413A1 (en) * | 2012-07-27 | 2014-01-30 | Pradeep G. Jain | System and method using rsvp hello suppression for graceful restart capable neighbors |
| CN103688497A (en) * | 2013-09-26 | 2014-03-26 | 华为技术有限公司 | Method and device for establishing cross-domain paths |
| CN105515982A (en) * | 2014-10-20 | 2016-04-20 | 中兴通讯股份有限公司 | Method and apparatus for tunnel path calculation |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8040797B2 (en) * | 2007-02-28 | 2011-10-18 | Cisco Technology, Inc. | Sliced tunnels in a computer network |
| CN101453407B (en) * | 2007-12-03 | 2011-06-08 | 华为技术有限公司 | Router and method for route message processing |
-
2014
- 2014-11-21 CN CN201410675842.7A patent/CN105681190A/en active Pending
-
2015
- 2015-05-12 WO PCT/CN2015/078790 patent/WO2016078363A1/en active Application Filing
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1592159A (en) * | 2003-08-29 | 2005-03-09 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
| CN1705292A (en) * | 2004-05-31 | 2005-12-07 | 华为技术有限公司 | Route selection method for implementing cross-domain constraint-based routing |
| CN1707978A (en) * | 2004-06-11 | 2005-12-14 | 华为技术有限公司 | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network |
| CN101237399A (en) * | 2007-09-28 | 2008-08-06 | 华为技术有限公司 | Method, system and device for getting label switching path |
| CN101471853A (en) * | 2007-12-29 | 2009-07-01 | 华为技术有限公司 | Route calculation method, unit and system |
| CN101222407A (en) * | 2008-01-23 | 2008-07-16 | 中兴通讯股份有限公司 | Method for evading loose node automatic loop circuit |
| CN101616063A (en) * | 2008-06-26 | 2009-12-30 | 华为技术有限公司 | A kind of routed path method for building up, system and device |
| CN101984595A (en) * | 2010-11-03 | 2011-03-09 | 北京星网锐捷网络技术有限公司 | Method, system and device for building trans-regional flow engineering tunnel |
| CN102752186A (en) * | 2011-04-20 | 2012-10-24 | 中兴通讯股份有限公司 | Method and system for selecting path, and nodes |
| US20130232193A1 (en) * | 2012-03-04 | 2013-09-05 | Zafar Ali | Control-Plane Interface Between Layers in a Multilayer Network |
| CN102647340A (en) * | 2012-03-22 | 2012-08-22 | 中兴通讯股份有限公司 | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node |
| US20140029413A1 (en) * | 2012-07-27 | 2014-01-30 | Pradeep G. Jain | System and method using rsvp hello suppression for graceful restart capable neighbors |
| CN103688497A (en) * | 2013-09-26 | 2014-03-26 | 华为技术有限公司 | Method and device for establishing cross-domain paths |
| CN105515982A (en) * | 2014-10-20 | 2016-04-20 | 中兴通讯股份有限公司 | Method and apparatus for tunnel path calculation |
Non-Patent Citations (1)
| Title |
|---|
| ZAFAR ALI等: "Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Extension for Signaling Objective Function and Metric Bound; draft-ali-ccamp-rc-objective-function-metric-bound-05.txt", 《CCAMP WORKING GROUP，INTERNET ENGINEERING TASK FORCE，IETF》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018177256A1 (en) * | 2017-03-27 | 2018-10-04 | 中兴通讯股份有限公司 | Method and device for announcing delay information |
| CN109729006A (en) * | 2017-10-27 | 2019-05-07 | 中兴通讯股份有限公司 | A kind of message processing method and device, computer readable storage medium |
| CN109729006B (en) * | 2017-10-27 | 2021-08-31 | 中兴通讯股份有限公司 | Message processing method and device and computer readable storage medium |
| CN112468353A (en) * | 2019-09-09 | 2021-03-09 | 华为数字技术（苏州）有限公司 | Network accessibility detection method and device |
| CN112468353B (en) * | 2019-09-09 | 2023-11-21 | 华为数字技术（苏州）有限公司 | Network reachability detection method and device |
| WO2023040503A1 (en) * | 2021-09-16 | 2023-03-23 | 中兴通讯股份有限公司 | Path calculation method and apparatus, network controller and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2016078363A1 (en) | 2016-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100461755C (en) | Data message transmitting method and node equipment based on MPLS TE tunnel | |
| JP5759637B2 (en) | Method for creating label switch path of ring network, related device, and communication system | |
| CN1973486B (en) | Avoiding micro-loop upon failure of fast reroute protected links | |
| CN110417651B (en) | Tunnel establishment method, device and system | |
| CN109587009A (en) | The method and apparatus for configuring seamless two-way converting detection SBFD mechanism | |
| CN108337157A (en) | The method and node of transmitting message in a kind of network | |
| US9210037B2 (en) | Method, apparatus and system for interconnected ring protection | |
| CN102119517B (en) | System and method for multi-topology support | |
| CN105681190A (en) | Tunnel restraint information sending, receiving method and device | |
| CN104429030A (en) | Signaling co-routed and non co-routed lsps of bidirectional packet te tunnel | |
| CN102647340A (en) | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node | |
| CN108881017B (en) | Method for changing bandwidth constraint of each hop in multi-path label switching path and router | |
| US20060215660A1 (en) | Device and a method for generating routing messages for a GMPLS control plane communications network | |
| ES2748168T3 (en) | Time-based service processing method and device | |
| CN103166848A (en) | Method and point for selecting multi-protocol label switching traffic engineering bypass tunnel | |
| CN101645822B (en) | Traffic engineering tunnel building method and system | |
| CN103650421B (en) | End-to-end two-way method, system and the node switched of a kind of 1+1 | |
| CN107347034B (en) | Link information processing method, device and system | |
| CN104618235A (en) | Method and device for constructing non-common-path route by cross-layer manner | |
| CN102447612B (en) | Bidirectional point is to multipoint label switched path foundation, grafting and pruning method and system | |
| CN101193047B (en) | Establishment method of resource share path | |
| JP2009188673A (en) | Transmitting apparatus and path setting method | |
| CN104469846A (en) | Message processing method and equipment | |
| CN104579992A (en) | Method and device for controlling network flow path | |
| CN103023780A (en) | Method and device for routing computation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160615 |