CN100413258C - Pre-alarming method - Google Patents
Pre-alarming method Download PDFInfo
- Publication number
- CN100413258C CN100413258C CNB200610000647XA CN200610000647A CN100413258C CN 100413258 C CN100413258 C CN 100413258C CN B200610000647X A CNB200610000647X A CN B200610000647XA CN 200610000647 A CN200610000647 A CN 200610000647A CN 100413258 C CN100413258 C CN 100413258C
- Authority
- CN
- China
- Prior art keywords
- path
- aij
- primary path
- network
- backup path
- 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 pre-alarming method which comprises the steps that a collection of spare paths related by main paths among all nodes of the current networks and a collection of main paths incapable of being protected among all the nodes are obtained by a fault simulation method. When the networks are changed, only the main paths and the spare paths affected by the change of the networks are modified, and the connection of spare paths related by main paths among all nodes of the current networks and the collection of main paths incapable of being protected among all the nodes are renewed. The collection of main paths incapable of being protected among all the nodes after renewal is sent to users, and the adoption of measures are decided by the users.
Description
Technical field
The present invention relates to the guard method of communication technique field, especially relate to a kind of method for early warning of network protection inadequate resource.
Background technology
Link in grid (Mesh) network typically refers to the entity circuit that is present between the communication point, as connecting the optical fiber of network; Main dedicated bandwidth is meant the bandwidth resources that are used for transmission communication information in the entity circuit, and protection bandwidth is meant the bandwidth resources of reserving in the entity circuit that are used to protect main dedicated bandwidth, abbreviates resource conservation as.
Primary path is meant the label switched path end to end (LSP) of having set up in the main dedicated bandwidth and having had the recovery and protection ability, hereinafter to be referred as the path; Network failure is meant the situation of network failure, typically refers to fiber failure (disconnected fine) or equipment fault; Backup path is meant the path of setting up that is used for communicating when network breaks down in protection bandwidth, to recover the communication of primary path.
Resource conservation in the network is present in the network with the form in standby path, and can share to a plurality of links.Share the main feature of Mesh network protection and heavy-route protection and shared resource conservation exactly, improved resource utilization.But along with the frequent variations of the complicated and network of network, the user can't know whether network also has enough resource conservations.If the resource conservation deficiency, when network broke down, some resource conservations were occupied, and the primary path of part of links just no longer has protected ability.
Therefore need provide a kind of method, can carry out early warning to whether enough resource conservations are arranged in the network, to not carrying out record by protected primary path, the prompting user handles.
Existing technical scheme is: the utilization emulation tool, at the beginning of network design, resource is planned.Generally be in Mesh network organizing process, cook up the teleservice path of customer requirements earlier, be primary path, require the planning protection resource according to the user then.Having planned after the resource emulation tool of user's general using off-line checks whether enough resource conservations are arranged, place's link failure is simulated, is the primary path planning protection resource of its influence then; When emulation, consider the huge profit problem of resource conservation; also consider the situation of two place's link simultaneous faultss; simulate two place's link failures simultaneously, be respectively the primary path planning protection resource that influences after two place's link failures then, promptly can realize planning resource conservation.
The operation that emulation is carried out is the measuring and calculating that resource conservation was simulated and carried out to fault, is the disconnected fibre of simulation and checks the network use that whether has after enough resource conservations offer disconnected fibre.This method mainly is to use in earlier stage in networking, and as when the network design or during the network planning, shortcoming is the precomputation that can't provide real-time.When network changes, such as an once disconnected fibre or user newly-built business etc. in the resource conservation of original planning, then need again the whole network to be carried out fault simulation, check whether enough resource conservations are arranged.
The shortcoming of prior art is:
1. be mainly used in the planning of backup path, in network design, use morely, the function of real-time update after the network change is not provided;
2. the method calculated of the disconnected fibre in simulation two places of Cai Yonging is very complicated, need take a lot of resources, and is very big for the workload of large complicated its emulation of network;
3. when network breaks down, can not handle in real time, need again the protect networks resource to be calculated, take a large amount of resources simultaneously and expend a large amount of workloads.
Summary of the invention
At above the deficiencies in the prior art; the objective of the invention is to; a kind of method is provided; can be when network changes; only primary path and the backup path to the network change influence carries out fault simulation; upgrade corresponding primary path and backup path information, find that fast whether network has enough resource conservations, in time provides early warning to the user.
For realizing this purpose, the present invention is a kind of method for early warning, comprises step:
(1) by the method for fault simulation obtain the related backup path of primary path between all nodes of current network the set ∑ Aij (x)-＞{ Pix, Pxx, set ∑ that can not protected primary path between Pxj}} and all nodes Unprotected-Aij (x, y) };
(2) when network changes, only revise primary path Aij and the backup path Pij that influenced by network change, upgrade the related backup path of primary path between all nodes the set ∑ Aij (x)-＞{ Pix, Pxx, set ∑ that can not protected primary path between Pxj}} and all nodes Unprotected-Aij (x, y) };
(3) set ∑ that can not protected primary path between all nodes after upgrading in the step (2) { Unprotected-Aij (x, y) } is sent to the user, and take which kind of measure by user's decision.
Step (1) also comprises: the set ∑ Aij (x) of the in esse primary path between all nodes that obtain current network according to the topology information and the user configuration information of current network and the set ∑ Pij (x) of backup path.
Step (1) further comprises step:
(1.1) link between 2 of the ij of simulation is the fault point, obtains the backup path that related to after primary path lost efficacy, promptly obtain Aij (x)-＞{ Pix, Pxx, Pxj}};
(1.2) according to Aij (x)-＞Pix, Pxx, the corresponding relation of Ai j and Pij among the Pxj}}, obtain Pij (x)-＞{ Aix, Axx, Axj}};
(1.3) for there not being enough backup paths in the primary path, provide concrete Aij and can not protected primary path bandwidth number, promptly obtain Unprotected-Aij (x, y) };
(1.4) whether inquiry all carried out fault simulation to all fault points in the network, if do not travel through all fault points then be back to step (1.1), from newly beginning a flow process fault simulation was carried out in the fault point of not simulating the network;
(1.5) simulate the set ∑ that obtains the related backup path of primary path between all nodes behind all fault points Aij (x)-＞{ Pix; Pxx; set ∑ that can not protected primary path between Pxj}} and all nodes Unprotected-Aij (x, y) }.
Step (2) further comprises step:
(2.1) upgrade the primary path between the node that network change relates to and the information of backup path, the primary path that finds all influenced by network change;
(2.2) again the primary path that influenced by network change is carried out fault simulation, draws its backup path information, and upgrade successively Aij (x)-＞Pix, Pxx, Pxj}, write down simultaneously Unprotected-Aij (x, y);
(2.3) in conjunction with original information in the network, the ∑ that output is upgraded Aij (x)-＞{ Pix, Pxx; Pxj}}, corresponding renewal ∑ Pij (x)-＞{ Aix, Axx; Axj}}, upgrade simultaneously between all nodes can not protected primary path information set ∑ { Unprotected-Aij (x, y) }.
Step (2.1) further comprises step:
(2.1.1) amount of bandwidth with primary path in the inefficacy link and backup path is updated to zero;
(2.1.2) according to Pij (x)-＞Aix, Axx, the corresponding relation of Axj}, after searching in the inefficacy link backup path and losing efficacy, the primary path Aix that shares this backup path of influence, Axx, Axj information;
(2.1.3) according to Aij (x)-＞{ corresponding relation of Pxj} is searched primary path in the inefficacy link shared backup path Pix in back that lost efficacy, Pxx, Pxj information for Pix, Pxx;
(2.1.4) upgrade Pix, Pxx, the ix at Pxj place, xx, backup path Pix in the xj link, Pxx, Pxj amount of bandwidth and primary path Aix, Axx, Axj amount of bandwidth;
(2.1.5) ix after upgrading in the finding step (2.1.4) successively, xx, backup path Pix in the xj link, Pxx, the primary path that Pxj influenced, promptly according to ∑ Pij (x)-＞{ Aix, Axx, Axj}} set, search successively and share this backup path Pix, Pxx, the primary path of Pxj;
(2.1.6) result who operates according to step (2.1.1), (2.1.4), primary path and backup path information after the renewal network change in the network.
Step (2.2) further comprises step:
(2.2.1) reach (2.1.5) result of operation, the primary path of network change influence is reaffirmed the backup path that it is corresponding according to step (2.1.2), (2.1.4);
(2.2.2) according to updated information in the step (2.2.1), upgrade Aij (x)-＞Pix, Pxx, Pxj} information, and record can not protected primary path information Unprotected-Aij (x, y).
Fault simulation described in step (1) and the step (2) comprises carries out fault simulation and/or simultaneously two places or fault point, many places is carried out fault simulation the Dan Chu fault point.
Describedly simultaneously fault simulation is carried out in two places or fault point, many places and comprises step:
(A) link between the simulation ij node is the fault point, obtains the backup path information after Aij lost efficacy;
(B) on step (A) basis, another fault point is simulated, remaining backup path in the network is distributed to the primary path that current fault point influences, the corresponding backup path information of obtaining after losing efficacy in fault point, two places;
(C) repeating step (A), (B) obtain the backup path information after losing efficacy simultaneously in the fault point, many places.
Fault simulation described in step (1) and the step (2) can refine to each label switched path on the link.
Fault simulation described in step (1) and the step (2) is considered the shared risk link, the primary path that will belong to same risk link all is set to related with backup path, when carrying out the fault simulation of a certain primary path, consider that there are situation about losing efficacy simultaneously in the primary path of same risk link and backup path.
This method also comprises: the failure risk of primary path as weights, is carried out classification to the warning level of network protection resource.Described failure risk comprises failure probability, the availability of link.
The beneficial effect of method of the present invention is:
1, by the method acquisition primary path of fault simulation and the corresponding relation between the backup path, when network changes, only need carry out fault simulation to the primary path and the backup path of network change influence, upgrade corresponding primary path and backup path information, find fast whether network has enough resource conservations, in time provides early warning to the user;
When network changes, do not need again the new topological structure of the whole network to be carried out fault simulation, and the link that only network change is influenced carries out fault simulation, significantly reduces the workload of fault simulation.
2, during fault simulation, actual routing algorithm and the related constraint rule must coupling system supported, the backup path that actual recovery policy adopted in the time of guaranteeing like this that fault simulation and network are actual and break down is consistent, ensures its accuracy.
Description of drawings
Fig. 1 is the schematic diagram of the related symbol in a kind of method for early warning of the present invention.
Embodiment
Method of the present invention is: utilize the method acquisition primary path of fault simulation and the corresponding relation between the backup path; when network changes; only need carry out fault simulation to the primary path and the backup path of network change influence; upgrade corresponding primary path and backup path information; find fast whether network has enough resource conservations, in time provides early warning to the user.
Employed related symbol explanation in the method for the present invention:
∑ Aij (x): the set of the in esse primary path between all nodes;
∑ Pij (x): the set of the in esse backup path between all nodes;
∑ Aij (x)-＞{ Pix, Pxx, Pxj}}: the set of the related backup path of primary path between all nodes;
∑ Pij (x)-＞Aix, Axx, Axj}}: the backup path between all nodes the set of primary path of corresponding protection;
∑ { Unprotected-Aij (x; y) }: set that can not protected primary path between all nodes; wherein x is the amount of bandwidth of the primary path of Aij; y be can not protected primary path in this x primary path amount of bandwidth, this information is the network protection resource early warning information of exporting in the method for the present invention.
Fig. 1 is the schematic diagram of the related symbol in a kind of method for early warning of the present invention, above-mentioned parameter obtain and implication is:
The primary path of supposing three links is A12 (3), A13 (1), A23 (3);
Backup path is P12 (2), P13 (4), P23 (3).
Obtaining the link 12 corresponding resource conservations in back of losing efficacy by fault simulation is backup paths on link 13 and 23, the corresponding relation that is primary path A12 (3) and its backup path be A12 (3)-＞{ P13, P23};
7 primary paths supposing link 14 can only find 4 backup paths at most, and then other 3 primary paths can't be protected, and this early warning information should be recorded as Unprotected-A14 (7,3).
The concrete implementation step of method of the present invention is:
Wherein, fault simulation and obtain the backup path informational needs and observe following rule:
When single backup path is not enough, can select other reachable paths, all backup paths that relate to must all be included in the backup path set.
The realization of step 2 can be specific as follows:
Link between 2 of the s2.1 simulation ij is the fault point, obtains the backup path that related to after primary path lost efficacy, promptly obtain Aij (x)-＞{ Pix, Pxx, Pxj}};
The S2.2 basis Aij (x)-＞Pix, and Pxx, the corresponding relation of Aij and Pij among the Pxj}}, obtain Pij (x)-＞{ Aix, Axx, Axj}};
S2.3 is not for there being enough backup paths in the primary path, provide concrete Aij and can not protected primary path bandwidth number, promptly obtain Unprotected-Aij (x, y) };
Whether s2.4 inquiry all carried out fault simulation to all fault points in the network, if do not travel through all fault points then be back to s2.1, from newly beginning a flow process fault simulation was carried out in the fault point of not simulating the network;
S2.5 simulate the set ∑ that obtains the related backup path of primary path between all nodes behind all fault points Aij (x)-＞{ Pix; Pxx; set ∑ that can not protected primary path between Pxj}} and all nodes Unprotected-Aij (x, y) }.
Set ∑ that can not protected primary path between all above-mentioned nodes { Unprotected-Aij (x, y) } be the network protection resource early warning information in the current network, this early warning information is sent to the user, and take which kind of measure by user's decision.
Foregoing description is respectively fault simulation to be carried out in the Dan Chu fault point; and obtain corresponding primary path and its backup path corresponding relation and can not protected primary path information; observing fault simulation and obtaining under the prerequisite of backup path rule information; also can carry out fault simulation to two places or fault point, many places simultaneously, its method is the stack of method that single fault point is simulated:
Link between the s2.1.1 simulation ij node is the fault point, obtains the backup path information after Aij lost efficacy;
S2.1.2 simulates another fault point on step s2.1.1 basis, and remaining backup path in the network is distributed to the primary path that current fault point influences, the corresponding backup path information of obtaining after losing efficacy in fault point, two places;
S2.1.3 repeating step s2.1.1, s2.1.2 can obtain the backup path information after losing efficacy simultaneously in the fault point, many places.
For the simulation of two places or fault point, many places, generally be to consider some shared risk links (SLRG), the perhaps very large link of failure probability, the choosing and plan by the user and determine with application scenarios according to demand of these links.
The user can obtain the corresponding relation of primary path and backup path by the method for above-mentioned fault simulation, also can adopt additive method to obtain the corresponding relation of primary path and backup path, determine the corresponding relation of primary path and backup path etc. as user oneself.
Primary path and backup path information between the node that s3.1 renewal network change relates to, the primary path that finds all influenced by network change;
S3.2 carries out fault simulation to the primary path that influenced by network change again, draws its backup path information, and upgrade successively Aij (x)-＞Pix, Pxx, Pxj}, write down simultaneously Unprotected-Aij (x, y);
S3.3 is in conjunction with original information in the network, the ∑ that output is upgraded Aij (x)-＞{ Pix, Pxx; Pxj}}, corresponding renewal ∑ Pij (x)-＞{ Aix, Axx; Axj}}, upgrade simultaneously between all nodes can not protected primary path information set ∑ { Unprotected-Aij (x, y) }.
Network changes, mainly be meant the disconnected fibre of network or increase primary path that business etc. causes newly and situation that backup path changes, it interrupts fibre and has the greatest impact, also common, to be example be described further the information updating flow process of primary path and backup path in the link failure that causes with disconnected fibre below:
The influence that can cause network after 2 link failures of i j is embodied in two aspects: 1. after 2 link failures of ij, the primary path of 2 links of ij and backup path lost efficacy, because the backup path in the network is to share to give a plurality of links, for the primary path of other links of sharing this link backup path, the also corresponding minimizing of its backup path; 2.ij the primary path of 2 links switched to its backup path after losing efficacy, and caused this backup path occupied, this backup path no longer has protective capability.
After 2 link failures of ij, the step of above-mentioned steps three can further be refined as:
S3.1 further comprises:
S3.1.1 in should the inefficacy link primary path and the amount of bandwidth of backup path be updated to zero;
S3.1.2 according to Pij (x)-＞Aix, Axx, the corresponding relation of Axj}, after searching in this inefficacy link backup path and losing efficacy, the primary path Aix that shares this backup path of influence, Axx, Axj information;
S3.1.3 according to Aij (x)-＞{ corresponding relation of Pxj} is searched primary path in this link shared backup path Pix in back that lost efficacy, Pxx, Pxj information for Pix, Pxx;
The above-mentioned Pix of s3.1.4, Pxx, the ix at Pxj place, xx, in the xj link, a part of backup path changes primary path into, therefore, ix, xx, primary path amount of bandwidth and backup path amount of bandwidth all have respective change in the xj link, need to upgrade ix, xx, backup path Pix in the xj link, Pxx, Pxj amount of bandwidth and primary path Aix, Axx, the Axj amount of bandwidth;
S3.1.5 searches the ix after upgrading among the s3.1.4, xx, backup path Pix in the xj link, Pxx successively, the primary path that Pxj influenced, promptly according to ∑ Pij (x)-＞{ Aix, Axx, Axj}} set, search successively and share this backup path Pix, Pxx, the primary path of Pxj;
S3.1.6 is according to s3.1.1, and the result of s3.1.4 operation upgrades primary path and backup path information in the network after the network change.
S3.2 further comprises:
S3.2.1 is according to s3.1.2, and s3.1.4, and the result of s3.1.5 operation reaffirm the backup path that it is corresponding to the primary path of network change influence;
S3.2.2 is according to updated information among the s3.2.1, upgrade Aij (x)-＞Pix, Pxx, Pxj} information, and record can not protected primary path information Unprotected-Aij (x, y).
S3.3 is:
S3.3.1 is in conjunction with original information in the network, the ∑ after output is upgraded Aij (x)-＞Pix, Pxx, Pxj}} information and ∑ { Unprotected-Aij (x, y) } information.
The present invention supports that also when causing network to change owing to other reasons, the renewal of primary path and backup path information can be adopted above-mentioned similar flow process equally.
Set ∑ { Unprotected-Aij (x that can not protected primary path information between all nodes after the renewal of obtaining according to step 3; y) }; be the network protection resource early warning information after the network change; this early warning information is sent to the user; which kind of and take measure, thereby realize providing early warning to the network protection inadequate resource by user decision.
Above-mentioned description for primary path and backup path is based on that link between the node makes, method of the present invention can be expanded and refinement, be not only the link between two nodes is carried out fault simulation, and can carry out fault simulation to each label switched path (LSP) on the link, pre-alerting ability is refine to the LSP level by link level.
Method of the present invention can as weights, be carried out classification to the warning level of network protection resource with the failure risk of primary path (as indexs such as the failure probability of link, availabilities).
Failure simulation method among the present invention is also considered the shared risk link, the primary path that will belong to same risk link all is set to related with backup path, like this when carrying out the fault simulation of a certain primary path, consider that there are situation about losing efficacy simultaneously in the primary path of same risk link and backup path, its method is similar with the processing method that two places or fault point, many places are simulated.
The beneficial effect of method of the present invention is:
1, by the method acquisition primary path of fault simulation and the corresponding relation between the backup path, when network changes, only need carry out fault simulation to the primary path and the backup path of network change influence, upgrade corresponding primary path and backup path information, find fast whether network has enough resource conservations, in time provides early warning to the user;
When network changes, do not need again the new topological structure of the whole network to be carried out the network failure simulation, and the link that only network change is influenced carries out fault simulation, significantly reduces the workload of fault simulation.
2, during fault simulation, actual routing algorithm and the related constraint rule must coupling system supported, the backup path that actual recovery policy adopted in the time of guaranteeing like this that fault simulation and network are actual and break down is consistent, ensures its accuracy.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can easily expect or replacement all should be contained within protection scope of the present invention.
Claims (12)
1. a method for early warning is characterized in that, comprises step:
(1) by the method for fault simulation obtain the related backup path of primary path between all nodes of current network the set ∑ Aij (x)-＞{ Pix, Pxx, set ∑ that can not protected primary path between Pxj}} and all nodes Unprotected-Aij (x, y) };
(2) when network changes, only revise primary path Aij and the backup path Pij that influenced by network change, upgrade the related backup path of primary path between all nodes the set ∑ Aij (x)-＞{ Pix, Pxx, set ∑ that can not protected primary path between Pxj}} and all nodes Unprotected-Aij (x, y) };
(3) set ∑ that can not protected primary path between all nodes after upgrading in the step (2) { Unprotected-Aij (x, y) } is sent to the user, and take which kind of measure by user's decision.
2. the method for claim 1, it is characterized in that: step (1) also comprises: the set ∑ Aij (x) of the in esse primary path between all nodes that obtain current network according to the topology information and the user configuration information of current network and the set ∑ Pij (x) of backup path.
3. the method for claim 1, it is characterized in that: step (1) further comprises step:
(1.1) link between 2 of the ij of simulation is the fault point, obtains the backup path that related to after primary path lost efficacy, promptly obtain Aij (x)-＞{ Pix, Pxx, Pxj}};
(1.2) according to Aij (x)-＞Pix, Pxx, the corresponding relation of Aij and Pij among the Pxj}}, obtain Pij (x)-＞{ Aix, Axx, Axj}};
(1.3) for there not being enough backup paths in the primary path, provide concrete Aij and can not protected primary path bandwidth number, promptly obtain Unprotected-Aij (x, y) };
(1.4) whether inquiry all carried out fault simulation to all fault points in the network, if do not travel through all fault points then be back to step (1.1), restarts a flow process fault simulation is carried out in the fault point of not simulating in the network;
(1.5) simulate the set ∑ that obtains the related backup path of primary path between all nodes behind all fault points Aij (x)-＞{ Pix; Pxx; set ∑ that can not protected primary path between Pxj}} and all nodes Unprotected-Aij (x, y) }.
4. the method for claim 1, it is characterized in that: step (2) further comprises step:
(2.1) upgrade the primary path between the node that network change relates to and the information of backup path, the primary path that finds all influenced by network change;
(2.2) again the primary path that influenced by network change is carried out fault simulation, draws its backup path information, and upgrade successively Aij (x)-＞Pix, Pxx, Pxj}, write down simultaneously Unprotected-Aij (x, y);
(2.3) in conjunction with original information in the network, the ∑ that output is upgraded Aij (x)-＞{ Pix, Pxx; Pxj}}, corresponding renewal ∑ Pij (x)-＞{ Aix, Axx; Axj}}, upgrade simultaneously between all nodes can not protected primary path information set ∑ { Unprotected-Aij (x, y) }.
5. method as claimed in claim 4 is characterized in that: step (2.1) further comprises step:
(2.1.1) amount of bandwidth with primary path in the inefficacy link and backup path is updated to zero;
(2.1.2) according to Pij (x)-＞Aix, Axx, the corresponding relation of Axj}, after searching in the inefficacy link backup path and losing efficacy, the primary path Aix that shares this backup path of influence, Axx, Axj information;
(2.1.3) according to Aij (x)-＞{ corresponding relation of Pxj} is searched primary path in the inefficacy link shared backup path Pix in back that lost efficacy, Pxx, Pxj information for Pix, Pxx;
(2.1.4) upgrade Pix, Pxx, the ix at Pxj place, xx, backup path Pix in the xj link, Pxx, Pxj amount of bandwidth and primary path Aix, Axx, Axj amount of bandwidth;
(2.1.5) ix after upgrading in the finding step (2.1.4) successively, xx, backup path Pix in the xj link, Pxx, the primary path that Pxj influenced, promptly according to ∑ Pij (x)-＞{ Aix, Axx, Axj}} set, search successively and share this backup path Pix, Pxx, the primary path of Pxj;
(2.1.6) result who operates according to step (2.1.1), (2.1.4), primary path and backup path information after the renewal network change in the network.
6. method as claimed in claim 5 is characterized in that: step (2.2) further comprises step:
(2.2.1) reach (2.1.5) result of operation, the primary path of network change influence is reaffirmed the backup path that it is corresponding according to step (2.1.2), (2.1.4);
(2.2.2) according to updated information in the step (2.2.1), upgrade Aij (x)-＞Pix, Pxx, Pxj} information, and record can not protected primary path information Unprotected-Aij (x, y).
7. as claim 3 or 4 described methods, it is characterized in that: the fault simulation described in step (1) and the step (2) comprises carries out fault simulation and/or simultaneously two places or fault point, many places is carried out fault simulation the Dan Chu fault point.
8. method as claimed in claim 7 is characterized in that: describedly simultaneously fault simulation is carried out in two places or fault point, many places and comprise step:
(A) link between the simulation ij node is the fault point, obtains the backup path information after Aij lost efficacy;
(B) on step (A) basis, another fault point is simulated, remaining backup path in the network is distributed to the primary path that current fault point influences, the corresponding backup path information of obtaining after losing efficacy in fault point, two places;
(C) repeating step (A), (B) obtain the backup path information after losing efficacy simultaneously in the fault point, many places.
9. as claim 3 or 4 described methods, it is characterized in that: the fault simulation described in step (1) and the step (2) can refine to each label switched path on the link.
10. as claim 3 or 4 described methods, it is characterized in that: the fault simulation described in step (1) and the step (2) is considered the shared risk link, the primary path that will belong to same risk link all is set to related with backup path, when carrying out the fault simulation of a certain primary path, consider that there are situation about losing efficacy simultaneously in the primary path of same risk link and backup path.
11. the method for claim 1 is characterized in that: this method also comprises: the failure risk of primary path as weights, is carried out classification to the warning level of network protection resource.
12. method as claimed in claim 11 is characterized in that: described failure risk comprises failure probability, the availability of link.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200610000647XA CN100413258C (en) | 2006-01-09 | 2006-01-09 | Pre-alarming method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200610000647XA CN100413258C (en) | 2006-01-09 | 2006-01-09 | Pre-alarming method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1852161A CN1852161A (en) | 2006-10-25 |
| CN100413258C true CN100413258C (en) | 2008-08-20 |
Family
ID=37133631
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB200610000647XA Expired - Fee Related CN100413258C (en) | 2006-01-09 | 2006-01-09 | Pre-alarming method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100413258C (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101753283B (en) * | 2008-11-28 | 2014-04-02 | 华为技术有限公司 | Network business reliability determination method, device and system |
| CN101588518B (en) * | 2009-06-29 | 2011-12-28 | 中国移动通信集团广东有限公司肇庆分公司 | Transport network topological structure safety analytical method and implementation system |
| US8659991B2 (en) * | 2010-12-10 | 2014-02-25 | Cisco Technology, Inc. | Minimizing the number of not-via addresses |
| CN109379770B (en) * | 2018-12-11 | 2021-04-06 | 北京百瑞互联技术有限公司 | Method and device for optimizing path auxiliary candidate node of Bluetooth mesh network and node |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1998031159A2 (en) * | 1997-01-09 | 1998-07-16 | At & T Corp. | Mesh network with high restorative capacity |
| CN1379573A (en) * | 2001-04-04 | 2002-11-13 | 阿尔卡塔尔公司 | Quick restoring mechanism and method for determining minimum restoring capacity in transmission net |
| US20030179700A1 (en) * | 1999-01-15 | 2003-09-25 | Saleh Ali Najib | Method for restoring a virtual path in an optical network using 1‘protection |
| CN1469260A (en) * | 2002-06-12 | 2004-01-21 | �ձ�������ʽ���� | Route calculating apparatus wiht switchable route selective standard |
| CN1556637A (en) * | 2003-12-30 | 2004-12-22 | ���ͨ�ſƼ��ɷ�����˾ | Method of proceeding failure recovery using shared spare passage in lattice shape network |
-
2006
- 2006-01-09 CN CNB200610000647XA patent/CN100413258C/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1998031159A2 (en) * | 1997-01-09 | 1998-07-16 | At & T Corp. | Mesh network with high restorative capacity |
| US20030179700A1 (en) * | 1999-01-15 | 2003-09-25 | Saleh Ali Najib | Method for restoring a virtual path in an optical network using 1‘protection |
| CN1379573A (en) * | 2001-04-04 | 2002-11-13 | 阿尔卡塔尔公司 | Quick restoring mechanism and method for determining minimum restoring capacity in transmission net |
| CN1469260A (en) * | 2002-06-12 | 2004-01-21 | �ձ�������ʽ���� | Route calculating apparatus wiht switchable route selective standard |
| CN1556637A (en) * | 2003-12-30 | 2004-12-22 | ���ͨ�ſƼ��ɷ�����˾ | Method of proceeding failure recovery using shared spare passage in lattice shape network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1852161A (en) | 2006-10-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7706284B2 (en) | Link property setting method, route calculating method and system using the same | |
| EP1394984A1 (en) | Method and Apparatus for Network Resource Utilization Assessment | |
| CN112633649A (en) | Power grid multi-attribute important node evaluation and planning method | |
| CN104243196A (en) | Virtual network mapping protection method and system under SDN architecture | |
| CN100413258C (en) | Pre-alarming method | |
| CN102546432B (en) | Method and device for planning packet transmission bearer network capacity | |
| CN103248571A (en) | Computing method of optimal second route | |
| CN103441878B (en) | The ownership processing method of PE equipment and equipment in VCF network | |
| Manzano et al. | Robustness analysis of real network topologies under multiple failure scenarios | |
| CN110011913A (en) | A kind of path calculation method and system | |
| Yazdani et al. | Robustness and vulnerability analysis of water distribution networks using graph theoretic and complex network principles | |
| Tootaghaj et al. | On progressive network recovery from massive failures under uncertainty | |
| Chen et al. | Repair strategy of military communication network based on discrete artificial bee colony algorithm | |
| Konak et al. | Designing survivable resilient networks: a stochastic hybrid genetic algorithm approach | |
| CN109995558A (en) | Failure information processing method, device, equipment and storage medium | |
| CN106789624A (en) | One kind failure route recovery method | |
| CN110519084A (en) | Circuit management method and apparatus for operator's transmission Packet Transport Network | |
| Pan et al. | Modeling and analysis of cascading failures in cyber-physical power systems under different coupling strategies | |
| JP5427964B1 (en) | Path recovery control device and path recovery control program | |
| JP6732927B2 (en) | Housing form searching apparatus, housing form searching method and program | |
| CN101459551B (en) | Method, apparatus for path recovery and path computing unit | |
| CN105119741A (en) | Cloud network reliability measuring method | |
| CN102904806A (en) | Deadlock free fault-tolerant self-adaptation routing method of computer system | |
| CN111324513A (en) | Monitoring management method and system for artificial intelligence development platform | |
| Gardner et al. | Finding geographic vulnerabilities in multilayer networks using reduced network state enumeration |
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: 20080820 Termination date: 20180109 |