CN104601473B - A kind of route generating method and system of the multi-goal path of belt restraining - Google Patents
A kind of route generating method and system of the multi-goal path of belt restraining Download PDFInfo
- Publication number
- CN104601473B CN104601473B CN201410851912.XA CN201410851912A CN104601473B CN 104601473 B CN104601473 B CN 104601473B CN 201410851912 A CN201410851912 A CN 201410851912A CN 104601473 B CN104601473 B CN 104601473B
- Authority
- CN
- China
- Prior art keywords
- path
- target
- feasible
- bandwidth
- list
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 230000000452 restraining Effects 0.000 title claims abstract description 66
- 238000005259 measurement Methods 0.000 claims abstract description 6
- 230000000875 corresponding Effects 0.000 claims description 4
- 230000014759 maintenance of location Effects 0.000 claims description 4
- 239000011159 matrix material Substances 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 claims description 3
- 230000001808 coupling Effects 0.000 claims description 3
- 238000010168 coupling process Methods 0.000 claims description 3
- 238000005859 coupling reaction Methods 0.000 claims description 3
- 238000011017 operating method Methods 0.000 claims description 3
- 238000004321 preservation Methods 0.000 abstract description 3
- 238000000034 method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 235000009808 lpulo Nutrition 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006011 modification reaction Methods 0.000 description 1
Abstract
The present invention proposes a kind of route generating method and system of the multi-goal path of belt restraining, and methods described reads input file, the parameter of routing algorithm is initialized first；Then according to initialized parameter, all sets of feasible paths that the multi-goal path of the belt restraining met in input file is calculated merge preservation；Finally the optimal path counted counted all feasible path combinations or therefrom selected is combined, is output in output file.The present invention is suitable for the network for having QoS demand, the constraint of destination path includes a variety of measurements and constrained, the algorithm of the present invention can either calculate all feasible paths or optimal path under the single goal multipath situation of belt restraining, can also calculate all feasible paths combination scheme or optimal path assembled scheme of a plurality of destination path of belt restraining.The present invention also proposes a kind of route generation system of multi-goal path of belt restraining, and described method and system has been implemented in combination with the route generation of the multi-goal path of belt restraining.
Description
Technical Field
The invention relates to the technical field of network routing, in particular to a method and a system for generating a route of a multi-target path with constraint.
Background
Multimedia services on the internet are growing rapidly, which stimulates research into how to provide quality of service (QoS) guarantees. Several QoS architectures exist today including: integrated services, differentiated services and multi-protocol identity exchange. One of the key issues in providing QoS guarantees is the generation of paths, i.e., qoS routes, that satisfy QoS constraints. Currently, many algorithms are used to solve the QoS routing problem, but most algorithms are based on Dijkstra algorithm, and a single path metric parameter, such as hop count or delay, is used, so that the obtained optimal path is an optimal solution that satisfies a single constraint condition, and is only directed to one target path. The measurement parameters in the actual network further include bandwidth, packet loss rate, reliability, etc., and a service may need multiple QoS parameters to ensure the quality of the service according to actual needs. In addition, when there is more than one target path to be calculated, their constraint conditions will affect each other, so that the calculation problem of routing becomes more complex, and the result can not be obtained simply by calculating the optimal solution combination of one target path one by one.
Disclosure of Invention
The invention aims to overcome the defect that the prior art only supports a single target path and a single constraint condition, and provides a method for generating a route of a multi-target path with constraint, which supports the multi-target path and the multi-constraint condition.
It is a further object of the present invention to provide a system for generating a multi-goal constrained route that supports multiple goals and constraints.
In order to solve the technical problems, the technical scheme of the invention is as follows:
a method for generating a route for a multi-destination path with constraints, the method comprising the steps of:
s1, reading an input file, and initializing parameters of a routing algorithm;
s2: calculating all feasible path combinations which meet the multi-target path with constraint in the input file according to the initialized parameters, and storing the feasible path combinations;
s3: and outputting all the calculated feasible path combinations or the selected optimal path combination to an output file.
In a preferred embodiment, the input file includes network topology information and user-entered constrained multi-target path information.
In a preferred scheme, the network topology information includes a leftnodeID, a rightnodeID, a bandwidth, and a cost, where the leftnodeID and the rightnodeID are IDs of switches at two ends of a link, respectively, the bandwidth of the link is the bandwidth of the link, and the cost is a custom overhead.
In a preferred scheme, the multi-target path information with constraints input by the user includes srcNodeID, dstNodeID, bandwidth and priority, where srcNodeID and dstNodeID refer to IDs of a source switch node and a destination switch node in a path, respectively, bandwidth refers to a bandwidth that needs to be allocated to the path, and priority refers to a priority of the path, where a higher priority is a higher priority, the bandwidth is guaranteed to be the first, and the priority can guarantee the minimum overhead.
In a preferred embodiment, the parameters of the routing algorithm include a bandwidth matrix, an overhead matrix, and a Target table, where a plurality of targets are stored in the Target table, and a Target is a structural body defined by the routing algorithm, and its members include: parameters associated with a target path to be solved with constraints: a source switch node src point, a destination switch node destPoint, bandwidth constraints bw, and weight priority;
epathList: the List linked List type variable is used for storing a feasible path combination which is selected by the current Target and meets the previous Target paths, if the Target path stored by the current Target is the ith Target path in the input file, i is greater than 1, then a path combination which meets the previous i-1 Target path with constraint is stored in the ePathList;
list: the List linked List type variable is used for storing all feasible paths meeting the current target path with constraint under the condition of selecting the path combination stored by the ePathList;
next: and if the Target path stored by the current Target is the ith Target path in the input file, the feasible path combinations meeting the previous i-1 Target paths with constraints can be multiple, each feasible path combination corresponds to a Target variable, and the feasible path combinations are combined into a Target linked list.
In a preferred scheme, all feasible path combinations which meet the constrained multi-target paths in the input file are calculated, and the specific method comprises the following steps:
s201: calling a getNextPoint function to find a feasible path set meeting a first constrained target path, and storing the feasible path set into a list linked list of target [0 ];
the running step of the getNextPoint function:
setting an input path as ' P1, P2 ' \ 8230and Pk ', firstly judging the parity of the node number k of an input path switch by a function, if the node number k is an odd number, searching a next hop meeting a bandwidth constraint condition in the Pk row of a bandwidth matrix B, and otherwise, searching a next hop meeting the bandwidth constraint condition in the Pk column of the B;
traversing the Pk-th row in B, if B [ Pk ] [ i ] is larger than bandwidth constraint, 1< -i < -N < +1 > and N is dimension of B, and i is not a point in path, adding the point i into an input path to generate a new path, and if i meeting the condition does not exist, ending the function and returning;
judging whether the i is the destination switch node of the input target, if so, the new path is a feasible path, and adding the feasible path into a list linked list of the target; otherwise, taking the new path as an input path, and calling the getNextPoint function to continuously search the next hop of the path;
s202: when the number of target paths to be solved is more than 1, setting the ith target, i >1, traversing the linked list of the target [ i-1], enabling prevTarget to point to the head node of the (i-1) th target linked list, firstly judging whether the linked list is empty, if not, continuing the following steps:
a) If the list linked list of the prevTarget is not empty, firstly copying the path in the ePathList of the prevTarget into the ePathList of the current node currentTarget of the linked list of the current ith target, traversing the path in the list of the prevTarget, and carrying out the following steps on each path: adding path to ePathList of currentTarget, updating bandwidth matrix B, calling getNextPoint function to obtain a group of matching path set, and adding the matching path set to list of currentTarget;
if the list of currentTarget is not empty, adding currentTarget to the current linked list of the ith target, otherwise, not adding;
b) Repeat step a) with prevTarget = prevTarget- > next.
In a preferred scheme, the output file includes a path, a cost, a priority, and a sumpost, where the path is a switch node through which an optimal path passes, and sequentially goes from a source switch node to a destination switch node, the cost is a cost of the path, the priority is a priority of the path, and the sumpost is a total cost of all optimal paths in the scheme, and is calculated according to the following formula:
a system for generating a route for a multi-goal path with constraints, the system comprising:
the input module is used for reading an input file and initializing the parameters of the routing algorithm;
the routing calculation module is used for calculating and obtaining all feasible path combinations meeting the multi-target path with constraint in the input file according to the initialized parameters and storing the feasible path combinations;
and the result output module is used for outputting all the calculated feasible path combinations or the selected optimal path combinations to an output file.
Compared with the prior art, the technical scheme of the invention has the beneficial effects that: the invention provides a route generation method of a multi-target path with constraint, which comprises the steps of firstly reading an input file and initializing parameters of a routing algorithm; then according to the initialized parameters, all feasible path combinations which meet the multi-target path with constraints in the input file are calculated and stored; and finally, outputting all the calculated feasible path combinations or the selected optimal path combinations to an output file. The method is suitable for the network with QoS requirement, the constraint of the target path comprises a plurality of measurement constraints such as bandwidth, time delay and priority, the algorithm of the invention can calculate all feasible paths or optimal paths under the condition of a single target path with the constraint, and can also calculate all feasible path combination schemes or optimal path combination schemes of a plurality of target paths with the constraint. The invention also provides a system for generating the route of the multi-target path with the constraint, and the method and the system are combined to realize the route generation of the multi-target path with the constraint.
Drawings
Fig. 1 is a schematic diagram of the principle of the present invention.
Detailed Description
The drawings are for illustrative purposes only and are not to be construed as limiting the patent;
it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The technical solution of the present invention is further described with reference to the drawings and the embodiments.
Example 1
A method for generating a route with constrained multi-destination path, as shown in fig. 1, the method comprising the steps of:
s1, reading an input file and initializing parameters of a routing algorithm.
The input file comprises network topology information and constrained multi-target path information input by a user.
The network topology information includes a leftnodeID, a rightnodeID, a bandwidth and a cost, where the leftnodeID and the rightnodeID are IDs of switches at two ends of a link, respectively, the bandwidth of the link is a link bandwidth, and the cost is a custom overhead, and the cost represents a time delay in this embodiment, and the network topology information in this embodiment is shown in table 1.
TABLE 1
| leftnodeID | rightnodeID | bandwidth | cost |
| 1 | 3 | 100 | 5 |
| 1 | 4 | 100 | 8 |
| 2 | 3 | 100 | 8 |
| 2 | 4 | 100 | 5 |
| 3 | 4 | 100 | 5 |
| 3 | 5 | 100 | 5 |
| 3 | 6 | 100 | 8 |
| 4 | 5 | 100 | 8 |
| 4 | 6 | 100 | 5 |
| 5 | 6 | 100 | 5 |
| 5 | 7 | 100 | 5 |
| 5 | 8 | 100 | 8 |
| 6 | 7 | 100 | 8 |
| 6 | 8 | 100 | 5 |
The multi-target path information with constraints input by a user comprises srcNodeID, dstNodeID, bandwidth and priority, wherein the srcNodeID and the dstNodeID respectively refer to IDs of a source switch node and a destination switch node under a path, the bandwidth refers to bandwidth needing to be allocated to the path, the priority refers to priority of the path, the higher the priority is, the bandwidth needs to be guaranteed first, and the minimum overhead can be guaranteed preferentially. The constrained multi-target path information input by the user in this embodiment is shown in table 2.
TABLE 2
| srcNodeID | dstNodeID | bandwidth | priority |
| 1 | 7 | 90 | 5 |
| 1 | 8 | 90 | 10 |
The parameters of the routing algorithm comprise a bandwidth matrix, an overhead matrix and a Target table, wherein a plurality of targets are stored in the Target table, the targets are a structural body defined by the routing algorithm, and the members of the Target comprise: parameters associated with a target path to be solved with constraints: a source switch node src point, a destination switch node destPoint, bandwidth constraints bw, and weight priority;
epathList: the List linked List type variable is used for storing a feasible path combination which is selected by the current Target and meets the previous Target paths, if the Target path stored by the current Target is the ith Target path in the input file, i is greater than 1, then a path combination which meets the Target path with the previous i-1 constraint is stored in the ePathList;
list: a List linked List type variable used for storing all feasible paths of the target path which meets the current belt constraint under the path combination stored by selecting the ePathList;
next: and if the Target path stored by the current Target is the ith Target path in the input file, the feasible path combinations meeting the previous i-1 Target paths with constraints can be multiple, each feasible path combination corresponds to a Target variable, and the feasible path combinations are combined into a Target linked list.
S2: and calculating and storing all feasible path combinations which meet the multi-target path with the constraint in the input file according to the initialized parameters.
In the specific implementation process, all feasible path combinations which meet the multi-target path with the constraint in the input file are obtained through calculation, and the specific method comprises the following steps:
s201: calling a getNextPoint function to find a feasible path set meeting a first constrained target path, and storing the feasible path set into a list linked list of target [0 ];
the running step of the getNextPoint function:
setting an input path as ' P1, P2 ' \ 8230and Pk ', firstly judging the parity of the node number k of an input path switch by a function, if the node number k is an odd number, searching a next hop meeting a bandwidth constraint condition in the Pk row of a bandwidth matrix B, and otherwise, searching a next hop meeting the bandwidth constraint condition in the Pk column of the B;
traversing the Pk-th row in B, if B [ Pk ] [ i ] is larger than bandwidth constraint, 1 yarn i yarn n +1 and N are the dimension of B, and i is not a point in path, adding the point i into the input path to generate a new path, and if i meeting the condition does not exist, ending the function and returning;
judging whether the i is the destination switch node of the input target, if so, the new path is a feasible path, and adding the feasible path into a list linked list of the target; otherwise, taking the new path as an input path, and calling the getNextPoint function to continuously search the next hop of the path;
s202: when the number of target paths to be solved is more than 1, setting the ith target, i >1, traversing the linked list of the target [ i-1], enabling prevTarget to point to the head node of the (i-1) th target linked list, firstly judging whether the linked list is empty, if not, continuing the following steps:
a) If the list linked list of the prevTarget is not empty, firstly copying the path in the ePathList of the prevTarget into the ePathList of the current node currentTarget of the linked list of the current ith target, traversing the path in the list of the prevTarget, and carrying out the following steps on each path: adding path to ePathList of currentTarget, updating bandwidth matrix B, calling getNextPoint function to obtain a group of matching path set, and adding the matching path set to list of currentTarget;
if the list of currentTarget is not empty, adding currentTarget to the current linked list of the ith target, otherwise, not adding;
b) Repeat step a) with prevTarget = prevTarget- > next.
S3: and outputting all the calculated feasible path combinations or the selected optimal path combination to an output file.
The output file includes a path, a cost, a priority, and a sumpost, where the path is a switch node through which an optimal path passes, and sequentially passes from a source switch node to a destination switch node, the cost is a cost of the path, the present embodiment is a total time delay, the priority is a priority of the path, and the sumpost is a total cost of all optimal paths in the scheme, and is calculated according to the following formula:
the output file of this embodiment is shown in table 3:
TABLE 3
A system for generating a route for a multi-goal constrained path, the system comprising:
the input module is used for reading an input file and initializing the parameters of the routing algorithm;
the routing calculation module is used for calculating and obtaining all feasible path combinations meeting the multi-target path with constraint in the input file according to the initialized parameters and storing the feasible path combinations;
and the result output module is used for outputting all the calculated feasible path combinations or the selected optimal path combinations to an output file.
The invention provides a route generation method of a multi-target path with constraint, which comprises the steps of firstly reading an input file and initializing parameters of a routing algorithm; then according to the initialized parameters, all feasible path combinations which meet the multi-target path with constraints in the input file are calculated and stored; and finally, outputting all the calculated feasible path combinations or the selected optimal path combinations to an output file. The method is suitable for the network with QoS requirement, the constraint of the target path comprises a plurality of measurement constraints such as bandwidth, time delay and priority, the algorithm of the invention can calculate all feasible paths or optimal paths under the condition of a single target path with the constraint, and can also calculate all feasible path combination schemes or optimal path combination schemes of a plurality of target paths with the constraint. The invention also provides a system for generating the route of the multi-target path with the constraint, and the method and the system are combined to realize the route generation of the multi-target path with the constraint.
The same or similar reference numerals correspond to the same or similar parts;
the terms describing positional relationships in the drawings are for illustrative purposes only and are not to be construed as limiting the patent;
it should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.
Claims (7)
1. A method for generating a route of a multi-target path with constraint is characterized by comprising the following steps:
s1, reading an input file, and initializing parameters of a routing algorithm;
s2: calculating all feasible path combinations which meet the multi-target path with constraint in the input file according to the initialized parameters and storing the feasible path combinations;
s3: outputting all the calculated feasible path combinations or the selected optimal path combination to an output file;
the parameters of the routing algorithm comprise a bandwidth matrix, an overhead matrix and a Target table, wherein a plurality of targets are stored in the Target table, the targets are a structural body defined by the routing algorithm, and the members of the Target comprise: parameters associated with a target path to be solved with constraints: a source switch node src point, a destination switch node destPoint, a bandwidth constraint bw and a weight priority;
ePathList: the List linked List type variable is used for storing a feasible path combination which is selected by the current Target and meets the previous Target paths, if the Target path stored by the current Target is the ith Target path in the input file, i is greater than 1, then a path combination which meets the Target path with the previous i-1 constraint is stored in the ePathList;
list: the List linked List type variable is used for storing all feasible paths meeting the current target path with constraint under the condition of selecting the path combination stored by the ePathList;
next: and if the Target path stored by the current Target is the ith Target path in the input file, the feasible path combinations meeting the previous i-1 Target paths with constraints can be multiple, each feasible path combination corresponds to a Target variable, and the feasible path combinations are combined into a Target linked list.
2. The method of claim 1, wherein the input file includes network topology information and user-entered constrained multi-target path information.
3. The method of claim 2, wherein the network topology information includes a leftnodeID, a rightnodeID, a bandwidth, and a cost, wherein the leftnodeID and the rightnodeID are IDs of switches at both ends of a link, the bandwidth is a link bandwidth, and the cost is a custom overhead.
4. The method of claim 2, wherein the information about the multi-target paths with constraints input by the user includes srcNodeID, dstNodeID, bandwidth and priority, where srcNodeID and dstNodeID refer to IDs of a source switch node and a destination switch node in a path, respectively, bandwidth refers to a bandwidth that needs to be allocated to the path, and priority refers to priority of the path, where the higher the priority is, the higher the bandwidth is to be guaranteed, and the priority is to guarantee the minimum overhead.
5. The method of claim 1, wherein all feasible path combinations that satisfy the constrained multi-goal paths in the input file are computed, and the method comprises the following steps:
s201: calling a getNextPoint function to find a feasible path set meeting a first constrained target path, and storing the feasible path set into a list linked list of target [0 ];
the running step of the getNextPoint function:
setting an input path as ' P1, P2 ' \ 8230and Pk ', firstly judging the parity of the node number k of an input path switch by a function, if the node number k is an odd number, searching a next hop meeting a bandwidth constraint condition in the Pk row of a bandwidth matrix B, and otherwise, searching a next hop meeting the bandwidth constraint condition in the Pk column of the B;
traversing the Pk-th row in B, if B [ Pk ] [ i ] is larger than bandwidth constraint, 1< -i < -N < +1 > and N is dimension of B, and i is not a point in path, adding the point i into an input path to generate a new path, and if i meeting the condition does not exist, ending the function and returning;
judging whether the i is the destination switch node of the input target, if so, the new path is a feasible path, and adding the feasible path into a list linked list of the target; otherwise, taking the new path as an input path, and calling the getNextPoint function to continuously search the next jump of the path;
s202: when the number of target paths to be solved is more than 1, setting the ith target, i >1, traversing the linked list of the target [ i-1], enabling the prevTarget to point to the head node target [ i-1] of the ith-1 target linked list, firstly judging whether the prevTarget is empty, if not, continuing the following steps:
a) If the list linked list of the prevTarget is not empty, firstly copying the path in the ePathList of the prevTarget into the ePathList of the current node currentTarget of the linked list of the current ith target, traversing the path in the list of the prevTarget, and carrying out the following steps on each path: adding path into ePathList of currentTarget, updating bandwidth matrix B, calling getNextPoint function to obtain a group of matching path set, and adding the matching path set into list of currentTarget;
if the list of currentTarget is not empty, adding currentTarget to the current linked list of the ith target, otherwise, not adding;
b) Let prevTarget = prevTarget- > next, repeat step a).
6. The method of claim 1, wherein the output file includes a path, a cost, a priority, and a sumpost, where the path is a switch node through which the optimal path passes, and sequentially passes from the source switch node to the destination switch node, the cost is a cost of the path, the priority is a priority of the path, and the sumpost is a total cost of all optimal paths in the solution, and the method is calculated according to the following formula:
7. a system for generating a route for a multi-goal constrained path, the system comprising:
the input module is used for reading an input file and initializing the parameters of the routing algorithm;
the routing calculation module is used for calculating and obtaining all feasible path combinations meeting the multi-target paths with constraints in the input file according to the initialized parameters and storing the feasible path combinations;
the result output module is used for outputting all the calculated feasible path combinations or the optimal path combinations selected from the feasible path combinations into an output file;
the parameters of the routing algorithm comprise a bandwidth matrix, an overhead matrix and a Target table, wherein a plurality of targets are stored in the Target table, the targets are a structural body defined by the routing algorithm, and the members of the Target comprise: parameters associated with a target path to be solved with constraints: a source switch node src point, a destination switch node destPoint, bandwidth constraints bw, and weight priority;
epathList: the List linked List type variable is used for storing a feasible path combination which is selected by the current Target and meets the previous Target paths, if the Target path stored by the current Target is the ith Target path in the input file, i is greater than 1, then a path combination which meets the Target path with the previous i-1 constraint is stored in the ePathList;
list: a List linked List type variable used for storing all feasible paths of the target path which meets the current belt constraint under the path combination stored by selecting the ePathList;
next: and if the Target path stored by the current Target is the ith Target path in the input file, the feasible path combinations meeting the previous i-1 Target paths with constraints can be multiple, each feasible path combination corresponds to a Target variable, and the feasible path combinations are combined into a Target linked list.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410851912.XA CN104601473B (en) | 2014-12-29 | 2014-12-29 | A kind of route generating method and system of the multi-goal path of belt restraining |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410851912.XA CN104601473B (en) | 2014-12-29 | 2014-12-29 | A kind of route generating method and system of the multi-goal path of belt restraining |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104601473A CN104601473A (en) | 2015-05-06 |
| CN104601473B true CN104601473B (en) | 2018-01-05 |
Family
ID=53126991
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410851912.XA Active CN104601473B (en) | 2014-12-29 | 2014-12-29 | A kind of route generating method and system of the multi-goal path of belt restraining |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104601473B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107404437B (en) * | 2017-07-25 | 2018-05-18 | 广东工业大学 | The determining method of path and device of a kind of message |
| CN107944609B (en) * | 2017-11-16 | 2022-01-07 | 上海交通大学 | Approximate multi-target preferred path searching method |
| CN108282403B (en) * | 2018-01-31 | 2020-12-04 | 新华三技术有限公司 | Path determining method and device |
| CN108429577A (en) * | 2018-03-21 | 2018-08-21 | 大连大学 | A kind of satellite QoS routing algorithms based on PROMETHEE methods |
| CN110971521B (en) * | 2018-09-29 | 2022-09-13 | 中兴通讯股份有限公司 | Routing path calculation method, system, device and computer readable storage medium |
| CN111447647B (en) * | 2020-03-03 | 2023-07-14 | 成都市联洲国际技术有限公司 | Client bandwidth calculation method, system, equipment and storage medium in wireless network |
| CN113806997A (en) * | 2020-06-15 | 2021-12-17 | 英业达科技有限公司 | Method for producing printed circuit board assembly scheme |
| CN116155790A (en) * | 2021-11-17 | 2023-05-23 | 中兴通讯股份有限公司 | Routing method, routing device, storage medium, and program product |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101969406A (en) * | 2010-11-02 | 2011-02-09 | 南京邮电大学 | Multi-constraint QoS (Quality of Service) routing method based on selective detection |
-
2014
- 2014-12-29 CN CN201410851912.XA patent/CN104601473B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101969406A (en) * | 2010-11-02 | 2011-02-09 | 南京邮电大学 | Multi-constraint QoS (Quality of Service) routing method based on selective detection |
Non-Patent Citations (2)
| Title |
|---|
| 一种带约束的多目标服务质量路由算法;崔逊学，林闯;《计算机研究与发展》;20040831;第2页左栏第2段，第4页左栏第2段 * |
| 带约束的多目标优化的无线传感器网络路由算法;米志超，周建江;《应用科学学报》;20080531;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104601473A (en) | 2015-05-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104601473B (en) | A kind of route generating method and system of the multi-goal path of belt restraining | |
| CN101965715B (en) | Tie-Breaking in Shortest Path Determination | |
| TWI493926B (en) | Automated traffic engineering for fat tree networks | |
| US8761022B2 (en) | Tie-breaking in shortest path determination | |
| EP2614615B1 (en) | Automated traffic engineering for 802.1aq based upon the use of link utilization as feedback into the tie-breaking mechanism | |
| RU2517431C2 (en) | Provider link state bridging (plsb) computation method | |
| US20160112299A1 (en) | Configuring forwarding information | |
| CN107294852B (en) | Network routing method using topology dispersed short path set | |
| CN101416455A (en) | Method and apparatus for improved routing in connectionless networks | |
| KR20150030644A (en) | Tie-breaking in shortest path determination | |
| US20180316599A1 (en) | Routing packets considering the propagation delay of routes | |
| CN103532861B (en) | In territory based on spanning tree, Dynamic Multi-Pathing generates method | |
| CN108199955A (en) | A kind of method for routing foundation and device | |
| CN110661704B (en) | Calculation method of forwarding path and SDN controller | |
| US20120093164A1 (en) | Method and Apparatus for Generating Constraint Route | |
| CN106209625B (en) | One kind supporting central controlled high efficiency method in distributed network | |
| WO2017101981A1 (en) | A method for constructing srlg-disjoint paths under qos constraints | |
| CN100518382C (en) | Shortest path searching method and device under multi-restraint conditions in automatic switching optical network | |
| Xiao et al. | Dynamic update of shortest path tree in OSPF | |
| CN103581015B (en) | A kind of based on disjoint multiple paths generation method between the territory of AS ring | |
| CN103763191A (en) | Intra-domain multipath generating method based on spanning tree | |
| CN114389989B (en) | Multistage next hop route processing method and device | |
| CN110679123B (en) | Virtual channel routing method, network device, and medium | |
| Parra et al. | Dijkstra's algorithm model over MPLS/GMPLS | |
| CN114050993A (en) | Access side-based safe and trusted path active selection method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |