CN101753417A - Method for calculating and determining routing, path calculating unit and system for determining routing - Google Patents
Method for calculating and determining routing, path calculating unit and system for determining routing Download PDFInfo
- Publication number
- CN101753417A CN101753417A CN200810182707A CN200810182707A CN101753417A CN 101753417 A CN101753417 A CN 101753417A CN 200810182707 A CN200810182707 A CN 200810182707A CN 200810182707 A CN200810182707 A CN 200810182707A CN 101753417 A CN101753417 A CN 101753417A
- Authority
- CN
- China
- Prior art keywords
- path
- territory
- asbr
- binding occurrence
- destination node
- 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for calculating and determining routing, a path calculating unit and a system for determining routing, wherein, the method for determining the routing comprises: a minimum constraint value vector of an export autonomous system boundary router ASBR of a source domain is computed; the next domain in a domain series sends a path computation request, and the path computation request carries the minimum constraint value vector of the export ASBR, the destination node of the requesting path and the total constraint value vector; the returned path computation response of the next domain in the domain series is received, and the path computation response comprises the path cost from the export ASBR of the next domain to the destination node; the path cost from the source node to the export ASBR of the source domain is computed, and the path cost from the source node to the destination node is determined according to the path cost carried by the path computation response, the export ASBR of the source domain which corresponds to the minimum path cost in the path costs from the source node to the destination node is selected, and the routing from the source node to the destination node is determined. The embodiment of the invention increases the success probability of routing.
Description
Technical field
The embodiment of the invention relates to network communications technology field, the system of method, path-calculating element and definite route of particularly a kind of calculating and definite route.
Background technology
In modern optical networks, for supporting the business demand of rapid growth, higher QoS (Quality of Service, service quality) requirement has been proposed professional route, route various constraints have been added, as cost, bandwidth, time-delay, reliability and must be through point, taboo point etc.Can probably these constraints be divided into four classes, one for the additivity constraint, as cost, time-delay etc.; One is the property taken advantage of constraint, as reliability etc.; One is the convexity constraint, as bandwidth etc.; One is the tactic constraint, as must or avoiding point etc. through point.Wherein, additivity is constrained to the most basic constraint, and the property taken advantage of constraint can be converted into additivity by taking the logarithm, and convexity constraint and tactic constraint (comprising that taboo retrains) are filtered solution by topology before route is calculated.
Calculating based on the route of constraints is MPLS (Multi-Protocol Label Switching, multiprotocol label switching)/basic function of GMPLS (Generalized Multi-Protocol Label Switching, general multiple protocols label exchange) network.Path computing in the large-scale multiple-domain network is very complicated process, may need special computing module and the not cooperation between the same area.
PCE (Path Computation Element, path-calculating element) is a functional entity, and it can topological structure Network Based and constraints, calculates a paths.The characteristics of PCE architecture comprise: PCE and existing MPLS/GMPLS protocol-compliant; PCE is applicable to the operational mode of existing MPLS/GMPLS network, comprises management plane; PCE adopts single signaling protocol and structure, is applicable to different network environments, as in the territory and between the territory, and between the different operators etc.; PCE allows operator or equipment vendors to use different method for routing, based on the traffic engineering parameter and the policy calculation route of complexity; PCE has architecture flexibly, can be in the same place with network element device, also can realize on independent server.
The calculating of finishing multiple constraint is one of very important application scenarios of PCE.Prior art has proposed a kind of method that adopts the backward recursive method to find the solution constraint routing issue between the territory, begin from the territory, place of destination node, enter the mouth to the optimum constrained path of destination node by the territory computational fields, after this computational process arrived the territory, source, the territory, source can calculate the complete optimum constrained path from source node to destination node.But this method does not consider how the constraint of reasonable distribution additivity can't guarantee the successful property that route is calculated to improve the route success rate between each territory, can not avoid the route trap.For example two paths to outlet are found to exist in certain territory when calculating this path, territory, article one, cost be 5 and jumping figure be 6, article one, cost be 7 and jumping figure be 4, suppose that always being constrained to jumping figure end to end is no more than 5, said method will be selected that little paths of cost this moment, and no matter the back also has not calculating path of how many territories, also need keep how many jumping figures and give as yet the not territory of calculating path.The local like this consequence of pursuing optimum is when having the path of end-to-end and satisfied constraint, and said method differs and finds this path surely, has the possibility of route trap.
Summary of the invention
The embodiment of the invention provides the system of method, PCE and definite route of a kind of calculating and definite route, to improve the route probability of successful.
For achieving the above object, the embodiment of the invention provides a kind of method of definite route on the one hand, comprising:
The least commitment value vector of the outlet Autonomous System Boundary Router, AS Boundary Router ASBR in territory, calculating source;
The next field path computation request in the series of territory, described path computing request are carried the least commitment value vector of described outlet ASBR, destination node and total binding occurrence vector of request path;
Receive the path computing response that the next field in the series of described territory returns, comprise the path cost of the inlet ASBR of described the next field in the described path computing response to destination node;
Calculate the path cost of source node to the outlet ASBR in territory, source, and the path cost that response is carried according to described path computing is determined the path cost of described source node to described destination node, select the outlet ASBR in described source node territory, source of minimum path cost correspondence in the path cost of described destination node, determine the route of described source node to described destination node.
On the other hand, the embodiment of the invention also provides a kind of method of calculating route, comprising:
Calculate the least commitment value vector of the ASBR of intermediate field according to the path computing request of the transmission of the previous field in the sequence of territory, and the next field path computation request in the sequence of described territory, described path computing request is carried the least commitment value vector of the outlet ASBR of intermediate field, destination node and total binding occurrence vector of request path;
Receive the path computing response that the next field in the sequence of described territory sends, the inlet ASBR that comprises described the next field in the described path computing response is to the path cost of destination node and used the binding occurrence vector;
According to the described maximum available binding occurrence vector of determining intermediate field with the binding occurrence vector of described total binding occurrence vector sum, and according to the path of the available binding occurrence vector calculation of described maximum intermediate field, the inlet ASBR that determines intermediate field is to the path cost of destination node and used the binding occurrence vector;
The inlet ASBR that intermediate field is carried in the response of the previous field path computation in the series of described territory, described path computing response is to the path cost of destination node and used the binding occurrence vector.
On the one hand, the embodiment of the invention also provides a kind of method of calculating route, comprising again:
The path computing request that the previous field in the acceptance domain series sends, described path computing request are carried the least commitment value vector of the outlet ASBR of described the previous field, the destination node of total binding occurrence vector sum request path;
According to the total binding occurrence vector of least commitment value vector sum of the outlet ASBR of described the previous field, determine the maximum available binding occurrence vector in purpose territory;
According to the path in the described purpose of the available binding occurrence vector calculation of the described maximum territory, the inlet ASBR that described purpose territory is carried in the response of the previous field path computation in the series of described territory, described path computing response is to the path cost of destination node and used the binding occurrence vector.
On the one hand, the embodiment of the invention also provides a kind of path-calculating element PCE again, and described PCE is the PCE in territory, source, and described PCE comprises:
First computing module is used to calculate the least commitment value vector of the outlet ASBR in territory, source;
First sending module is used for the next field path computation request to territory series, and described path computing request is carried the least commitment value vector of the outlet ASBR of described first computing module calculating, destination node and total binding occurrence vector of request path;
First receiver module is used for receiving the path computing response that the next field of described territory series returns, and comprises the path cost of the inlet ASBR of described the next field to destination node in the described path computing response;
The route determination module, be used for determining the path cost of the outlet ASBR in territory, described source to described destination node according to the path cost that described receiver module receives, select the outlet ASBR of described source node minimum path cost correspondence in the path cost of described destination node, determine the route of described source node to described destination node.
On the one hand, the embodiment of the invention also provides a kind of path-calculating element PCE again, and described PCE is the PCE of intermediate field, and described PCE comprises:
Second computing module, the path computing request that is used for sending according to the previous field of territory sequence is calculated the least commitment value vector of the Autonomous System Boundary Router, AS Boundary Router ASBR of intermediate field;
Second sending module, be used for the next field path computation request to described territory sequence, described path computing request is carried the least commitment value vector of the outlet ASBR of the described intermediate field that described second computing module calculates, destination node and total binding occurrence vector of request path;
Second receiver module is used for receiving the path computing response that the next field of described territory sequence sends, and the inlet ASBR that comprises described the next field in the described path computing response is to the path cost of destination node and used the binding occurrence vector;
The primary vector determination module, be used for having determined with the binding occurrence vector the maximum available binding occurrence vector of intermediate field according to described total binding occurrence vector sum, and according to this path, territory of the available binding occurrence vector calculation of described maximum, the inlet ASBR that determines this territory is to the path cost of destination node and used the binding occurrence vector;
Described second sending module also is used for to the response of the previous field path computation of described territory series, and the inlet ASBR that the intermediate field that described primary vector determination module determines is carried in described path computing response is to the path cost of destination node and used the binding occurrence vector.
On the one hand, the embodiment of the invention also provides a kind of path-calculating element PCE again, and described PCE is the PCE in purpose territory, and described PCE comprises:
The 3rd receiver module is used for the path computing request that the previous field of acceptance domain series sends, and described path computing request is carried the least commitment value vector of the outlet ASBR of described the previous field, the destination node of total binding occurrence vector sum request path;
The secondary vector determination module is used for the total binding occurrence vector of least commitment value vector sum of the outlet ASBR of the previous field of receiving according to described the 3rd receiver module, determines the maximum available binding occurrence vector in purpose territory;
Path calculation module, the path in the described purpose of the maximum available binding occurrence vector calculation territory that is used for determining according to described secondary vector determination module, the inlet ASBR that determines described purpose territory is to the path cost of destination node and used the binding occurrence vector;
The response sending module is used for to the response of the previous field path computation of described territory series, and the inlet ASBR that the purpose territory that described path calculation module determines is carried in described path computing response is to the path cost of destination node and used the binding occurrence vector.
On the one hand, the embodiment of the invention also provides a kind of system of definite route again, and the path-calculating element PCE in territory, source communicates by letter with the PCE in purpose territory, and described system comprises:
The PCE in territory, described source, be used to calculate the least commitment value vector of the outlet Autonomous System Boundary Router, AS Boundary Router ASBR in territory, source, the next field path computation request in the series of territory, described path computing request are carried the least commitment value vector of described outlet ASBR, destination node and total binding occurrence vector of request path; Receive the path computing response that the next field in the series of described territory returns, comprise the path cost of the inlet ASBR of described the next field in the described path computing response to destination node; Determine the path cost of the outlet ASBR in territory, described source according to described path cost to described destination node, select the outlet ASBR of described source node minimum path cost correspondence in the path cost of described destination node, determine the route of described source node to described destination node.
Compared with prior art, the embodiment of the invention has the following advantages: the embodiment of the invention is passed to the next field in the series of territory with the least commitment value vector of each territory of total binding occurrence vector sum outlet ASBR, until the purpose territory, the purpose territory is according to the total binding occurrence vector of least commitment value vector sum of the intermediate field outlet ASBR in next-door neighbour's purpose territory, determine the maximum available binding occurrence vector in purpose territory, and according to the path in the definite purpose territory of maximum available binding occurrence vector in purpose territory, and the routing information in the purpose territory is fed back to the intermediate field in next-door neighbour purpose territory, until the territory, source, determine the route of source node to destination node for the territory, source.The embodiment of the invention has realized reasonably distributing the additivity binding occurrence in each territory, determine that according to the additivity binding occurrence source node arrives the route of destination node, can avoid entering the route trap in the route deterministic process, has greatly improved the route probability of successful.
Description of drawings
In order to be illustrated more clearly in the technical scheme of the embodiment of the invention, the accompanying drawing of required use is done to introduce simply in will describing embodiment below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
The schematic diagram of the object that Fig. 1 expands in PCECP for the embodiment of the invention;
Fig. 2 is the handling process schematic diagram of embodiment of the invention source territory PCE;
Fig. 3 is the handling process schematic diagram of embodiment of the invention intermediate field PCE;
Fig. 4 is the handling process schematic diagram of embodiment of the invention purpose territory PCE;
Fig. 5 is the schematic diagram of embodiment of the invention multiple domain route;
When Fig. 6 is embodiment of the invention multiple domain route, determine the schematic flow sheet of route;
The structure chart of a kind of PCE that Fig. 7 provides for the embodiment of the invention;
The structure chart of the another kind of PCE that Fig. 8 provides for the embodiment of the invention;
The structure chart of another PCE that Fig. 9 provides for the embodiment of the invention;
The structure chart of the system of a kind of definite route that Figure 10 provides for the embodiment of the invention;
The another kind that Figure 11 provides for the embodiment of the invention is determined the structure chart of the system of route.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is a part of embodiment of the present invention, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
The embodiment of the invention provides the method for a kind of calculating and definite route, and the additivity that multiple domain additivity constraint routing issue is converted in a plurality of single domains retrains routing issue.The scheme of the embodiment of the invention comprises two processes: the additivity constraint transmittance process and the reverse constrained path essential information feedback procedure of forward.Route is calculated and all can be adopted existing computational methods in the territory that relates in the embodiment of the invention, and the embodiment of the invention is not described in detail.
And in the embodiment of the invention, source node is known to the territory sequence of destination node process, can be based on certain management strategy and pre-configured or calculate by other mechanism, and the embodiment of the invention is not described in detail.
1, the additivity of forward constraint transmittance process
The purpose of this process is to determine how many additivity binding occurrences (for example: jumping figure restriction or distance limit etc.) that territory, destination node place can be assigned to is, so that path in its territory is calculated in territory, destination node place, the essential information in the path of reverse feedback calculating is until source node then.In order to reach this purpose, the PCE in each territory may be by the ASBR of process (Autonomous System BoundaryRouter in final route, autonomous domain border router) the outlet ASBR that keeps and transmit to next territory each territory on is to the required minimum binding occurrence of source node, this minimum binding occurrence comprises the binding occurrence of a plurality of types, the minimum jumping figure that for example needs, beeline etc.The additivity constraint transmittance process of forward only needs simple extension existing P CEP (PCE Communication Protocol when realizing, path-calculating element communication protocol), and the least commitment value of only transmitting outlet ASBR in territory in transmittance process gets final product, and the least commitment value of realm entry ASBR is as one of parameter of subsequent calculations process.
Particularly, the embodiment of the invention is expanded an object ADDITIVE_CONSTRAINT_OBJECT in PCECP, as shown in Figure 1, to support the additivity constraint, wherein Flags (sign) field can judge whether it is the additivity constraint object, the constraint number that the indication application of Constr.NUM territory connects, Constr.type territory indication constrained type, the indication of Objective value territory connects the application desired value, and Process value indicates currently used value in the territory.
The calculation process of least commitment value is specifically as follows:
| If (destination node is in this territory) stops the forward transmittance process, the carries out reverse route and calculates.else for (entrance that this territory is possible; Source node is then refered in particular in the territory, source in this way) binding occurrence for (outlet that this territory is possible, destination node is then refered in particular in the purpose territory in this way) uses routing calculation module in the territory to calculate the least commitment value of this outlet ASBR corresponding to this entrance of binding occurrence C2 between entrance and exit ← C1+C2 end of for (outlet that this territory is possible) end offor (entrance that this territory is possible) if (failure is all calculated in the path between all entrances outlets) upwards to return that Path_Comp_Failed stops that forward constraint transmittance process else gets each outlet least commitment value and to next territory transmission in a territory between the least commitment value of the least commitment value entrance ASBR of C1 ← upper territory ASBR ← C1+ territory |
The PCE in territory, source (being territory, source node place) sends path computing request, and with the PCE in next territory in the least commitment value advertised domain sequence in territory, source, this least commitment value can comprise the least commitment value of one or more types, and the number of the least commitment value that comprises depends on the ASBR information of territory, source node place outlet.
After the PCE of intermediate field receives the path computing request and constraint information that the PCE in a territory transmits, the inlet ASBR that calculates in this territory arrives the least commitment value that exports ASBR, and be passed to next territory in the sequence of territory, until territory, destination node place, intermediate field is not for comprising the territory of source node, destination node; Receive the least commitment value of last territory outlet when purpose territory (being territory, destination node place) after, deduct the maximum available binding occurrence that the least commitment value just can obtain territory, destination node place with total binding occurrence, such as the available at most jumping figure in territory, destination node place, maximum usable distance etc.
2, reverse constrained path essential information feedback procedure
When ASBR to the least commitment value of source node (for example: the minimum jumping figure, the ultimate range that need) when being delivered to territory, destination node place, territory, destination node place is according to the binding occurrence in this least commitment value and final path, can obtain the additivity binding occurrence that territory, destination node place can be used, this available additivity binding occurrence is the difference of total binding occurrence and least commitment value.Path in this territory is calculated according to this additivity binding occurrence in territory, destination node place.The purpose territory is the intermediate field that the additivity binding occurrence (for example: the jumping figure that has used, use distance) in ASBR information, path and cost etc. pass to next-door neighbour's purpose territory with the source node information in the path of calculating.
The binding occurrence that the reality that the minimum binding occurrence that this realm entry ASBR that writes down before the intermediate field basis is required to the territory, source and next territory are transmitted has been used, can determine the available binding occurrence in this territory, intermediate field utilizes this available binding occurrence to calculate constrained path in this territory, and continues transmitting with binding occurrence, the path cost territory that makes progress this territory.This process is constantly repeated up to arriving the territory, source in territory in the sequence of territory, and this moment, path computing finished, and the path computing flow process in each territory is specifically as follows:
| If (source node is in this territory) stops transmittance process, and routing iinformation is fed back after calculating route in this territory.The least commitment value of else for (each may enter the mouth in the territory, and source node is then refered in particular in the territory, source in this way) C1 ← inlet ASBR |
| (each may export in the territory; Destination node is then refered in particular in the purpose territory in this way) next territory is transmitted in C2 ← territory sequence this export can use between the cost entrance outlet that corresponding route used next territory of binding occurrence V1 ← territory sequence to transmit constraint C3 ← total constraint-C2-C1 use routing calculation module in the territory calculate cost end offor (each may export in the territory in) end offor between this outlet minimum cost V2 corresponding to this entrance of path between entrance and exit ← V1+ entrance outlet (each may entrance) if (failure is all calculated in the path between all entrances outlets) in the territory in upwards territory transmission Path_Comp_Failed else take out each entrance minimum cost value, and the binding occurrence of the correspondence territory transmission that makes progress |
According to foregoing description, describe the handling process of single PCE inside below in detail.The PCE in territory, source (territory, source node place), intermediate field (territory that does not comprise source node, destination node) and purpose territory (territory at destination node place) is different on handling.
As shown in Figure 2, the handling process schematic diagram for embodiment of the invention source territory PCE specifically comprises:
Step S201, the least commitment value vector of the outlet ASBR in calculating territory, source.
Step S202, the next field path computation request (Path_Comp_Req) in the series of territory, this path computing request are carried the least commitment value vector of the outlet ASBR in territory, source, destination node and total binding occurrence vector of request path.
After the PCE in territory, source sends Path_Comp_Req, the state that is in wait RX path calculated response (Path_Comp_Res) in territory, source.
Step S203, the path computing response (Path_Comp_Res) that the next field in the acceptance domain series returns comprises the path cost of the inlet ASBR of the next field to destination node in this path computing response.
Step S204, calculate the path cost of source node to the outlet ASBR in territory, source, and the path cost that response is carried according to path computing determines that source node arrives the path cost of destination node, select the outlet ASBR in source node territory, source of minimum path cost correspondence in the path cost of destination node, determine that source node arrives the route of destination node.
After the PCE in territory, source receives the path computing response, calculate the path cost of source node to the outlet ASBR in territory, source.And then, determine that source node arrives the path cost of destination node, the outlet ASBR in the territory, source of the path cost correspondence that selection is minimum according to the path cost that the inlet ASBR of the next field that carries in the path computing response that receives arrives destination node.Because the next field in territory, source before the return path calculated response, has determined that the inlet ASBR of the next field in territory, source to the optimal path of destination node, therefore after the outlet ASBR that has determined the territory, source, can determine that source node arrives the route of destination node.
As shown in Figure 3, the handling process schematic diagram for embodiment of the invention intermediate field PCE specifically comprises:
Step S301, calculate the least commitment value vector of the ASBR of intermediate field according to the path computing request of the transmission of the previous field in the sequence of territory, and the next field path computation request in the sequence of territory, this path computing request is carried the least commitment value vector of the outlet ASBR of intermediate field, destination node and total binding occurrence vector of request path.Above-mentioned intermediate field is a territory between territory, source and the purpose territory, or this intermediate field is a territory in a plurality of territories between territory, source and the purpose territory.
Wherein, this path computing request is carried the least commitment value vector of the outlet ASBR of the previous field, destination node and total binding occurrence vector of request path, when calculating the least commitment value vector of ASBR of intermediate field, can be according to the least commitment value vector of the ASBR in this territory of least commitment value vector calculation of the outlet ASBR of the previous field in the path computing request.
Because destination node is not in intermediate field, the PCE of intermediate field is after the least commitment value vector of the ASBR that calculates this intermediate field, and the next field path computation request in the series of territory is until the purpose territory.
Step S302, the path computing response that the next field in the acceptance domain sequence sends, the inlet ASBR that comprises the next field in this path computing response is to the path cost of destination node and used the binding occurrence vector.
Step S303, determined the maximum available binding occurrence vector of intermediate field with the binding occurrence vector according to total binding occurrence vector sum, and according to the path of the available binding occurrence vector calculation of maximum intermediate field, the inlet ASBR that determines intermediate field is to the path cost of destination node and used the binding occurrence vector.
Step S304, the inlet ASBR that intermediate field is carried in the response of the previous field path computation in the series of territory, this path computing response is to the path cost of destination node and used the binding occurrence vector.
If the failure of intermediate field PCE path computing, then path computation failure (Path_Comp_Failed).
As shown in Figure 4, the handling process schematic diagram for embodiment of the invention purpose territory PCE specifically comprises:
Step S401, the path computing request that the previous field in the acceptance domain series sends, this path computing request are carried the least commitment value vector of the outlet ASBR of the previous field, the destination node of total binding occurrence vector sum request path.
Step S402 according to the total binding occurrence vector of least commitment value vector sum of the outlet ASBR of the previous field, determines the maximum available binding occurrence vector in purpose territory.
Step S403, according to the path in the available binding occurrence vector calculation of the maximum purpose territory, the inlet ASBR that the purpose territory is carried in the response of the previous field path computation in the series of territory, this path computing response is to the path cost of destination node and used the binding occurrence vector.
If the failure of purpose territory PCE path computing, then the PCE in purpose territory sends Path_Comp_Failed.
The embodiment of the invention is passed to the next field in the series of territory with the least commitment value vector of each territory of total binding occurrence vector sum outlet ASBR, until the purpose territory, the purpose territory is according to the total binding occurrence vector of least commitment value vector sum of the intermediate field outlet ASBR in next-door neighbour's purpose territory, determine the maximum available binding occurrence vector in purpose territory, and according to the path in the definite purpose territory of maximum available binding occurrence vector in purpose territory, and the routing information in the purpose territory is fed back to the intermediate field in next-door neighbour purpose territory, until the territory, source, determine the route of source node to destination node for the territory, source.The embodiment of the invention has realized reasonably distributing the additivity binding occurrence in each territory, determine that according to the additivity binding occurrence source node arrives the route of destination node, can avoid entering the route trap in the route deterministic process, has greatly improved the route probability of successful.
Below in conjunction with Fig. 5, the method for definite route of multiple domain additivity constraint is described with instantiation.
The link range of supposition between the intradomain router is 1 in Fig. 5, and the link range that connects between the router in two territories is 2, and the existing business request is from R1 to R14, additivity is constrained to jumping figure and distance, binding occurrence is respectively 8 and 14, and the constrained vector of composition is (8,14).PCE1, PCE2, PCE3, PCE4 safeguard the path computing of AS (Autonomous System, autonomous system) 1, AS2, AS3, AS4 respectively, each PCE interactive information, collaborative finish final path computing, as shown in Figure 6, specifically comprise:
Step S601, PCE1 sends Path_Comp_Req to PCE2.Announcement content among this Path_Comp_Req comprises following information: destination node is R14, and jumping figure is constrained to 8, and distance restraint is 14, total binding occurrence vector is (8,14), and the least commitment value vector of R2, R3 is (1,1), the announcement content among the Path_Comp_Req specifically as shown in Figure 5.
After step S602, PCE2 receive Path_Comp_Req from PCE1, respectively according to the least commitment value vector calculation R4 of R2, R3 among the Path_Comp_Req, the least commitment value vector of R5.In the present embodiment, the least commitment value vector of R4, R5 is identical, is (2,3), and is (4,5) according to the least commitment value vector of the least commitment value vector calculation R7 of R4 or R5.
Step S603, PCE2 sent Path_Comp_Req to PCE3 after calculating was finished, and the illustration purpose node is R14, and jumping figure is constrained to 8, and distance restraint is 14, and the least commitment value vector of announcement R7 is (4,5).
After step S604, PCE3 receive Path_Comp_Req from PCE2, according to least commitment value vector calculation R8, the R9 of R7 among the Path_Comp_Req and the least commitment value vector of R11.In the present embodiment, the least commitment value vector of R8 and R9 is (5,7), and the least commitment value vector of R11 is (6,8).
Step S605, after calculating was finished, PCE3 sent Path_Comp_Req to PCE4, and the illustration purpose node is R14, and jumping figure is constrained to 8, and distance restraint is 14, the least commitment value vector of R11 is (6,8).
Step S606, PCE4 calculate the respective path of inlet ASBR in this territory.After PCE4 receives Path_Comp_Req from PCE3, find destination node in this territory, the least commitment value vector (6,8) of the R11 that carries according to this Path_Comp_Req and total constrained vector (8,14) obtain that maximum available jumping figure is 1 in this territory, maximum usable distance is 4.PCE4 is according to the respective path of inlet ASBR in this territory of above-mentioned information calculations, comprises the cost of the respective path of the ASBR that enters the mouth, uses information such as binding occurrence vector.
Step S607, PCE4 sends Path_Comq_Res to PCE3, the announcement routing information of R12 to R14 and the routing information of R13 to R14, wherein routing information comprises path cost, uses information such as binding occurrence vector, and the announcement content among the Path_Comp_Res is shown in Figure 5.
Step S608, after PCE3 receives Path_Comp_Res from PCE4, calculate the ASBR that enters the mouth in this territory to the maximum available binding occurrence vector of outlet ASBR, enter the mouth ASBR and the path cost that exports the ASBR respective path, determine that according to this path cost inlet ASBR is to the optimum ASBR of destination node in this territory.
In the present embodiment, total binding occurrence vector is (8,14), the least commitment value vector of R8 is (5,7), the R12's to R14 that carries among the Path_Comp_Res from PCE4 is (1,1) with the binding occurrence vector with binding occurrence vector sum R13 to R14, what therefore can determine R11 to R14 has been (2 with the binding occurrence vector, 3), thus the maximum available binding occurrence vector of R8 to R11 be (8-5-2,14-7-3), i.e. (1,4).The maximum available binding occurrence vector that in like manner can obtain R9 to R11 is (1,4).Calculate the path cost of R8 to R11 and the path cost of R9 to R11 respectively, determine that according to path cost this path, territory is R8-R11, the optimum ASBR of R8 to R14 is R11 and R12.
Step S609, PCE3 sends Path_Comp_Res to PCE2, and announcement R8 is to the routing information of destination node R14, and this routing information comprises the path cost of R8 to R14, uses information such as binding occurrence vector.
Step S610, after PCE2 receives Path_Comq_Res from PCE3, calculate the ASBR that enters the mouth in this territory to the maximum available binding occurrence vector of outlet ASBR, enter the mouth ASBR and the path cost that exports the ASBR respective path, determine that according to this path cost inlet ASBR is to the optimum ASBR of destination node in this territory.
In the present embodiment, total binding occurrence vector is (8,14), the least commitment value vector of R4 is (2,3), and the R8's to R14 that carries among the Path_Comq_Res from PCE3 has been (3 with the binding occurrence vector, 4), can determine that therefore R7's to R14 is (4,6) with the binding occurrence vector, so the maximum available binding occurrence vector of R4 to R7 is (8-4-2,14-6-3), promptly (2,5), the maximum available binding occurrence vector that in like manner can obtain R5 to R7 is (2,5).Calculate the path cost of R4-R6-R7 and the path cost of R5-R6-R7 respectively, determine that according to path cost this path, territory is R5-R6-R7, the optimum ASBR of R5 to R8 is R7.
Step S611, PCE2 sends Path_Comp_Res to PCE1, carry R4 among this Path_comp_Res to the path cost of R14 with used the constrained vector value, and R5 is to the cost of R14 with information such as constrained vector values.
Step S612, after PCE1 receives Path_Comp_Res from PCE2, calculate that maximum available binding occurrence vector is (1 in this territory, 4), calculate the path cost of R1 respectively, determine that according to this path cost R1 is to the outlet (being assumed to be R2) in this territory of the optimal path of R14 to the path cost of R3, R1 to R2.Because PCE2 is before returning Path_Comp_Res, determined the optimal path of the inlet ASBR in territory, PCE2 place to destination node, in the present embodiment R5-R6-R7-R8-R11-R12-R14, therefore determined R1 to the optimal path of R14 after the outlet in territory, PCE1 place, PCE1 can obtain complete routing information, i.e. R1-R2-R5-R6-R7-R8-R11-R12-R14.When relating between the territory topological privacy problem, also can adopt existing P ath Key technology to carry out topology and maintain secrecy.
The forward binding occurrence that the embodiment of the invention provides calculates and transmittance process can reasonably distribute the additivity constraint in each territory, makes reverse constraint computational process avoid entering the route trap.
The embodiment of the invention provides the method for a kind of calculating and definite route, can avoid route to calculate under single additivity restraint condition and enter the route trap, promptly exists the path just can find; And under the multiple constraint situation, can greatly improve the route probability of successful.
As shown in Figure 7, the structure chart of a kind of PCE that provides for the embodiment of the invention, this PCE7 is the PCE in territory, source, this PCE7 comprises:
First sending module 72 is used for the next field path computation request to territory series, and this path computing request is carried the least commitment value vector of the outlet ASBR of first computing module, 71 calculating, destination node and total binding occurrence vector of request path;
As shown in Figure 8, the structure chart of the another kind of PCE that provides for the embodiment of the invention, this PCE 8 is the PCE of intermediate field, this intermediate field is a territory between territory, source and the purpose territory, perhaps this intermediate field is a territory in a plurality of territories between territory, source and the purpose territory, and this PCE8 comprises:
Second sending module 82, be used for the next field path computation request to the territory sequence, this path computing request is carried the least commitment value vector of the outlet ASBR of the intermediate field that second computing module 81 calculates, destination node and total binding occurrence vector of request path;
Primary vector determination module 84, be used for having determined with the binding occurrence vector the maximum available binding occurrence vector of intermediate field according to total binding occurrence vector sum, and according to this path, territory of the available binding occurrence vector calculation of maximum, the inlet ASBR that determines this territory is to the path cost of destination node and used the binding occurrence vector;
Second sending module 82 also is used for to the response of the previous field path computation of territory series, and the inlet ASBR that the intermediate field that primary vector determination module 84 determines is carried in this path computing response is to the path cost of destination node and used the binding occurrence vector.
As shown in Figure 9, the structure chart of another PCE that provides for the embodiment of the invention, this PCE is the PCE in purpose territory, this PCE comprises:
The 3rd receiver module 91 is used for the path computing request that the previous field of acceptance domain series sends, and this path computing request is carried the least commitment value vector of the outlet ASBR of the previous field, the destination node of total binding occurrence vector sum request path;
Secondary vector determination module 92 is used for the total binding occurrence vector of least commitment value vector sum of the outlet ASBR of the previous field of receiving according to the 3rd receiver module 91, determines the maximum available binding occurrence vector in purpose territory;
In the foregoing description, because the PCE function in the PCE in territory, source, the PCE of intermediate field and purpose territory is different, therefore as a PCE during respectively as the PCE in the PCE of the PCE in territory, source, intermediate field and purpose territory, has different functional modules, but above-mentioned three kinds of PCE can be integrated among the PCE and realize, this PCE can comprise the part or all of functional module of above-mentioned three kinds of PCE.
Contents such as the information interaction between each module in the said equipment, implementation and since with the inventive method embodiment based on same design, particular content can repeat no more referring to the narration among the inventive method embodiment herein.
As shown in figure 10, the structure chart of the system of a kind of definite route that provides for the embodiment of the invention, the PCE in territory, source communicates by letter with the PCE in purpose territory, and this system comprises:
The PCE 101 in territory, source, be used to calculate the least commitment value vector of the outlet ASBR in territory, source, the next field path computation request in the series of territory, this path computing request are carried the least commitment value vector of outlet ASBR, destination node and total binding occurrence vector of request path; The path computing response that the next field in the acceptance domain series returns comprises the path cost of the inlet ASBR of the next field to destination node in this path computing response; Calculate the path cost of source node to the outlet ASBR in territory, source, and the path cost that response is carried according to this path computing determines that source node arrives the path cost of destination node, select the outlet ASBR in source node territory, source of minimum path cost correspondence in the path cost of destination node, determine that source node arrives the route of destination node;
The PCE102 in purpose territory is used for the path computing request that the previous field of acceptance domain series sends, and this path computing request is carried the least commitment value vector of the outlet ASBR of the previous field, the destination node of total binding occurrence vector sum request path; According to the total binding occurrence vector of least commitment value vector sum of the outlet ASBR of the previous field, determine the maximum available binding occurrence vector in purpose territory; According to the path in the available binding occurrence vector calculation of the maximum purpose territory, the previous field path computation response in the series of territory, the inlet ASBR that the purpose territory is carried in the response of this path computing is to the path cost of destination node and used the binding occurrence vector, arrives the route of destination node so that the PCE101 in territory, source determines source node.
As shown in figure 11, this system can also comprise: the PCE 103 of intermediate field, be used for path computing request according to the PCE101 transmission in territory, source, obtain the least commitment value vector of the ASBR of intermediate field, and the next field path computation request in the sequence of territory, this path computing request is carried the least commitment value vector of the outlet ASBR of intermediate field, destination node and total binding occurrence vector of request path; The path computing response that the next field in the acceptance domain sequence sends, the inlet ASBR that comprises the next field in this path computing response is to the path cost of destination node and used the binding occurrence vector; Determined the maximum available binding occurrence vector of intermediate field with the binding occurrence vector according to total binding occurrence vector sum, and according to the path of the available binding occurrence vector calculation of this maximum intermediate field, the inlet ASBR that determines intermediate field is to the path cost of destination node and used the binding occurrence vector; The inlet ASBR that intermediate field is carried in the response of the previous field path computation in the series of territory, this path computing response is to the path cost of destination node and used the binding occurrence vector;
In the embodiment of the invention, the PCE101 in territory, source and the PCE103 of intermediate field are passed to the least commitment value vector of each territory of total binding occurrence vector sum outlet ASBR the next field in the series of territory successively, PCE102 until the purpose territory, the PCE102 in purpose territory is according to the total binding occurrence vector of least commitment value vector sum of the intermediate field outlet ASBR in next-door neighbour's purpose territory, determine the maximum available binding occurrence vector in purpose territory, and according to the path in the definite purpose territory of maximum available binding occurrence vector in purpose territory, and the routing information in the purpose territory is fed back to the PCE103 of the intermediate field in next-door neighbour purpose territory, PCE 101 until the territory, source determines the route of source node to destination node for the PCE101 in territory, source.The embodiment of the invention has realized reasonably distributing the additivity binding occurrence in each territory, determine that according to the additivity binding occurrence source node arrives the route of destination node, can avoid entering the route trap in the route deterministic process, and greatly improve the route probability of successful.
Contents such as the information interaction between each module in the said equipment, implementation and since with the inventive method embodiment based on same design, particular content can repeat no more referring to the narration among the inventive method embodiment herein.
Through the above description of the embodiments, those skilled in the art can be well understood to the present invention and can realize by hardware, also can realize based on such understanding by the mode that software adds necessary general hardware platform, technical scheme of the present invention can embody with the form of software product, it (can be CD-ROM that this software product can be stored in a non-volatile memory medium, USB flash disk, portable hard drive etc.) in, comprise that some instructions are with so that a computer equipment (can be a personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the present invention.
It will be appreciated by those skilled in the art that accompanying drawing is the schematic diagram of a specific embodiment, module in the accompanying drawing or flow process might not be that enforcement the present invention is necessary.
It will be appreciated by those skilled in the art that the module in the device among the embodiment can be distributed in the device of embodiment according to the embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from present embodiment.The module of the foregoing description can be merged into a module, also can further split into a plurality of submodules.
The invention described above embodiment sequence number is not represented the quality of embodiment just to description.
More than disclosed only be several specific embodiment of the present invention, still, the present invention is not limited thereto, any those skilled in the art can think variation all should fall into protection scope of the present invention.
Claims (11)
1. the method for a definite route is characterized in that, comprising:
The least commitment value vector of the outlet Autonomous System Boundary Router, AS Boundary Router ASBR in territory, calculating source;
The next field path computation request in the series of territory, described path computing request are carried the least commitment value vector of described outlet ASBR, destination node and total binding occurrence vector of request path;
Receive the path computing response that the next field in the series of described territory returns, comprise the path cost of the inlet ASBR of described the next field in the described path computing response to destination node;
Calculate the path cost of source node to the outlet ASBR in territory, source, and the path cost that response is carried according to described path computing is determined the path cost of described source node to described destination node, select the outlet ASBR in described source node territory, source of minimum path cost correspondence in the path cost of described destination node, determine the route of described source node to described destination node.
2. a method of calculating route is characterized in that, comprising:
Calculate the least commitment value vector of the outlet Autonomous System Boundary Router, AS Boundary Router ASBR of intermediate field according to the path computing request of the transmission of the previous field in the sequence of territory, and the next field path computation request in the sequence of described territory, described path computing request is carried the least commitment value vector of the outlet ASBR of described intermediate field, destination node and total binding occurrence vector of request path;
Receive the path computing response that the next field in the sequence of described territory sends, the inlet ASBR that comprises described the next field in the described path computing response is to the path cost of destination node and used the binding occurrence vector;
According to the described maximum available binding occurrence vector of determining intermediate field with the binding occurrence vector of described total binding occurrence vector sum, and according to the path of the available binding occurrence vector calculation of described maximum intermediate field, the inlet ASBR that determines intermediate field is to the path cost of destination node and used the binding occurrence vector;
The inlet ASBR that described intermediate field is carried in the response of the previous field path computation in the series of described territory, described path computing response is to the path cost of destination node and used the binding occurrence vector.
3. method as claimed in claim 2 is characterized in that, described path computing request is carried the least commitment value vector of the outlet ASBR of described the previous field, destination node and total binding occurrence vector of request path;
The least commitment value vector that the described path computing request that sends according to the previous field in the sequence of territory is calculated the ASBR of intermediate field is specially:
Least commitment value vector according to the ASBR of the described intermediate field of least commitment value vector calculation of the outlet ASBR of described the previous field.
4. a method of calculating route is characterized in that, comprising:
The path computing request that the previous field in the acceptance domain series sends, described path computing request are carried the least commitment value vector of the outlet Autonomous System Boundary Router, AS Boundary Router ASBR of described the previous field, the destination node of total binding occurrence vector sum request path;
According to the total binding occurrence vector of least commitment value vector sum of the outlet ASBR of described the previous field, determine the maximum available binding occurrence vector in purpose territory;
According to the path in the described purpose of the available binding occurrence vector calculation of the described maximum territory, the inlet ASBR that described purpose territory is carried in the response of the previous field path computation in the series of described territory, described path computing response is to the path cost of destination node and used the binding occurrence vector.
5. path-calculating element PCE, described PCE is the PCE in territory, source, it is characterized in that, described PCE comprises:
First computing module is used to calculate the least commitment value vector of the outlet Autonomous System Boundary Router, AS Boundary Router ASBR in territory, source;
First sending module is used for the next field path computation request to territory series, and described path computing request is carried the least commitment value vector of the outlet ASBR of described first computing module calculating, destination node and total binding occurrence vector of request path;
First receiver module is used for receiving the path computing response that the next field of described territory series returns, and comprises the path cost of the inlet ASBR of described the next field to destination node in the described path computing response;
The route determination module, be used to calculate the path cost of source node to the outlet ASBR in territory, source, and the path cost that response is carried according to described path computing is determined the path cost of described source node to described destination node, select the outlet ASBR in described source node territory, source of minimum path cost correspondence in the path cost of described destination node, determine the route of described source node to described destination node.
6. path-calculating element PCE, described PCE is the PCE of intermediate field, it is characterized in that, described PCE comprises:
Second computing module, the path computing request that is used for sending according to the previous field of territory sequence is calculated the least commitment value vector of the Autonomous System Boundary Router, AS Boundary Router ASBR of intermediate field;
Second sending module, be used for the next field path computation request to described territory sequence, described path computing request is carried the least commitment value vector of the outlet ASBR of the described intermediate field that described second computing module calculates, destination node and total binding occurrence vector of request path;
Second receiver module is used for receiving the path computing response that the next field of described territory sequence sends, and the inlet ASBR that comprises described the next field in the described path computing response is to the path cost of destination node and used the binding occurrence vector;
The primary vector determination module, be used for having determined with the binding occurrence vector the maximum available binding occurrence vector of intermediate field according to described total binding occurrence vector sum, and according to this path, territory of the available binding occurrence vector calculation of described maximum, the inlet ASBR that determines this territory is to the path cost of destination node and used the binding occurrence vector;
Described second sending module also is used for to the response of the previous field path computation of described territory series, and the inlet ASBR that the intermediate field that described primary vector determination module determines is carried in described path computing response is to the path cost of destination node and used the binding occurrence vector.
7. as PCE as described in the claim 6, it is characterized in that described path computing request is carried the least commitment value vector of the outlet ASBR of described the previous field, destination node and total binding occurrence vector of request path;
Described computing module specifically is used for the least commitment value vector according to the ASBR of the described intermediate field of least commitment value vector calculation of the outlet ASBR of described the previous field.
8. path-calculating element PCE, described PCE is the PCE in purpose territory, it is characterized in that, described PCE comprises:
The 3rd receiver module is used for the path computing request that the previous field of acceptance domain series sends, and described path computing request is carried the least commitment value vector of the outlet ASBR of described the previous field, the destination node of total binding occurrence vector sum request path;
The secondary vector determination module is used for the total binding occurrence vector of least commitment value vector sum of the outlet ASBR of the previous field of receiving according to described the 3rd receiver module, determines the maximum available binding occurrence vector in purpose territory;
Path calculation module, the path in the described purpose of the maximum available binding occurrence vector calculation territory that is used for determining according to described secondary vector determination module, the inlet ASBR that determines described purpose territory is to the path cost of destination node and used the binding occurrence vector;
The response sending module is used for to the response of the previous field path computation of described territory series, and the inlet ASBR that the purpose territory that described path calculation module determines is carried in described path computing response is to the path cost of destination node and used the binding occurrence vector.
9. the system of a definite route is characterized in that, the path-calculating element PCE in territory, source communicates by letter with the PCE in purpose territory, and described system comprises:
The PCE in territory, described source, be used to calculate the least commitment value vector of the outlet Autonomous System Boundary Router, AS Boundary Router ASBR in territory, source, the next field path computation request in the series of territory, described path computing request are carried the least commitment value vector of described outlet ASBR, destination node and total binding occurrence vector of request path; Receive the path computing response that the next field in the series of described territory returns, comprise the path cost of the inlet ASBR of described the next field in the described path computing response to destination node; Calculate the path cost of source node to the outlet ASBR in territory, source, and the path cost that response is carried according to described path computing is determined the path cost of described source node to described destination node, select the outlet ASBR in described source node territory, source of minimum path cost correspondence in the path cost of described destination node, determine the route of described source node to described destination node.
10. system as claimed in claim 9 is characterized in that,
The PCE in described purpose territory is used for the path computing request that the previous field of acceptance domain series sends, and described path computing request is carried the least commitment value vector of the outlet ASBR of described the previous field, the destination node of total binding occurrence vector sum request path; According to the total binding occurrence vector of least commitment value vector sum of the outlet ASBR of described the previous field, determine the maximum available binding occurrence vector in purpose territory; According to the path in the described purpose of the available binding occurrence vector calculation of the described maximum territory, the inlet ASBR that described purpose territory is carried in the response of the previous field path computation in the series of described territory, described path computing response is to the path cost of destination node and used the binding occurrence vector.
11. system as claimed in claim 10 is characterized in that, also comprises:
The PCE of intermediate field, be used for path computing request according to the PCE transmission in territory, described source, obtain the least commitment value vector of the ASBR of intermediate field, and the next field path computation request in the sequence of described territory, described path computing request is carried the least commitment value vector of the outlet ASBR of described intermediate field, destination node and total binding occurrence vector of request path; Receive the path computing response that the next field in the sequence of described territory sends, the inlet ASBR that comprises described the next field in the described path computing response is to the path cost of destination node and used the binding occurrence vector; According to the described maximum available binding occurrence vector of determining intermediate field with the binding occurrence vector of described total binding occurrence vector sum, and according to the path of the available binding occurrence vector calculation of described maximum intermediate field, the inlet ASBR that determines intermediate field is to the path cost of destination node and used the binding occurrence vector; The inlet ASBR that described intermediate field is carried in the response of the previous field path computation in the series of described territory, described path computing response is to the path cost of destination node and used the binding occurrence vector.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101827073A CN101753417B (en) | 2008-12-03 | 2008-12-03 | Method for calculating and determining routing, path calculating unit and system for determining routing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101827073A CN101753417B (en) | 2008-12-03 | 2008-12-03 | Method for calculating and determining routing, path calculating unit and system for determining routing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101753417A true CN101753417A (en) | 2010-06-23 |
| CN101753417B CN101753417B (en) | 2012-05-23 |
Family
ID=42479849
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101827073A Active CN101753417B (en) | 2008-12-03 | 2008-12-03 | Method for calculating and determining routing, path calculating unit and system for determining routing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101753417B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012019404A1 (en) * | 2010-08-12 | 2012-02-16 | 中兴通讯股份有限公司 | Path calculating method and device |
| CN110912824A (en) * | 2019-11-27 | 2020-03-24 | 美的集团股份有限公司 | Method and device for determining survival time value of multi-hop network node |
| CN111030928A (en) * | 2018-10-10 | 2020-04-17 | 中国移动通信有限公司研究院 | Routing information determination method, node, system and storage medium |
| CN111385198A (en) * | 2018-12-29 | 2020-07-07 | 北京华为数字技术有限公司 | Path determining method, device and communication system |
| CN112272141A (en) * | 2020-10-30 | 2021-01-26 | 山西大学 | Intra-domain route protection method based on key network state |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100440844C (en) * | 2004-06-16 | 2008-12-03 | 华为技术有限公司 | System and method for realizing virtual special network of hybrid backbond network of hybrid station |
| CN101155054A (en) * | 2006-09-28 | 2008-04-02 | 华为技术有限公司 | Method and device for automatic detection and calculation of PCE path between autonomous system domains |
-
2008
- 2008-12-03 CN CN2008101827073A patent/CN101753417B/en active Active
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012019404A1 (en) * | 2010-08-12 | 2012-02-16 | 中兴通讯股份有限公司 | Path calculating method and device |
| CN111030928A (en) * | 2018-10-10 | 2020-04-17 | 中国移动通信有限公司研究院 | Routing information determination method, node, system and storage medium |
| CN111385198A (en) * | 2018-12-29 | 2020-07-07 | 北京华为数字技术有限公司 | Path determining method, device and communication system |
| CN111385198B (en) * | 2018-12-29 | 2022-05-10 | 北京华为数字技术有限公司 | Path determining method, device and communication system |
| CN110912824A (en) * | 2019-11-27 | 2020-03-24 | 美的集团股份有限公司 | Method and device for determining survival time value of multi-hop network node |
| CN112272141A (en) * | 2020-10-30 | 2021-01-26 | 山西大学 | Intra-domain route protection method based on key network state |
| CN112272141B (en) * | 2020-10-30 | 2021-11-19 | 山西大学 | Intra-domain route protection method based on key network state |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101753417B (en) | 2012-05-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6882627B2 (en) | Methods and apparatus for selecting multiple paths taking into account shared risk | |
| RU2541940C2 (en) | Method of applying service instance to mpls network (versions) and mpls network | |
| US7969890B2 (en) | Methods, systems, and computer program products for load balanced and symmetric path computations for VoIP traffic engineering | |
| CN101692652B (en) | Method and device for preventing interrupt of traffics in aggregation link | |
| CN106452958A (en) | Flow control method and system, and centralized controller | |
| CN105075194A (en) | Indexed segment ID | |
| CN105052090A (en) | Seamless segment routing | |
| CN101610433A (en) | The multi-constraint condition routing selection method that a kind of support policy is resolved | |
| CN104718730A (en) | Segment routing techniques | |
| CN103229468A (en) | Packet-switching resource distribution method and device | |
| CN101753417B (en) | Method for calculating and determining routing, path calculating unit and system for determining routing | |
| CN103117925A (en) | Processing method and processing device for data message forward | |
| CN102281193A (en) | Method and fiber channel (FC) equipment for realizing message forwarding in fiber channel network | |
| CN104639437A (en) | Forwarding method and apparatus of broadcast messages in stack system | |
| CN109600291B (en) | Cross-domain QoS (quality of service) adjusting method and device | |
| CN103597786A (en) | Method of and apparatus for configuring quality of service | |
| Zheng et al. | Dependence-aware service function chain embedding in optical networks | |
| Haeri et al. | A reinforcement learning-based algorithm for deflection routing in optical burst-switched networks | |
| CN105207906B (en) | A kind of service path determines method and device | |
| WO2016078363A1 (en) | Methods and apparatuses for sending and receiving tunnel constraint information | |
| CN101263692B (en) | Hybrid optical and data networks | |
| US7289448B2 (en) | Path engine for optical network | |
| CN102025615A (en) | Method and device for planning paths of small-granularity services in optical communication network | |
| Barradas et al. | Pre-planned optical burst switched routing strategies considering the streamline effect | |
| US20120328282A1 (en) | Network Restoration Under Link or Node Failure Using Preconfigured Virtual Cycles |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |