WO2018006653A1 - 确定转发路径的方法和控制设备 - Google Patents

确定转发路径的方法和控制设备 Download PDF

Info

Publication number
WO2018006653A1
WO2018006653A1 PCT/CN2017/084375 CN2017084375W WO2018006653A1 WO 2018006653 A1 WO2018006653 A1 WO 2018006653A1 CN 2017084375 W CN2017084375 W CN 2017084375W WO 2018006653 A1 WO2018006653 A1 WO 2018006653A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
forwarding path
constraint
priority
forwarding
Prior art date
Application number
PCT/CN2017/084375
Other languages
English (en)
French (fr)
Inventor
龙勇
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP17823465.4A priority Critical patent/EP3462687B1/en
Publication of WO2018006653A1 publication Critical patent/WO2018006653A1/zh
Priority to US16/243,062 priority patent/US10812372B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/42—Centralised routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/64—Routing or path finding of packets in data switching networks using an overlay routing layer

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a method and a control device for determining a forwarding path.
  • a Path Computation Element based on Multi-Protocol Label Switch (MPLS) Traffic Engineering (TE) technology Architecture
  • MPLS Multi-Protocol Label Switch
  • TE Traffic Engineering
  • SDN Software Defined Networking
  • centralized control equipment for example, PCE equipment or SDN controller
  • PCE equipment or SDN controller can be calculated according to the path based on the network topology map and necessary constraints of centralized management
  • the business request calculates an optimal path that satisfies the necessary constraints.
  • the centralized control device selects a forwarding path that satisfies a calculation reference constraint, and satisfies the calculation reference If there are at least two forwarding paths of the constraint, then one of them is randomly selected as the calculation result, which may cause the randomly selected forwarding path to be not the preferred or the path desired by the user.
  • the method and the control device for determining the forwarding path provided by the embodiment of the present invention can solve the problem that when the control device calculates the forwarding path, when there are at least two forwarding paths satisfying the necessary constraint conditions, the centralized control device selects one of them to satisfy one calculation path.
  • the forwarding path of the reference constraint if there are at least two forwarding paths that satisfy the calculation of the reference constraint, then randomly selecting one of them as the calculation result may cause the randomly selected forwarding path to be not preferred or the path desired by the user. The problem.
  • a first aspect of the embodiments of the present invention provides a method for determining a forwarding path, which is applied to a communication network, where the method includes: the control device obtains a first forwarding path calculation request, and the first forwarding path calculation request Instructing to calculate a first forwarding path from the source node to the destination node and satisfying necessary constraints; when the control device calculates at least two forwarding paths that satisfy the necessary constraints, the control device determines and prioritizes according to the calculation path reference The mapping relationship is obtained, the highest-priority computing reference constraint is obtained, and the computing circuit that satisfies the highest priority is determined from the at least two forwarding paths that satisfy the necessary constraint according to the highest-priority computing reference constraint At least one forwarding path of the reference constraint; wherein the mapping relationship between the computing reference constraint and the priority includes N the computing reference constraints C i and N the priorities P i , the P i and the C i corresponds to one, the i is a positive integer greater than
  • the control device performs forwarding path calculation according to necessary constraints, when the necessary constraint is met.
  • the control device selects an accounting reference constraint with the highest priority according to the mapping relationship between the reference datum constraint and the priority, and selects one of the computing reference constraints that meet the highest priority. The method of forwarding the path, thereby obtaining a preferred forwarding path that meets the user's needs.
  • the method further includes: when the control device calculates at least two forwarding paths that meet the highest priority computing path constraint, the control device is configured according to the priority a second highest calculation basis constraint, determining, from the at least two forwarding paths satisfying the highest priority calculation path constraint, a forwarding path that satisfies the second highest priority of the calculation path constraint, and When the forwarding path that satisfies the second highest priority of the calculation path constraint is greater than or equal to two, the transaction reference constraint corresponding to the lower priority is sequentially selected and the priority corresponding to the lower priority is determined.
  • the control device selects according to the second highest priority calculation reference constraint in the mapping relationship. At least one forwarding path that satisfies the second highest computing path constraint of the priority, and so on, uses the second-highest computing path constraint to calculate the path, thereby obtaining a preferred forwarding path that satisfies the user's needs.
  • the mapping relationship further includes: N computing reference constraint enabling switches E i ,
  • the E i is in one-to-one correspondence with the C i , and the E i is used to indicate whether C i corresponding to the E i is enabled; if E i is an enabled state, corresponding to the E i C i is a calculation path constraint that can be used; correspondingly, the control device obtains the highest priority calculation path constraint according to the mapping relationship between the calculation path reference constraint and the priority: the control device according to the E i E is selected enabled state C i, and then select the highest priority C i P i that corresponds to the P i in the E from the enabled state in accordance with C i.
  • the mapping relationship further includes: a path calculation reference of the N first forwarding paths constraint enable switch T i, T i of the first forwarding path of the N path computation reference correspondence constraint C i, T i is the first forwarding path is determined for indicating the first forwarding when the path, and the first forwarding path T i corresponding to C i being enabled; T i if the first forwarding path is enabled, then determining that the first forwarding path, and the said first forwarding path T i of C i corresponding to the reference path computation constraints can be used; accordingly, the operator control device according to a reference path constraints and priority mappings, to obtain the highest priority reference path computation constraints include: the control device is in the enabled state C i T T i of the first forwarding path is selected depending on, then according to the highest priority P i P i that corresponds in C i T from the enabled state in C i .
  • the mapping relationship further includes: the operation reference constraint enabling switch of the N first forwarding paths T i, T i of the first forwarding path of the N path computation constraints C i-one correspondence basis, the first forwarding path T i of determining for indicating when the first forwarding path, and whether the first forwarding path T i corresponding to C i is enabled; if the first forwarding path T i of an enabled state, in determining the first forwarding path, and the first forwarding C i T i corresponding to the path of the reference path computation constraints can be used; accordingly, the operator control device according to a reference path constraints and priority mappings, to obtain the highest priority constraint reference path computation comprises: the control device Selecting C i in the E-enabled state according to the E i ; and selecting C i in the T-enabled state from the C i in the E-enabled state according to the T i of the first forwarding path
  • the method provided by the embodiment of the invention enables the user to flexibly control the preferred forwarding path when calculating the path by setting the E i and the T i according to his own needs.
  • the mapping relationship further includes: N computing reference constraints default enable switch D i the C i D i and the correspondence, the D i D i is used to indicate the corresponding C i is the default enabled state; if D i is enabled as the default state, and the The C i corresponding to the D i is a default calculation reference constraint; correspondingly, the control device obtains the highest priority calculation reference constraint according to the calculation path constraint and the priority mapping relationship: the control device according to the D I D selected in said enabled state C i, then P i with the highest priority corresponding to P i of C i C i D is from the enabled state in accordance with.
  • the method provided by the embodiment of the present invention is compatible with the prior art or the existing calculation method by the setting of the default enable switch D i of the calculation path constraint, when the user wants to use the traditional single calculation path constraint to select When the road is set, the D i can be set to achieve the purpose.
  • the method further includes: when the control device determines that the forwarding path of the necessary constraint is not met, The control device selects P i in the T enabled state according to the T i of the first forwarding path, and selects the highest priority from the P i in the T enabled state for the first forwarding path.
  • control device obtains the number N of the second forwarding path reference path computation constraints enable switch T i, T i and the second forwarding path to the correspondence of the N P i, T I and the second transfer path is selected according to the enabled state T P i, P i, T is then enabled state from said second forwarding path for the Selecting the highest priority P i as the preemption priority of the second forwarding path, and determining that the preemption priority of the second forwarding path is lower than the preemption priority of the first forwarding path; Second, forward the resources of the path and determine the full At least one of the necessary constraints forwarding path.
  • the preemptive priority of the ordered resource in the order of priority is constrained according to the calculation of the path reference, so that the operator administrator can clearly manage the network resources and avoid conflicts with the prior art.
  • the method provided by the embodiment of the present invention not only can make the resource preemption orderly classification and the resource management clear by using the calculation path constraint of each forwarding path to constrain the corresponding priority and the control of the path reference constraint enabling switch E i . It is convenient for users to view and use on demand, and also can flexibly follow the user's needs for resource preemption.
  • the method before the control device obtains the first forwarding path calculation request, the method further includes: On the device, set and save the mapping relationship.
  • the invention provides a control device for performing the method of the first aspect or any possible implementation of the first aspect.
  • the control device comprises means for performing the method of the first aspect or any of the possible implementations of the first aspect.
  • the present invention provides a control device including: a receiver, a processor, a transmitter, a random access memory, a read only memory, and a bus.
  • the processor is coupled to the receiver, the transmitter, the random access memory, and the read only memory through a bus.
  • the basic input/output system solidified in the read-only memory or the bootloader booting system in the embedded system is started, and the control device is booted into a normal running state.
  • the application and operating system are run in a random access memory such that the processor performs the method of the first aspect or any possible implementation of the first aspect.
  • the invention provides a computer readable medium for storing a computer program comprising instructions for performing the method of the first aspect or any of the possible implementations of the first aspect.
  • FIG. 1a is a schematic diagram of a network according to an embodiment of the present invention.
  • FIG. 1b is a schematic diagram of another network according to an embodiment of the present invention.
  • FIG. 2 is a schematic flowchart of determining a forwarding path according to an embodiment of the present invention
  • FIG. 3a is a schematic diagram of a network according to an embodiment of the present invention.
  • FIG. 3b is a schematic diagram of still another network according to an embodiment of the present invention.
  • FIG. 3c is a schematic diagram of still another network according to an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of a control device according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of still another control device according to an embodiment of the present invention.
  • the application scenario of the embodiment of the present invention is a communication network with centralized control management capability.
  • the centralized control device can calculate and satisfy the service request according to the path of the user based on the network topology map and necessary constraints. The preferred path for this necessary constraint.
  • a traditional communication network with centralized control and management capabilities may be a PCE network, which is a centralized computing architecture based on MPLS TE technology.
  • the PCE architecture includes two functional entities: a PCE and a Path Computation Client (PCC).
  • the PCE and the PCC communicate through a Path Computation Element Communication Protocol (PCEP).
  • PCEP Path Computation Element Communication Protocol
  • the PCE is the completion of the path calculation and stores the path information of the entire network.
  • the PCC is the initiator of the calculation request, that is, the ingress node of the tunnel.
  • the PCC sends a PECP Report message to the PCE, requesting the PCE to perform path calculation.
  • the PCE performs path calculation according to the resource condition of the entire network and the constraint policy of the path, and returns the calculation result to the ingress node through a PCEP update (Update) message, and the ingress node performs the TE tunnel establishment according to the path calculation result.
  • Update PCEP update
  • the SDN network separates the functions of the control plane and the forwarding plane of the traditional network device, and centrally deploys the functions of the control plane to the controller.
  • the centralized controller has a topology map of the entire network. The utilization of the network resources, so that the forwarding path can be calculated centrally according to the requirements of the user, and the forwarding entries are respectively generated for each forwarding device on the path, and the forwarding entries are respectively sent to the corresponding forwarding through the control channel protocol. device.
  • the controller and the forwarding device communicate through the control channel protocol.
  • the commonly used control channel protocols may include: OpenFlow protocol, PCEP, Border Gateway Protocol (BGP), and routing system interface ( Interface to the Routing System, I2RS), etc. Because they are based on the concept of centralized computing, the traditional PCE architecture can be naturally integrated into the SDN architecture.
  • the PCEP protocol is also a viable control channel protocol in the SDN architecture.
  • the SDN network here includes an SDN network in a transition phase deployed by using an SDN hybrid forwarding device, and an SDN network deployed using a pure SDN forwarding device.
  • one or more controllers can be deployed in a centralized manner in each network domain. When the network size is large, multiple controllers can be deployed in a distributed manner to become a controller cluster.
  • a communication network that controls management capabilities.
  • the forwarding device (FD) in FIG. 1b may be a hardware or software-based device for implementing data packet routing and forwarding functions, and the forwarding device may be a traditional router or a switch; Is an SDN hybrid router or switch that supports both the operation of SDN specification definitions (such as the OpenFlow protocol specification) and the operations specified by traditional switches or routers, such as OpenFlow-hybrid switches or routers; It is a pure SDN router or switch that only supports operations defined by the SDN specification, such as OpenFlow-only switches or routers. It should be understood that the forwarding device is also referred to as a PCC entity in a PCE or SDN architecture based on the PCEP protocol.
  • the centralized control device in a communication network architecture with centralized control management capabilities, the centralized control device usually runs a computational algorithm, and completes the calculation of the path according to the necessary constraints on the forwarding path.
  • Necessary constraints can also be called necessary Constraints, which are constraints that must be met when computing a path, can be constraints that must satisfy a particular value, such as the bandwidth of the forwarding path, the affinity attribute, and the link color. If the user applies to calculate the forwarding path with a bandwidth of 20M, the calculation result must accurately meet the bandwidth of 20M, which cannot be more or less.
  • the necessary constraint may also be a constraint that must satisfy a certain range.
  • the hop count is less than or equal to N
  • the threshold of the hop count is set to N
  • N 3
  • the path that satisfies the hop threshold is less than or equal to 3 when calculating the path.
  • the delay is less than or equal to 10 milliseconds
  • the packet loss rate is less than or equal to 20%
  • the jitter is less than 10%.
  • At least one forwarding path is selected from the plurality of candidate paths using the calculation path constraint (for example, the cost cost value is the smallest).
  • a calculation of a baseline constraint is a relative or constraint that needs to be compared, usually set to the maximum value (eg, the maximum, minimum, or value closest to the target) or the constraint of the specified value.
  • the calculation of the reference datum constraint in the embodiment of the present invention includes, in addition to the calculation of the reference datum constraint (eg, cost) in the prior art, the hop count, the delay, the jitter, the packet loss rate, and the like.
  • the most value or the specified value For example, the hop count is the smallest, the delay is the largest, the jitter is closest to 30%, or the packet loss rate is 10%.
  • the method for resolving the conflict is to preempt the bandwidth requirement of the forwarding path with a high preemption priority by releasing other bandwidth resources of the forwarding path with a lower priority.
  • the preemption priority constraint in the prior art is a tunnel priority constraint and the like.
  • the tunnel priority can also be called tunnel creation priority or tunnel retention priority. It should be noted that the hop count, delay, jitter or packet loss rate are not exclusive resources.
  • the centralized control device when the centralized control device performs the forwarding path calculation according to the necessary constraints, when there are at least two forwarding paths satisfying the necessary constraints, the centralized control device is Select a forwarding path that satisfies a calculation basis constraint. If there are at least two forwarding and forwarding paths that satisfy the calculation of the reference constraint, then randomly select one from the calculation result, which may result in the randomly selected forwarding path is not preferred. Or the path the user wants.
  • an embodiment of the present invention provides a method and a device for determining a forwarding path.
  • the control device selects a path reference constraint with the highest priority to determine the forwarding path according to the mapping relationship between the path reference constraint and the priority.
  • the mapping relationship between the reference datum constraint and the priority may be implemented by setting a calculation datum constraint and a priority mapping relationship, where the mapping relationship includes at least two calculation datum constraints, and each of the calculation datum constraints corresponds to a priority.
  • the higher priority routing reference constraint is preferred to determine the forwarding path.
  • the control device performs forwarding path calculation according to the necessary constraint condition.
  • the centralized control device selects the highest priority calculation reference according to the mapping relationship between the calculation path reference constraint and the priority level. Constraint, from which a forwarding path that satisfies the highest priority reference constraint is selected.
  • the second highest priority calculation path constraint in the mapping relationship is selected, and at least one of the second highest priority is selected.
  • the forwarding path of the path reference constraint is deduced, and the calculation path of the second highest priority is used step by step, so as to obtain a preferred forwarding path that satisfies the user's needs.
  • FIG. 2 is a schematic flowchart of a method for determining a forwarding path according to an embodiment of the present invention. The method includes the following steps:
  • the control device obtains a first forwarding path calculation request, where the first forwarding path calculation request indicates to calculate a first forwarding path from the source node to the destination node and satisfying necessary constraints.
  • the method for the control device to obtain the first forwarding path calculation request may be multiple, which is not limited herein.
  • it can be:
  • control device as a PCE entity, receives the first forwarding path calculation request message sent by the forwarding device that is the PCC entity by using the PCEP protocol;
  • the control device is used as an SDN controller, and receives the first forwarding path calculation request message from the server, where the server may be a synthesizer, an orchestrator, or an application server that provides services for providing service collaboration functions under the SDN architecture;
  • the control device receives the command line configuration of the user, and specifies the first forwarding path calculation request through the command line.
  • Method 4 The control device automatically generates the first forwarding path calculation request according to the internally integrated application service program.
  • the first forwarding path may be a TE tunnel or a Label Switched Path (LSP) tunnel; or a flow forwarding path identified by a tuple or a multi-group, for example, with a destination IP address or an IP address.
  • LSP Label Switched Path
  • the stream forwarding path identified by the prefix, or the stream forwarding path identified by the quintuple source IP address, destination IP address, protocol number, source port number, destination port number).
  • the control device ie, the PCE entity
  • receives a request message from the FD1 ie, the PCC entity
  • the request message carries the first forwarding path calculation request, where the first forwarding path calculation request indicates that a slave forwarding device is calculated.
  • the first forwarding path of FD1 to FD4 that satisfies the necessary constraints (eg, bandwidth 20M).
  • control device 1002 When the control device calculates at least two forwarding paths that meet the necessary constraints, the control device obtains a computing path reference constraint with the highest priority according to the mapping relationship between the computing path reference constraint and the priority.
  • the highest priority routing reference constraint determines at least one forwarding path that satisfies the highest priority computing reference constraint from the at least two forwarding paths that satisfy the necessary constraint.
  • the mapping relationship between the calculation path constraint and the priority includes N the calculation path reference constraints C i and the N priority levels P i , wherein the P i corresponds to the C i one by one, i is a positive integer greater than or equal to 1 and less than or equal to N, and the N is a positive integer greater than or equal to 2.
  • the calculation path constraint and the priority mapping relationship may be configured on the control device, and are saved on the control device in the form of a mapping table, or acquired by the control device from other devices, and the The mapping relationship can be updated according to the actual situation.
  • the control device When the control device calculates at least two forwarding paths that satisfy the highest priority of the computing path constraint, the control device satisfies the at least two according to the second highest priority computing reference constraint. Determining, in the forwarding path of the highest priority of the calculation path constraint, a forwarding path that satisfies the second highest priority of the calculation path constraint, and forwarding the calculation of the calculation path constraint that satisfies the second highest priority When the path is greater than or equal to two, select in order a calculation path constraint corresponding to the low-level priority and determining a forwarding path that satisfies the calculation path constraint corresponding to the low-level priority until determining an account corresponding to one of the low-level priorities The forwarding path of the road reference constraint or the routing reference constraint corresponding to the lowest priority priority is selected and the forwarding path that satisfies the calculation reference constraint corresponding to the lowest level priority is determined.
  • the steps 1002 and 1003 are illustrated in conjunction with FIG. 1b.
  • the user can pre-set the calculation of the reference constraint and the priority mapping relationship on the control device, and the mapping relationship is usually configured and maintained by the administrator of the operator.
  • P 1 has the highest priority
  • the corresponding C 1 is the Cost constraint, which is the most preferred to determine the forwarding path, followed by the delay, hop count, jitter, and packet loss constraint.
  • the first embodiment is only a specific example. In the actual application, the calculation of the path reference constraint and its corresponding priority may be configured according to the situation, and the configuration is not limited by the present invention.
  • an existing calculation datum constraint is usually fixed (for example, cost) and cannot be changed according to the needs of the user.
  • the user may be a network administrator (for example, a network administrator of a network operator, etc.), a user who uses the network service (for example, an Internet application provider), and the like, and is not specifically limited herein.
  • the control device calculates the first forwarding path that meets the 20M bandwidth from FD1 to FD4.
  • the three results of the forwarding paths Path-A, Path-B, and Path-C are obtained.
  • the control device obtains the calculation path constraint corresponding to the P 1 with the highest priority as the Cost constraint. If a forwarding path that satisfies the Cost constraint is determined as Path-A from the three results, the calculation terminates.
  • -A is the calculation result of the first forwarding path calculation request, that is, Path-A is the first forwarding path.
  • the calculation result is supplied to the forwarding path calculation requester FD1.
  • the control device continues to obtain the second-high P 2 corresponding to the calculation path constraint.
  • the delay constraint is used for the calculation. If the forwarding path that satisfies the delay constraint is still Path-A, the calculation is terminated, and Path-A is used as the calculation result of the first forwarding path calculation request. That is, Path-A is the first forwarding path.
  • the calculation result is supplied to the forwarding path calculation requester FD1.
  • the control apparatus continue receiving the third-highest priority P 3 corresponding to path computation
  • the benchmark constraint is a hop count constraint, and the process is looped until a forwarding path termination calculation that satisfies the requirements is calculated; if at least two forwarding paths are still calculated until the lowest priority packet loss rate constraint is used, then Pick one as the result of the calculation.
  • calculation path constraint in the embodiment of the present invention is usually set to the maximum value or the specified value, for example, the minimum number of hops, the minimum delay, the minimum jitter, or the smallest packet loss rate.
  • the control device performs the forwarding path calculation according to the necessary constraint conditions.
  • the control device selects the highest priority operation path according to the mapping relationship between the calculation path reference constraint and the priority level.
  • a baseline constraint from which a forwarding path that satisfies the highest priority of the calculation path constraint is selected.
  • the control device selects at least one of the priorities based on the second highest priority of the mapping relationship in the mapping relationship.
  • the second highest routing reference constraint forwarding path, and so on uses the second highest priority computing path constraint calculation path to obtain a preferred forwarding path that meets the user's needs.
  • the mapping relationship may include N calculation reference constraints in addition to the calculation reference constraint C i and the priority P i
  • the E i can be switched, and the E i is in one-to-one correspondence with the C i , and the E i is used to indicate whether C i corresponding to the E i is enabled. If an enabled state E i, E i is the C i corresponding to the reference path constraint operator can be used.
  • the control device is in the enabled state C i E E i is selected according to the, then according to the highest priority P i P i of the corresponding C i from C i E is in the enabled state To obtain the highest priority of the calculation of the benchmark constraint.
  • the table 2 is based on Table 1, and the calculation path constraint and priority mapping relationship further includes an enable switch E i of 5 calculation reference constraints, 1 ⁇ i ⁇ 5, E 1 is set to not enabled (for example, it can be identified by N, or it can be identified by other means such as digital identification, which is not specifically limited here), and C 1 (which is called Cost) corresponding to it cannot be used for calculation.
  • E 2 is set to enable (for example, it is identified by Y, and may be identified by other means such as digital identification, which is not specifically limited herein), and C 2 (which is a time delay) corresponding thereto can be used for calculation.
  • E 3 is set to not enabled, and C 3 (which is the number of hops) corresponding to it cannot be used for calculation.
  • E 4 is set to enable, and the corresponding C 4 (for jitter) can be used to calculate the path.
  • E 5 is set to enable, and the corresponding C 5 (which is the packet loss rate) can be used for the calculation.
  • the E i is configured and specified by the administrator of the operator according to the business requirement.
  • the control device calculates the first forwarding path that meets the 20M bandwidth from FD1 to FD4, the three results of the forwarding paths Path-A, Path-B, and Path-C are obtained.
  • the control device obtains the delay constraint, the jitter constraint, and the packet loss rate constraint according to the settings of E 1 , E 2 , E 3 , E 4 , and E 5 , and can be used for the calculation of the forwarding path.
  • the settings of P 1 , P 2 , P 3 , P 4 and P 5 it is judged that the delay constraint has the highest priority, the jitter constraint has the second highest priority, and the packet loss rate constraint has the lowest priority.
  • the delay constraint corresponding to the highest priority P 2 is obtained, and if a forwarding path that satisfies the delay constraint is determined as Path-A from the three results, the calculation is terminated, and Path-A is used as the first forwarding path.
  • Path-A is the first forwarding path.
  • the calculation result is supplied to the forwarding path calculation requester FD1.
  • the control apparatus continue receiving the second highest priority P 4 corresponding to the calculated jitter constraints If the forwarding path that meets the jitter constraint is determined as Path-A from the two results, the calculation is terminated, and Path-A is used as the calculation result of the first forwarding path calculation request, that is, Path-A is the first. Forward path.
  • the calculation result is supplied to the forwarding path calculation requester FD1.
  • the control device continues acquires the lowest priority packet loss rate constraint corresponding to P 5 is If the forwarding path that satisfies the packet loss rate constraint is Path-A, the calculation is terminated, and Path-A is used as the calculation result of the first forwarding path calculation request, that is, Path-A. It is the first forwarding path; if two forwarding paths Path-A and Path-B are still calculated, one of them is randomly selected as the calculation result.
  • the user can flexibly control the preferred forwarding path when calculating the path by setting the E i according to his own needs.
  • the mapping relationship may further include N first forwarding paths in addition to the calculation reference constraint C i and the priority P i .
  • the calculating reference constraint enabling switch T i of the first forwarding path is different from the calculating reference constraint enabling switch E i in that the computing reference constraint enabling of the first forwarding path is enabled
  • the switch T i acts only for the first forwarding path, that is, whether it is enabled, and the computing reference constraint enabling switch E i is not limited to the first forwarding path, and the enabling state is for all forwarding paths of the entire network. .
  • the T i of the first forwarding path is in one-to-one correspondence with the N computing reference constraints C i , and the T i of the first forwarding path is used to indicate that when the first forwarding path is determined, Whether C i corresponding to T i of a forwarding path is enabled. If the T i of the first forwarding path is an enabled state, when determining the first forwarding path, C i corresponding to the T i of the first forwarding path is a usable path reference constraint.
  • the control device is in the enabled state C i T T i of the first forwarding path is selected depending on, then according to the highest priority P i P i that corresponds in C i T from the enabled state in C i , thus obtaining the highest priority of the calculation of the benchmark constraint.
  • the method for obtaining the calculation path constraint enabling switch T i of the first forwarding path by the control device is exemplified below with reference to FIG. 1 b and Table 3, which may be in various ways:
  • the first forwarding path calculation request carries the T i of the first forwarding path specified according to the user requirement, and the control device acquires the real-time access request from the first forwarding path calculation request;
  • the T i of the first forwarding path is set in advance according to the user's requirement in the calculation path constraint and the priority mapping relationship (for example, Table 3, which is based on Table 1 and includes the The T i of the first forwarding path, the control device searches for the mapping relationship to obtain.
  • the control device may search the mapping relationship table according to the identifier of the first forwarding path (for example, ID1), and obtain the algorithm reference constraint enabling switch T i corresponding to the first forwarding path.
  • the T i of the first forwarding path corresponds to the C i one-to-one.
  • the T i of the first forwarding path is used to control which computing reference constraints can be used, and which computing reference constraints cannot be used.
  • the T i of the first forwarding path includes 5 switches, 1 ⁇ i ⁇ 5, and T 1 is set to be disabled (for example, it is identified by N, and may also be identified by other means such as digital identification, and is not specifically limited herein. ), the corresponding C 1 (which is Cost) cannot be used to calculate the path.
  • T 2 is set to enable (for example, it is identified by Y, and may be identified by other means such as digital identification, which is not specifically limited herein), and C 2 (which is a time delay) corresponding thereto can be used for calculation.
  • T 3 is set to enable, and C 3 (which is the number of hops) corresponding to it can be used for calculation.
  • T 4 is set to not enabled, and C 4 (which is jitter) corresponding to it cannot be used for calculation.
  • T 5 is set to enable, and the corresponding C 5 (which is the packet loss rate) can be used for the calculation.
  • the control device calculates the first forwarding path that meets the 20M bandwidth from FD1 to FD4, the three results of the forwarding paths Path-A, Path-B, and Path-C are obtained.
  • the control device obtains the delay constraint, the hop count constraint, and the packet loss rate constraint according to the settings of T 1 , T 2 , T 3 , T 4 , and T 5 , and can be used for the calculation of the forwarding path.
  • the settings of P 1 , P 2 , P 3 , P 4 and P 5 it is determined that the delay constraint has the highest priority, the hop limit constraint has the second highest priority, and the packet loss rate constraint has the lowest priority.
  • the delay constraint corresponding to the highest priority P 2 is obtained, and if a forwarding path that satisfies the delay constraint is determined as Path-A from the three results, the calculation is terminated, and Path-A is used as the first forwarding path.
  • Path-A is the first forwarding path.
  • the calculation result is supplied to the forwarding path calculation requester FD1.
  • the control apparatus continue receiving the second highest priority P 3 corresponding to the number of hops constraints If the forwarding path that satisfies the hop limit constraint is Path-A, the calculation is terminated, and Path-A is used as the calculation result of the first forwarding path calculation request, that is, Path-A is The first forwarding path.
  • the calculation result is supplied to the forwarding path calculation requester FD1.
  • the control device acquires the lowest priority continues P 5 corresponds to packet loss rate constraint If the forwarding path that satisfies the packet loss rate constraint is Path-A, the calculation is terminated, and Path-A is used as the calculation result of the first forwarding path calculation request, that is, Path- A is the first forwarding path. If two forwarding paths Path-A and Path-B are still calculated, one of them is randomly selected as the calculation result.
  • the user can flexibly control the preferred forwarding path when calculating the path by setting the T i according to his own needs.
  • the table 4 is based on Table 2, the mapping relationship including the calculation of the reference constraint C i and the priority P.
  • the N-based reference-constrained enable switch E i and the N first forward-transfer path-based reference-constrained enable switches T i may be included .
  • the control device calculates the whole network of any one forwarding path, the path computation E i for a reference which can be used to control constraints, which constraints reference path computation can not be used. That is, the E i can control which routing reference constraints are used when calculating all forwarding paths of the entire network.
  • the T i only controls which path reference constraint is used when calculating a certain forwarding path.
  • the control strength of the E i is stronger than the control strength of the T i , that is, the enabling priority of the E i is higher than the enabling priority of the T i .
  • the control device calculates the first forwarding path from FD1 to FD4 that meets the 20M bandwidth, the three results of the forwarding paths Path-A, Path-B, and Path-C are obtained.
  • the control device obtains the delay constraint, the jitter constraint, and the packet loss rate constraint according to the settings of E 1 , E 2 , E 3 , E 4 , and E 5 , and can be used for the calculation of the forwarding path.
  • the control device obtains the delay constraint, the hop limit constraint and the packet loss rate constraint according to the settings of T 1 , T 2 , T 3 , T 4 and T 5 , but because the E i is enabled.
  • the calculation of the forwarding path is the delay constraint and the packet loss rate constraint.
  • the delay constraint has the highest priority
  • the packet loss rate constraint has the second highest priority (at this time, the lowest).
  • the delay constraint corresponding to the highest priority P 2 is obtained, and if a forwarding path that satisfies the delay constraint is determined as Path-A from the three results, the calculation is terminated, and Path-A is used as the first forwarding path.
  • Path-A is the first forwarding path.
  • the calculation result is supplied to the forwarding path calculation requester FD1.
  • the control apparatus continue receiving the second highest priority of the packet loss rate P 5 corresponds to the constraint If the forwarding path that satisfies the packet loss rate constraint is Path-A, the calculation is terminated, and Path-A is used as the calculation result of the first forwarding path calculation request, that is, Path- A is the first forwarding path. The calculation result is supplied to the forwarding path calculation requester FD1.
  • control device randomly selects one of the two as the calculation result.
  • the user can flexibly control the preferred forwarding path when calculating the path by setting the E i and T i according to his own needs.
  • the mapping relationship includes N calculation reference constraints in addition to the calculation reference constraint C i and the priority P i
  • the switch D i is enabled by default.
  • the C i D i and the correspondence, the D i D i is used to indicate the corresponding C i is the default enabled. If D i is the default enabled state, C i corresponding to the D i is a default used reference constraint.
  • the control device D is selected enabled state according to the D I C i, then according to the highest priority P i P i that corresponds to C i C i D is from the enabled state, whereby the priority is obtained The highest level of the benchmark constraint.
  • the table 5 is based on Table 1, and includes a default enable switch D i of 5 calculation path constraints, 1 ⁇ i ⁇ 5, which may also be called default. Can switch.
  • D i is enabled (for example, it is identified by Y, and may be identified by other means such as digital identification, which is not specifically limited herein), and C 1 (which is a Cost) corresponding thereto can be used for calculation.
  • D 2 is set to not enabled (for example, it is identified by N, and may be identified by other means such as digital identification, which is not specifically limited herein), and C 2 (which is a time delay) corresponding thereto cannot be used for calculation.
  • D 3 is set to not enabled, and C 3 (which is the number of hops) corresponding to it cannot be used for calculation.
  • D 4 is set to not enabled, and C 4 (which is jitter) corresponding to it cannot be used for calculation.
  • D 5 is set to not enabled, and the corresponding C 5 (which is the packet loss rate) cannot be used for calculation.
  • the control device calculates the first forwarding path that meets the 20M bandwidth from FD1 to FD4, the three results of the forwarding paths Path-A, Path-B, and Path-C are obtained.
  • the control device obtains the Cost constraint in the enabled state according to the settings of D 1 , D 2 , D 3 , D 4 , and D 5 , and can be used for the calculation of the forwarding path. Based on the settings of P 1 , P 2 , P 3 , P 4 and P 5 , it is judged that the priority of the Cost constraint is the highest. Therefore, the calculation is performed by using the Cost constraint.
  • Path-A is used as the calculation result of the first forwarding path calculation request, that is, Path.
  • -A is the first forwarding path.
  • the calculation result is supplied to the forwarding path calculation requester FD1. If at least two forwarding paths are still calculated, for example, Path-A and Path-B, one of them is randomly selected as the calculation result.
  • the setting of the default enable switch D i of the calculation path constraint can be used to be compatible with the prior art or the existing calculation method.
  • the D can be set. i to achieve the goal.
  • the above describes that when the control device calculates the forwarding path according to the first forwarding path calculation request, when at least two forwarding paths satisfying the necessary constraints are calculated, by using C i and P i , and with E i , T i , D i is any combination of the three to be flexible routing control in accordance with user's business needs.
  • the following embodiment describes a method of how to preempt resources (e.g., bandwidth resources) of other forwarding paths when calculating a forwarding path that does not satisfy the necessary constraints.
  • the control device directly uses the priority of the tunnel as an additional constraint to determine whether resources of other forwarding paths can be preempted. .
  • a forwarding path with a high tunnel priority can preempt the forwarding path with a low tunnel priority.
  • the link bandwidth between FD1 and FD2 is 20M
  • the link bandwidth between FD1 and FD5 is 10M
  • the link bandwidth between FD1 and FD3 is 5M.
  • FD2 and FD5 The link bandwidth between the two is 20M
  • the link bandwidth between FD5 and FD4 is 10M
  • the link bandwidth between F5 and FD3 is 5M
  • the link bandwidth between FD3 and FD4 is 10M.
  • the control device calculates a forwarding path X with a bandwidth of 20 M.
  • the path reference with the highest priority of the forwarding path X (Path-X) to be calculated is the hop count and the tunnel priority is high.
  • the one with the highest priority of the forwarding path Y (Path-Y) in the network is the cost and the tunnel priority is low. If, in this calculation scenario, the set reference cost constraint cost corresponds to a priority higher than the hop count.
  • the control device calculates the Path-X, if it finds that the Path-X does not satisfy the 20M bandwidth, resource preemption is performed. If the method of preempting the bandwidth resources according to the existing tunnel priority, the control device determines that the tunnel priority of the path-X is higher than that of the existing Path-Y tunnel, and preempts the existing Path-Y. The bandwidth resource (that is, the bandwidth resource on the existing Path-Y is released), thereby calculating a forwarding path that satisfies the 20M bandwidth. Although the priority of the path-based reference hop count of the Path-X to be calculated is smaller than the priority of the path-reference hop count of the existing Path-Y, the tunnel-first path of the path-X to be calculated is prioritized.
  • the level is greater than the tunnel priority of the existing Path-Y.
  • the path-X to be calculated can preempt the bandwidth of the existing Path-Y.
  • the control device will preempt the resources with higher priority than the calculation reference constraint of the forwarding path, so that the management of the network resources is not clear, and it is not convenient for the operator administrator to manage on demand.
  • the unit of bandwidth in the embodiment of the present invention is Mbps (megabits per second) or MBps (megabytes per second), for example, 10 Mbps or 10 MBps.
  • the embodiment of the present invention provides a resource preemption method, in which the priority of the tunnel priority of each forwarding path is set to be lower than the priority of the calculation reference constraint of each forwarding path, for example, resource preemption.
  • the priority of the priority is: cost, delay, hop count, jitter, packet loss rate, and tunnel priority.
  • the tunnel priority is followed.
  • the control device can preempt resources of an existing forwarding path that has a lower preemptive priority than the forwarding path to be calculated. Therefore, the scenario based on the calculation of the reference datum constraint and the priority mapping relationship can be smoothly compatible with the method of directly using the tunnel priority to resolve resource conflicts, thereby avoiding conflicts and enabling the operator administrator to follow the calculation path.
  • the priority of the reference constraint corresponds to the orderly planning resource preemption, which facilitates the clear management of network resources.
  • the resource preemption method provided by the embodiment of the present invention is specifically described below.
  • the method provided by the embodiment of the present invention further include:
  • the control device selects P i in the T enabled state according to the T i of the first forwarding path, and then from the first forwarding path in the enabled state T P i of the highest priority is selected as the P i of the first forwarding path preemption priority.
  • the control device obtains the number N of the second forwarding path reference path computation constraints enable switch T i, T i of the second forwarding path P i with said N-one correspondence, according to the second and selecting a forwarding path in T T i of P i of the enabled state, then T is P i of the enabled state from the forwarding path for the second highest priority is selected as the P i of the second forwarding path
  • the preemption priority of the second forwarding path is lower than the preemption priority of the first forwarding path.
  • the control device preempts resources of the second forwarding path and determines at least one forwarding path that meets the necessary constraints.
  • the control device calculates the first forwarding path and calculates a forwarding path that does not satisfy the necessary constraint
  • the T i of the first forwarding path is used to control which priority of the computing reference constraint can be used, and which computing reference is used.
  • the priority of the constraint can not be used, and the priority of the reference path constraint can be used as the preemption priority of the first forwarding path to be calculated, so that resources of other forwarding paths with lower preemption priority than themselves can be preempted. That is, the T i of the first forwarding path is used to control which priorities can be used, which priorities cannot be used, and which priorities can be used as preemption priorities.
  • the control device determines the preemption priority of the first forwarding path according to the T i of the first forwarding path in Table 6.
  • T i the first forwarding path comprises five switches, 1 ⁇ i ⁇ 5, T 1 is set to not enabled, the corresponding P 1 of the representative can not be used as the first forwarding path preemption priority.
  • T 2 is set to enable, and P 2 corresponding thereto can be used as the preemption priority of the first forwarding path.
  • T 3 is set to enable, and the corresponding P 3 can be used as the preemption priority of the first forwarding path.
  • T 4 is set to not enabled, and P 4 corresponding thereto cannot be used as the preemption priority of the first forwarding path.
  • T 5 is set to enable, and the corresponding P 5 can be used as the preemption priority of the first forwarding path. Then be able to seize the forwarding path as the first priority P 2, P 3 and P 5, select the highest priority P 2 as the first forwarding path preemption priority.
  • the T i of the second forwarding path in the table 6 includes 5 switches, 1 ⁇ i ⁇ 5, and T 1 is set to be disabled, and the P 1 corresponding thereto cannot be used as the preemption priority of the second forwarding path. .
  • T 2 is set to not enabled, and P 2 corresponding thereto cannot be used as the preemption priority of the second forwarding path.
  • T 3 is set to enable, and P 3 corresponding thereto can be used as the preemption priority of the second forwarding path.
  • T 4 is set to not enabled, and P 4 corresponding thereto cannot be used as the preemption priority of the second forwarding path.
  • T 5 is set to enable, and P 5 corresponding thereto can be used as the preemption priority of the second forwarding path.
  • Priority can preempt and from P 3 and P 5 as the second forwarding path, selecting the highest priority preemption priority P 3 as the second forwarding path.
  • preemption priority higher than the first transfer path to the second forwarding path preemption priority i.e. the first forwarding path may preempt bandwidth resource of the second forwarding path.
  • the control device calculates a first forwarding path that satisfies the 20M bandwidth from FD1 to FD4, and obtains a forwarding path in the network that cannot satisfy the 20M bandwidth resource, the control device can preempt (ie, release) the second forwarding path.
  • Bandwidth resources eg, bandwidth 20M
  • the preemption priority of the second forwarding path in the network is equal to the preemption priority of the first forwarding path to be calculated, the jitter calculation path constraint is Corresponding priority level 3, the preemption relationship needs to be determined according to the tunnel priority of the two forwarding paths. At this time, the tunnel priority of the second forwarding path is lower than the tunnel priority of the first forwarding path. Therefore, when the control device calculates the path, the resource of the second forwarding path can be preempted, so that the first Forward path.
  • the preemptive priority of the ordered planning resources is prioritized according to the priority of the calculation path constraint.
  • step 1001 based on the embodiments and methods set forth herein in Table 6, further optionally, wherein the control apparatus in accordance with the selected E E I enabled state P i, is then from the E enabled state P i in accordance with T I of the first forwarding path is selected at T P i enabled state, then the highest priority is selected from P i P i that is in the enabled state T as the Preemption priority of the first forwarding path.
  • the control apparatus according to the selection in E E I enabled state P i, P i is further from the enabled state of E, T I in accordance with the second forwarding path selection enabled state at T P i, then the highest priority is selected as the P i of the second forwarding path from said preemption priority P i T is in the enabled state.
  • Table 8 in conjunction with FIGS. 1b and illustrated, the table 8 is based on Table 6, further comprising a reference path computation constraints enable switch E i, E i of the function have been set forth above, is worth noting that, in In the scenario of resource preemption, when the control device calculates any forwarding path in the entire network, E i is used to control which priority of the calculation reference constraint can be used, and which priority of the calculation reference constraint cannot be used. That is, E i can control which priorities of the calculation path reference constraints are used when calculating all the forwarding paths of the entire network. However, T i only controls the priority corresponding to the calculation path constraint when calculating a certain forwarding path. The control strength of E i is stronger than that of T i , that is, the enabling priority of E i is higher than the enabling priority of T i .
  • the control apparatus according to the Table 8 E 1 E 2, E 3, E 4 and E settings, 5, to obtain E 2, E 4 and E 5 each corresponding to P 2, P 4 and P 5 can be used as the first Preemption priority of the forwarding path.
  • the control device further determines, according to the T i of the first forwarding path, P 2 , P 3 and P 5 as the preemption priority of the first forwarding path, and combines E i and T i to obtain P 2 and P 5 as Preemption priority of the first forwarding path.
  • the priority can preempt P 2 and P 5 as the first forwarding path, selecting the highest priority P 2 as the first forwarding path preemption priority.
  • the control device 8 in Table E 1 E 2, E 3, E is provided, and E 5 4 obtained E 2, E 4 and E 5 each corresponding to P 2, P 4 and P 5 can be used as the second Preemption priority of the forwarding path.
  • the control device further determines, according to the T i of the second forwarding path, P 3 and P 5 as the preemption priority of the second forwarding path, and combines E i and the T i of the second forwarding path to obtain P 5 as The preemption priority of the second forwarding path.
  • P 5 is determined as the preemption priority of the second forwarding path.
  • the first preemption priority forwarding path is higher than the second preemption priority forwarding path, i.e., the first forwarding path may preempt bandwidth resource of the second forwarding path.
  • the control device calculates a first forwarding path that satisfies the 20M bandwidth from FD1 to FD4, and obtains a forwarding path in the network that cannot satisfy the 20M bandwidth resource, the control device can preempt (ie, release) the second forwarding path.
  • Bandwidth resources eg, bandwidth 20M
  • the method of this embodiment can be compatible with the method of using the tunnel priority for resource preemption.
  • the calculation path constraint of each forwarding path corresponds to a priority greater than the tunnel priority of each forwarding path.
  • the tunnel priority of the first forwarding path and the tunnel priority of the second forwarding path may be used for resource preemption.
  • FIG. 4 is a schematic block diagram of a control device 400 according to an embodiment of the present invention. As shown in FIG. 4, the control device includes an acquisition unit 401 and a processing unit 402.
  • the obtaining unit 401 is configured to acquire a first forwarding path calculation request, where the first forwarding path calculation request indicates to calculate a first forwarding path from the source node to the destination node and satisfying the necessary constraint.
  • the processing unit 402 When the processing unit 402 is configured to calculate at least two forwarding paths that satisfy the necessary constraints, obtain the highest-priority computing reference constraint according to the mapping relationship between the computing path reference constraint and the priority, and according to the highest priority
  • the calculation path constraint determines at least one forwarding path that satisfies the highest priority of the calculation reference constraint from the at least two forwarding paths that satisfy the necessary constraint.
  • the mapping relationship between the calculation path constraint and the priority includes N the calculation path reference constraints C i and the N priority levels P i , wherein the P i corresponds to the C i one by one, i is a positive integer greater than or equal to 1 and less than or equal to N, and the N is a positive integer greater than or equal to 2.
  • the processing unit 402 is further configured to: when calculating at least two forwarding paths that satisfy the highest priority of the computing path constraint, according to the second highest priority computing reference constraint, from the at least two The bar meets the highest priority Determining, in the forwarding path of the high-calcion reference constraint, a forwarding path that satisfies the second highest priority of the calculation path constraint, and the forwarding path of the calculation-based reference constraint that satisfies the second highest priority is greater than or equal to In two cases, the calculation path constraint corresponding to the lower priority is sequentially selected and the forwarding path satisfying the calculation reference constraint corresponding to the lower priority is determined until it is determined that one of the low levels is satisfied. The forwarding path of the calculation path constraint corresponding to the priority or the calculation of the calculation path constraint corresponding to the lowest level priority and determining the forwarding path of the calculation reference constraint corresponding to the priority of the lowest level.
  • mapping relationship further includes N path computation constraints default reference enable switch D i, D i of the correspondence with the C i, D i a D i is used to indicate the corresponding Whether C i is the default enable state. If D i is the default enabled state, C i corresponding to the D i is a default used reference constraint.
  • mapping relationship further includes N channel reference count enable switch constraints E i, E i of the I-one correspondence with the C, the E i E i is used to indicate the corresponding C Is i enabled? If an enabled state E i, E i is the C i corresponding to the reference path constraint operator can be used.
  • the selection processing unit 402 in the E enabled state according to the C i E I, again based on the highest priority P i P i of the corresponding C i from C i E is in the enabled state, Thereby obtaining the highest priority calculation path constraint.
  • the mapping relationship further includes an operation reference constraint enabling switch T i of the N first forwarding paths, and a T i of the first forwarding path and the N computing reference constraints C i
  • the T i of the first forwarding path is used to indicate whether C i corresponding to the T i of the first forwarding path is enabled when the processing unit 402 determines the first forwarding path;
  • the C i corresponding to the T i of the first forwarding path is a usable algorithm. Benchmark constraint.
  • the processing unit 402 to select the E is C i according to the enabled state E I; I T again according to the first forwarding path from said enabled state E is C i, the selection is enabled T state C i; P i and the highest priority is selected corresponding to P i that is in C i C i T from the enabled state according to obtain the highest priority reference path computation constraints.
  • the mapping relationship further includes an operation reference constraint enabling switch T i of the N first forwarding paths, and a T i of the first forwarding path and the N computing reference constraints C i
  • the T i of the first forwarding path is used to indicate whether C i corresponding to the T i of the first forwarding path is enabled when the processing unit 402 determines the first forwarding path;
  • the C i corresponding to the T i of the first forwarding path is a usable algorithm. Benchmark constraint.
  • the selection processing unit 402 in the enabled state T C i T I according to the first forwarding path, and then according to the highest priority P i P i that is in C i T from the enabled state in Corresponding C i , thus obtaining the highest priority of the calculation path constraint.
  • the processing unit 402 determines that the forwarding path of the necessary constraint is not met, selecting P i in the T enabled state according to the T i of the first forwarding path, and then forwarding from the first forwarding the path is in the enabled state T P i of the highest priority is selected as the P i of the first forwarding path preemption priority.
  • the processing unit 402 obtains N forwarding path of the second reference path computation constraints enable switch T i, said second forwarding path T i of said N P i-one correspondence.
  • the processing unit 402 selects P i in the T enabled state according to the T i of the second forwarding path, and selects the highest priority from the P i in the T enabled state for the second forwarding path.
  • the P i is used as the preemption priority of the second forwarding path, and determines that the preemption priority of the second forwarding path is lower than the preemption priority of the first forwarding path.
  • the processing unit 402 preempts resources of the second forwarding path and determines at least one forwarding path that satisfies the necessary constraints.
  • control device 400 further includes a storage unit, where the storage unit is configured to save the mapping relationship.
  • the control device 400 may correspond to a control device in a method of determining a forwarding path according to an embodiment of the present invention, and each module in the control device 400 and the other operations and/or functions described above are respectively implemented for The various steps and methods implemented by the control device in the embodiment corresponding to FIG. 3a to FIG. 3c are not described herein for brevity.
  • the control device of the embodiment of the present invention determines the forwarding path by selecting the path reference constraint with a high priority according to the mapping relationship between the path reference constraint and the priority, thereby obtaining a preferred forwarding path that satisfies the user's needs.
  • the forwarding path is arbitrarily selected to some extent.
  • the user can flexibly control the preferred forwarding path when calculating the circuit according to his own needs.
  • the preemptive priority of the ordered resource in the priority order of the corresponding priority is determined according to the calculation of the path reference, so that the operator administrator can clearly manage the network resources and avoid conflicts with the prior art.
  • FIG. 5 is a schematic structural diagram of another embodiment of a control device of the present application.
  • the control device 500 of the present embodiment includes a receiver 510, a processor 520, a transmitter 530, a random access memory 540, a read only memory 550, and a bus 560.
  • the processor 520 is coupled to the receiver 510, the transmitter 530, the random access memory 540, and the read only memory 550 via a bus 560.
  • the booting is performed in the basic input/output system or the bootloader booting system in the embedded system, and the booting control device 500 is put into a normal operating state.
  • the application and operating system are run in the random access memory 540 such that:
  • the processor 520 is configured to obtain a first forwarding path calculation request, where the first forwarding path calculation request indicates to calculate a first forwarding path from a source node to a destination node and satisfying a necessary constraint.
  • the processor 520 is further configured to: when calculating at least two forwarding paths that satisfy the necessary constraint, obtain a computing path reference constraint with the highest priority according to the mapping relationship between the computing path reference constraint and the priority, and according to the priority
  • the highest level of the routing reference constraint determines at least one forwarding path that satisfies the highest priority of the computing reference constraint from the at least two forwarding paths that satisfy the necessary constraints.
  • the mapping relationship between the calculation path constraint and the priority includes N the calculation path reference constraints C i and the N priority levels P i , wherein the P i corresponds to the C i one by one, i is a positive integer greater than or equal to 1 and less than or equal to N, and the N is a positive integer greater than or equal to 2.
  • the processor 520 is further configured to: when calculating at least two forwarding paths that satisfy the highest priority of the computing path constraint, according to the second highest priority computing reference constraint, from the at least two Determining, in the forwarding path that satisfies the highest priority of the calculation path constraint, the forwarding path that satisfies the second highest priority of the calculation path constraint, and the calculation of the calculation path constraint that satisfies the second highest priority
  • the forwarding path is greater than or equal to two
  • the routing reference constraint corresponding to the low-level priority is selected in turn, and the forwarding path that satisfies the calculation reference constraint corresponding to the low-level priority is determined until a certain one is satisfied.
  • the control device of the embodiment of the present invention determines the forwarding path by selecting the path reference constraint with a high priority according to the mapping relationship between the path reference constraint and the priority, thereby obtaining a preferred forwarding path that satisfies the user's needs.
  • the forwarding path is arbitrarily selected to some extent.
  • the mapping relationship further includes N path computation constraints default reference enable switch D i, D i of the correspondence with the C i, D i a D i is used to indicate the corresponding Whether C i is the default enable state. If D i is the default enabled state, C i corresponding to the D i is a default used reference constraint.
  • the processor 520 is selected according to the D i C i D enabled state, then according to the highest priority P i P i that corresponds to C i C i D is from the enabled state, the priority is obtained The highest level of the benchmark constraint.
  • the mapping relationship further includes N channel reference count enable switch constraints E i, E i of the I-one correspondence with the C, the E i E i is used to indicate the corresponding C Is i enabled? If an enabled state E i, E i is the C i corresponding to the reference path constraint operator can be used.
  • the processor 520 of the E i C i E is selected according to the enabled state, then in accordance with the highest priority P i P i of the corresponding C i from C i E is in the enabled state, Thereby obtaining the highest priority calculation path constraint.
  • the mapping relationship further includes an operation reference constraint enabling switch T i of the N first forwarding paths, and a T i of the first forwarding path and the N computing reference constraints C i
  • the T i of the first forwarding path is used to indicate whether C i corresponding to the T i of the first forwarding path is enabled when the processor 520 determines the first forwarding path;
  • the C i corresponding to the T i of the first forwarding path is a usable algorithm. Benchmark constraint.
  • the processor 520 of the first I E E C i is selected according to the enabled state; then I T according to the first forwarding path from said enabled state E is C i, the selection is enabled T state C i; P i and the highest priority is selected corresponding to P i that is in C i C i T from the enabled state according to obtain the highest priority reference path computation constraints.
  • the mapping relationship further includes an operation reference constraint enabling switch T i of the N first forwarding paths, and a T i of the first forwarding path and the N computing reference constraints C i
  • the T i of the first forwarding path is used to indicate whether C i corresponding to the T i of the first forwarding path is enabled when the processor 520 determines the first forwarding path;
  • the C i corresponding to the T i of the first forwarding path is a usable algorithm. Benchmark constraint.
  • the processor 520 T i of the first forwarding path is selected in accordance with C i T enabled state, then P i in accordance with the highest priority is selected from P i that is in the enabled state T C i in Corresponding C i , thus obtaining the highest priority of the calculation path constraint.
  • control device of the embodiment of the present invention enables the user to flexibly control the preferred forwarding path when calculating the path according to the needs of the E i , T i and D i switches.
  • T i is the first forwarding path is selected according to T P i enabled state, then for the first forwarding from the path is in the enabled state T P i of the highest priority is selected as the P i of the first forwarding path preemption priority.
  • the processor 520 obtains N forwarding path of the second reference path computation constraints enable switch T i, said second forwarding path T i of said N P i-one correspondence.
  • the processor 520 selects P i in the T enabled state according to the T i of the second forwarding path, and selects the highest priority from the P i in the T enabled state for the second forwarding path.
  • the P i is used as the preemption priority of the second forwarding path, and determines that the preemption priority of the second forwarding path is lower than the preemption priority of the first forwarding path.
  • the processor 520 preempts resources of the second forwarding path and determines at least one forwarding path that satisfies the necessary constraints.
  • the processor 520 in accordance with the selected E E I enabled state P i, P i is further from the enabled state of E, T i according to the first forwarding path is selected at T P i of the enabled state, then the highest priority is selected as the P i of the first forwarding path from said preemption priority P i T is in the enabled state.
  • the processor 520 in accordance with the selected E E I enabled state P i, P i is further from the enabled state of E, T I of the second transfer path is selected according to the T P i of the enabled state, then the highest priority is selected as the P i of the second forwarding path from said preemption priority P i T is in the enabled state.
  • the random access memory 540 and/or the read only memory 550 is further configured to save the mapping relationship.
  • control device of the embodiment of the present invention can preferentially manage network resources and avoid conflicts with the prior art by prioritizing the preemption of the orderly planning resources according to the priority of the computing path.
  • the control device 500 may correspond to a control device in a method of determining a forwarding path according to an embodiment of the present invention, and each module in the control device 500 and the other operations and/or functions described above are respectively implemented for Various steps and methods implemented by the control device in the embodiment corresponding to 1a to 3c.
  • the processor 520 is configured to perform all operations of the obtaining unit 401 and the processing unit 402 of the control device of FIG. For the sake of brevity, it will not be repeated here.
  • the size of the sequence numbers of the above processes does not mean the order of execution, and the order of execution of each process should be determined by its function and internal logic, and should not be taken to the embodiments of the present invention.
  • the implementation process constitutes any limitation.
  • the disclosed systems, devices, and methods may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the functions may be stored in a computer readable storage medium if implemented in the form of a software functional unit and sold or used as a standalone product.
  • the technical solution of the present invention which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including
  • the instructions are used to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like. .

