CN106100882B - A kind of construction method of the network fault diagnosis model based on flow value - Google Patents
A kind of construction method of the network fault diagnosis model based on flow value Download PDFInfo
- Publication number
- CN106100882B CN106100882B CN201610416606.2A CN201610416606A CN106100882B CN 106100882 B CN106100882 B CN 106100882B CN 201610416606 A CN201610416606 A CN 201610416606A CN 106100882 B CN106100882 B CN 106100882B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- network
- flow value
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The construction method of the invention discloses a kind of network fault diagnosis model based on flow value, the flow transmission mode of the construction method analog network of the network fault diagnosis based on flow value, node state is divided thinner, using corresponding acquisition station choosing method and congested node, malfunctioning node location algorithm, even if congestion point and fault point under the premise of choosing less website in positioning network.The flow transmission mode of network fault diagnosis modeling network of the invention, it is more realistic by the thinner of node state division；The network model newly constructed proposes corresponding acquisition station Algorithms of Selecting and congested node, malfunctioning node location algorithm；The location efficiency in monitoring path is improved through the invention, even if experiment simulation proves that the present invention still can accurately and efficiently position congestion point and the fault point in network under the premise of choosing less website.
Description
Technical field
The invention belongs to network failure management technical field more particularly to a kind of network fault diagnosis moulds based on flow value
The construction method of type.
Background technique
Fault diagnosis, a core direction of network failure management are to infer to lose from some failure signs observed
One process of the precise reason why lost.Fault diagnosis is generally divided into two steps: malfunction monitoring and fault location.With computer
Network has become network manager in e-commerce, electronic communication, the extensive use of web service etc., fault diagnosis
A vital task, a large amount of research focus is gathered in this, produces a large amount of fault diagnosis technologies.However, since system becomes
It must become increasingly complex and provide many new functions, the requirement to fault location technology is also constantly changing therewith.Although
Effort through being there is these to study, the fault location technology of network are still one and open very promising study a question.
Detection method is a kind of processing method end to end, reaches deduction by sending detection information packet into network positively
The purpose of networking component health degree.Detection information is obtaining end-to-end information, for example, delay, handling capacity, loss, path can
It is widely used with situation etc..Existing fault diagnosis technology is mainly focused on discovery and positions the failure in network
The state of node or link is generally divided into two classes by node or faulty link, these methods: health or failure.For example,
Maitreya Natu, Adarshpal S.Sethi etc. send detectable signal discovery by the detective path selected into network
Disconnected link is to achieve the purpose that fault point；P é ter Babarczi, Pin-Han Ho etc. is equally by link point
Health and failure are respectively indicated for 0 and 1 two states, path (monitoring trail) is monitored by deployment, is obtained all
Possible chain circuit alarming code table, the single link failure of network can quickly be positioned by comparing alarm code, and to adapt to different nets
Network structure；And the method by constructing Bayesian network, the faulty link group of IP network is inferred with probabilistic manner.
However the transmission quantity of information and data is often huge in network, the health status of each node, processing and biography
The ability of defeated information is irregular.Certain nodes such as hardware aging or failure due to various reasons, when information to be treated
Beyond its processing capacity, information will congestion, congested node can undoubtedly drag the transmission speed of slow network.And the appearance of congested node
It often influences whether surrounding neighbor node again, the mode of a kind of " infection " is presented.Therefore only by node or chain k-path partition
It is inadequate for health and failure two states.How quickly positioning and handling these congested nodes and be one is highly desirable to solve
Certainly the problem of.Fault diagnosis is detected by end-to-end transmission detectable signal, is by active transmission in a network
Detect the health status to infer network components.Detection is test assignment, and the success of test is dependent on the network components detected
Health status.Detection is used to be counted end to end, such as delay, handling capacity, Loss Rate and route availability.Citing comes
It says, detection can be regarded as a ping to collect about Connectivity information.More complicated detection be a series of sizes not
Same detection packet is collected about total bandwidth or the information of available bandwidth.For special server, detected about fault diagnosis
HTTP request be can be to collect the statistical information of response time.Expected end is obtained in addition to generating flow between Chosen Point
To the statistics at end, detection also provides other advantages.Detection is very clever in terms of detection flow design in terms of meeting special measurement
It is living.For example, positioning ad hoc network point failure by average retardation amount on test path and Loss Rate size, can send preferably
Detection is to identify bottleneck and available bandwidth, or goes estimation background traffic.The other application of detection is by Detection location bottleneck
Node and further send it is special detection go further diagnose fault occur the reason of.
The acquisition station quantity of existing method is more, and fault diagnosis rate is lower.
Summary of the invention
The construction method of the purpose of the present invention is to provide a kind of network fault diagnosis model based on flow value, it is intended to solve
Certainly the acquisition station quantity of existing method is more, the lower problem of fault diagnosis rate.
The invention is realized in this way a kind of construction method of the network fault diagnosis model based on flow value, the base
In the flow transmission mode of the construction method analog network of the network fault diagnosis of flow value, node state is divided it is thinner,
Using corresponding acquisition station choosing method and congested node, malfunctioning node location algorithm, even if before choosing less website
Put the congestion point in positioning network and fault point.
Further, the network fault diagnosis model based on flow value construction method the following steps are included:
Step 1 constructs the network topological diagram of connection；
Step 2, initialization, the flow value being randomly assigned to each node between 0 to 0.5；
Step 3 randomly selects certain node, the flow value of node is increased certain value, flow value is greater than specified threshold
For 0.8 node as preliminary congested node, the node that flow value increases to 1 is considered as fault point；
Step 4 simulates the infection characteristic of congested node, and the peripherad neighbor node of congested node transmits flow value, and will
Flow value is greater than the node of specified threshold as newly-increased congested node；
Step 5, newly-increased congested node continue to influence the neighbor node of oneself, transmit additional flow value, repeat this mistake
Journey.
Further, the choosing method of the acquisition station includes:
Input: network G=(V, E), maximum probe station number MAXpssize, failure points MAXfaults；
Output: detection tiny node collection PS；
Number of network node N=| V |, shaded nodes collection SN=V,
It selects the maximum node i of degree as first monitoring station PS=PS ∪ i, updates shaded nodes and monitoring path；
Further, available monitoring path generating method includes:
Input: network G=(V, E), acquisition station point set PS；
Output: monitoring path Ap can be used；
Further, described as follows to the detection method of remaining measuring point to be checked:
Input: available path Ap, point set Nn to be detected；
Output: the monitoring path Sp of detection can be used；
The unknown point set of point set Un, Un that can not be detected；
Step 0.While
Step 1. is to each vi∈ Nn is found out by degree of covering least v in path in Nnmin, covered if there is no path
Cover viThen increase viInto Un, Nn=Nn-vmin, turn step 0；
Step 2. is in every pathj∈ Ap and covering vminIn, find out the longest path in pathmax, pathmaxIncrease to
In Sp；
Step 3.Ap=Ap-pathmax, Nn=Nn-vmin.
Further, the congestion point includes: with fault point positioning method
Input: available path Ap, point set Nn to be detected；
Output: the monitoring path Sp for detection；
The point set Un (unknown point set) that can not be detected；
Step 0.While
Step 1. is to each vi∈ Nn is found out by degree of covering least v in path in Nnmin, covered if there is no path
Cover viThen increase viInto Un, Nn=Nn-vmin, turn step 0；
Step 2. is in every pathj∈ Ap and covering vminIn, find out the longest path in pathmax, increase pathmaxTo Sp
In；
Step 3.AP=AP-pathmax, Nn=Nn-vmin.
The construction method of network fault diagnosis model provided by the invention based on flow value, the flow transmission of analog network
Mode, it is more realistic by the thinner of node state division；The network model newly constructed proposes corresponding acquisition station and chooses calculation
Method and congested node, malfunctioning node location algorithm；Prove that the present invention has higher fault diagnosis precision by experiment simulation, shortly
Make still can accurately and efficiently position congestion point and the fault point in network under the premise of choosing less website；Failure is examined
Disconnected is the process of detection failure, by from the failure symptom observed come the cause of positioning failure；Since computer network is in electricity
Sub- commercial affairs, telecommuting, network service, mesh services etc. are widely used, fault diagnosis for network administrator
Through becoming a vital task.In addition, development key application performance improvement, service quality importance increase,
The development of large-scale complicated system so that failure quick detection and separation visiting for robustness, reliability and system
Asking property is vital.
Detailed description of the invention
Fig. 1 is the construction method flow chart of the network fault diagnosis model provided in an embodiment of the present invention based on flow value.
Fig. 2 is the topological diagram diagram of the network fault diagnosis model provided in an embodiment of the present invention based on flow value.
Fig. 3 is influence schematic diagram of the different site location selections provided in an embodiment of the present invention to monitoring result.
Fig. 4 is the monitoring path schematic diagram provided in an embodiment of the present invention generated by website 1.
Fig. 5 is deletion provided in an embodiment of the present invention unnecessary monitoring path schematic diagram.
Fig. 6 is the path schematic diagram provided in an embodiment of the present invention for needing additionally to choose.
Fig. 7 is diagnostic process flow chart provided in an embodiment of the present invention.
Fig. 8 is diagnosis provided in an embodiment of the present invention and non-diagnosis analysis schematic diagram；
In figure: (a) the diagnosis when difference of fault point；(b) non-diagnosis when the difference of fault point；(c) average degree is not examined simultaneously
Disconnected rate；(d) non-diagnosis when average degree difference；(e) diagnosis when network size difference；(f) it is not diagnosed when network size difference
Rate.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to
Limit the present invention.
Application principle of the invention is explained in detail with reference to the accompanying drawing.
As shown in Figure 1, the construction method of the network fault diagnosis model based on flow value of the embodiment of the present invention include with
Lower step:
S101: the network topological diagram of connection is constructed；
S102: initialization, the flow value being randomly assigned to each node between 0 to 0.5；
S103: randomly selecting certain node, the flow value of node is increased certain value, flow value is greater than specified threshold
For the node of (taking 0.8) as preliminary congested node, the node that flow value increases to 1, which is considered as fault point, (no longer has transmission energy
Power)；
S104: simulating the infection characteristic of congested node, and the peripherad neighbor node of congested node transmits flow value, and will stream
Magnitude is greater than the node of specified threshold as newly-increased congested node；
S105: newly-increased congested node continues the neighbor node of influence (infection) oneself, and additional flow is transmitted to them
Value repeats this process.
Application principle of the invention is further described combined with specific embodiments below.
1, the invention proposes a kind of network model based on flow, the data-transmission modes of analog network.First to every
A node distributes corresponding flow value, and flow value is classified as congested node beyond the node for formulating range, " is infected to simulate
Mode " congestion point, which can will transmit certain flow to its neighbor node, increases its flow value, and the new congestion point of generation repeats to follow
Ring above procedure.After the completion of model construction, a kind of Algorithms of Selecting of acquisition station and the detective path for fault location are proposed
Algorithms of Selecting positions the congested node in network.The algorithm proved by experiment simulation can be before choosing less acquisition station
Put the congested node being accurately located in network.
Current invention assumes that 1) fixed route pattern, along the fixed defeated information in path between any two node.Do not consider standby
With path, malfunctioning node if it exists between path does not consider new transmission path.2) only consider the state or event of nodes
Barrier, link state and failure problems follow-up study in.3) failure of monitoring station is not considered.In fact, working as some node
When being selected as monitoring station, if the node is that malfunctioning node can directly repair it.
Net definitions are the non-directed graph G (V, E) of a connection by the network model building based on flow value, and V indicates network
Node collection, E indicate link set, however it is original research mostly by node or link be simply classified as health or two kinds of failure
Generally indicated with 0,1, and actual conditions are far from this way, for example have the processing capacity of many nodes to weaken, hardware aging, flow
The health degree that congestion, software fault etc. can lead to node is affected but is unlikely to not working.The present invention will construct
The node of these flow congestions is known as congested node by the network model based on flow, and the presence of congestion point not only makes network
Service quality and transmittability be affected, and due to lead to these nodes data information smooth can not transmit, they
The processing task of neighbor node become weight, health degree also will receive certain influence.Make congestion point that there is certain " infection " property,
As shown in Fig. 2, congested node 1 causes the transmission pressure of surrounding neighbours point 2,3,4,5 to increase.In order to simulate this situation, this hair
The degree of the health of node is divided into more detailed situation based on flow value by bright network model.Each node starts have 0 to 1
Between flow value, reflect the health status of node.Two class nodes needs are found: 1, (flow value is greater than certain congested node
Threshold value).2, malfunctioning node.
Building process is as follows: 1) network topological diagram of building connection.2) it initializes, is randomly assigned 0 to 0.5 to each node
Between flow value.3) certain node is randomly selected, the flow value of node is increased into certain value, flow value, which is greater than, formulates threshold value
As preliminary congested node, the node that flow value increases to 1 is considered as fault point (no longer to be had and passes the node of (present invention takes 0.8)
Movement Capabilities).4) the infection characteristic of congested node is simulated, the peripherad neighbor node of congested node transmits flow value, and by flow
Value is greater than the node of specified threshold as newly-increased congested node.5) newly-increased congested node continues the neighbour of influence (infection) oneself
Node is occupied, additional flow value is transmitted to them, repeats this process.
According to the network model of design, due to the infection ability of congested node, the congested node number finally generated can be big
In congested node number initially set, however specific congested node number is unknown, and in reality the case where is often also
So.Even in this case.Corresponding website Selection Strategy and fault location algorithm proposed by the present invention, still may be used
Efficiently and accurately to position congested node present in network and malfunctioning node.
2, acquisition station Selection Strategy
In detection method, in order to obtain the information of the introductory path between node, need to be disposed in a network for sending out
Send the acquisition station of detection packet and to acquisite approachs information.According to theorem, when in network there are when k malfunctioning node, to guarantee network
In the health status of each node can be detected, 1) it is detection site that each node, which must satisfy one of following two condition,
Neighbor node (can be directly monitored).Or 2) the independent monitoring path of k item existed to the node.Therefore, failure in network
The number of node directly affects the placement number of detection site.In view of the situation that detection site number is limited, each
The monitoring capability of acquisition station will receive the influence of website installation position, and monitoring path pair can be improved in appropriate website installation position
The coverage rate of network, and inappropriate website installation position will lead to shaded nodes (can not be monitored the node that station monitors)
In the presence of, as shown in figure 3,1,5 when being website can fault point 3, and the failure of 5,3 nodes 2 when being website cause 1 state without
Method is known.For the cost for maximizing the coverage rate to network, minimizing deployment and maintenance, the distribution deployment of acquisition station needs to fight
The considerations of omiting property.The thought of heuristic greedy algorithm SNR, algorithm are that gradually choosing can be such that shadow spots in network reduce at most
Website.Algorithm assumes the number of maximum fault point present in known network, but it is practical when can not often determine a of fault point
Number.Algorithm is intended to reach monitoring rate absolutely, however need not dispose sufficient amount of website sometimes also can obtain preferably
Monitoring rate.Furthermore in the case where not selecting enough detection sites, the website of the every step of SNR algorithm chooses mode and non-optimal plan
Slightly.Certain improvement is done to SNR algorithm for the network model of building, each iteration selection can bring at most newly-increased monitoring path
Website.
Pseudocode is as follows:
It is initialized first, is the non-directed graph G=(V, E) of a connection, all node original states by net definitions
It is shadow spots SN=V, acquisition station point set is empty setFirst assume in network there are small number of malfunctioning node,
It will lead in this way and select less acquisition station, however experiment simulation proves that reality but can still obtain higher fault diagnosis
Rate.Select the maximum node of degree as first detection site, because most monitoring roads can be provided by instinctively doing so
Diameter.Subsequent algorithm successively calculates the new monitoring number of passes that can be provided when selecting each remaining node as monitoring station, and
Select to be capable of providing the nodes at most new monitoring paths as new website, each iteration of algorithm select a new website until
There is no shaded nodes presence or website number to reach preset maximum optional website number in network.
3, monitoring coordinates measurement can be used
Website selection is completed, and can send corresponding detection information from other nodes of website into network, is formed available
It monitors path (according to shortest path first), such as Fig. 5, there are 1-2,1-2-3,1-2-4,1- in the available monitoring path that website 1 generates
5,1-5-6,1-5-7,1-5-7-8.The case where considering fixed route, the monitoring path of website to each node only has one.So
And some monitoring paths are then unnecessary.Unnecessary monitoring path is deleted from available path, not going can using them
It is spent with effectively less detection, increases efficiency.In Fig. 4, the monitoring path by website to leaf node can be only used completely
1-2-3,1-2-4,1-5-6,1-5-7-8.In addition, if including that other detection sites are also deleted in a paths, by
A monitoring path can be generated to node 5 in website 1, however this path is extra, because including another monitoring in path
Website 3, therefore, the monitoring path can be replaced completely by 1 to 2,3 to 5.Therefore by the monitoring path comprising other monitoring stations
Leave out from available monitoring path.It can be as follows with monitoring coordinates measurement algorithm:
4, congestion point and localization of fault
(1) in order to which network is accurately positioned the problem of link or node, need to summarize and research and application path obtain
Monitoring information.After detection site selection is completed, corresponding monitoring road can all be generated by website to other nodes in network
Diameter, these paths constitute a monitoring tree, are sent on this available path of monitoring information from website into these monitoring paths
The relevant information such as flows of some nodes, processing delay, packet drop etc., but the presence meeting of malfunctioning node is so that this path
On fault point after the health status of node can not know that therefore additional monitoring path needs to continue to be sent to network
In.As shown in fig. 6, in monitoring path 1 to 3, there are fault points 2 to cause 3 state that can not obtain, and needs to continue along path 7 to 3,
Or 6 to 3 send monitoring information.It selects biggish network load can be caused to spend to all monitoring path transmission detection information packets
And it is often unnecessary.However the monitoring path deficiency of selection may result in the congestion point (or fault point) that can not be positioned
Excessive situation, diagnosis reduce.For the capaciated flow network model of building, using reasonable monitoring routing strategy, detection
The flow information for the node that path is passed through improves monitoring path utilization rate.The malfunctioning node in network can be not only positioned, may be used also
Quick and precisely to position the node that flow value exceeds a prescribed threshold value --- it is known as congested node.Algorithm steps are as follows:
Path selection is monitored, the monitoring path of the one group first current state for monitoring network needs to be selected.Firstly,
All node initializings are measuring point to be checked in addition to website.For convenience of explanation, the relationship square in monitoring a path and node is established
System of battle formations A.Table 1, row indicate monitoring path, and column indicate that node, A (i, j)=1 indicate monitoring path i overlay node j.It can pay attention to
It is only covered to certain nodes (node 1) by a small amount of monitoring path, therefore at least to select (a path from these paths
C), in remaining node 2,3,4 to be detected (5 are covered by C), node 2 can be covered by least monitoring path, be selected in next step
The path (A and B) of energy overlay node 2, B can cover more nodes, therefore B is better choice.The iteration above process is straight
Into network, arbitrary node is at least covered by a monitoring path.If node cannot be covered by any monitoring path, call it as
Unknown point, and deleted from measuring point to be checked.The step pseudocode is as follows.
Table 1
(2) after detective path is selected, each node that corresponding detection information will be sent in network by these paths.Path warp
The state (being flow value in the present invention) for the node crossed then is acquired, however the presence of malfunctioning node will lead to failure on path
The state of node after point can not be acquired, i.e., remaining node to be detected.
(3) in order to obtain the state that these are put, step is executed again to remaining measuring point to be checked and remaining detective path
1.Repeatedly until point set to be detected is empty set or no available detective path.Algorithm stops.The basic procedure of algorithm is such as
Fig. 7.
For what is generated in step (1), it cannot be acquired the unknown point set of state, (or be sky since its range is smaller
Collection), it is detected one by one, congestion point and fault point in network can be accurately positioned in conjunction with the congestion point set being diagnosed to be.
Application effect of the invention is explained in detail below with reference to emulation.
The present invention uses malfunction monitoring rate Pc=Nf/|Vf|, and rate P is not monitoredu=Nu/ | V | the calculation of two criterions
Method.NfFor the congested node number detected, | Vf| it is the congestion point number of physical presence, NuFor the section of Status unknown in network
Point number.In the network of different average degrees, different monitoring station numbers, the different feelings of initial congestion node number are selected
The algorithm executed under condition obtains analogous diagram.Use Matlab as emulation tool, analogous diagram is derived from the average value of ten experiments.Figure
8 (a), it is 20 that (b), which is respectively number of nodes, and when network average degree is 3, initial congestion number of nodes is corresponding when being respectively 3,6,9 to be examined
The result figure of disconnected rate and non-diagnosis.The available very high diagnosis of algorithm and lower non-diagnosis that can be seen that.Value
It is to be noted that there are when 6 initial congestion points, according to the infection mechanism of congestion point, the congestion point in network will be greater than 6, and
They can be accurately positioned when choosing 3 websites at this time.If being required when initial congestion point is 3,6,9 according to SNR algorithm,
At least need 3,6,9 monitoring stations that could position all fault points in network respectively.Even and if being chosen according to algorithm in website
Diagnosis just has reached high value when seldom.When initial congestion point is 9, since congestion point number will be greater than infection mode at this time
9, even so, 4 website diagnosis are chosen just already close to 0.9, and unknown point proportion is only 0.05.Unknown state section
It not only include the congestion point not being diagnosed to be in point, it is also possible to lead to the normal section of Status unknown comprising the presence due to fault point
Point.In conjunction with non-diagnosis node collection, the range of remaining congestion point position is substantially reduced, can further be examined one by one
It looks into.Fig. 8 (c), (d) are the asynchronous diagnosis of network average degree and non-diagnosis situation, it can be seen that with network average degree
Increasing diagnosis can increase accordingly, and non-diagnosis can reduce, because the biggish network of average degree is in the identical Shi Nengti of website number
For more can be used monitoring path to improve monitoring efficiency.And Fig. 8 (e), (f) are for the diagnosis under heterogeneous networks scale and not
Diagnosis comparison.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Made any modifications, equivalent replacements, and improvements etc., should all be included in the protection scope of the present invention within mind and principle.
Claims (4)
1. a kind of construction method of the network fault diagnosis model based on flow value, which is characterized in that described based on flow value
The flow transmission mode of the construction method analog network of network fault diagnosis, by the thinner of node state division, using corresponding
Acquisition station choosing method and congested node, malfunctioning node location algorithm, under the premise of choosing less website in positioning network
Congestion point and fault point；
The construction method of the network fault diagnosis model based on flow value the following steps are included:
Step 1 constructs the network topological diagram of connection；
Step 2, initialization, the flow value being randomly assigned to each node between 0 to 0.5；
Step 3 randomly selects node, and the flow value of node is increased, and flow value is greater than the node of specified threshold 0.8 as just
The congested node of step, the node that flow value increases to 1 are considered as fault point；
Step 4, simulates the infection characteristic of congested node, and the peripherad neighbor node of congested node transmits flow value, and by flow
Value is greater than the node of specified threshold as newly-increased congested node；
Step 5, newly-increased congested node continue to influence the neighbor node of oneself, transmit additional flow value, repeat this process；
The choosing method of the acquisition station includes:
Input: network G=(V, E), maximum probe station number MAXpssize, failure points MAXfaults；
Output: detection tiny node collection PS；
Number of network node N=| V |, shaded nodes collection SN=V,
It selects the maximum node i of degree as first monitoring station PS=PS ∪ i, updates shaded nodes and monitoring path；
while
The each node i ∈ V of For andIt calculatesiThe new independent pathway P (i) to other shadow spots that can increase；
End
Selection can generate the point c of maximum P (c), and as next acquisition station, PS=PS ∪ c updates shaded nodes and monitoring path；
If | PS |=MAXpssize Break；
End。
2. the construction method of the network fault diagnosis model based on flow value as described in claim 1, which is characterized in that available
Monitoring path generating method include:
Input: network G=(V, E), acquisition station point set PS；
Output: monitoring path Ap can be used；
3. the construction method of the network fault diagnosis model based on flow value as described in claim 1, which is characterized in that surplus
The detection method of remaining measuring point to be checked is as follows:
Input: available path Ap, point set Nn to be detected；
Output: the monitoring path Sp for detection；
The unknown point set of point set Un, Un that can not be detected；
Step0.While
Step1. to each vi∈ Nn is found out by degree of covering least v in path in Nnmin, v is covered if there is no pathiThen
ViIt is added to Un, Nn=Nn-vmin, turn step0；
Step2. in every pathj∈ Ap and covering vminIn, find out the longest path in pathmax, pathmaxIt is added in Sp；
Step3.Ap=Ap-pathmax；
Nn=Nn-vmin。
4. the construction method of the network fault diagnosis model based on flow value as described in claim 1, which is characterized in that described
Congestion point includes: with fault point positioning method
Input: available path Ap, point set Nn to be detected；
Output: the monitoring path Sp for detection；
The point set Un (unknown point set) that can not be detected；
Step0.While
Step1. to each vi∈ Nn is found out by degree of covering least v in path in Nnmin, v is covered if there is no pathiThen
ViIt is added in Un, Nn=Nn-vmin, turn step0；
Step2. in every pathj∈ Ap and covering vminIn, find out the longest path in pathmax,pathmaxIt is added in Sp；
Step3.Ap=Ap-pathmax；
Nn=Nn-vmin。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610416606.2A CN106100882B (en) | 2016-06-14 | 2016-06-14 | A kind of construction method of the network fault diagnosis model based on flow value |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610416606.2A CN106100882B (en) | 2016-06-14 | 2016-06-14 | A kind of construction method of the network fault diagnosis model based on flow value |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106100882A CN106100882A (en) | 2016-11-09 |
| CN106100882B true CN106100882B (en) | 2019-04-30 |
Family
ID=57846228
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610416606.2A Active CN106100882B (en) | 2016-06-14 | 2016-06-14 | A kind of construction method of the network fault diagnosis model based on flow value |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106100882B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110557275B (en) * | 2019-07-12 | 2020-09-25 | 广东电网有限责任公司 | Electric power communication network detection station selection algorithm based on network intrinsic characteristics |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101420331A (en) * | 2008-12-12 | 2009-04-29 | 北京邮电大学 | Fast fault locating method for ultra-long connection in T-MPLS network |
| JP5102804B2 (en) * | 2009-05-12 | 2012-12-19 | 日本電信電話株式会社 | Congestion impact evaluation apparatus, link traffic calculation method and program thereof |
| CN101640622B (en) * | 2009-09-07 | 2012-05-23 | 中兴通讯股份有限公司 | Ethernet ring net protection method and transit node |
| CN104054076B (en) * | 2013-01-14 | 2017-11-17 | 华为技术有限公司 | Date storage method, database purchase node failure processing method and processing device |
-
2016
- 2016-06-14 CN CN201610416606.2A patent/CN106100882B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN106100882A (en) | 2016-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102112981B (en) | Distribution of virtual machines in a communication network | |
| CN107682195B (en) | Communication network robustness evaluation method based on combination of complex network and big data | |
| CN113411221B (en) | Power communication network fault simulation verification method, device, equipment and storage medium | |
| CN104270268A (en) | Network performance analysis and fault diagnosis method of distributed system | |
| CN109067592A (en) | A kind of intelligent control device and management-control method for matching electricity consumption towards intelligence | |
| CN102684902B (en) | Based on the network failure locating method of probe prediction | |
| CN108933694A (en) | Data center network Fault Node Diagnosis method and system based on testing data | |
| Sitanayah et al. | Fault-tolerant relay deployment based on length-constrained connectivity and rerouting centrality in wireless sensor networks | |
| CN102404170A (en) | Detection method, device and system of message loss | |
| Ochoa-Aday et al. | Self-healing topology discovery protocol for software-defined networks | |
| Ma et al. | Link scanner: Faulty link detection for wireless sensor networks | |
| CN108156004A (en) | SDN controllers and switch management method | |
| CN107800624A (en) | A kind of optimal circuitous path selection new method of regional protection key message | |
| CN107947988A (en) | A kind of Real Time Communication Network analogue system | |
| Al Mtawa et al. | Migrating from legacy to software defined networks: A network reliability perspective | |
| CN110557275B (en) | Electric power communication network detection station selection algorithm based on network intrinsic characteristics | |
| Zafar et al. | A hybrid fault diagnosis architecture for wireless sensor networks | |
| Bermudez et al. | On the infiniband subnet discovery process | |
| CN106100882B (en) | A kind of construction method of the network fault diagnosis model based on flow value | |
| CN110113262A (en) | A kind of routing policy determines method, apparatus, SDN controller and heterogeneous network | |
| Tri et al. | Locating deteriorated links by network-assisted multicast proving on OpenFlow networks | |
| Bermúdez et al. | Evaluation of a subnet management mechanism for infiniband networks | |
| Tayal et al. | Traffic dynamics-aware probe selection for fault detection in networks | |
| Saihi et al. | A real time centralized fault detection application in wireless sensor networks | |
| Ciulla et al. | Damage detection via shortest-path network sampling |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |