CN101924697B - Two-way startup recovery method based on link back backtracking strategy - Google Patents
Two-way startup recovery method based on link back backtracking strategy Download PDFInfo
- Publication number
- CN101924697B CN101924697B CN2010102143444A CN201010214344A CN101924697B CN 101924697 B CN101924697 B CN 101924697B CN 2010102143444 A CN2010102143444 A CN 2010102143444A CN 201010214344 A CN201010214344 A CN 201010214344A CN 101924697 B CN101924697 B CN 101924697B
- Authority
- CN
- China
- Prior art keywords
- node
- breakpoint
- route
- search
- reverse
- 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
- Telephonic Communication Services (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a method based on a link back backtracking strategy, and in particular provides a two-way startup backtracking method, which comprises the steps of: when a network has trouble, searching a new path to a public node of an upstream node by a faulty downstream node while searching a new path to a downstream node of a faulty node by an upstream node of a faulty node; if the two situations can not search a new path, searching a new path to a next node of the downstream node by the upstream node; and searching a new path to the public node of the upstream node by the next node, and so forth until a new path is searched. The invention is improved on the basis of the link back backtracking strategy, so as to firstly ensure that a path of a destination node is found without tracing back to the source node and relating to all nodes on the original route so that the original route path is effectively utilized and the problem that the backtracking strategy can not backtrack the condition that adjacent nodes simultaneously go wrong is solved and the upstream node and the downstream node simultaneously start for searching the path, thereby greatly reducing the time of searching the route.
Description
Technical field
The present invention relates to based on the link back backtracking strategy method; A kind of two-way startup recovery technology has been proposed especially; Be exactly that the forward node starts the path between forerunner's node that searching route and reverse node start reverse search forward node, two search are carried out simultaneously, under the prerequisite of rationally utilizing the link-recovery recovery policy; Solved this strategy and can not recover adjacent two simultaneous situation of node failure, and shortened recovery time greatly through two-way startup recovery.
Background technology
Network is divided into different aspects, and each layer provides relatively independent recovery technology usually, and the recovery technology of IP layer, photosphere (WDM layer) is a survivability technology important in the network.In the IP layer, IP/MPLS can recover the multiple faults business, and the operation granularity to business is also very little simultaneously.Photosphere recovers to have that particle complex is thick, the protection resume speed is fast, and multiple cost is low, and reliability is high, and is efficient, high these characteristics of transparency.
Optical-fiber network is made up of node and link usually,, according to different modes, Restoration Mechanism has different classification, have according to the control mode branch concentrated, distributed, these three kinds of subregions.Have based on link according to the heavy-route mode, based on passage, segmentation recovers three kinds.According to resource reservation mode branch the recovery of sharing and rerouting recovering are arranged.
If the recovery means based on link are compared with the recovery means based on passage. owing to only relate to the link at malfunctioning node two ends. implement comparatively simple. but the selected new route of recovery policy that is based on link possibly not be current best route. what is more important. the upstream node of malfunctioning node can not find a new path (have only a link to be connected to upstream node like certain node. in addition, node is independent with whole network) arrive the downstream node of malfunctioning node. then can declare obstruction.In addition. this algorithm is difficult to handle the situation of multinode fault.Defective to above recovery policy.A kind of new recovery policy one link back backtracking strategy has been proposed.
The drawback that can not handle when link back backtracking strategy exists adjacent two nodes to break down simultaneously again also has long characteristics recovery time.Propose two-way startup recovery on this basis, not only solved this drawback, also reduced recovery time greatly.
Summary of the invention
The object of the present invention is to provide a quick recovery policy of optical-fiber network; On recovery time, study; Improving basically of original link back backtracking strategy; Can not carry out the recovery after adjacent node breaks down thereby solved original strategy, and also be significantly improved aspect recovery time.
This method particular content is following:
Restoration path is by the new path of search between near the node the fault, link road by, search for restoration path simultaneously, concrete steps by fault upstream node and downstream node:
1, breakpoint search: begin from source node, press network failure routed path search before takes place, find out the forward breakpoint that the back original route takes place network failure, and the record source node is to the routing iinformation between the upstream node of breakpoint; Begin from destination node, press the routed path reverse search before network failure takes place, find out the reverse breakpoint that the back original route takes place network failure, and write down reverse breakpoint downstream node to the routing iinformation between the destination node;
2, route search between breakpoint: preceding route restriction condition takes place according to network failure; Between the downstream node of the upstream node of forward breakpoint and reverse breakpoint, search for; Carry out reverse search between forerunner's node of downstream node and upstream node at the same time; If can search out a routed path in both cases; Just deletion forwards step 3 to behind the useless node in original routing iinformation, otherwise the upstream node of search forward breakpoint is to the route between the rear-guard node of the downstream node of reverse breakpoint, at the same time by the route between forerunner's node of the upstream node of this rear-guard node searching forward breakpoint; As searching out route, just in original routing iinformation, forward step 3 to behind the useless node of deletion; If can not search for the routed path that makes new advances; That just leaves out the upstream node and the downstream node information of breakpoint in original routing iinformation; That is to say these two nodes as new forward breakpoint and reverse breakpoint, again according to top step repetition route search, up to finding new routed path;
3, link road by: connect source node to the route the forward breakpoint, route and reverse breakpoint between two breakpoints to the route the destination node, the completion business recovery.
Further, in the said step 1,, arrive the routing iinformation of destination node to the downstream node of the routing iinformation between the malfunctioning node upstream node and this malfunctioning node with regard to only needing the record source node if a breakpoint just takes place.
Because algorithm utilizes original route, thus when business recovery, the route between two breakpoints, source node to the route between the forward breakpoint and oppositely breakpoint can not intersect to the route between the destination node.Above the content discussion be to connect route recovery end to end, can adopt same algorithm and same step to carry out route recovery for the business ring that destroys in the network.
Description of drawings
Fig. 1 is a method step flow chart of the present invention.
Fig. 2 is that the practical implementation simulation drawing takes place and recovers fault.
Embodiment
As shown in Figure 1, particular content of the present invention is following:
Restoration path is by the new path of search between near the node the fault, link road by, search for restoration path simultaneously, concrete steps by fault upstream node and downstream node:
1, breakpoint search: begin from source node, press network failure routed path search before takes place, find out the forward breakpoint that the back original route takes place network failure, and the record source node is to the routing iinformation between the upstream node of breakpoint; Begin from destination node, press the routed path reverse search before network failure takes place, find out the reverse breakpoint that the back original route takes place network failure, and write down reverse breakpoint downstream node to the routing iinformation between the destination node; If a breakpoint just takes place, arrive the routing iinformation of destination node to the downstream node of the routing iinformation between the malfunctioning node upstream node and this malfunctioning node with regard to only needing the record source node.
2, route search between breakpoint: preceding route restriction condition takes place according to network failure; Between the downstream node of the upstream node of forward breakpoint and reverse breakpoint, search for; Carry out reverse search between forerunner's node of downstream node and upstream node at the same time; If can search out a routed path in both cases; Just deletion forwards step 3 to behind the useless node in original routing iinformation, otherwise the upstream node of search forward breakpoint is to the route between the rear-guard node of the downstream node of reverse breakpoint, at the same time by the route between forerunner's node of the upstream node of this rear-guard node searching forward breakpoint; As searching out route, just in original routing iinformation, forward step 3 to behind the useless node of deletion; If can not search for the routed path that makes new advances; That just leaves out the upstream node and the downstream node information of breakpoint in original routing iinformation; That is to say these two nodes as new forward breakpoint and reverse breakpoint, again according to top step repetition route search, up to finding new routed path;
3, link road by: connect source node to the route the forward breakpoint, route and reverse breakpoint between two breakpoints to the route the destination node, the completion business recovery.
State like Fig. 2: what describe among the figure is a kind of adjacent two simultaneous situation of node.Recovery process is following:
1, from source node 1 beginning,, searches breakpoint 6 from the forward lookup breakpoint; Route between the upstream node of source node and breakpoint is 1-2-3-4-5; From destination node 11 reverse search breakpoints, search breakpoint 7, the downstream node of reverse breakpoint is to the route 8-9-10-11 between the destination node.
2, search between the downstream node 8 of the upstream node 5 of forward breakpoint and reverse breakpoint, downstream node 8 reverse searches are to the path of forerunner's node of upstream node 5 in search, and two all can not search out a connection routed path.
3, search between the rear-guard node 9 of node 5 and node 8, in search, rear-guard node 9 reverse searches are to forerunner's node of node 5, and two can not search out one and be communicated with routed path.
4, in route 1-2-3-4-5, remove node 5, in route 8-9-10-11, remove node 8, just put node 5 and be the forward direction breakpoint, put node 8 and be reverse breakpoint.
5, searching route between the rear-guard node 10 of the upstream node 4 of node 5 and node 9, at the same time, node 10 oppositely searches out the path between forerunner's node of node 4, searches out reverse route 10-14-13-12-3, and the forward route is 3-12-13-14.
6, link road is by 1-2-3, and 3-12-13-14-10 and 10-11 form new route and be connected 1-2-3-12-13-14-10-11 and be and recover to connect.
Claims (2)
1. two-way startup recovery method based on link back backtracking strategy is characterized in that:
Restoration path is by the new path of search between near the node the fault, link road by, search for restoration path simultaneously, concrete steps by fault upstream node and downstream node:
1.1 breakpoint search: begin from source node, press network failure routed path search before takes place, find out the forward breakpoint that the back original route takes place network failure, and the record source node is to the routing iinformation between the upstream node of breakpoint; Begin from destination node, press the routed path reverse search before network failure takes place, find out the reverse breakpoint that the back original route takes place network failure, and write down reverse breakpoint downstream node to the routing iinformation between the destination node;
1.2 route search between breakpoint: preceding route restriction condition takes place according to network failure; Between the downstream node of the upstream node of forward breakpoint and reverse breakpoint, search for; Carry out reverse search between forerunner's node of downstream node and upstream node at the same time; If can search out a routed path in both cases; Just deletion forwards step 1.3 to behind the useless node in original routing iinformation, otherwise the upstream node of search forward breakpoint is to the route between the rear-guard node of the downstream node of reverse breakpoint, at the same time by the route between forerunner's node of the upstream node of this rear-guard node searching forward breakpoint; As searching out route, just in original routing iinformation, forward step 1.3 to behind the useless node of deletion; If can not search for the routed path that makes new advances; That just leaves out the upstream node and the downstream node information of breakpoint in original routing iinformation; That is to say these two nodes as new forward breakpoint and reverse breakpoint, again according to top step repetition route search, up to finding new routed path;
1.3 link road by: connect source node to the route the forward breakpoint, route and reverse breakpoint between two breakpoints to the route the destination node, the completion business recovery.
2. a kind of two-way startup recovery method according to claim 1 based on link back backtracking strategy; It is characterized in that: in the said step 1.1; If a breakpoint just takes place, arrive the routing iinformation of destination node to the downstream node of the routing iinformation between the malfunctioning node upstream node and this malfunctioning node with regard to only needing the record source node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102143444A CN101924697B (en) | 2010-06-30 | 2010-06-30 | Two-way startup recovery method based on link back backtracking strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102143444A CN101924697B (en) | 2010-06-30 | 2010-06-30 | Two-way startup recovery method based on link back backtracking strategy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101924697A CN101924697A (en) | 2010-12-22 |
| CN101924697B true CN101924697B (en) | 2012-07-11 |
Family
ID=43339352
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102143444A Expired - Fee Related CN101924697B (en) | 2010-06-30 | 2010-06-30 | Two-way startup recovery method based on link back backtracking strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101924697B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103560952B (en) * | 2013-10-14 | 2017-01-11 | 广州捷能电力科技有限公司 | Node failure recovery method for micro network |
| CN104579725B (en) * | 2013-10-15 | 2018-03-23 | 中国移动通信集团江苏有限公司 | One kind route traversal search method and device |
| CN106341320A (en) * | 2015-07-10 | 2017-01-18 | 中兴通讯股份有限公司 | Business backtracking method and device |
| CN105704021B (en) * | 2016-01-22 | 2019-04-12 | 中国人民解放军国防科学技术大学 | A kind of heavy route method based on elastic label |
| CN108289031B (en) * | 2017-01-09 | 2021-06-22 | 中国移动通信集团河北有限公司 | Home broadband network fault diagnosis method and device |
| CN113365165B (en) * | 2021-06-22 | 2022-07-08 | 烽火通信科技股份有限公司 | Method and equipment for dynamically switching transport network rerouting service |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009088819A1 (en) * | 2007-12-31 | 2009-07-16 | Schneider Automation Inc. | Method and apparatus for transparent auto-recovery in chain and ring networks |
| CN101534234A (en) * | 2009-04-20 | 2009-09-16 | 杭州华三通信技术有限公司 | Interworking Ethernet ring network protection method and system |
| CN101753397A (en) * | 2010-01-29 | 2010-06-23 | 上海埃德电子股份有限公司 | System, method and device for rapidly self-healing Ethernet ring |
-
2010
- 2010-06-30 CN CN2010102143444A patent/CN101924697B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009088819A1 (en) * | 2007-12-31 | 2009-07-16 | Schneider Automation Inc. | Method and apparatus for transparent auto-recovery in chain and ring networks |
| CN101534234A (en) * | 2009-04-20 | 2009-09-16 | 杭州华三通信技术有限公司 | Interworking Ethernet ring network protection method and system |
| CN101753397A (en) * | 2010-01-29 | 2010-06-23 | 上海埃德电子股份有限公司 | System, method and device for rapidly self-healing Ethernet ring |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101924697A (en) | 2010-12-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101924697B (en) | Two-way startup recovery method based on link back backtracking strategy | |
| US6904018B2 (en) | Method for high speed rerouting in multi protocol label switching network | |
| US8705373B2 (en) | Apparatus and method for packet forwarding | |
| CN103380605B (en) | The MPLS of LDP is used to re-route method and the NE of LDP-FRR fast | |
| CN101436976B (en) | Method, system and equipment for forwarding data frame | |
| CN101164260B (en) | Method of processing channel fault in automatic exchange optical network | |
| CN101999223B (en) | Reducing traffic loss in an EAPS system | |
| CN102377607B (en) | Data transmission method and data transmission device for special two-layer virtual network | |
| CN101431466B (en) | Fast rerouting method and label exchange router | |
| CN102088387B (en) | Tunnel protection method and device of ring network | |
| EP2748986B1 (en) | Method and apparatus for path switching | |
| WO2010020146A1 (en) | Correlative protection method, device and system for flux engineering channel | |
| CN103067274A (en) | Spanning tree back-up port quick recovery method and device | |
| CN101499960B (en) | Method and apparatus for flow path switching | |
| CN102315967A (en) | Intermediate node protection method for multicast label switched path and device | |
| CN101247354A (en) | Method for fast recovering heavy route aiming at T-MPLS network multicast | |
| CN101192959B (en) | A recovery method for multicast service connection in automatic switching optical network | |
| CN101848159B (en) | Three-layer VPN route resetting method and device | |
| CN102740175A (en) | Method for protecting and recovering cross-domain end-to-end label switched path | |
| CN106572012A (en) | VPN FRR implementation method and PE equipment | |
| CN101192956A (en) | A computing method for multicast tree of automatic switching optical network multicast service | |
| CN102571616A (en) | Methods for combining and separating tunnels, tunnel association device and router | |
| CN104717143A (en) | Method and equipment for many-one reducibility scene multicast data transmission | |
| WO2012129907A1 (en) | Method and device for implementing multi-protection overlapped protection groups | |
| CN103404091B (en) | Service protecting method, equipment and system |
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 |
Granted publication date: 20120711 Termination date: 20150630 |
|
| EXPY | Termination of patent right or utility model |