Landscapes

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

Abstract

本发明实施例提供一种确定转发路径的方法和装置。该方法包括：控制设备获得第一转发路径计算请求，所述第一转发路径计算请求指示计算从源节点到目的节点并满足必要约束的第一转发路径。当所述控制设备计算出至少两条满足所述必要约束的转发路径时，所述控制设备根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束，根据所述优先级最高的算路基准约束从所述至少两条满足所述必要约束的转发路径中确定满足所述优先级最高的算路基准约束的至少一条转发路径。有助于控制设备算路时选取优选的转发路径。

Description

确定转发路径的方法和控制设备
本申请要求于2016年7月8日提交中国专利局、申请号为CN 201610539761.3、发明名称为“确定转发路径的方法和控制设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明涉及通信技术领域，具体涉及一种用于确定转发路径的方法和控制设备。
背景技术
对于控制设备集中计算转发路径的通信网络场景，例如，基于多协议标签交换(Multiple Protocol Label Switch，MPLS)流量工程(Traffic Engineering，TE)技术的路径计算单元(Path Computation Element，PCE)集中算路架构；和基于控制转发分离思想的软件定义网络(Software Defined Networking，SDN)架构，集中控制设备(例如，PCE设备或SDN控制器)可以基于集中管理的网络拓扑图和必要约束条件，根据路径计算业务请求计算出一条满足该必要约束条件的最佳路径。
但是，在现有的集中算路方案中，当满足该必要约束条件的转发路径有至少两条时，该集中控制设备从中选取一条满足一个算路基准约束的转发路径，当满足该算路基准约束的转发路径还有至少两条时，则从中随意选取一条作为计算结果，可能导致该随意选取的转发路径并不是优选的或者用户想要的路径。
发明内容
本发明实施例提供的确定转发路径的方法和控制设备，可以解决控制设备在计算转发路径时，当满足必要约束条件的转发路径有至少两条时，该集中控制设备从中选取一条满足一个算路基准约束的转发路径，当满足该算路基准约束的转发路径还有至少两条时，则从中随意选取一条作为计算结果，可能导致该随意选取的转发路径并不是优选的或者用户想要的路径的问题。
为了解决上述问题，本发明实施例第一方面提供一种确定转发路径的方法，应用于通信网络中，所述方法包括：控制设备获得第一转发路径计算请求，所述第一转发路径计算请求指示计算从源节点到目的节点并满足必要约束的第一转发路径；当所述控制设备计算出至少两条满足所述必要约束的转发路径时，所述控制设备根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束，根据所述优先级最高的算路基准约束从所述至少两条满足所述必要约束的转发路径中确定满足所述优先级最高的算路基准约束的至少一条转发路径；其中，所述算路基准约束和优先级的映射关系包括N个所述算路基准约束Ci和N个所述优先级Pi，所述Pi与所述Ci一一对应，所述i为大于等于1且小于等于N的正整数，所述N为大于等于2的正整数。
本发明实施例中，控制设备根据必要约束条件进行转发路径计算，当满足该必要约束 条件的转发路径有至少两条时，所述控制设备通过根据算路基准约束和优先级的映射关系选取优先级最高的算路基准约束，从中选取一条满足该优先级最高的算路基准约束的转发路径的方法，从而得到了满足用户需求的、优选的转发路径。
在第一方面的第一种可能的实现方式中，还包括：当所述控制设备计算出至少两条满足所述优先级最高的算路基准约束的转发路径时，所述控制设备根据优先级次高的算路基准约束，从所述至少两条满足所述优先级最高的算路基准约束的转发路径中，确定满足所述优先级次高的算路基准约束的转发路径，并且在所述满足所述优先级次高的算路基准约束的转发路径大于或等于两条时，依次选择低级别的优先级所对应的算路基准约束并确定满足所述低级别的优先级所对应的算路基准约束的转发路径，直至确定一条满足其中一个所述低级别的优先级所对应的算路基准约束的转发路径或者直至选择最低级别的优先级对应的算路基准约束并确定满足所述最低级别的优先级所对应的算路基准约束的转发路径。
本发明实施例中，当满足该优先级最高的算路基准约束的转发路径还有至少两条时，则所述控制设备根据该映射关系中优先级第二高的算路基准约束，从中选取至少一条满足该优先级第二高的算路基准约束的转发路径，以此类推，逐级使用优先级次高的算路基准约束算路，从而得到满足用户需求的、优选的转发路径。
结合第一方面或第一方面的第一种可能的实现方式，在第一方面的第二种可能的实现方式中，所述映射关系还包括：N个算路基准约束使能开关Ei，所述Ei与所述Ci一一对应，所述Ei用于指示与所述Ei对应的Ci是否被使能；若Ei为使能状态，则与所述Ei对应的Ci为可以使用的算路基准约束；相应地，所述控制设备根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束包括：所述控制设备根据所述Ei选择处于E使能状态的Ci，再根据所述Pi从所述处于E使能状态的Ci中选择优先级最高的Pi对应的Ci。
本发明实施例提供的方法，使用户可以根据自己的需求，通过Ei的设置来灵活地控制算路时选择优选的转发路径。
结合第一方面或第一方面的第一种可能的实现方式，在第一方面的第三种可能的实现方式中，所述映射关系还包括：N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径的Ti为使能状态，则在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束；相应地，所述控制设备根据算路基准约束和优先级映射关系，获得优先级最高的算路基准约束包括：所述控制设备根据所述第一转发路径的Ti选择处于T使能状态的Ci，再根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci。
本发明实施例提供的方法，使用户可以根据自己的需求，通过Ti的设置来灵活地控制算路时选择优选的转发路径。
结合第一方面的第二种可能的实现方式，在第一方面的第四种可能的实现方式中，所述映射关系还包括：N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径 的Ti为使能状态，则在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束；相应地，所述控制设备根据算路基准约束和优先级映射关系，获得优先级最高的算路基准约束包括：所述控制设备先根据所述Ei选择处于E使能状态的Ci；再根据所述第一转发路径的Ti从所述处于E使能状态的Ci中，选择处于T使能状态的Ci；然后根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci。
本发明实施例提供的方法，使用户可以根据自己的需求，通过Ei和Ti的设置来灵活地控制算路时选择优选的转发路径。
结合第一方面或第一方面的第一种可能的实现方式，在第一方面的第五种可能的实现方式中，所述映射关系还包括：N个算路基准约束默认使能开关Di，所述Di与所述Ci一一对应，所述Di用于指示与所述Di对应的Ci是否为默认使能状态；若Di为默认使能状态，则与所述Di对应的Ci为默认使用的算路基准约束；相应地，所述控制设备根据算路基准约束和优先级映射关系，获得优先级最高的算路基准约束包括：所述控制设备根据所述Di选择处于D使能状态的Ci，再根据Pi从所述处于D使能状态的Ci中选择优先级最高的Pi对应的Ci。
本发明实施例提供的方法，通过该算路基准约束的默认使能开关Di的设置，来兼容现有技术或者现有的算路方式，当用户希望使用传统的单算路基准约束进行选路时，可以设置该Di来达到目的。
结合第一方面的第三种可能的实现方式，在第一方面的第六种可能的实现方式中，所述方法还包括：当所述控制设备确定没有满足所述必要约束的转发路径时，所述控制设备根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从针对所述第一转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级；所述控制设备获得N个所述第二转发路径的算路基准约束使能开关Ti，所述第二转发路径的Ti与所述N个Pi一一对应，并根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从针对所述第二转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级；并确定所述第二转发路径的抢占优先级低于所述第一转发路径的抢占优先级；所述控制设备抢占第二转发路径的资源，并确定出满足所述必要约束的至少一条转发路径。
本发明实施例提供的方法，通过优先按照算路基准约束对应的优先级顺序有序的规划资源的抢占优先级，便于运营商管理员清晰的管理网络资源，避免与现有技术的冲突。
结合第一方面的第六种可能的实现方式，在第一方面的第七种可能的实现方式中，所述控制设备根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级包括：所述映射关系还包括N个算路基准约束使能开关Ei，所述Ei与所述Ci一一对应，所述Ei用于指示与所述Ei对应的Ci是否被使能；若Ei为使能状态，则与所述Ei对应的Ci为可以使用的算路基准约束；所述控制设备根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级；相应地，所述控制设备根据第二转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先 级最高的Pi作为所述第二转发路径的抢占优先级包括：所述控制设备根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级。
本发明实施例提供的方法，通过利用每条转发路径的算路基准约束对应的优先级，以及算路基准约束的使能开关Ei的控制，不但可以使得资源抢占有序分级、资源管理清晰，便于用户按需查看使用，而且还可以灵活的按照用户的需求进行资源抢占。
结合第一方面及其上述可能的实现方式，在第一方面的第八种可能的实现方式中，在所述控制设备获得第一转发路径计算请求之前，所述方法还包括：在所述控制设备上，设置并保存所述映射关系。
第二方面，本发明提供一种控制设备，所述控制设备用于执行第一方面或第一方面的任意可能的实现方式中的方法。具体地，所述控制设备包括用于执行第一方面或第一方面的任意可能的实现方式中的方法的模块。
第三方面，本发明提供一种控制设备，所述控制设备包括：接收器、处理器、发送器、随机存取存储器、只读存储器以及总线。其中，处理器通过总线分别耦接接收器、发送器、随机存取存储器以及只读存储器。其中，当需要运行控制设备时，通过固化在只读存储器中的基本输入输出系统或者嵌入式系统中的bootloader引导系统进行启动，引导控制设备进入正常运行状态。在控制设备进入正常运行状态后，在随机存取存储器中运行应用程序和操作系统，使得该处理器执行第一方面或第一方面的任意可能的实现方式中的方法。
第四方面，本发明提供一种计算机可读介质，用于存储计算机程序，该计算机程序包括用于执行第一方面或第一方面的任意可能的实现方式中的方法的指令。
附图说明
为了更清楚地说明本发明的技术方案，下面将对实施例中使用的附图作简单地介绍。显而易见地，下面附图只是本发明的一些实施例的附图，对于本领域普通技术人员来说，在不付出创造性劳动性的前提下，还可以根据这些附图获得同样能实现本发明的其他技术方案和附图。这些技术方案和附图也应该被认为是在本发明的范围之内。
图1a是本发明实施例的一种网络示意图；
图1b是本发明实施例又一种网络示意图；
图2是本发明实施例中一种确定转发路径的流程示意图；
图3a是本发明实施例的一种网络示意图；
图3b是本发明实施例的又一种网络示意图；
图3c是本发明实施例的再一种网络示意图；
图4是本发明实施例中一种控制设备的结构示意图；
图5是本发明实施例中又一种控制设备的结构示意图。
具体实施方式
为了使本技术领域的人员更好地理解本发明方案，下面结合附图和实施方式对本发明实施例作进一步的详细说明。显然，所描述的实施例是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其它实施例，都属于本发明保护的范围。
本发明实施例的应用场景为具有集中控制管理能力的通信网络，在这种通信网络中，集中控制设备可以基于集中管理的网络拓扑图和必要约束条件，根据用户的路径计算业务请求计算出满足该必要约束条件的优选的路径。
传统的具有集中控制管理能力的通信网络，例如，可以是PCE网络，PCE网络是一种基于MPLS TE技术的集中算路架构。如图1a所示，PCE架构中包括PCE和路径计算客户端(Path Computation Client，PCC)两种功能实体，PCE和PCC之间通过路径计算通信协议(Path Computation Element Communication Protocol,PCEP)进行通信。PCE是路径计算的完成方，存储了整网的路径信息。PCC为算路请求的发起方，即隧道的入口(Ingress)节点。PCC向PCE发送PECP Report消息，请求PCE进行路径计算。PCE会根据整网的资源情况和该路径的约束策略进行路径计算，并将计算结果通过PCEP更新(Update)消息返回给该Ingress节点，该Ingress节点按照该路径计算结果，进行TE隧道的建立。
近年来随着SDN的兴起，传统分布式控制架构的网络正在向集中式控制架构的网络演变。如图1b所示，SDN网络通过将传统网络设备的控制平面和转发平面的功能进行分离，并将控制平面的功能集中部署到控制器上，集中的控制器因为具有了全网的拓扑图和网络资源的利用情况，从而可以按照用户的需求，集中计算转发路径，并为该路径上的各转发设备分别生成转发表项，以及将各转发表项通过控制通道协议，分别发送给相应的转发设备。控制器和转发设备之间通过控制通道协议进行通信，目前常用的控制通道协议，例如，可以包括：开放流(OpenFlow)协议、PCEP、边界网关协议(Border Gateway Protocol，BGP)、路由系统接口(Interface to the Routing System，I2RS)等。因为都是基于集中计算的理念，所以传统的PCE架构可以很自然的融入到SDN架构中，PCEP协议也是SDN架构中一种可行的控制通道协议。需要说明的是，这里的SDN网络包括利用SDN混合转发设备部署的过渡阶段的SDN网络，和利用纯SDN转发设备部署的SDN网络。此外，每个网络域中可以集中部署一台或多台控制器，当网络规模较大时，多台控制器也可以采用分布式技术集中部署，成为控制器集群，此种场景依然属于具有集中控制管理能力的通信网络。
值得说明的是，图1b中的转发设备(Forwarding Device，FD)可以为硬件或者基于软件的实现数据报文路由和转发功能的设备，该转发设备可以是传统路由器或交换机；该转发设备也可以是SDN混合路由器或交换机，该SDN混合交换机或路由器既支持SDN规范定义(例如OpenFlow协议规范)的操作，又支持传统交换机或路由器规定的操作，例如OpenFlow-hybrid交换机或路由器；该转发设备还可以是纯SDN路由器或交换机，该纯SDN路由器或交换机只支持SDN规范定义的操作，例如OpenFlow-only交换机或路由器。应理解，该转发设备在基于PCEP协议的PCE或SDN架构中，也称作PCC实体。
从上述可以看出，在具有集中控制管理能力的通信网络架构中，集中控制设备通常运行算路算法，根据对转发路径的必要约束条件完成路径的计算。必要约束条件也可叫必要 约束，是算路时必需满足的约束条件，可以是必需满足特定值的约束条件，例如，转发路径的带宽、亲和属性和链路颜色。如果用户申请计算带宽为20M的转发路径，则计算结果必需精确满足20M的带宽，不能多也不能少。必要约束也可以是必需满足特定范围的约束条件，例如，跳数小于等于N，当跳数的门限设置为N、N＝3时，算路时计算的是满足跳数门限小于等于3的路径。再例如，时延小于等于10毫秒，丢包率小于等于20％，抖动小于10％。
在算路时，当满足必要约束的转发路径有至少两条时，使用算路基准约束(例如，成本cost值最小)从多条候选路径中选取至少一条转发路径。算路基准约束是一个相对的或者需要进行比较的约束条件，通常设置为最值(如，最大值、最小值或最接近目标的值)或指定值的约束条件。已有技术中，用成本(cost)值作为算路基准约束，算路基准约束的形式可以是cost值最大、cost值最小、cost值最接近于目标值(如最接近cost值为20的目标值)、指定的cost值(如cost＝20)等。
需要说明的是，本发明实施例中的算路基准约束除了包括已有技术中的算路基准约束(如，cost)，还包括：跳数、时延、抖动、丢包率等约束参数的最值或者指定值。例如，跳数最小、时延最大、抖动最接近30％或丢包率为10％等。
在算路时，当满足必要约束的转发路径算不出来时，即出现了资源冲突的情况，这种资源通常是具有独占性质的资源，例如带宽。解决冲突的方法是抢占，就是通过释放其它抢占优先级低的转发路径的带宽资源，来满足待建的抢占优先级高的转发路径的带宽需求。已有技术中的抢占优先级约束条件为隧道优先级约束等。该隧道优先级也可以叫做隧道创建优先级或隧道保持优先级。需要说明的是，跳数、时延、抖动或丢包率都不属于独占性质的资源。
但是，在现有的PCE和SDN这种集中算路架构中，集中控制设备根据必要约束条件进行转发路径计算时，当满足该必要约束条件的转发路径有至少两条时，该集中控制设备从中选取一条满足一个算路基准约束的转发路径，当满足该算路基准约束的转发转发路径还有至少两条时，则从中随意选取一条作为计算结果，可能导致该随意选取的转发路径并不是优选的或者用户想要的路径。
为此，本发明实施例提供了一种转发路径确定方法和装置，控制设备根据算路基准约束和优先级的映射关系选取优先级最高的算路基准约束进行转发路径的确定。该算路基准约束和优先级的映射关系可以通过设置算路基准约束和优先级映射关系的方式实现，该映射关系包括至少两个算路基准约束，每个算路基准约束对应一个优先级，优先级高的算路基准约束被优先选用进行转发路径的确定。该控制设备根据必要约束条件进行转发路径计算，当满足该必要约束条件的转发路径有至少两条时，该集中控制设备根据算路基准约束和优先级的映射关系选取优先级最高的算路基准约束，从中选取一条满足该优先级最高的算路基准约束的转发路径。当满足该优先级最高的算路基准约束的转发路径还有至少两条时，则根据该映射关系中优先级第二高的算路基准约束，从中选取至少一条满足该优先级第二高的算路基准约束的转发路径，以此类推，逐级使用优先级次高的算路基准约束算路，从而得到满足用户需求的、优选的转发路径。
下面具体阐述本发明的方法和装置实施例。
图2为本发明实施例提供的一种确定转发路径的方法流程示意图。该方法包括以下步骤：
1001：控制设备获得第一转发路径计算请求，所述第一转发路径计算请求指示计算从源节点到目的节点并满足必要约束的第一转发路径。
在不同的应用场景下，控制设备获得第一转发路径计算请求的方式可以有多种，此处不做限定。例如，可以是：
方式一、控制设备作为PCE实体，通过PCEP协议，接收作为PCC实体的转发设备发送的该第一转发路径计算请求消息；
方式二、控制设备作为SDN控制器，接收来自服务器的该第一转发路径计算请求消息，该服务器可以是SDN架构下提供业务协同功能的协同器、编排器或者提供业务的应用服务器；
方式三、控制设备接收用户的命令行配置，通过命令行指定该第一转发路径计算请求。
方式四、控制设备根据内部集成的应用服务程序自动生成该第一转发路径计算请求。
应理解，该第一转发路径可以是一条TE隧道或者标签交换路径(Label Switched Path，LSP)隧道；也可以是用一元组或者多元组标识的流转发路径，例如，用目的IP地址或IP地址前缀标识的一元组流转发路径，或者用五元组(源IP地址，目的IP地址，协议号，源端口号，目的端口号)标识的流转发路径。
下面结合图1b和必要约束为带宽时为例进行说明。控制设备(即PCE实体)通过PCEP协议接收到一条来自FD1(即PCC实体)的请求消息，该请求消息中携带该第一转发路径计算请求，该第一转发路径计算请求指示计算一条从转发设备FD1到FD4的满足必要约束(例如，带宽20M)的第一转发路径。
1002：当所述控制设备计算出至少两条满足所述必要约束的转发路径时，所述控制设备根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束，根据所述优先级最高的算路基准约束从所述至少两条满足所述必要约束的转发路径中确定满足所述优先级最高的算路基准约束的至少一条转发路径.
其中，所述算路基准约束和优先级的映射关系包括N个所述算路基准约束Ci和N个所述优先级Pi，所述Pi与所述Ci一一对应，所述i为大于等于1且小于等于N的正整数，所述N为大于等于2的正整数。
具体实施方式中，该算路基准约束和优先级映射关系可以配置在所述控制设备上，并以映射表的形式保存在该控制设备上，或者由所述控制设备从其它设备获取，而且该映射关系可以根据实际情况进行更新。
在一个具体的实施方式中，当满足该优先级最高的算路基准约束的转发路径还有至少两条时，还包括以下步骤：
1003：当所述控制设备计算出至少两条满足所述优先级最高的算路基准约束的转发路径时，所述控制设备根据优先级次高的算路基准约束，从所述至少两条满足所述优先级最高的算路基准约束的转发路径中，确定满足所述优先级次高的算路基准约束的转发路径，并且在所述满足所述优先级次高的算路基准约束的转发路径大于或等于两条时，依次选择 低级别的优先级所对应的算路基准约束并确定满足所述低级别的优先级所对应的算路基准约束的转发路径，直至确定一条满足其中一个所述低级别的优先级所对应的算路基准约束的转发路径或者直至选择最低级别的优先级对应的算路基准约束并确定满足所述最低级别的优先级所对应的算路基准约束的转发路径。
下面结合图1b举例说明1002和1003步骤，在算路之前，用户可以在控制设备上预先设置算路基准约束和优先级映射关系，该映射关系通常由运营商的管理员来配置维护。例如下表1所示，该映射关系包括5个算路基准约束Ci，则N＝5、1≤i≤5，C1＝Cost、C2＝时延、C3＝跳数、C4＝抖动和C5＝丢包率。这5个算路基准约束分别对应5个优先级Pi，例如，优先级可以设置为：P1＝0、P2＝1、P3＝2、P4＝3和P5＝4，数值越小，代表优先级越高；数值越大，代表优先级越低。P1的优先级最高，对应的C1为Cost约束就会被最优先选用确定转发路径，其次依次是时延、跳数、抖动和丢包约束。需要说明的是，表1仅仅是一个具体示例，实际应用中可以根据情况配置算路基准约束及其对应的优先级，并采用其他形式进行这样的配置，本发明不做限定。
值得说明的是，本发明实施例的算路基准约束有至少两个，包括范围约束。而且现有的一个算路基准约束通常是固定的(例如，cost)，不能根据用户的需要来改变。用户可以为网络管理员(例如，网络运营商的网管人员等)，也可以为使用网络业务的用户(例如，互联网应用提供商)等等，此处不做具体限定。
表1：算路基准约束和优先级映射关系
i 1 2 3 4 5
算路基准约束Ci Cost 时延 跳数 抖动 丢包率
优先级Pi 0 1 2 3 4
当控制设备计算从FD1到FD4的满足20M带宽的第一转发路径时，得到了转发路径Path-A、Path-B和Path-C三条结果。此时，该控制设备获取优先级最高的P1对应的算路基准约束为Cost约束进行算路，如果从三条结果中确定出一条满足Cost约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。并将计算结果提供给转发路径计算请求方FD1。
可选地，如果从该三条结果中确定出两条满足Cost约束的转发路径为Path-A和Path-B，则该控制设备继续获取优先级第二高的P2对应的算路基准约束为时延约束进行算路，如果从该两条结果中确定出一条满足时延约束的转发路径仍然为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。并将计算结果提供给转发路径计算请求方FD1。
可选地，如果从该两条结果中确定出两条满足时延约束的转发路径仍然为Path-A和Path-B，则该控制设备继续获取优先级第三高的P3对应的算路基准约束为跳数约束进行算路，依此流程循环，直到计算出一条满足要求的转发路径终止计算；如果直到使用优先级最低的丢包率约束，依然算出至少两条转发路径，则从中随意选取一条作为计算结果。
值得说明的是，本发明实施例中的算路基准约束使用时，通常设定为最值或者指定值，例如，跳数最小、时延最小、抖动最小或丢包率最小。
因此，控制设备根据必要约束条件进行转发路径计算，当满足该必要约束条件的转发路径有至少两条时，所述控制设备根据算路基准约束和优先级的映射关系选取优先级最高的算路基准约束，从中选取一条满足该优先级最高的算路基准约束的转发路径。当满足该优先级最高的算路基准约束的转发路径还有至少两条时，则所述控制设备根据该映射关系中优先级第二高的算路基准约束，从中选取至少一条满足该优先级第二高的算路基准约束的转发路径，以此类推，逐级使用优先级次高的算路基准约束算路，从而得到满足用户需求的、优选的转发路径。
在一个具体实施方式中，基于步骤1001、1002和表1，进一步可选地，所述映射关系除了包括算路基准约束Ci以及优先级Pi外还可以包括N个算路基准约束的使能开关Ei，所述Ei与所述Ci一一对应，所述Ei用于指示与所述Ei对应的Ci是否被使能。若Ei为使能状态，则与所述Ei对应的Ci为可以使用的算路基准约束。
所述所述控制设备根据所述Ei选择处于E使能状态的Ci，再根据所述Pi从所述处于E使能状态的Ci中选择优先级最高的Pi对应的Ci，从而获得优先级最高的算路基准约束。
结合图1b和表2举例，该表2是在表1的基础上，该算路基准约束和优先级映射关系还包括5个算路基准约束的使能开关Ei，1≤i≤5，E1设置为不使能(例如用N标识，也可以用数字标识等其它方式标识，此处不做具体限定)，代表与其对应的C1(为Cost)不能用来进行算路。E2设置为使能(例如用Y标识，也可以用数字标识等其它方式标识，此处不做具体限定)，代表与其对应的C2(为时延)能够用来进行算路。E3设置为不使能，代表与其对应的C3(为跳数)不能用来进行算路。E4设置为使能，代表与其对应的C4(为抖动)能够用来进行算路。E5设置为使能，代表与其对应的C5(为丢包率)能用来进行算路。需要说明的是，例如，该Ei由运营商的管理员根据业务需求来配置指定。
表2：算路基准约束和优先级映射关系
i 1 2 3 4 5
算路基准约束Ci Cost 时延 跳数 抖动 丢包率
优先级Pi 0 1 2 3 4
算路基准约束的使能开关Ei N Y N Y Y
当控制设备计算从FD1到FD4的满足20M带宽的第一转发路径时，得到了转发路径Path-A、Path-B和Path-C三条结果。此时，该控制设备根据E1、E2、E3、E4和E5的设置，获得时延约束、抖动约束和丢包率约束处于使能状态，可以用于转发路径的计算。再根据P1、P2、P3、P4和P5的设置，判断出时延约束的优先级最高，抖动约束的优先级第二高，丢包率约束的优先级最低。于是获取优先级最高的P2对应的时延约束进行算路，如果从三条结果中确定出一条满足时延约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。并将计算结果提供给转发路径计算请求方FD1。
可选地，如果从该三条结果中确定出两条满足时延约束的转发路径为Path-A和Path-B，则该控制设备继续获取优先级第二高的P4对应的抖动约束进行算路，如果从该两 条结果中确定出一条满足抖动约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。并将计算结果提供给转发路径计算请求方FD1。
可选地，如果从该两条结果中确定出两条满足抖动约束的转发路径仍然为Path-A和Path-B，则该控制设备继续获取优先级最低的P5对应的丢包率约束进行算路，如果从该两条结果中确定出一条满足丢包率约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径；如果仍然算出两条转发路径Path-A和Path-B，则从中随意选取一条作为计算结果。
因此，用户可以根据自己的需求，通过Ei的设置来灵活地控制算路时选择优选的转发路径。
在另一个具体实施方式中，基于步骤1001、1002和表1，进一步可选地，所述映射关系除了包括算路基准约束Ci以及优先级Pi外还可以包括N个第一转发路径的算路基准约束使能开关Ti，第一转发路径的算路基准约束使能开关Ti与前述算路基准约束使能开关Ei不同在于所述第一转发路径的算路基准约束使能开关Ti仅针对所述第一转发路径发生作用，即是否被使能，而算路基准约束使能开关Ei则不限于第一转发路径，其使能状态是针对全网所有的转发路径。
所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能。若所述第一转发路径的Ti为使能状态，则在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束。
所述控制设备根据所述第一转发路径的Ti选择处于T使能状态的Ci，再根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci，从而获得优先级最高的算路基准约束。
以下结合图1b和表3举例说明该控制设备获得第一转发路径的算路基准约束使能开关Ti的方法，其可以有多种方式：
方式一、该第一转发路径计算请求中携带了按照用户需求指定的该第一转发路径的Ti，该控制设备从该第一转发路径计算请求中实时地获取；或
方式二、该算路基准约束和优先级映射关系中预先按照用户的需求设置了该第一转发路径的Ti(例如，表3，该表3是在表1的基础上，还包括了该第一转发路径的Ti)，该控制设备查找该映射关系来获取。例如，该控制设备可以根据第一转发路径的标识(例如，ID1)，查找映射关系表，获得该第一转发路径对应的算路基准约束使能开关Ti。
表3：算路基准约束和优先级映射关系
i 1 2 3 4 5
算路基准约束Ci Cost 时延 跳数 抖动 丢包率
优先级Pi 0 1 2 3 4
第一转发路径的算路基准约束使 N Y Y N Y
能开关Ti          
该第一转发路径的Ti与该Ci一一对应。当该控制设备计算该第一转发路径时，该第一转发路径的Ti用于控制哪些算路基准约束可以被使用，哪些算路基准约束不能使用。例如，该第一转发路径的Ti包括5个开关，1≤i≤5，T1设置为不使能(例如用N标识，也可以用数字标识等其它方式标识，此处不做具体限定)，代表与其对应的C1(为Cost)不能用来进行算路。T2设置为使能(例如用Y标识，也可以用数字标识等其它方式标识，此处不做具体限定)，代表与其对应的C2(为时延)能够用来进行算路。T3设置为使能，代表与其对应的C3(为跳数)能用来进行算路。T4设置为不使能，代表与其对应的C4(为抖动)不能用来进行算路。T5设置为使能，代表与其对应的C5(为丢包率)能用来进行算路。
当控制设备计算从FD1到FD4的满足20M带宽的第一转发路径时，得到了转发路径Path-A、Path-B和Path-C三条结果。此时，该控制设备根据T1、T2、T3、T4和T5的设置，获得时延约束、跳数约束和丢包率约束处于使能状态，可以用于转发路径的计算。再根据P1、P2、P3、P4和P5的设置，判断出时延约束的优先级最高，跳数约束的优先级第二高，丢包率约束的优先级最低。于是获取优先级最高的P2对应的时延约束进行算路，如果从三条结果中确定出一条满足时延约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。并将计算结果提供给转发路径计算请求方FD1。
可选地，如果从该三条结果中确定出两条满足时延约束的转发路径为Path-A和Path-B，则该控制设备继续获取优先级第二高的P3对应的跳数约束进行算路，如果从该两条结果中确定出一条满足跳数约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。并将计算结果提供给转发路径计算请求方FD1。
可选地，如果从该两条结果中确定出两条满足跳数约束的转发路径仍然为Path-A和Path-B，则该控制设备继续获取优先级最低的P5对应的丢包率约束进行算路，如果从该两条结果中确定出一条满足丢包率约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。如果仍然算出两条转发路径Path-A和Path-B，则从中随意选取一条作为计算结果。
因此，用户可以根据自己的需求，通过Ti的设置来灵活地控制算路时选择优选的转发路径。
在另一个具体实施方式中，基于步骤1001、1002，进一步可选地，基于表4，该表4是在表2的基础上，所述映射关系除了包括算路基准约束Ci以及优先级Pi外，还可以包括N个算路基准约束的使能开关Ei和N个第一转发路径的算路基准约束使能开关Ti。当该控制设备计算整个网络中任何一条转发路径时，该Ei用于控制哪些算路基准约束可以被使用，哪些算路基准约束不能使用。也就是该Ei可以对全网所有的转发路径进行计算时选用哪些算路基准约束进行控制。而该Ti仅仅对某一条转发路径进行计算时选用哪些算路基准约束进行控制。该Ei的控制力度比该Ti的控制力度更强，即该Ei的使能优先级比该Ti的使能优先级高。
所述控制设备先根据所述Ei选择处于E使能状态的Ci；再根据所述第一转发路径的Ti从所述处于E使能状态的Ci中，选择处于T使能状态的Ci；然后根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci，从而获得优先级最高的算路基准约束。
表4：算路基准约束和优先级映射关系
Figure PCTCN2017084375-appb-000001
基于表4，当控制设备计算从FD1到FD4的满足20M带宽的第一转发路径时，得到了转发路径Path-A、Path-B和Path-C三条结果。此时，该控制设备根据E1、E2、E3、E4和E5的设置，获得时延约束、抖动约束和丢包率约束处于使能状态，可以用于转发路径的计算。其次，该控制设备再根据T1、T2、T3、T4和T5的设置，获得时延约束、跳数约束和丢包率约束处于使能状态，但是因为该Ei的使能优先级比该Ti的使能优先级高，所以跳数约束并不能使用，最终可以用于转发路径的计算的是时延约束和丢包率约束。再根据P1、P2、P3、P4和P5的设置，判断出时延约束的优先级最高，丢包率约束的优先级第二高(此时，也是最低)。于是获取优先级最高的P2对应的时延约束进行算路，如果从三条结果中确定出一条满足时延约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。并将计算结果提供给转发路径计算请求方FD1。
可选地，如果从该三条结果中确定出两条满足时延约束的转发路径为Path-A和Path-B，则该控制设备继续获取优先级第二高的P5对应的丢包率约束进行算路，如果从该两条结果中确定出一条满足丢包率约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。并将计算结果提供给转发路径计算请求方FD1。
可选地，如果从该两条结果中确定出两条满足丢包率约束的转发路径仍然为Path-A和Path-B，则该控制设备从中随意选取一条作为计算结果。
因此，用户可以根据自己的需求，通过Ei和Ti的设置来灵活地控制算路时选择优选的转发路径。
在另一具体实施方式中，基于步骤1001、1002和表1，进一步可选地，所述映射关系除了包括算路基准约束Ci以及优先级Pi外，还包括N个算路基准约束的默认使能开关Di。所述Di与所述Ci一一对应，所述Di用于指示与所述Di对应的Ci是否为默认使能状态。若Di为默认使能状态，则与所述Di对应的Ci为默认使用的算路基准约束。
所述控制设备根据所述Di选择处于D使能状态的Ci，再根据Pi从所述处于D使能状态的Ci中选择优先级最高的Pi对应的Ci，从而获得优先级最高的算路基准约束。
以下结合图1b和表5举例说明，该表5是在表1的基础上，还包括5个算路基准约束的默认使能开关Di，1≤i≤5，也可以叫作缺省使能开关。当既没有设置Ei，也没有设置Ti时，该控制设备计算转发路径时，使用该算路基准约束的默认使能开关来控制哪些算路基准约束可以使用，哪些算路基准约束不可以使用。D1为使能(例如用Y标识，也可以用数字标识等其它方式标识，此处不做具体限定)，代表与其对应的C1(为Cost)能用来进行算路。D2设置为不使能(例如用N标识，也可以用数字标识等其它方式标识，此处不做具体限定)，代表与其对应的C2(为时延)不能用来进行算路。D3设置为不使能，代表与其对应的C3(为跳数)不能用来进行算路。D4设置为不使能，代表与其对应的C4(为抖动)不能用来进行算路。D5设置为不使能，代表与其对应的C5(为丢包率)不能用来进行算路。
表5：算路基准约束和优先级映射关系
i 1 2 3 4 5
算路基准约束Ci Cost 时延 跳数 抖动 丢包率
优先级Pi 0 1 2 3 4
算路基准约束的默认使能开关Di Y N N N N
当控制设备计算从FD1到FD4的满足20M带宽的第一转发路径时，得到了转发路径Path-A、Path-B和Path-C三条结果。此时，该控制设备根据D1、D2、D3、D4和D5的设置，获得Cost约束处于使能状态，可以用于转发路径的计算。再根据P1、P2、P3、P4和P5的设置，判断出Cost约束的优先级最高。于是用Cost约束进行算路，如果从三条结果中确定出一条满足时延约束的转发路径为Path-A，则计算终止，Path-A作为该第一转发路径计算请求的计算结果，也就是Path-A为第一转发路径。并将计算结果提供给转发路径计算请求方FD1。如果仍然算出至少两条转发路径，例如，Path-A和Path-B，则从中随意选取一条作为计算结果。
该算路基准约束的默认使能开关Di的设置，可以用来兼容现有技术或者现有的算路方式，当用户希望使用传统的单算路基准约束进行选路时，可以设置该Di来达到目的。
以上阐述了该控制设备根据第一转发路径计算请求计算转发路径时，当计算出至少两条满足该必要约束的转发路径时，通过使用Ci和Pi，以及与Ei、Ti、Di三者中的任意组合，来按照用户的业务需求灵活的进行选路控制。下面的实施例描述当计算出没有满足该必要约束的转发路径时，如何抢占其它转发路径的资源(例如，带宽资源)的处理方法。
根据已有的技术，当出现上述没有满足必要约束的转发路径而需要抢占其他转发路径的资源情况时，控制设备会直接使用隧道的优先级作为附加约束，来决定是否可以抢占其它转发路径的资源。隧道优先级高的转发路径可以抢占隧道优先级低的转发路径。但是，采用已有技术中的该隧道优先级解决资源冲突的方法，直接应用到基于上述算路基准约束和优先级映射关系进行算路的场景中时，会产生冲突、造成资源管理不清晰的问题。
以图3a为例说明，FD1与FD2之间的链路带宽为20M,，FD1与FD5之间的链路带宽为10M,，FD1与FD3之间的链路带宽为5M,，FD2与FD5之间的链路带宽为20M,，FD2 与FD4之间的链路带宽为10M,，FD5与FD4之间的链路带宽为20M,，F5与FD3之间的链路带宽为5M,，FD3与FD4之间的链路带宽为10M。控制设备要计算一条带宽为20M的转发路径X，该待计算的转发路径X(Path-X)的优先级最高的算路基准约束为跳数，隧道优先级为高。而网络中已有的一条转发路径Y(Path-Y)的优先级最高的算路基准约束为cost，隧道优先级为低。假如在这个算路场景下，设置的算路基准约束cost对应的优先级高于跳数对应的优先级。
此时，该控制设备计算该Path-X时，如果发现没有满足20M带宽的Path-X，就要进行资源抢占。如果按照已有隧道优先级抢占带宽资源的方法，则该控制设备判断待算的Path-X的隧道优先级高于已有的Path-Y的隧道优先级，就抢占该已有的Path-Y的带宽资源(即释放该已有的Path-Y上的带宽资源)，从而计算出一条满足20M带宽的转发路径。虽然该待算的Path-X的算路基准约束跳数对应的优先级小于该已有的Path-Y的算路基准约束跳数对应的优先级，但是该待算的Path-X的隧道优先级大于该已有的Path-Y的隧道优先级，该待算的Path-X可以抢占该已有的Path-Y的带宽资源。这样就会造成控制设备算路时抢占了算路基准约束优先级比待算转发路径的算路基准约束优先级高的资源，使网络资源的管理不清晰，不便于运营商管理员按需管理。需要说明的是本发明实施例中带宽的单位为Mbps(兆位/秒)或者MBps(兆字节/秒)，如，10Mbps或者10MBps。
为此，本发明实施例提供了一种资源抢占的方法，通过将每条转发路径的隧道优先级的优先等级设置为比每条转发路径的算路基准约束的优先级低，例如，资源抢占的优先级从高到低依次为：cost、时延、跳数、抖动、丢包率、隧道优先级从而，在控制设备计算转发路径过程中需要进行资源抢占时，可以先按照待算的转发路径的算路基准约束对应的最高优先级和已有的转发路径的算路基准约束对应的最高优先级来分别确定抢占优先级。当待算的转发路径的算路基准约束对应的最高优先级和已有的转发路径的算路基准约束对应的最高优先级相同时(例如，都是丢包率)，则再按照隧道优先级来确定待算的转发路径和已有的转发路径的抢占优先级。该控制设备可以抢占比待算的转发路径的抢占优先级低的已有的转发路径的资源。因此，基于上述算路基准约束和优先级映射关系进行算路的场景，可以平滑的兼容已有直接采用隧道优先级解决资源冲突的方法，从而避免冲突，并使运营商管理员可以按照算路基准约束对应的优先级顺序有序的规划资源的抢占、便于清晰的管理网络资源。
下面具体描述本发明实施例提供的资源抢占方法。
基于上述步骤1001和表3所述的第一转发路径的Ti，当所述控制设备计算出没有满足所述必要约束的转发路径时，进一步，可选地，本发明实施例提供的方法还包括：
当所述控制设备确定没有满足所述必要约束的转发路径时，所述控制设备根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从针对所述第一转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级。
所述控制设备获得N个所述第二转发路径的算路基准约束使能开关Ti，所述第二转发路径的Ti与所述N个Pi一一对应，并根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从针对所述第二转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级；并确定所述第二转发路径的抢占优先级低于所述第一转发 路径的抢占优先级。
所述控制设备抢占第二转发路径的资源，并确定出满足所述必要约束的至少一条转发路径。
以下结合图3b和表6举例说明，该表6是在表3的基础上，还包括N个第二转发路径的算路基准约束使能开关Ti。当该控制设备计算该第一转发路径，计算出没有满足必要约束的转发路径时，该第一转发路径的Ti用于控制哪些算路基准约束对应的优先级可以被使用，哪些算路基准约束对应的优先级不能使用，哪个算路基准约束对应的优先级可以作为该待计算的第一转发路径的抢占优先级，从而可以抢占其它抢占优先级比自己低的转发路径的资源。也就是，该第一转发路径的Ti用于控制哪些优先级可以被使用，哪些优先级不能使用，哪个优先级可以作为抢占优先级。
该控制设备根据表6中该第一转发路径的Ti判断该第一转发路径的抢占优先级。例如，该第一转发路径的Ti包括5个开关，1≤i≤5，T1设置为不使能，代表与其对应的P1不能用来作为该第一转发路径的抢占优先级。T2设置为使能，代表与其对应的P2能够用来作为该第一转发路径的抢占优先级。T3设置为使能，代表与其对应的P3能用来作为该第一转发路径的抢占优先级。T4设置为不使能，代表与其对应的P4不能用来作为该第一转发路径的抢占优先级。T5设置为使能，代表与其对应的P5能用来作为该第一转发路径的抢占优先级。再从能够作为该第一转发路径的抢占优先级P2、P3和P5中，选取优先级最高的P2作为该第一转发路径的抢占优先级。
表6：算路基准约束和优先级映射关系
Figure PCTCN2017084375-appb-000002
该表6中该第二转发路径的Ti包括5个开关，1≤i≤5，T1设置为不使能，代表与其对应的P1不能用来作为该第二转发路径的抢占优先级。T2设置为不使能，代表与其对应的P2不能用来作为该第二转发路径的抢占优先级。T3设置为使能，代表与其对应的P3能用来作为该第二转发路径的抢占优先级。T4设置为不使能，代表与其对应的P4不能用来作为该第二转发路径的抢占优先级。T5设置为使能，代表与其对应的P5能用来作为该第二转发路径的抢占优先级。再从能够作为该第二转发路径的抢占优先级P3和P5中，选取优先级最高的P3作为该第二转发路径的抢占优先级。
由于P2的优先级高于P3，所以该第一转发路径的抢占优先级高于该第二转发路径的抢占优先级，即该第一转发路径可以抢占该第二转发路径的带宽资源。当该控制设备计算从FD1到FD4的满足20M带宽的第一转发路径，得到网络中没有能够满足20M带宽资源的一条转发路径时，该控制设备就可以抢占(即释放)该第二转发路径的带宽资源(例如， 带宽20M)，从而来优先获得满足20M带宽的该第一转发路径。
值得说明的是，如图3c所示，根据表7的设置，如果网络中已有第二转发路径的抢占优先级与待算第一转发路径的抢占优先级相等，都是抖动算路基准约束对应的优先级3，则需要根据两条转发路径的隧道优先级来确定抢占关系。此时，已有第二转发路径的隧道优先级低于待算第一转发路径的隧道优先级，所以控制设备算路时，可以抢占该第二转发路径的资源，从而能够计算出该第一转发路径。
表7：算路基准约束和优先级映射关系
i 1 2 3 4 5
算路基准约束Ci Cost 时延 跳数 抖动 丢包率
优先级Pi 0 1 2 3 4
第二转发路径的算路基准约束使能开关Ti N N N Y N
第一转发路径的算路基准约束使能开关Ti N N N Y N
因此，通过优先按照算路基准约束对应的优先级顺序有序的规划资源的抢占优先级，
便于运营商管理员清晰的管理网络资源，避免与现有技术的冲突。
在另一个具体实施方式中，基于步骤1001和表6阐述的方法实施例，进一步可选地，所述控制设备根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级。
所述控制设备根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级。
以下结合图1b和表8举例说明，该表8是在表6的基础上，进一步包括算路基准约束的使能开关Ei，该Ei的功能上文已经阐述，值得说明的是，在资源抢占的场景中，当控制设备计算整个网络中任何一条转发路径时，Ei用于控制哪些算路基准约束对应的优先级可以被使用，哪些算路基准约束对应的优先级不能使用。也就是Ei可以对全网所有的转发路径进行计算时选用哪些算路基准约束对应的优先级进行控制。而Ti仅仅对某一条转发路径进行计算时选用哪些算路基准约束对应的优先级进行控制。Ei的控制力度比Ti的控制力度更强，即Ei的使能优先级比Ti的使能优先级高。
该控制设备根据表8中E1、E2、E3、E4和E5的设置，获得E2、E4和E5分别对应的P2、P4和P5能够用作该第一转发路径的抢占优先级。其次该控制设备再根据该第一转发路径的Ti判断P2、P3和P5可以作为该第一转发路径的抢占优先级，结合Ei和Ti得出P2和P5可以作为该第一转发路径的抢占优先级。最后，再从能够作为该第一转发路径的抢占优先级P2和P5中，选取优先级最高的P2作为该第一转发路径的抢占优先级。
表8：算路基准约束和优先级映射关系
Figure PCTCN2017084375-appb-000003
Figure PCTCN2017084375-appb-000004
该控制设备根据表8中E1、E2、E3、E4和E5的设置，获得E2、E4和E5分别对应的P2、P4和P5能够用作该第二转发路径的抢占优先级。其次该控制设备再根据该第二转发路径的Ti判断P3和P5可以作为该第二转发路径的抢占优先级，结合Ei和该第二转发路径的Ti得出P5可以作为该第二转发路径的抢占优先级。最后，确定P5作为该第二转发路径的抢占优先级。
由于P2的优先级高于P5，所以该第一转发路径的抢占优先级高于该第二转发路径的抢占优先级，即该第一转发路径可以抢占该第二转发路径的带宽资源。当该控制设备计算从FD1到FD4的满足20M带宽的第一转发路径，得到网络中没有能够满足20M带宽资源的一条转发路径时，该控制设备就可以抢占(即释放)该第二转发路径的带宽资源(例如，带宽20M)，从而来优先获得满足20M带宽的该第一转发路径。
因此，通过利用每条转发路径的算路基准约束对应的优先级，以及算路基准约束的使能开关Ei的控制，不但可以使得资源抢占有序分级、资源管理清晰，便于用户按需查看使用，而且还可以灵活的按照用户的需求进行资源抢占。
值得说明的是，本实施例方法可以和使用隧道优先级进行资源抢占的方法进行兼容。每条转发路径的算路基准约束对应的优先级大于每条转发路径的隧道优先级。当该第一转发路径与该第二转发路径的抢占优先级相等时，可以继续使用该第一转发路径的隧道优先级和该第二转发路径的隧道优先级进行资源抢占。
图4为本发明实施例的控制设备400的示意性框图。如图4所示，该控制设备包括：获取单元401和处理单元402。
其中，获取单元401用于获取第一转发路径计算请求，所述第一转发路径计算请求指示计算从源节点到目的节点并满足必要约束的第一转发路径。
处理单元402用于计算出至少两条满足所述必要约束的转发路径时，根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束，并根据所述优先级最高的算路基准约束从所述至少两条满足所述必要约束的转发路径中确定满足所述优先级最高的算路基准约束的至少一条转发路径。
其中，所述算路基准约束和优先级的映射关系包括N个所述算路基准约束Ci和N个所述优先级Pi，所述Pi与所述Ci一一对应，所述i为大于等于1且小于等于N的正整数，所述N为大于等于2的正整数。
可选地，所述处理单元402还用于当计算出至少两条满足所述优先级最高的算路基准约束的转发路径时，根据优先级次高的算路基准约束，从所述至少两条满足所述优先级最 高的算路基准约束的转发路径中，确定满足所述优先级次高的算路基准约束的转发路径，并且在所述满足所述优先级次高的算路基准约束的转发路径大于或等于两条时，依次选择低级别的优先级所对应的算路基准约束并确定满足所述低级别的优先级所对应的算路基准约束的转发路径，直至确定一条满足其中一个所述低级别的优先级所对应的算路基准约束的转发路径或者直至选择最低级别的优先级对应的算路基准约束并确定满足所述最低级别的优先级所对应的算路基准约束的转发路径。
可选地，所述映射关系还包括N个算路基准约束默认使能开关Di，所述Di与所述Ci一一对应，所述Di用于指示与所述Di对应的Ci是否为默认使能状态。若Di为默认使能状态，则与所述Di对应的Ci为默认使用的算路基准约束。
所述处理单元402根据所述Di选择处于D使能状态的Ci，再根据Pi从所述处于D使能状态的Ci中选择优先级最高的Pi对应的Ci，获得优先级最高的算路基准约束。
可选地，所述映射关系还包括N个算路基准约束使能开关Ei，所述Ei与所述Ci一一对应，所述Ei用于指示与所述Ei对应的Ci是否被使能。若Ei为使能状态，则与所述Ei对应的Ci为可以使用的算路基准约束。
所述处理单元402根据所述Ei选择处于E使能状态的Ci，再根据所述Pi从所述处于E使能状态的Ci中选择优先级最高的Pi对应的Ci，从而获得优先级最高的算路基准约束。
可选地，所述映射关系还包括N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在所述处理单元402确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径的Ti为使能状态，则所述处理单元402在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束。
所述处理单元402先根据所述Ei选择处于E使能状态的Ci；再根据所述第一转发路径的Ti从所述处于E使能状态的Ci中，选择处于T使能状态的Ci；然后根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci，获得优先级最高的算路基准约束。
可选地，所述映射关系还包括N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在所述处理单元402确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径的Ti为使能状态，则所述处理单元402在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束。
所述处理单元402根据所述第一转发路径的Ti选择处于T使能状态的Ci，再根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci，从而获得优先级最高的算路基准约束。
可选地，当所述处理单元402确定没有满足所述必要约束的转发路径时，根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从针对所述第一转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级。
所述处理单元402获得N个所述第二转发路径的算路基准约束使能开关Ti，所述第二转发路径的Ti与所述N个Pi一一对应。所述处理单元402根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从针对所述第二转发路径的所述处于T使能状态的Pi中选择优 先级最高的Pi作为所述第二转发路径的抢占优先级，并确定所述第二转发路径的抢占优先级低于所述第一转发路径的抢占优先级。
所述处理单元402抢占第二转发路径的资源，并确定出满足所述必要约束的至少一条转发路径。
可选地，所述处理单元402根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级。
相应地，所述处理单元402根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级。
可选地，所述控制设备400还包括存储单元，所述存储单元用于保存所述映射关系。
根据本发明实施例的控制设备400可对应于根据本发明实施例的确定转发路径的方法中的控制设备，并且，该控制设备400中的各模块和上述其他操作和/或功能分别为了实现图1a至图3c所对应的实施例中的控制设备所实施的各种步骤和方法，为了简洁，在此不再赘述。
因此，本发明实施例的控制设备，通过根据算路基准约束和优先级的映射关系依次选取优先级高的算路基准约束进行转发路径的确定，从而得到满足用户需求的、优选的转发路径。与现有技术中只有一个算路基准约束进行选路的方法相比，一定程度上避免了随意选取转发路径。进一步，通过Ei、Ti和Di开关的按需设置，使用户可以根据自己的需求来灵活地控制算路时选择优选的转发路径。更进一步，通过优先按照算路基准约束对应的优先级顺序有序的规划资源的抢占优先级，便于运营商管理员清晰的管理网络资源，避免与现有技术的冲突。
图5是本申请控制设备另一实施方式的结构示意图。本实施方式的控制设备500包括：接收器510、处理器520、发送器530、随机存取存储器540、只读存储器550以及总线560。其中，处理器520通过总线560分别耦接接收器510、发送器530、随机存取存储器540以及只读存储器550。其中，当需要运行控制设备500时，通过固化在只读存储器550中的基本输入输出系统或者嵌入式系统中的bootloader引导系统进行启动，引导控制设备500进入正常运行状态。在控制设备500进入正常运行状态后，在随机存取存储器540中运行应用程序和操作系统，使得：
所述处理器520用于获取第一转发路径计算请求，所述第一转发路径计算请求指示计算从源节点到目的节点并满足必要约束的第一转发路径。
所述处理器520还用于计算出至少两条满足所述必要约束的转发路径时，根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束，并根据所述优先级最高的算路基准约束从所述至少两条满足所述必要约束的转发路径中确定满足所述优先级最高的算路基准约束的至少一条转发路径。
其中，所述算路基准约束和优先级的映射关系包括N个所述算路基准约束Ci和N个所述 优先级Pi，所述Pi与所述Ci一一对应，所述i为大于等于1且小于等于N的正整数，所述N为大于等于2的正整数。
可选地，所述处理器520还用于当计算出至少两条满足所述优先级最高的算路基准约束的转发路径时，根据优先级次高的算路基准约束，从所述至少两条满足所述优先级最高的算路基准约束的转发路径中，确定满足所述优先级次高的算路基准约束的转发路径，并且在所述满足所述优先级次高的算路基准约束的转发路径大于或等于两条时，依次选择低级别的优先级所对应的算路基准约束并确定满足所述低级别的优先级所对应的算路基准约束的转发路径，直至确定一条满足其中一个所述低级别的优先级所对应的算路基准约束的转发路径或者直至选择最低级别的优先级对应的算路基准约束并确定满足所述最低级别的优先级所对应的算路基准约束的转发路径。
因此，本发明实施例的控制设备，通过根据算路基准约束和优先级的映射关系依次选取优先级高的算路基准约束进行转发路径的确定，从而得到满足用户需求的、优选的转发路径。与现有技术中只有一个算路基准约束进行选路的方法相比，一定程度上避免了随意选取转发路径。
可选地，所述映射关系还包括N个算路基准约束默认使能开关Di，所述Di与所述Ci一一对应，所述Di用于指示与所述Di对应的Ci是否为默认使能状态。若Di为默认使能状态，则与所述Di对应的Ci为默认使用的算路基准约束。所述处理器520根据所述Di选择处于D使能状态的Ci，再根据Pi从所述处于D使能状态的Ci中选择优先级最高的Pi对应的Ci，获得优先级最高的算路基准约束。
可选地，所述映射关系还包括N个算路基准约束使能开关Ei，所述Ei与所述Ci一一对应，所述Ei用于指示与所述Ei对应的Ci是否被使能。若Ei为使能状态，则与所述Ei对应的Ci为可以使用的算路基准约束。所述处理器520根据所述Ei选择处于E使能状态的Ci，再根据所述Pi从所述处于E使能状态的Ci中选择优先级最高的Pi对应的Ci，从而获得优先级最高的算路基准约束。
可选地，所述映射关系还包括N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在所述处理器520确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径的Ti为使能状态，则所述处理器520在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束。所述处理器520先根据所述Ei选择处于E使能状态的Ci；再根据所述第一转发路径的Ti从所述处于E使能状态的Ci中，选择处于T使能状态的Ci；然后根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci，获得优先级最高的算路基准约束。
可选地，所述映射关系还包括N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在所述处理器520确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径的Ti为使能状态，则所述处理器520在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束。所述处理器520根据所述第一转发路径的Ti选择处于T使能状态的Ci，再根据所述Pi从所述处于T使能状态 的Ci中选择优先级最高的Pi对应的Ci，从而获得优先级最高的算路基准约束。
因此，本发明实施例的控制设备，通过Ei、Ti和Di开关的按需设置，使用户可以根据自己的需求来灵活地控制算路时选择优选的转发路径。
可选地，当所述处理器520确定没有满足所述必要约束的转发路径时，根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从针对所述第一转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级。所述处理器520获得N个所述第二转发路径的算路基准约束使能开关Ti，所述第二转发路径的Ti与所述N个Pi一一对应。所述处理器520根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从针对所述第二转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级，并确定所述第二转发路径的抢占优先级低于所述第一转发路径的抢占优先级。所述处理器520抢占第二转发路径的资源，并确定出满足所述必要约束的至少一条转发路径。
可选地，所述处理器520根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级。相应地，所述处理器520根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级。
可选地，所述随机存取存储器540和/或所述只读存储器550还用于保存所述映射关系。
因此，本发明实施例的控制设备通过优先按照算路基准约束对应的优先级顺序有序的规划资源的抢占，便于运营商管理员清晰的管理网络资源，避免与现有技术的冲突。
根据本发明实施例的控制设备500可对应于根据本发明实施例的确定转发路径的方法中的控制设备，并且，该控制设备500中的各模块和上述其他操作和/或功能分别为了实现图1a至图3c所对应的实施例中的控制设备所实施的各种步骤和方法。所述处理器520用于执行图4所述控制设备的获取单元401和处理单元402的所有操作。为了简洁，在此不再赘述。
应理解，本领域技术人员在阅读本申请文件的基础上，可以针对本申请实施例中所描述的可选的特征、步骤或方法进行不需要付出创造性的组合，都属于本申请公开的实施例，只是由于描述或行文的简单没有重复赘述不同组合。
应理解，本文中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
应理解，在本发明的各种实施例中，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本发明实施例的实施过程构成任何限定。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以 硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本发明的范围。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本发明各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本发明的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本发明各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本发明的具体实施方式，但本发明的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本发明揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本发明的保护范围之内。因此，本发明的保护范围应以所述权利要求的保护范围为准。

