CN100396040C - Method of path selecting in intelligent optical network - Google Patents
Method of path selecting in intelligent optical network Download PDFInfo
- Publication number
- CN100396040C CN100396040C CNB2005100333104A CN200510033310A CN100396040C CN 100396040 C CN100396040 C CN 100396040C CN B2005100333104 A CNB2005100333104 A CN B2005100333104A CN 200510033310 A CN200510033310 A CN 200510033310A CN 100396040 C CN100396040 C CN 100396040C
- Authority
- CN
- China
- Prior art keywords
- path
- node
- memory cell
- source node
- cost
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a method of path selecting in an intelligent optical network, which comprises the following steps: step (a), the first storage unit and the second storage unit are cleaned, and a source node is put in the first storage unit; step (b), the node with the minimum path cost corresponding to the source node in the first storage unit and a corresponding path are put in the second storage unit; step (c), if the node is a target node, a step (d) is executed, and otherwise, a neighbor node which satisfies constrained conditions and the corresponding path are put in the first storage unit; step (d), the first storage unit is judged to be empty or not; step (e), if the first storage unit does not empty, the step (b) is returned; otherwise, the target node is judged whether in the second storage unit or not; if the target node is arranged in the second storage unit, the path of the second storage unit is the shortest path. The method of path selecting in an intelligent optical network of the present invention can obtain the shortest path in network topology with negative chain circuit cost thereby through the improvement for fundamental Dijkstra algorithm.
Description
Technical field
The present invention relates to the ASON self Healing Technology, the method for Path selection in particularly a kind of ASON.
Background technology
Based on the structure of mesh network (MESH), ASON can provide multiple business protection and recovery policy, for example 1+1 privacy protection, 1:N share protect, pre-set path protection, complete heavy-route protection etc.Wherein, the 1+1 privacy protection is the highest a kind of end to end services protected mode of protection intensity.
The 1+1 privacy protection is exactly to adopt the path (protection path) of a special use to protect an other paths (operating path).Under normal circumstances, transport service simultaneously on operating path and the protection path, the egress choosing of traffic direction is knocked off and is made business on the path; When fault happens in operational, the egress of traffic direction automatically switches to and receives professional from the protection path.The 1+1 privacy protection realizes that by SNCP (SNCP) group of setting up operating path and protection path on business end business switching time can reach and be not more than 20ms.Break down simultaneously for fear of protection path and operating path, separate each other with operating path as far as possible in claimed path, and promptly two paths are as far as possible without identical link.
In intelligent optical network system, Constraint Shortest Path First (CSPF) algorithm (being that basic Otto Dix spy draws algorithm (Dijkstra)) is adopted in the calculating of service path usually.The CSPF algorithm is when the computing service path; at first whether decision node or link satisfy professional constraint requirements (require, whether be excluded etc. as bandwidth requirement, protection type); in node that satisfies constraint requirements and link, select then by the shortest path of source node to destination node.The shortest path that the CSPF algorithm computation goes out is of path cost minimum in all feasible paths.Path cost is a numerical value weighing the path quality, and general adopt " the link cost sum of all links on path cost=path " calculated.Link cost is represented professional by the cost that this link spent, and it calculates according to attributes such as the current available bandwidth of link, linkage lengths.
The process of wherein a kind of method of existing two paths that obtain the 1+1 business is as follows: (a) adopt basic dijkstra's algorithm, calculate first the shortest path (be called primary path) of source node to destination node; (b) all links on the eliminating primary path, and then adopt basic dijkstra's algorithm, calculate the second shortest path (be called backup path) of source node to destination node.Yet this method can only be obtained by two the paths that link fully separate of source node to destination node, if two paths that do not exist link to separate fully in the network topology calculate failure; In some network topology, even two paths that exist link to separate fully, existing method may be can not find this two paths in addition; In some network topology, two paths that this method is found out are not optimum, and are promptly minimum in not all feasible two paths of the path cost sum of this two paths.As shown in Figure 1, it is A-B-C-D to the primary path of the 1+1 business of node D that this method calculates node A, and its path cost is 150; After getting rid of the link on the primary path,, calculate the backup path failure owing to there is not the path of connection between node A and the node D.And in fact, having two path that link separates fully: A-E-C-D and A-B-F-D in the network topology of Fig. 1, its path cost is respectively 350 and 450.In addition, dijkstra's algorithm is inapplicable substantially obtains shortest path in the network topology with minus strand road cost.
" trap " topology at Fig. 1 exists technique known to obtain the path of two separation.The process of a kind of technology wherein is as follows: (a) adopt basic dijkstra's algorithm, calculate by first the shortest path (path one) of source node to destination node, if calculate failure, then can not find two paths that satisfy condition, calculate and finish; (b) link cost of all reverse links on the path one is set to-1 times of former link cost, and with all forward links on the path one be set to unavailable; Adopt Bhandari to improve dijkstra's algorithm, calculate,, then can not find two paths that satisfy condition, calculate and finish if calculate failure by the second shortest path (path two) of source node to destination node; (c) check all forward links on the path two,,, promptly delete overlaid on path one and the path two but by the opposite link of direction then from the path two and path one this link of deletion and reverse link thereof if the link cost of certain bar link is a negative value; (d) path one and the path two behind the merging deletion link finds two of the 1+1 business to separate paths.Yet this method is obtained the shortcoming that the method for two paths of 1+1 business exists: can only obtain by two the paths that link fully separate of source node to destination node, if two paths that do not exist link to separate fully in the network topology calculate and fail.For example, for the network topology of Fig. 2, node D has only a two-way link between the node G, and promptly first node A is to two paths that do not exist link to separate fully between the end-node G, this method is obtained two paths of 1+1 business and will be failed, and the optimal path that can not find two links as far as possible to separate.
Summary of the invention
The objective of the invention is to, the method of Path selection in a kind of ASON is provided, and the method for two optimal route selection that link separates as far as possible in a kind of ASON, solve and can not find two links problem of the optimal path of separation as far as possible in the existing ASON.
Technical scheme of the present invention is, the method for Path selection in a kind of ASON is provided, and may further comprise the steps:
(a) first memory cell and second memory cell are emptied, and source node is put into first memory cell;
(b) node and the respective path with respect to source node path cost minimum in first memory cell put into second memory cell;
(c) be destination node as if described node with respect to source node path cost minimum, then execution in step (d) is not a destination node as if described node with respect to source node path cost minimum, then
(c1) judge whether the neighbor node judge described node with respect to source node path cost minimum successively satisfies constraints;
(c2) if the neighbor node that satisfies constraints neither in first memory cell, also not in second memory cell, is then put into first memory cell with described neighbor node;
(c3) if the neighbor node that satisfies constraints in first memory cell, then the reference source node if the cost of new route is then put into new route described first memory cell less than old path, is left out old path to new, the old path of described neighbor node simultaneously;
(c4) if satisfy the neighbor node of constraints in second memory cell, when described neighbor node not at source node to the shortest path of described node with respect to source node path cost minimum, and source node arrives the corresponding old path of described neighbor node less than the source node in first memory cell to the cost of the new route of described neighbor node, then new route is put into described first memory cell and second memory cell, left out old path simultaneously;
(e) judge whether first memory cell is empty;
(f) if the first memory cell non-NULL then returns step (b); If described first memory cell be empty, then judge destination node whether in second memory cell, in second memory cell, then the path in second memory cell is exactly a shortest path as if destination node.
In the method for Path selection, described step (c4) may further comprise the steps in the above-mentioned ASON:
(c41) judge whether described neighbor node is positioned at by source node to the shortest path of described node with respect to source node path cost minimum;
(c42) if described neighbor node is positioned at by source node to the shortest path of described node with respect to source node path cost minimum, then abandon the new route of source node to described neighbor node;
(c43) if described neighbor node is not positioned at by source node to the shortest path of described node with respect to source node path cost minimum, the corresponding old path of reference source node then to the new route of described neighbor node and the source node in first memory cell to described neighbor node, if the cost of new route is less than old path, then new route is put into described first memory cell and second memory cell, left out old path simultaneously.
The present invention also provides the method for Path selection in a kind of ASON, may further comprise the steps:
(a) adopt basic dijkstra's algorithm, calculate by first shortest path of source node to destination node;
(b), and all the forward link costs on described first shortest path are added big constant with all the reverse link cost negates on described first shortest path;
(c) adopt following steps to calculate second shortest path:
(c1) first memory cell and second memory cell are emptied, and source node is put into first memory cell;
(c2) node and the respective path with respect to source node path cost minimum in first memory cell put into second memory cell;
(c3) be destination node as if described node with respect to source node path cost minimum, then execution in step (c4) is not a destination node as if described node with respect to source node path cost minimum, then
(c31) whether the neighbor node of judging described node with respect to source node path cost minimum successively satisfies constraints;
(c32) if the neighbor node that satisfies constraints neither in first memory cell, also not in second memory cell, is then put into first memory cell with described neighbor node;
(c33) if the neighbor node that satisfies constraints in first memory cell, then the reference source node if the cost of new route is then put into new route described first memory cell less than old path, is left out old path to new, the old path of described neighbor node simultaneously;
(c34) if satisfy the neighbor node of constraints in second memory cell, when described neighbor node not at source node to the shortest path of described node with respect to source node path cost minimum, the corresponding old path of reference source node then to the new route of described neighbor node and the source node in first memory cell to described neighbor node, if the cost of new route is less than old path, then new route is put into described first memory cell and second memory cell, left out old path simultaneously;
(c4) judge whether first memory cell is empty;
(c5) if the first memory cell non-NULL then returns step (c2); If described first memory cell be empty, then judge destination node whether in second memory cell, in second memory cell, then the path in second memory cell is exactly second shortest path as if destination node;
(d) on deletion described first shortest path and second shortest path corresponding to the minus strand road cost part of second shortest path;
(e) the residue link of described first shortest path of merging and second shortest path obtains two by the path of source node to destination node;
(f) recover link cost, recomputate the path cost of described two paths, as the first final shortest path, an other paths is as the second final shortest path with the less path of path cost.
In the method for Path selection, (c34) is further comprising the steps of for described step in the above-mentioned ASON:
(c341) judge whether described neighbor node is positioned at by source node to the shortest path of described node with respect to source node path cost minimum;
(c342) if described neighbor node is positioned at by source node to the shortest path of described node with respect to source node path cost minimum, then abandon the new route of source node to described neighbor node;
(c343) if described neighbor node is not positioned at by source node to the shortest path of described node with respect to source node path cost minimum, the corresponding old path of reference source node then to the new route of described neighbor node and the source node in first memory cell to described neighbor node, if the cost of new route is less than old path, then new route is put into described first memory cell and second memory cell, left out old path simultaneously.
In the above-mentioned ASON in the method for Path selection, step (d) also comprises judges whether the described second shortest path uplink cost has available bandwidth more than the constraints twice greater than the link of described big constant.If the described second shortest path uplink cost does not have available bandwidth more than the constraints twice greater than the link of described big constant, then there are not two feasible paths in the current network.
The method of Path selection in the ASON of the present invention by basic dijkstra's algorithm is improved, thereby can be obtained shortest path in the network topology with minus strand road cost.In addition, the present invention can obtain also that two links of 1+1 business separate as far as possible than shortest path.
Description of drawings
Fig. 1 is the network element topology structure schematic diagram of first embodiment;
Fig. 2 is the network element topology structure schematic diagram of second embodiment;
Fig. 3 is the layered architecture schematic diagram of ASON;
Fig. 4 is the flow chart that obtains shortest path in the method for Path selection in the ASON of the present invention;
Fig. 5 is the flow chart that obtains operating path and protection path in the method for Path selection in the ASON of the present invention;
Fig. 6 is the schematic diagram that adopts first path of basic dijkstra's algorithm acquisition at Fig. 2;
Fig. 7 is the network element topology structure process negate of Fig. 2 and the schematic diagram behind the additive constant.
Fig. 8 is the schematic diagram that adopts second path that method shown in Figure 4 obtains at Fig. 3;
Fig. 9 is the schematic diagram that Fig. 6 is carried out remaining link behind the link circuit deleting;
Figure 10 is the schematic diagram that Fig. 7 is carried out remaining link behind the link circuit deleting;
Figure 11 is the schematic diagram of two optimal paths as far as possible separating of the link that finally obtains at Fig. 2.
Embodiment
As shown in Figure 3, ASON is promptly transmitted plane 13, control plane 12 and management plane 11 and is constituted by three logic planes.Control plane 12 with transmit plane 13 and be connected with management plane 11 respectively, and between control plane 12 and the transmission plane 13 by being connected control interface 14 connections.
Transmit plane 13 and is made up of the transmission network element 131 of entity in return, described network element 131 interconnects by subnet connection 132.Transmit plane 13 and mainly finish functions such as connecting/take out stitches, exchange (routing) and transmission, transmit so that the two-way or unidirectional information from an end points to another end points to be provided, and some controls and network management information.
11 pairs of control planes of management plane 12 and transmit plane 13 and manage, provide optical transfer network and network element 131 managed in, realize between network operating system and the network element 131 communication function more efficiently.
As shown in Figure 4, be the flow chart that obtains shortest path of the present invention.In the present embodiment, control plane 12 when calculating between two nodes optimal path, use shortest path tree (PATHS) and potential next jump and gather (TENT) two databases, wherein, preserve the information that arrives the shortest path of other nodes by source node among the PATHS, and be kept at the information that finds shortest path trial node before among the TENT.In the initial condition of calculating, two databases all are empty.
At first, control plane 12 empties PATHS and TENT, and source node is put into TENT, and the source node path cost is set is 0 (step S41).Then, in TENT, choose with respect to the node and the corresponding path of the path cost minimum of source node and put into PATHS (step S42), and judge whether the node (present node) of putting into PATHS is destination node (step S43).If present node is a destination node, execution in step S45 (will in following description) then.
If present node is not a destination node, whether execution in step S44 then, the link (being called current link) of checking the neighbor node (being called current neighbor node) of the present node among the firm adding PATHS one by one and arriving this neighbor node according to rule satisfy constraints (as bandwidth etc.).If do not satisfy, then current link and current neighbor node are abandoned; If satisfy, then control plane 12 calculates the path cost (being called the current path cost) that arrives current neighbor node by current link, and judges whether current neighbor node and respective path are added among the TENT according to following method:
If A. current neighbor node has been present among the TENT, then there is the new route that arrives this neighbor node in expression, and control plane 12 compares the path cost size in the old path among current path cost and the TENT.If the current path cost less than the path cost in old path, then replaces old path with new route, promptly upgrade link and the path cost that is stored in the current neighbor node of arrival among the TENT with current link and current path cost; Otherwise, abandon new route, keep the old path among the TENT.
If B. current neighbor node has been present among the PATHS, check then whether current neighbor node is positioned at by source node to the path of present node.If current neighbor node is positioned at by source node to the path of present node, expression can form loop by the path that current link arrives current neighbor node, and current link is not abandoned; Otherwise, there is the new route that arrives this neighbor node in expression, the path cost size that compares the old path among current path cost and the TENT then, if the current path cost is less than the path cost in old path, then replace old path with new route, promptly upgrade link and the path cost that is stored in the current neighbor node of arrival among the TENT, and upgrade the path cost of all nodes on the subtree of current neighbor node among the PATHS with current link and current path cost; Otherwise, ignore new route, keep the old path among the TENT.
If C. current neighbor node neither in PATHS also not in TENT, then current neighbor node is added among the TENT.
After all neighbor nodes of present node added TENT according to the method described above or abandon, control plane 12 judged whether current TENT is empty (step S45).If TENT is not empty, then return step S42.If TENT is empty, then control plane 12 is judged whether step S46 in PATHS of destination node.
If destination node in PATHS, is then calculated successfully, finding by source node is path (step S48) among the PATHS to the shortest path of destination node; If destination node not in PATHS, is then calculated failure, do not exist by the shortest path (step S47) of source node to destination node.
Certainly, above-mentioned database is not limited to TENT and PATHS, so long as two different memory cell get final product.
As shown in Figure 5, be to obtain the link flow chart of two optimal paths of separation as far as possible in the ASON of the present invention.Introduce method of the present invention below in conjunction with Fig. 2, Fig. 6-Figure 10.
At first, adopt basic dijkstra's algorithm, calculate by first the shortest path (first path) of source node to destination node, the result as shown in Figure 6, i.e. shortest path A-B-C-D-G (step S51).The link cost of all reverse links on first path is set to former link cost-1 times, and the link cost of all forward links on first path is increased a big constant (be defined as MAX_METRIC, can be 300000 in the present embodiment), the result is (step S52) as shown in Figure 7.Adopt shortest path acquisition methods shown in Figure 4 then, calculate by the second shortest path (second path) of source node to destination node, the result as shown in Figure 8, i.e. A-E-C-B-F-D-G (step S53).
Check all forward links on second path, and judge that whether having cost on second path is the link of negative value, the B-C link is negative value (step S54) in the present embodiment.If the link cost of certain bar link is a negative value,, promptly delete overlaid on first path and second path but by the opposite link of direction then from first path and second path this link of deletion and reverse link thereof.Delete link B-C in the present embodiment, result such as Fig. 9 and shown in Figure 10 behind the deletion link.If the link cost of certain bar forward link is greater than MAX_METRIC (being link D-G in the present embodiment) on second path, checking then whether this link and reverse link thereof have doubles demand bandwidth or above available bandwidth, if do not have, then expression can not find two paths that satisfy condition, and calculates and finishes; Otherwise, there is the link that overlaps on two paths that expression is finally found, not two paths (step S55) that link separates fully.
Merge first path and second path behind the deletion link then, the result finally obtains two optimal paths of 1+1 business as shown in figure 11, and two links are respectively A-E-C-D-G and A-B-F-D-G (step S56) in the present embodiment.Recover the link cost of link, calculate the path cost of two paths respectively, the cost in two paths is respectively 400 and 500 in the present embodiment, and the less path of path cost is set to primary path, and the bigger path of path cost is set to backup path (step S57).
Among the above-mentioned steps S52, the MAX_METRIC that requires to choose is greater than possible maximum path cost.Step 2) effect is to make when calculating the second path, preferentially selects the reverse link on the path one as far as possible, and does not select the forward link in path one as far as possible.(link direction is for the path, is forward by source node to the direction of destination node).
The link cost of the forward link of said method by strengthening first path allows two paths by same link, thereby can find two paths of two 1+1 business of as far as possible separating under the situation that only has a link.
Claims (5)
1. the method for Path selection in the ASON is characterized in that, may further comprise the steps:
(a) first memory cell and second memory cell are emptied, and source node is put into first memory cell;
(b) node and the respective path with respect to source node path cost minimum in first memory cell put into second memory cell;
(c) be destination node as if described node with respect to source node path cost minimum, then execution in step (d) is not a destination node as if described node with respect to source node path cost minimum, then
(c1) whether the neighbor node of judging described node with respect to source node path cost minimum successively satisfies constraints;
(c2) if the neighbor node that satisfies constraints neither in first memory cell, also not in second memory cell, is then put into first memory cell with described neighbor node;
(c3) if the neighbor node that satisfies constraints in first memory cell, then the reference source node if the cost of new route is then put into new route described first memory cell less than old path, is left out old path to new, the old path of described neighbor node simultaneously;
(c4) if satisfy the neighbor node of constraints in second memory cell, when described neighbor node not at source node to the shortest path of described node with respect to source node path cost minimum, and source node arrives the corresponding old path of described neighbor node less than the source node in first memory cell to the cost of the new route of described neighbor node, then new route is put into described first memory cell and second memory cell, left out old path simultaneously;
(d) judge whether first memory cell is empty;
(e) if the first memory cell non-NULL then returns step (b); If described first memory cell be empty, then judge destination node whether in second memory cell, in second memory cell, then the path in second memory cell is exactly a shortest path as if destination node.
2. the method for Path selection is characterized in that in the ASON according to claim 1, and described step (c4) may further comprise the steps:
(c41) judge whether described neighbor node is positioned at by source node to the shortest path of described node with respect to source node path cost minimum;
(c42) if described neighbor node is positioned at by source node to the shortest path of described node with respect to source node path cost minimum, then abandon the new route of source node to described neighbor node;
(c43) if described neighbor node is not positioned at by source node to the shortest path of described node with respect to source node path cost minimum, the corresponding old path of reference source node then to the new route of described neighbor node and the source node in first memory cell to described neighbor node, if the cost of new route is less than old path, then new route is put into described first memory cell and second memory cell, left out old path simultaneously.
3. the method for Path selection in the ASON is characterized in that, may further comprise the steps:
(a) adopt basic dijkstra's algorithm, calculate by first shortest path of source node to destination node;
(b), and all the forward link costs on described first shortest path are added big constant with all the reverse link cost negates on described first shortest path;
(c) adopt following steps to calculate second shortest path:
(c1) first memory cell and second memory cell are emptied, and source node is put into first memory cell;
(c2) node and the respective path with respect to source node path cost minimum in first memory cell put into second memory cell;
(c3) be destination node as if described node with respect to source node path cost minimum, then execution in step (c4) is not a destination node as if described node with respect to source node path cost minimum, then
(c31) whether the neighbor node of judging described node with respect to source node path cost minimum successively satisfies constraints;
(c32) if the neighbor node that satisfies constraints neither in first memory cell, also not in second memory cell, is then put into first memory cell with described neighbor node;
(c33) if the neighbor node that satisfies constraints in first memory cell, then the reference source node if the cost of new route is then put into new route described first memory cell less than old path, is left out old path to new, the old path of described neighbor node simultaneously;
(c34) if satisfy the neighbor node of constraints in second memory cell, when described neighbor node is not positioned at by source node to the shortest path of described node with respect to source node path cost minimum, the corresponding old path of reference source node then to the new route of described neighbor node and the source node in first memory cell to described neighbor node, if the cost of new route is less than old path, then new route is put into described first memory cell and second memory cell, left out old path simultaneously;
(c4) judge whether first memory cell is empty;
(c5) if the first memory cell non-NULL then returns step (c2); If described first memory cell be empty, then judge destination node whether in second memory cell, in second memory cell, then the path in second memory cell is exactly second shortest path as if destination node;
(d) on deletion described first shortest path and second shortest path corresponding to the minus strand road cost part of second shortest path;
(e) the residue link of described first shortest path of merging and second shortest path obtains two by the path of source node to destination node;
(f) recover link cost, recomputate the path cost of described two paths, as the first final shortest path, an other paths is as the second final shortest path with the less path of path cost.
4. the method for Path selection is characterized in that in the ASON according to claim 3, and described step (c34) may further comprise the steps:
(c341) judge whether described neighbor node is positioned at by source node to the shortest path of described node with respect to source node path cost minimum;
(c342) if described neighbor node is positioned at by source node to the shortest path of described node with respect to source node path cost minimum, then abandon the new route of source node to described neighbor node;
(c343) if described neighbor node is not positioned at by source node to the shortest path of described node with respect to source node path cost minimum, the corresponding old path of reference source node then to the new route of described neighbor node and the source node in first memory cell to described neighbor node, if the cost of new route is less than old path, then new route is put into described first memory cell and second memory cell, left out old path simultaneously.
5. the method for Path selection in the ASON according to claim 3, it is characterized in that, step (d) also comprises judges whether the described second shortest path uplink cost has available bandwidth more than the constraints twice greater than the link of described big constant, if the described second shortest path uplink cost does not have available bandwidth more than the constraints twice greater than the link of described big constant, then there are not two feasible paths in the current network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100333104A CN100396040C (en) | 2005-02-22 | 2005-02-22 | Method of path selecting in intelligent optical network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100333104A CN100396040C (en) | 2005-02-22 | 2005-02-22 | Method of path selecting in intelligent optical network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1825820A CN1825820A (en) | 2006-08-30 |
| CN100396040C true CN100396040C (en) | 2008-06-18 |
Family
ID=36936278
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100333104A Expired - Fee Related CN100396040C (en) | 2005-02-22 | 2005-02-22 | Method of path selecting in intelligent optical network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100396040C (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101262297B (en) * | 2007-03-08 | 2012-04-25 | 华为技术有限公司 | Method and device for configuring device in wave division multiplexing WDM network |
| CN101459469B (en) * | 2007-12-14 | 2012-06-27 | 华为技术有限公司 | Optical layer scheduling method for network element and network management control system |
| JP5108956B2 (en) * | 2008-11-19 | 2012-12-26 | 日本電信電話株式会社 | Route calculation order determination method, program, and calculation apparatus |
| CN101448296B (en) * | 2009-01-04 | 2010-11-10 | 华为技术有限公司 | Distributed network topology control method and node thereof |
| CN102088413B (en) * | 2011-03-02 | 2012-07-04 | 华为技术有限公司 | Network flow shunting method, network node and network system |
| EP2750337B1 (en) * | 2011-09-20 | 2017-03-29 | Huawei Technologies Co., Ltd. | Service cross-layer separated path calculation method, device and communication system |
| CN103051533B (en) * | 2011-10-11 | 2017-09-12 | 中兴通讯股份有限公司 | A kind of band protects the route computing method and device of business |
| CN103051537B (en) * | 2012-12-17 | 2015-10-14 | 广东省电信规划设计院有限公司 | IP Circuit Service transmission dispatching method and system |
| WO2017067590A1 (en) | 2015-10-21 | 2017-04-27 | Huawei Technologies Co., Ltd. | Constrained disjoint path computation |
| CN108199955B (en) * | 2016-12-08 | 2021-11-12 | 中兴通讯股份有限公司 | Route establishing method and device |
| CN108183856B (en) * | 2016-12-08 | 2021-10-15 | 中兴通讯股份有限公司 | Route establishing method and device |
| CN108337174B (en) * | 2017-12-27 | 2020-10-23 | 瑞斯康达科技发展股份有限公司 | Method and device for searching end-to-end service route of transmission network and storage medium |
| CN110611620B (en) * | 2019-09-29 | 2021-11-05 | 新华三信息安全技术有限公司 | Link updating method and device |
| CN115442293B (en) * | 2022-08-27 | 2023-06-06 | 武汉烽火技术服务有限公司 | Path finding method, device, equipment and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6762997B1 (en) * | 2000-03-29 | 2004-07-13 | Lucent Technologies Inc. | Method for finding shortest network routing paths subject to system constraints |
| CN1529518A (en) * | 2002-08-30 | 2004-09-15 | ���Ͽع�����˾ | Constraint-based shortest path first method for dynamically switched optical transport networks |
| EP1460808A2 (en) * | 2003-03-19 | 2004-09-22 | Alcatel | Inter-Domain constraint-based shortest path first technique for supporting hierarchical routing in interconnected multi-domain optical transport networks |
| CN1567747A (en) * | 2003-06-13 | 2005-01-19 | 港湾网络有限公司 | A method for computing best route of multiple constraints service in optical network |
-
2005
- 2005-02-22 CN CNB2005100333104A patent/CN100396040C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6762997B1 (en) * | 2000-03-29 | 2004-07-13 | Lucent Technologies Inc. | Method for finding shortest network routing paths subject to system constraints |
| CN1529518A (en) * | 2002-08-30 | 2004-09-15 | ���Ͽع�����˾ | Constraint-based shortest path first method for dynamically switched optical transport networks |
| EP1460808A2 (en) * | 2003-03-19 | 2004-09-22 | Alcatel | Inter-Domain constraint-based shortest path first technique for supporting hierarchical routing in interconnected multi-domain optical transport networks |
| CN1567747A (en) * | 2003-06-13 | 2005-01-19 | 港湾网络有限公司 | A method for computing best route of multiple constraints service in optical network |
Non-Patent Citations (2)
| Title |
|---|
| 改进的Dijkstra算法在GIS路径规划中的应用. 李宁宁，刘玉树.计算机与现代化，第9期. 2004 |
| 改进的Dijkstra算法在GIS路径规划中的应用. 李宁宁，刘玉树.计算机与现代化，第9期. 2004 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1825820A (en) | 2006-08-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100396040C (en) | Method of path selecting in intelligent optical network | |
| CN101313528B (en) | Multi-domain route computation method and system | |
| US7283741B2 (en) | Optical reroutable redundancy scheme | |
| CN101471853B (en) | Route calculation method, unit and system | |
| Mohan et al. | Lightpath restoration in WDM optical networks | |
| US7860392B2 (en) | Optical network topology databases based on a set of connectivity constraints | |
| US8059528B2 (en) | Method of estimating restoration capacity in a network | |
| US7500013B2 (en) | Calculation of link-detour paths in mesh networks | |
| US7406032B2 (en) | Bandwidth management for MPLS fast rerouting | |
| US6282170B1 (en) | Network restoration routing optimization | |
| US5615254A (en) | Methods and systems for dynamic routing in a switched comunication network | |
| US20040004938A1 (en) | Routing bandwidth guaranteed paths with local restoration in label switched networks | |
| US8958691B2 (en) | Method and system for providing fault recovery using composite transport groups | |
| CN1783785A (en) | Restoration in a telecommunication network | |
| CN1571390A (en) | Virtual private network fault tolerance | |
| JP4837765B2 (en) | Resource management and recursive route calculation method and apparatus necessary for multi-tier resource transfer network route calculation | |
| CN101610433A (en) | The multi-constraint condition routing selection method that a kind of support policy is resolved | |
| JP3826181B2 (en) | Telecommunications system | |
| US7414985B1 (en) | Link aggregation | |
| JP5869041B2 (en) | Method for mapping network topology request to physical network, computer program product, mobile communication system, and network configuration platform | |
| Chu et al. | A study of lightpath rerouting schemes in wavelength-routed WDM networks | |
| US20040247317A1 (en) | Method and apparatus for a network database in an optical network | |
| CN1859049B (en) | Method for obtaining optimum shared protective path | |
| Tang et al. | Ocbridge: An efficient topology reconfiguration strategy in optical data center network | |
| CN101753450A (en) | Method for joint optimization of resources in three-layered network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080618 Termination date: 20170222 |