CN105871597A - Method and system for fault handling of network single point - Google Patents
Method and system for fault handling of network single point Download PDFInfo
- Publication number
- CN105871597A CN105871597A CN201610183639.7A CN201610183639A CN105871597A CN 105871597 A CN105871597 A CN 105871597A CN 201610183639 A CN201610183639 A CN 201610183639A CN 105871597 A CN105871597 A CN 105871597A
- Authority
- CN
- China
- Prior art keywords
- point
- network
- connected graph
- network single
- distance
- 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.)
- Pending
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/06—Management of faults, events, alarms or notifications
- H04L41/0677—Localisation of faults
-
- 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/0631—Management of faults, events, alarms or notifications using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis
- H04L41/065—Management of faults, events, alarms or notifications using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis involving logical or physical relationship, e.g. grouping and hierarchies
-
- 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/12—Discovery or management of network topologies
Abstract
The invention provides a method for fault handling of a network signal point. The method comprises the following steps: forming real connecting graphs according to each network single point for the network connection; determining a valid connecting graph from the real connecting graphs based on the distance between the network single points; in the valid connecting graph, searching a cut point in the valid connecting graph according to the relationship whether presence or absence of each single point is related to the adding of the connecting branches formed in the valid connecting graph or not; using the network single point corresponding to the cut point as a fault checking object, and performing the fault handling. The invention further provides a system for fault handling of the network single point. The complex fault node handling operation in the network can be converted into the operation of intuitively searching the cut point in the connecting graph, and then the fault node corresponding to the cut point is handled and operated, the interference to the fault field is reduced, the operation is simple and convenient, the time is saved, the maintenance cost is reduced and the reliability of the fault judgment is high.
Description
Technical field
The present embodiments relate to communication technical field, particularly relate to the method and system of a kind of troubleshooting to network single-point.
Background technology
Along with the fast development of network technology, the quantity of network single-point (including but not limited to the equipment such as microcomputer, server, mobile phone, panel computer, router) presents the situation of sharp increase.Network Single Point of Faliure may affect being in communication with each other between other single-point in network.
At present, each network single-point is generally periodically detected, to find fault single-point by people.Or after being in communication with each other and going wrong, then trouble-shooting single-point one by one.After finding fault single-point, then this Trouble ticket point is keeped in repair or changes.
Existing technical scheme is all after node goes wrong in a network, and passive finds concrete fault single-point to fault in-situ, then this Trouble ticket point is keeped in repair and changed.Trouble-shooting single-point complex operation the most one by one, causes large effect, and failture evacuation accuracy rate is low, maintenance and inspection time-consumingly long, maintenance cost height people's routine office work life.
Summary of the invention
The embodiment of the present invention provides the method and system of a kind of troubleshooting to network single-point, in order to solve in prior art trouble-shooting single-point complex operation one by one, people's routine office work life is caused large effect, and the problem such as failture evacuation accuracy rate is low, maintenance and inspection are time-consumingly long and maintenance cost is high.
The embodiment of the present invention provides a kind of method of troubleshooting to network single-point, and the method includes:
Each network single-point according to network-in-dialing forms true connected graph；
From described true connected graph, effective connected graph is determined based on the distance between each network single-point；
In described effective connected graph, the relation whether increased with the connected component of formation in described effective connected graph according to the presence or absence of each single-point, find the cutpoint in described effective connected graph；
Network single-point corresponding for described cutpoint as trouble shooting object and is carried out troubleshooting.
The embodiment of the present invention provides the system of a kind of troubleshooting to network single-point, and this system includes:
True connected graph forms unit, for forming true connected graph according to each network single-point of network-in-dialing；
Effectively connected graph determines unit, determines effective connected graph based on the distance between each network single-point from described true connected graph；
Cutpoint finds unit, is used in described effective connected graph, the relation whether increased with the connected component of formation in described effective connected graph according to the presence or absence of each single-point, finds the cutpoint in described effective connected graph；
Fault processing unit, for as trouble shooting object and carrying out fault pre-alarming or eliminating using network single-point corresponding for described cutpoint.
Present invention may apply to the process operation of malfunctioning node in various network environment.The present invention is by operating complicated the malfunctioning node early warning in network or eliminating, it is converted into intuitively to the lookup of cutpoint in connected graph, the most again to malfunctioning node early warning corresponding to cutpoint or get rid of operation, decrease the interference of life that fault in-situ people are handled official business, simple to operation, the reliability that barrier judges is high, saves the time, reduces maintenance cost.
Accompanying drawing explanation
In order to be illustrated more clearly that the technical scheme of the embodiment of the present invention, in describing embodiment below, the required accompanying drawing used is briefly described, apparently, accompanying drawing in describing below is some embodiments of the present invention, for those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the method flow diagram of the troubleshooting to network single-point according to one embodiment of the invention；
Fig. 2 (a) is the schematic diagram of the true connected graph that the multiple stage network single-point according to one embodiment of the invention is formed；
The schematic diagram of the true connected graph that multiple stage network single-point is formed when Fig. 2 (b) is the some C fault according to one embodiment of the invention；
The schematic diagram of the true connected graph that multiple stage network single-point is formed when Fig. 2 (c) is the some D fault according to one embodiment of the invention；
Fig. 3 is a sub-process schematic diagram in Fig. 1；
Fig. 4 is another sub-process schematic diagram in Fig. 1；
Fig. 5 (a) is the schematic diagram of effective connected graph after A is put in the deletion according to one embodiment of the invention；
Fig. 5 (b) is the schematic diagram of effective connected graph after B is put in the deletion according to one embodiment of the invention；
Fig. 5 (c) is the schematic diagram of effective connected graph after C is put in the deletion according to one embodiment of the invention；
Fig. 5 (d) is the schematic diagram of effective connected graph after D is put in the deletion according to one embodiment of the invention；
Fig. 5 (e) is the schematic diagram of effective connected graph after E is put in the deletion according to one embodiment of the invention；
Fig. 5 (f) is the schematic diagram of effective connected graph after F is put in the deletion according to one embodiment of the invention；
Fig. 6 is the structural representation of the troubleshooting to network single-point according to one embodiment of the invention；
Fig. 7 is the structural representation that effective connected graph of one embodiment of the invention determines unit.
Specific embodiment
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is a part of embodiment of the present invention rather than whole embodiments.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art are obtained under not making creative work premise, broadly fall into the scope of protection of the invention.
As it is shown in figure 1, the fault pre-alarming of network single-point be may include that with the method for eliminating
Step 11: form true connected graph according to each network single-point of network-in-dialing.
Step 12: determine effective connected graph from described true connected graph based on the distance between each network single-point.
Step 13: in described effective connected graph, the relation whether increased with the connected component of formation in described effective connected graph according to the presence or absence of each single-point, find the cutpoint in described effective connected graph.
Step 14: network single-point corresponding for described cutpoint as trouble shooting object and is carried out fault pre-alarming or failture evacuation.
The present invention can be used for the early warning of malfunctioning node in various network environment (such as mobile phone, work station, server, microcomputer and router etc.), to point out maintainer to go fault in-situ to go to check.It is contemplated that the present invention may be use with directly the node corresponding to the cutpoint found directly to be changed hardware or maintenance recovery.The present invention can be also used for malfunctioning node early warning, carries out failture evacuation after the node to this early warning detects afterwards again.
The present invention is by processing operation by complicated to the malfunctioning node in network, it is converted into intuitively to the lookup of cutpoint in connected graph, the most again the malfunctioning node that cutpoint is corresponding is processed operation, decrease the interference of life that fault in-situ people are handled official business, simple to operation, the saving time, the reliability reducing maintenance cost and barrier judgement is high.
For example simple, intuitive and convenience of arguing, as a example by 6 computers are only carried out network-in-dialing connection one LAN of formation by FIG. 2 below, illustrate that these 6 network single-points form the implementation of true connected graph.It will be appreciated by those skilled in the art that network single-point can be the equipment including but not limited to microcomputer, server, mobile phone, panel computer, router etc., and the quantity of equipment can not limit.
Point A, some B, some C, some D, some E and computer A, computer B, computer C, computer D, computer E and the computer F in some F certain LAN corresponding respectively as shown in Fig. 2 (a), in connected graph.Wherein, some C is connected with some A, B, a D respectively.Point D is connected with some C, E, a F respectively.It is attached with solid line between line segment AB, AC, BC, CD, DE, DF and EF, illustrates that between the end points (corresponding to computer) of each line be network-in-dialing.Now, the communication between each computer in LAN is smooth and easy.
As shown in Fig. 2 (b), if the computer C fault that the cutpoint C in connected graph (the determination method of cutpoint will hereinafter be described) is corresponding, now, computer C network with computer A, B and D respectively is connected disconnection.Now, line segment AC, BC and CD is become dotted line from solid line.The connected component of this connected graph has been become 2 (1 connected component formed by A and B, some D, E and F another 1 connected component formed) from 1.
As shown in Fig. 2 (c), if the computer D fault corresponding for cutpoint D in connected graph, now, computer D network with computer C, E and F respectively is connected disconnection.Now, line segment CD, DE and DF is become dotted line from solid line.Connected component is become 2 (1 connected component become by some A, B, E and F another 1 connected component formed) with C-shaped from 1.
As it is shown on figure 3, determine that from described true connected graph effective connected graph (step 12 in Fig. 1) may include that based on the distance between each network single-point
Step 121: measure in described true connected graph the distance between each network single-point according to the network transmission efficiency parameter between network single-point.
Step 122: the correspondence between corresponding to distance two NEs of the distance threshold that will be greater than setting is judged to disconnect.
Step 123: the line being judged in described true connected graph between the network single-point disconnected is deleted, determines effective connected graph.
The present embodiment exceedes threshold value by distance and judges that between corresponding network node, communication disconnects, and corresponding with the distance of network single-point in real network, contrast is directly perceived, simple to operation, the reliability height of breakdown judge.
In the present embodiment, when the network transmission efficiency parameter when between network single-point is better than predetermined network efficiency of transmission parameter, it is definite value really between 0～100 by the distance definition between network single-point；When network transmission efficiency parameter when between network single-point is inferior to predetermined network efficiency of transmission parameter, it is infinitely great by the distance definition between network single-point.
The present embodiment is by along with the increase of communication distance, and network transmission efficiency parameter (such as network transfer speeds) is gradually deteriorated, and when being infinitely great by the distance definition between network separate room, just correspond to network service and interrupts, and intuitive and convenient, reliability is high.
The present embodiment is by being definite value really between 0～100 by the distance definition of network single-point good for communications status in network so that connected graph is drawn simple, directly perceived, and data operation is simple and convenient, enhances the reliability of network failure standalone processes.
In certain embodiments, described network transmission efficiency parameter at least includes the one in following parameter: message transmission rate, two-way time and, packet loss.
In certain embodiments, preset data transfer rate is 1Mbps.
During message transmission rate V when between network single-point >=1Mbps, it is definite value (for simple and convenience of calculation of arguing, preferably this value of determination is set to 1) really between 0～100 by the distance definition between network single-point；
Distance definition between network single-point < during 1Mbps, is infinitely great by message transmission rate V when between network single-point.
Concrete, this example can measure the distance between two nodes by considering message transmission rate (such as downloading rate), two-way time and packet loss between two network single-points.Such as, the distance between downloading rate the biggest explanation two network single-point is the nearest, so the distance between downloading rate and two network single-points is inversely proportional to；Two-way time is the time carrying out the most complete communication between two network single-points, and the shortest explanation two two-way time euclidean distance between node pair is the nearest；The tolerance of the integrity of transmission information when packet loss is communication between two network single-points, packet loss is the biggest, shows to transmit between two network single-points the most imperfect of information, and the distance between i.e. two network single-points is the biggest.
The present embodiment is big by traffic rate, represents network condition good, and traffic rate is little, and network is likely to occur fault to determine in connected graph, whether line connects or disconnect, intuitive and convenient, reliability height.
As shown in Figure 4, in described effective connected graph, the relation whether increased with the connected component of formation in described effective connected graph according to the presence or absence of each single-point, find the cutpoint in described effective connected graph (step 13 in Fig. 1) and including:
Step 131: traversal deletes the left point in described effective connected graph after certain single-point one by one, and obtains the quantity of the connected component of the connected graph formed by described left point.
Step 132: when the quantity of described connected component is more than 1, determine that deleted point is cutpoint.
Specifically determine that the implementation of cutpoint can be such that
As shown in Fig. 5 (a), traversal is the left point in effective connected graph (some B, C, D, E and F) after deleting an A, and the quantity of the connected component determined after deleting an A in effective connected graph is 1.Therefore, some A is not cutpoint.
As shown in Fig. 5 (b), traversal is the left point in effective connected graph (some A, C, D, E and F) after deleting a B, and the quantity of the connected component determined after deleting a B in effective connected graph is 1.Therefore, some B is not cutpoint.
As shown in Fig. 5 (c), traversal is the left point in effective connected graph (some A, B, D, E and F) after deleting a C, the quantity of the connected component determined after deleting a C in effective connected graph is 2 (1 connected component formed by A and B, some D, E and F another 1 connected component formed).Therefore, some C is cutpoint.
As shown in Fig. 5 (d), traversal is the left point in effective connected graph (some A, B, C, E and F) after deleting a D, the quantity of the connected component determined after deleting a D in effective connected graph is 2 (1 connected component become with C-shaped by some A, B, E and F another 1 connected component formed).Therefore, some D is also cutpoint.
As shown in Fig. 5 (e), traversal is the left point in effective connected graph (some A, B, C, D and F) after deleting an E, and the quantity of the connected component determined after deleting an E in effective connected graph is 2, and therefore, some E is not cutpoint.
As shown in Fig. 5 (f), traversal is the left point in effective connected graph (some A, B, C, D and E) after deleting a F, and the quantity of the connected component determined after deleting a F in effective connected graph is 2, and therefore, some F is not cutpoint.
In the present embodiment, the cutpoint position of connected graph specifically can also be determined with cut-vertex algorithm.
In complicated network environment, the communication between network single-point is frequent, and therefore, in network, each single-point is not that the probability of cutpoint is the least.
As shown in Figure 6, the system to the troubleshooting of network single-point may include that true connected graph forms unit, effective connected graph determines that unit, cutpoint find unit and fault processing unit.Wherein:
True connected graph forms unit for forming true connected graph according to each network single-point of network-in-dialing.
Effectively connected graph determines that unit is for determining effective connected graph based on the distance between each network single-point from described true connected graph.
Cutpoint is found unit and is used in described effective connected graph, the relation whether increased with the connected component of formation in described effective connected graph according to the presence or absence of each single-point, finds the cutpoint in described effective connected graph.
Fault processing unit is for as trouble shooting object and carrying out troubleshooting using network single-point corresponding for described cutpoint.
As it is shown in fig. 7, in certain embodiments, effective connected graph determines that unit may include that distance metric module, disconnects determination module and line removing module.Wherein:
Distance metric module for measuring in described true connected graph the distance between each network single-point according to the network transmission efficiency parameter between network single-point.
Disconnect determination module correspondence between corresponding to distance two NEs that will be greater than the distance threshold of setting to be judged to disconnect.
Line removing module, for being deleted by the line being judged in described true connected graph between the network single-point disconnected, determines effective connected graph.
In certain embodiments, distance metric module may be used for:
When network transmission efficiency parameter when between network single-point is better than predetermined network efficiency of transmission parameter, it is (between such as 0～100) definite value really in the range of first by the distance definition between network single-point；
When network transmission efficiency parameter when between network single-point is inferior to predetermined network efficiency of transmission parameter, it is infinitely great by the distance definition between network single-point.
In certain embodiments, cutpoint searching unit may be used for:
Traversal deletes the left point in described effective connected graph after certain single-point one by one, and obtains the quantity of the connected component of the connected graph formed by described left point；
When the quantity of described connected component is more than 1, determine that deleted point is cutpoint.
In certain embodiments, the one during network transmission efficiency parameter at least includes following parameter: message transmission rate, two-way time and, packet loss.
Owing to the system of the troubleshooting to network single-point of above-described embodiment is corresponding with the function of the method for the troubleshooting to network single-point, here, repeat no more the two relevant content.The embodiment of the present invention can be passed through hardware processor (hardware processor) and realize related function module.
Device embodiment described above is only schematically, the wherein said unit illustrated as separating component can be or may not be physically separate, the parts shown as unit can be or may not be physical location, i.e. may be located at a place, or can also be distributed on multiple NE.Some or all of module therein can be selected according to the actual needs to realize the purpose of the present embodiment scheme.Those of ordinary skill in the art, in the case of not paying performing creative labour, are i.e. appreciated that and implement.
By the description of above embodiment, those skilled in the art is it can be understood that can add the mode of required general hardware platform by software to each embodiment and realize, naturally it is also possible to pass through hardware.Based on such understanding, the part that prior art is contributed by technique scheme the most in other words can embody with the form of software product, this computer software product can store in a computer-readable storage medium, such as ROM/RAM, magnetic disc, CD etc., including some instructions with so that a computer equipment (can be personal computer, server, or the network equipment etc.) perform the method described in some part of each embodiment or embodiment.
Last it is noted that above example is only in order to illustrate technical scheme, it is not intended to limit；Although the present invention being described in detail with reference to previous embodiment, it will be understood by those within the art that: the technical scheme described in foregoing embodiments still can be modified by it, or wherein portion of techniques feature is carried out equivalent；And these amendments or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (10)
1. the method to the troubleshooting of network single-point, including:
Each network single-point according to network-in-dialing forms true connected graph；
From described true connected graph, effective connected graph is determined based on the distance between each network single-point；
In described effective connected graph, according to presence or absence and the company of formation in described effective connected graph of each single-point
The relation whether increased is propped up in the reduction of fractions to a common denominator, finds the cutpoint in described effective connected graph；
Network single-point corresponding for described cutpoint as trouble shooting object and is carried out fault pre-alarming or eliminating.
Method the most according to claim 1, wherein, described based on the distance between each network single-point
From described true connected graph, determine that effective connected graph includes:
Each network list in described true connected graph is measured according to the network transmission efficiency parameter between network single-point
Distance between point；
Correspondence between corresponding to distance two NEs of the distance threshold that will be greater than setting is sentenced
It is set to disconnection；
The line being judged in described true connected graph between the network single-point disconnected is deleted, determines effectively
Connected graph.
Method the most according to claim 2, wherein, according to the network transmission efficiency between network single-point
The distance that parameter is measured in described true connected graph between each network single-point includes:
When network transmission efficiency parameter when between network single-point is better than predetermined network efficiency of transmission parameter, by net
Distance definition between network single-point is definite value really in the range of first；
When network transmission efficiency parameter when between network single-point is inferior to predetermined network efficiency of transmission parameter, by net
Distance definition between network single-point is infinitely great.
Method the most according to claim 1, wherein, in described effective connected graph, according to each list
The relation whether connected component formed in presence or absence and described effective connected graph of point increases, has described in searching
Cutpoint in effect connected graph includes:
Traversal deletes the left point in described effective connected graph after certain single-point one by one, and obtains by described surplus
The quantity of the connected component of the connected graph that remaining point is formed；
When the quantity of described connected component is more than 1, determine that deleted point is cutpoint.
5. according to the method according to any one of claim 2-4, wherein, described network transmission efficiency ginseng
The one that number at least includes in following parameter: message transmission rate, two-way time and, packet loss.
6. the system to the troubleshooting of network single-point, including:
True connected graph forms unit, for forming true connected graph according to each network single-point of network-in-dialing；
Effectively connected graph determines unit, is used for based on the distance between each network single-point from described true connection
Figure determines effective connected graph；
Cutpoint finds unit, in described effective connected graph, has with described according to the presence or absence of each single-point
The relation whether connected component formed in effect connected graph increases, finds the cutpoint in described effective connected graph；
Fault processing unit, for going forward side by side network single-point corresponding for described cutpoint as trouble shooting object
Row fault pre-alarming or eliminating.
System the most according to claim 1, wherein, described effective connected graph determines that unit includes:
Distance metric module, for according to the network transmission efficiency parameter between network single-point measure described very
Distance between each network single-point in real connected graph；
Disconnect determination module, for will be greater than corresponding to distance two network lists of the distance threshold set
Correspondence between unit is judged to disconnect；
Line removing module, for by described true connected graph is judged to disconnect network single-point between
Line is deleted, and determines effective connected graph.
System the most according to claim 7, wherein, described distance metric module includes:
When network transmission efficiency parameter when between network single-point is better than predetermined network efficiency of transmission parameter, by net
Distance definition between network single-point is definite value really in the range of first；
When network transmission efficiency parameter when between network single-point is inferior to predetermined network efficiency of transmission parameter, by net
Distance definition between network single-point is infinitely great.
System the most according to claim 7, wherein, described cutpoint is found unit and is used for:
Traversal deletes the left point in described effective connected graph after certain single-point one by one, and obtains by described surplus
The quantity of the connected component of the connected graph that remaining point is formed；
When the quantity of described connected component is more than 1, determine that deleted point is cutpoint.
10. according to the system according to any one of claim 6-9, wherein, described network transmission efficiency
Parameter at least includes the one in following parameter: message transmission rate, two-way time and, packet loss.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610183639.7A CN105871597A (en) | 2016-03-28 | 2016-03-28 | Method and system for fault handling of network single point |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610183639.7A CN105871597A (en) | 2016-03-28 | 2016-03-28 | Method and system for fault handling of network single point |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105871597A true CN105871597A (en) | 2016-08-17 |
Family
ID=56625155
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610183639.7A Pending CN105871597A (en) | 2016-03-28 | 2016-03-28 | Method and system for fault handling of network single point |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105871597A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101163059A (en) * | 2007-11-24 | 2008-04-16 | 杭州华三通信技术有限公司 | Network node detection method and apparatus |
| CN101453352A (en) * | 2007-12-07 | 2009-06-10 | 华为技术有限公司 | Path failure detection method and apparatus |
| CN102457403A (en) * | 2010-10-15 | 2012-05-16 | 无锡江南计算技术研究所 | Method and device for detecting network connection faults |
| CN104093166A (en) * | 2014-07-08 | 2014-10-08 | 南京信息工程大学 | Wireless sensor network connection recovery method based on minimum movement of nodes |
-
2016
- 2016-03-28 CN CN201610183639.7A patent/CN105871597A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101163059A (en) * | 2007-11-24 | 2008-04-16 | 杭州华三通信技术有限公司 | Network node detection method and apparatus |
| CN101453352A (en) * | 2007-12-07 | 2009-06-10 | 华为技术有限公司 | Path failure detection method and apparatus |
| CN102457403A (en) * | 2010-10-15 | 2012-05-16 | 无锡江南计算技术研究所 | Method and device for detecting network connection faults |
| CN104093166A (en) * | 2014-07-08 | 2014-10-08 | 南京信息工程大学 | Wireless sensor network connection recovery method based on minimum movement of nodes |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104753828A (en) | SDN controller, data central system and route connection method | |
| CN108322320B (en) | Service survivability analysis method and device | |
| CN102761461B (en) | A kind of link health examination method and device | |
| CN102761476B (en) | Load balancing method and device | |
| CN108306747B (en) | Cloud security detection method and device and electronic equipment | |
| CN102868553A (en) | Failure positioning method and associated equipment | |
| CN101895472A (en) | Traffic flow load sharing method and processing method and corresponding device and system | |
| CN108965049A (en) | Method, equipment, system and the storage medium of cluster exception solution are provided | |
| US20170206125A1 (en) | Monitoring system, monitoring device, and monitoring program | |
| CN104283780A (en) | Method and device for establishing data transmission route | |
| CN110912606B (en) | Fault positioning method and device for PON cloud private network | |
| CN110557275B (en) | Electric power communication network detection station selection algorithm based on network intrinsic characteristics | |
| CN116455729A (en) | Fault link detection and recovery method based on link quality assessment model | |
| CN114070752B (en) | Test method, test device, electronic equipment and computer readable storage medium | |
| CN113656252B (en) | Fault positioning method, device, electronic equipment and storage medium | |
| CN107241216A (en) | Maintain the method and device of the stable transmission of critical data | |
| CN102143011A (en) | Device and method for realizing network protection | |
| CN116723136B (en) | Network data detection method applying FCM clustering algorithm | |
| CN105871597A (en) | Method and system for fault handling of network single point | |
| CN112116511A (en) | State monitoring method and device for urban rail transit system | |
| CN105991305B (en) | A kind of method and device identifying link exception | |
| CN103178997B (en) | Detection method that a kind of MAC Address based on LLDP agreement is identical and equipment | |
| CN112866009B (en) | Virtual network fault diagnosis method and device for comprehensive service station | |
| CN115102865A (en) | Network security device topology management method and system | |
| CN109699041A (en) | A kind of RRU channel failure diagnosis processing method and RRU device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160817 |