Claims (16)

  1. 一种确定转发路径的方法，其特征在于，应用于通信网络中，包括：
    控制设备获得第一转发路径计算请求，所述第一转发路径计算请求指示计算从源节点到目的节点并满足必要约束的第一转发路径；
    当所述控制设备计算出至少两条满足所述必要约束的转发路径时，所述控制设备根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束，根据所述优先级最高的算路基准约束从所述至少两条满足所述必要约束的转发路径中确定满足所述优先级最高的算路基准约束的至少一条转发路径；
    其中，所述算路基准约束和优先级的映射关系包括N个所述算路基准约束Ci和N个所述优先级Pi，所述Pi与所述Ci一一对应，所述i为大于等于1且小于等于N的正整数，所述N为大于等于2的正整数。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    当所述控制设备计算出至少两条满足所述优先级最高的算路基准约束的转发路径时，所述控制设备根据优先级次高的算路基准约束，从所述至少两条满足所述优先级最高的算路基准约束的转发路径中，确定满足所述优先级次高的算路基准约束的转发路径，并且在所述满足所述优先级次高的算路基准约束的转发路径大于或等于两条时，依次选择低级别的优先级所对应的算路基准约束并确定满足所述低级别的优先级所对应的算路基准约束的转发路径，直至确定一条满足其中一个所述低级别的优先级所对应的算路基准约束的转发路径或者直至选择最低级别的优先级对应的算路基准约束并确定满足所述最低级别的优先级所对应的算路基准约束的转发路径。
  3. 根据权利要求1或2所述的方法，其特征在于，所述映射关系还包括：
    N个算路基准约束使能开关Ei，所述Ei与所述Ci一一对应，所述Ei用于指示与所述Ei对应的Ci是否被使能；若Ei为使能状态，则与所述Ei对应的Ci为可以使用的算路基准约束；
    相应地，所述控制设备根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束包括：
    所述控制设备根据所述Ei选择处于E使能状态的Ci，再根据所述Pi从所述处于E使能状态的Ci中选择优先级最高的Pi对应的Ci。
  4. 根据权利要求1至2任一所述的方法，其特征在于，所述映射关系还包括：
    N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径的Ti为使能状态，则在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束；
    相应地，所述控制设备根据算路基准约束和优先级映射关系，获得优先级最高的算路基准约束包括：
    所述控制设备根据所述第一转发路径的Ti选择处于T使能状态的Ci，再根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci。
  5. 根据权利要求3所述的方法，其特征在于，所述映射关系还包括：
    N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径的Ti为使能状态，则在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束；
    相应地，所述控制设备根据算路基准约束和优先级映射关系，获得优先级最高的算路基准约束包括：
    所述控制设备先根据所述Ei选择处于E使能状态的Ci；再根据所述第一转发路径的Ti从所述处于E使能状态的Ci中，选择处于T使能状态的Ci；然后根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci。
  6. 根据权利要求1或者2所述的方法，其特征在于，所述映射关系还包括：
    N个算路基准约束默认使能开关Di，所述Di与所述Ci一一对应，所述Di用于指示与所述Di对应的Ci是否为默认使能状态；若Di为默认使能状态，则与所述Di对应的Ci为默认使用的算路基准约束；
    相应地，所述控制设备根据算路基准约束和优先级映射关系，获得优先级最高的算路基准约束包括：
    所述控制设备根据所述Di选择处于D使能状态的Ci，再根据Pi从所述处于D使能状态的Ci中选择优先级最高的Pi对应的Ci。
  7. 根据权利要求4所述的方法，其特征在于，所述方法还包括：
    当所述控制设备确定没有满足所述必要约束的转发路径时，所述控制设备根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从针对所述第一转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级；
    所述控制设备获得N个所述第二转发路径的算路基准约束使能开关Ti，所述第二转发路径的Ti与所述N个Pi一一对应，并根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从针对所述第二转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级；并确定所述第二转发路径的抢占优先级低于所述第一转发路径的抢占优先级；
    所述控制设备抢占第二转发路径的资源，并确定出满足所述必要约束的至少一条转发路径。
  8. 根据权利要求7所述的方法，其特征在于，所述控制设备根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级包括：
    所述映射关系还包括N个算路基准约束使能开关Ei，所述Ei与所述Ci一一对应，所述Ei用于指示与所述Ei对应的Ci是否被使能；若Ei为使能状态，则与所述Ei对应的Ci为可以使用的算路基准约束；
    所述控制设备根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级；
    相应地，所述控制设备根据第二转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级包括：
    所述控制设备根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级。
  9. 一种控制设备，其特征在于，包括：
    获取单元，用于获取第一转发路径计算请求，所述第一转发路径计算请求指示计算从源节点到目的节点并满足必要约束的第一转发路径；
    处理单元，用于计算出至少两条满足所述约束的转发路径时，根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束，并根据所述优先级最高的算路基准约束从所述至少两条满足所述必要约束的转发路径中确定满足所述优先级最高的算路基准约束的至少一条转发路径；
    其中，所述算路基准约束和优先级的映射关系包括N个所述算路基准约束Ci和N个所述优先级Pi，所述Pi与所述Ci一一对应，所述i为大于等于1且小于等于N的正整数，所述N为大于等于2的正整数。
  10. 根据权利要求9所述的控制设备，其特征在于，还包括：
    所述处理单元，用于当计算出至少两条满足所述优先级最高的算路基准约束的转发路径时，根据优先级次高的算路基准约束，从所述至少两条满足所述优先级最高的算路基准约束的转发路径中，确定满足所述优先级次高的算路基准约束的转发路径，并且在所述满足所述优先级次高的算路基准约束的转发路径大于或等于两条时，依次选择低级别的优先级所对应的算路基准约束并确定满足所述低级别的优先级所对应的算路基准约束的转发路径，直至确定一条满足其中一个所述低级别的优先级所对应的算路基准约束的转发路径或者直至选择最低级别的优先级对应的算路基准约束并确定满足所述最低级别的优先级所对应的算路基准约束的转发路径。
  11. 根据权利要求9或10所述的控制设备，其特征在于，所述映射关系还包括：
    N个算路基准约束使能开关Ei，所述Ei与所述Ci一一对应，所述Ei用于指示与所述Ei对应的Ci是否被使能；若Ei为使能状态，则与所述Ei对应的Ci为可以使用的算路基准约束；
    相应地，所述处理单元根据算路基准约束和优先级的映射关系，获得优先级最高的算路基准约束包括：
    所述处理单元根据所述Ei选择处于E使能状态的Ci，再根据所述Pi从所述处于E使能状态的Ci中选择优先级最高的Pi对应的Ci。
  12. 根据权利要求9至10任一所述的控制设备，其特征在于，所述映射关系还包括：
    N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示在所述处理单元确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径的Ti为使能状态，则所述处理单元在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束；
    相应地，所述处理单元根据算路基准约束和优先级映射关系，获得优先级最高的算路基准约束包括：
    所述处理单元根据所述第一转发路径的Ti选择处于T使能状态的Ci，再根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci。
  13. 根据权利要求11所述的控制设备，其特征在于，所述映射关系还包括：
    N个所述第一转发路径的算路基准约束使能开关Ti，所述第一转发路径的Ti与所述N个算路基准约束Ci一一对应，所述第一转发路径的Ti用于指示所述处理单元在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci是否被使能；若所述第一转发路径的Ti为使能状态，则所述处理单元在确定所述第一转发路径时，与所述第一转发路径的Ti对应的Ci为可以使用的算路基准约束；
    相应地，所述处理单元根据算路基准约束和优先级映射关系，获得优先级最高的算路基准约束包括：
    所述处理单元先根据所述Ei选择处于E使能状态的Ci；再根据所述第一转发路径的Ti从所述处于E使能状态的Ci中，选择处于T使能状态的Ci；然后根据所述Pi从所述处于T使能状态的Ci中选择优先级最高的Pi对应的Ci。
  14. 根据权利要求9或者10所述的控制设备，其特征在于，所述映射关系还包括：
    N个算路基准约束默认使能开关Di，所述Di与所述Ci一一对应，所述Di用于指示与所述Di对应的Ci是否为默认使能状态；若Di为默认使能状态，则与所述Di对应的Ci为默认使用的算路基准约束；
    相应地，所述处理单元根据算路基准约束和优先级映射关系，获得优先级最高的算路基准约束包括：
    所述处理单元根据所述Di选择处于D使能状态的Ci，再根据Pi从所述处于D使能状态的Ci中选择优先级最高的Pi对应的Ci。
  15. 根据权利要求12所述的控制设备，其特征在于，所述方法还包括：
    当所述处理单元确定没有满足所述必要约束的转发路径时，根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从针对所述第一转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级；
    所述处理单元获得N个所述第二转发路径的算路基准约束使能开关Ti，所述第二转发路径的Ti与所述N个Pi一一对应，并根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从针对所述第二转发路径的所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级；并确定所述第二转发路径的抢占优先级低于所述第一转发路径的抢占优先级；
    所述处理单元抢占第二转发路径的资源，并确定出满足所述必要约束的至少一条转发路径。
  16. 根据权利要求15所述的控制设备，其特征在于，所述处理单元根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级包括：
    所述映射关系还包括N个算路基准约束使能开关Ei，所述Ei与所述Ci一一对应，所述Ei用于指示与所述Ei对应的Ci是否被使能；若Ei为使能状态，则与所述Ei对应的Ci为可以使用的算路基准约束；
    所述处理单元根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第一转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第一转发路径的抢占优先级；
    相应地，所述处理单元根据第二转发路径的Ti选择处于T使能状态的Pi，再从所述 处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级包括：
    所述处理单元根据所述Ei选择处于E使能状态的Pi，再从所述处于E使能状态的Pi中，根据所述第二转发路径的Ti选择处于T使能状态的Pi，再从所述处于T使能状态的Pi中选择优先级最高的Pi作为所述第二转发路径的抢占优先级。
PCT/CN2017/084375 2016-07-08 2017-05-15 确定转发路径的方法和控制设备 WO2018006653A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP17823465.4A EP3462687B1 (en) 2016-07-08 2017-05-15 Method for determining forwarding path, and control device
US16/243,062 US10812372B2 (en) 2016-07-08 2019-01-08 Method for determining forwarding path and control device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610539761.3A CN106209623B (zh) 2016-07-08 2016-07-08 确定转发路径的方法和控制设备
CN201610539761.3 2016-07-08

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/243,062 Continuation US10812372B2 (en) 2016-07-08 2019-01-08 Method for determining forwarding path and control device

Publications (1)

Publication Number Publication Date
WO2018006653A1 true WO2018006653A1 (zh) 2018-01-11

Family

ID=57473787

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/084375 WO2018006653A1 (zh) 2016-07-08 2017-05-15 确定转发路径的方法和控制设备

Country Status (4)

Country Link
US (1) US10812372B2 (zh)
EP (1) EP3462687B1 (zh)
CN (2) CN106209623B (zh)
WO (1) WO2018006653A1 (zh)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106209623B (zh) * 2016-07-08 2020-01-10 华为技术有限公司 确定转发路径的方法和控制设备
US9954611B1 (en) 2016-12-16 2018-04-24 Futurewei Technologies, Inc. System and method for abstracting wavelength-switched optical network traffic engineering topology in SDN control hierarchy
CN109246003A (zh) * 2017-07-11 2019-01-18 阿里巴巴集团控股有限公司 一种进行网络链路切换的方法和系统
CN108282403B (zh) * 2018-01-31 2020-12-04 新华三技术有限公司 一种路径确定方法和装置
US11178590B2 (en) * 2018-08-13 2021-11-16 Qualcomm Incorporated Hop-count indication in wireless systems
CN109672621B (zh) * 2019-01-23 2021-04-30 中国联合网络通信集团有限公司 一种为vpn业务选择传输路径的方法和设备
CN112054960B (zh) 2019-02-13 2024-04-26 华为技术有限公司 一种路径计算方法、装置及设备
CN110752993B (zh) * 2019-10-24 2022-02-25 新华三信息安全技术有限公司 一种报文转发方法及装置
JP7387563B2 (ja) * 2020-09-14 2023-11-28 株式会社東芝 無線通信装置、無線通信システム、無線通信方法及びプログラム
CN112333093A (zh) * 2020-11-23 2021-02-05 迈普通信技术股份有限公司 策略路由路径确定方法、装置、网络设备及可读存储介质
CN112822102B (zh) * 2020-12-30 2023-01-24 瑞斯康达科技发展股份有限公司 链路切换方法、装置、设备、系统及存储介质
CN115037681A (zh) * 2021-03-04 2022-09-09 国家电网有限公司信息通信分公司 一种以ip地址为显式路径的标签转发方法和系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101150491A (zh) * 2006-09-22 2008-03-26 华为技术有限公司 一种多协议标签交换网络中的组播树的优化方法
CN101159695A (zh) * 2007-11-16 2008-04-09 杭州华三通信技术有限公司 链路选择方法和设备
CN101714940A (zh) * 2008-09-30 2010-05-26 华为技术有限公司 路径计算及建立方法、路径计算单元和节点、网络
CN102123088A (zh) * 2011-02-21 2011-07-13 杭州华三通信技术有限公司 建立te隧道的方法及设备
WO2016102008A1 (en) * 2014-12-23 2016-06-30 Telefonaktiebolaget L M Ericsson (Publ) Path computation in a segment routing network
CN106209623A (zh) * 2016-07-08 2016-12-07 华为技术有限公司 确定转发路径的方法和控制设备

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8014291B2 (en) * 2006-11-28 2011-09-06 Cisco Technology, Inc. Relaxed constrained shortest path first (R-CSPF)
CN101785257B (zh) 2007-03-01 2014-07-23 极进网络有限公司 用于交换机和路由器的软件控制平面
CN101217487A (zh) * 2008-01-07 2008-07-09 华为技术有限公司 一种实现链路抢占的方法及链路端口
CN101616094B (zh) * 2009-08-10 2012-04-18 杭州华三通信技术有限公司 报文转发路径的获取方法和设备
US8233390B2 (en) * 2010-02-22 2012-07-31 Telefonaktiebolaget L M Ericsson (Publ) Priority and source aware packet memory reservation and flow control in forwarding planes
US8817594B2 (en) 2010-07-13 2014-08-26 Telefonaktiebolaget L M Ericsson (Publ) Technique establishing a forwarding path in a network system
US8842537B2 (en) * 2010-08-30 2014-09-23 Tellabs Operations, Inc. Configuring traffic allocations in a router
CA2902618A1 (en) * 2013-02-27 2014-09-04 Nec Corporation Control apparatus, communication system, switch control method and program
US9450864B2 (en) * 2013-10-11 2016-09-20 Futurewei Technologies, Inc. Using PCE as SDN controller
CN104660519B (zh) * 2013-11-25 2018-10-30 华为技术有限公司 一种trill网络中转发路径的处理方法及装置
US9537753B2 (en) * 2014-03-03 2017-01-03 Cisco Technology, Inc. Opaque profile identifiers for path computation element protocol
CN104980347B (zh) * 2014-04-04 2019-02-12 华为技术有限公司 一种建立隧道的方法及装置
CN105515981A (zh) * 2014-10-17 2016-04-20 中兴通讯股份有限公司 算路方法、隧道建立方法、pcc、pce及算路系统
CN104468536B (zh) * 2014-11-25 2017-10-31 中国电子科技集团公司第三十研究所 一种无线VoIP环境下基于一次建链过程的QoS保障方法和系统
US9806997B2 (en) * 2015-06-16 2017-10-31 At&T Intellectual Property I, L.P. Service specific route selection in communication networks
CN105337761B (zh) * 2015-09-24 2018-06-15 烽火通信科技股份有限公司 一种多保护路径之间的最优保护路径选择方法及端点设备
CN105391649B (zh) * 2015-10-16 2018-09-04 浪潮(北京)电子信息产业有限公司 一种队列调度方法及装置
CN105656799A (zh) * 2016-01-08 2016-06-08 浪潮集团有限公司 一种sdn网络下基于业务特征的调度方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101150491A (zh) * 2006-09-22 2008-03-26 华为技术有限公司 一种多协议标签交换网络中的组播树的优化方法
CN101159695A (zh) * 2007-11-16 2008-04-09 杭州华三通信技术有限公司 链路选择方法和设备
CN101714940A (zh) * 2008-09-30 2010-05-26 华为技术有限公司 路径计算及建立方法、路径计算单元和节点、网络
CN102123088A (zh) * 2011-02-21 2011-07-13 杭州华三通信技术有限公司 建立te隧道的方法及设备
WO2016102008A1 (en) * 2014-12-23 2016-06-30 Telefonaktiebolaget L M Ericsson (Publ) Path computation in a segment routing network
CN106209623A (zh) * 2016-07-08 2016-12-07 华为技术有限公司 确定转发路径的方法和控制设备

Also Published As

Publication number Publication date
US20190149450A1 (en) 2019-05-16
EP3462687A4 (en) 2019-05-22
CN111147370B (zh) 2021-08-20
CN111147370A (zh) 2020-05-12
US10812372B2 (en) 2020-10-20
EP3462687B1 (en) 2020-09-09
CN106209623A (zh) 2016-12-07
EP3462687A1 (en) 2019-04-03
CN106209623B (zh) 2020-01-10

Similar Documents

Publication Publication Date Title
WO2018006653A1 (zh) 确定转发路径的方法和控制设备
EP3624408B1 (en) Method for generating forwarding table entry, controller, and network device
US10263889B2 (en) Data forwarding method, device, and system in software-defined networking
CN107204867B (zh) 一种信息传输方法、装置和系统
WO2017070970A1 (zh) 一种确定路由的方法、对应装置及系统
US9699077B2 (en) Method for determining a packet forwarding path, network device, and control device
EP3101849A1 (en) Flow table entry generation method and device
US9360885B2 (en) Fabric multipathing based on dynamic latency-based calculations
KR101909364B1 (ko) 전송 네트워크 가상화에서 탄력성을 제공하기 위한 방법
EP3541028B1 (en) Adaptive load-balancing over a multi-point logical interface
US9781048B2 (en) Dynamic packet traffic performance adjustment systems and methods
EP3142303A1 (en) Network control method and apparatus
EP3310010B1 (en) Method for allocating global label, method for acquiring global label and related device
WO2018233580A1 (zh) 一种网络中建立转发路径的方法、控制器及系统
EP3253012B1 (en) Method and apparatus for obtaining port path
WO2015039617A1 (zh) 一种报文处理方法、系统及设备
US10791031B2 (en) Methods and systems for managing connected data transfer sessions
US11381497B2 (en) Path selection method and device
US9749240B2 (en) Communication system, virtual machine server, virtual network management apparatus, network control method, and program
WO2015135284A1 (zh) 数据流转发的控制方法及系统、计算机存储介质
US20220094638A1 (en) Stateless multicasting over traffic engineered unicast tunnels
WO2023279818A1 (zh) 确定性流的转发方法及装置、存储介质及电子装置
US20140269737A1 (en) System, method and apparatus for lsp setup using inter-domain abr indication
WO2016008156A1 (zh) 一种跨层路径建立方法及装置
WO2016023149A1 (zh) 一种业务服务质量保证方法与集中控制器

Legal Events

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

Ref document number: 17823465

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2017823465

Country of ref document: EP

Effective date: 20181227