CN109039815B - Routing interruption node detection method and device based on historical data perception - Google Patents
Routing interruption node detection method and device based on historical data perception Download PDFInfo
- Publication number
- CN109039815B CN109039815B CN201810846487.3A CN201810846487A CN109039815B CN 109039815 B CN109039815 B CN 109039815B CN 201810846487 A CN201810846487 A CN 201810846487A CN 109039815 B CN109039815 B CN 109039815B
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- historical data
- hop
- detection method
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
-
- 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
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Cardiology (AREA)
- General Health & Medical Sciences (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention describes a routing interruption node detection method and a device based on historical data perception, which comprises the following steps: the method comprises the steps of disassembling routing data, screening and forming an interruption event record set, searching the farthest routing node IP, searching the next node IP set of each routing node IP from historical data, and performing backtracking analysis according to the historical records to determine the routing node IP with the highest breakpoint risk. The invention can find the node range in which the route interruption possibly occurs, and makes up the defect that the traditional Traceroute tool cannot sense the position in which the interrupted node possibly occurs.
Description
Technical Field
The invention relates to the field of network topology, in particular to a routing interruption node detection method and device based on historical data perception.
Background
In recent years, with the rapid development of the internet, more and more network services need to be better provided according to the geographical location of the user IP address. The process of associating an IP address with a geographic location is referred to as IP positioning. IP positioning plays an important role in today's internet services.
In the field of IP positioning, a Traceroute tool is generally adopted for route detection, however, there are cases where there is a broken node in a network topology, and in such cases, Traceroute cannot detect which hop a specific broken routing node is in. Therefore, the design and implementation of a routing interrupt node positioning system and the provision of high-accuracy interrupt node positioning service are of great significance. The existing technology for positioning the interrupt node has the technical problems of poor positioning accuracy and low reliability for the interrupt node.
Disclosure of Invention
The invention describes a routing interruption node detection method and device based on historical data perception, which are used for finding a node range where routing interruption possibly occurs and making up for the defect that a traditional Traceroute tool cannot perceive the position where the interruption node possibly occurs.
The invention discloses a routing interruption node detection method based on historical data perception, which comprises the following steps:
s1, disassembling routing data, converting the semi-structured data into structured data, and generating a routing node pair database, wherein the routing node pair database stores a routing node relation containing two continuous hops;
s2, screening records c with interrupt events in each sampling periodiForming an interrupt event record set Cases ═ { c ═ ci|i{1，2，…，n}}；
S3, recording c from each interrupt eventiFinding the farthest routing node IP reachable from the source IP, if the finding process is expressed as a function FAR (), then finding the farthest routing node IPiThe calculation formula of (c) can be expressed as:
nodei＝FAR(ci)；
s4, searching the NEXT hop node IP set of each routing node IP from the historical data, and representing by a function NEXT (), then hopi＝NEXT(nodei) Wherein, hopiIs an IP set;
s5, extracting at least 2 different IP sets IPs according to the data obtained in the step S4;
s6, according to the IP set IPs obtained in the step S5, searching an IP set hop to which each element in the IP set IPs belongs through backtracking analysisiThen searching the IP set hop respectivelyiCorresponding nodeiFinally according to nodeiRecord c tracing back to event attributioniThen, the routing node IP with the highest breakpoint risk in a certain Traceroute path can be obtained;
wherein IPs acquired through step S5 is the IP set with the highest interrupt risk, and hoss acquired through step S5 contains the IP set with the second highest interrupt risk.
Further, the extracting step in step S5 specifically includes:
a decision function is defined that, as follows,
in the above formula, IP is an IP address;
if N is {1, 2., N }, hops is { hop }i|i∈N}，
Then it is determined that,
further, the step S6 further includes:
the priorities of the IP sets are sorted in ascending order according to the distance from the current interrupt event time.
The application also discloses routing interruption node detection device based on historical data perception, including: a processor, a storage medium storing instructions executable by the processor, characterized in that: the instructions are executable by the processor to implement the route interruption node detection method of claim 1.
The invention has the beneficial effects that:
the invention improves the traditional Traceroute path node probing capability through node pair correlation complementation, and ensures that the interrupt detection is accurate to the most suspicious next hop node IP, thereby solving the technical problems of poor positioning accuracy and low reliability of the interrupt node in the prior art.
Drawings
Fig. 1 is a flowchart of a routing interruption node detection method based on historical data awareness according to an embodiment.
Detailed Description
In order to more clearly understand the technical features, objects, and effects of the present invention, embodiments of the present invention will now be described with reference to the accompanying drawings.
As shown in fig. 1 of the specification, the present invention discloses a routing interruption node detection method based on historical data perception, which includes:
s1, disassembling routing data, converting the semi-structured data into structured data, and generating a routing node pair database, wherein the routing node pair database stores a routing node relation containing two continuous hops;
s2, screening records c with interrupt events in each sampling periodiForming an interrupt event record set Cases ═ { c ═ ci|i{1，2，…，n}}；
S3, recording c from each interrupt eventiFind the farthest routing node reachable from the source IPIP, if the searching process is expressed as function FAR (), the node of the farthest route nodeiThe calculation formula of (c) can be expressed as:
nodei＝FAR(ci)；
s4, searching the NEXT hop node IP set of each routing node IP from the historical data, and representing by a function NEXT (), then hopi＝NEXT(nodei) Wherein, hopiIs an IP set;
s5, extracting at least 2 different IP sets IPs according to the data obtained in the step S4;
s6, according to the IP set IPs obtained in the step S5, searching an IP set hop to which each element in the IP set IPs belongs through backtracking analysisiThen searching the IP set hop respectivelyiCorresponding nodeiFinally according to nodeiRecord c tracing back to event attributioniThen, the routing node IP with the highest breakpoint risk in a certain Traceroute path can be obtained;
wherein IPs acquired through step S5 is the IP set with the highest interrupt risk, and hoss acquired through step S5 contains the IP set with the second highest interrupt risk.
Further, the extracting step in step S5 specifically includes:
a decision function is defined that, as follows,
in the above formula, IP is an IP address;
if N is {1, 2., N }, hops is { hop }i|i∈N}，
Then it is determined that,
further, the step S6 further includes:
the priorities of the IP sets are sorted in ascending order by distance from the current interrupt event time.
The application also discloses routing interruption node detection device based on historical data perception, including: a processor, a storage medium storing instructions executable by the processor, characterized in that: the instructions are executed by the processor to implement the above-described route break node detection method.
It should be noted that, for simplicity of description, the above-mentioned embodiments of the method are described as a series of acts or combinations, but those skilled in the art should understand that the present application is not limited by the order of acts described, as some steps may be performed in other orders or simultaneously according to the present application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and elements referred to are not necessarily required in this application.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a ROM, a RAM, etc.
The above disclosure is only for the purpose of illustrating the preferred embodiments of the present invention, and it is therefore to be understood that the invention is not limited by the scope of the appended claims.
Claims (3)
1. A routing interruption node detection method based on historical data perception comprises the following steps:
s1, disassembling routing data, converting the semi-structured data into structured data, and generating a routing node pair database, wherein the routing node pair database stores a routing node relation containing two continuous hops;
s2, screening records c with interrupt events in each sampling periodiForming an interrupt event record set Cases ═ { c ═ ci|i∈{1，2，…，n}}；
S3, recording c from each interrupt eventiFinding the farthest routing node IP reachable from the source IP, if the finding process is expressed as a function FAR (), then finding the farthest routing node IPiThe calculation formula of (c) can be expressed as:
nodei＝FAR(ci)；
s4, searching each farthest routing node from historical dataiIs represented by the function NEXT (), hopi＝NEXT(nodei) Wherein, hopiIs an IP set;
s5, extracting at least 2 different hops according to the data obtained in the step S4iIP set IPs of (1);
the extracting step in step S5 specifically includes:
a decision function IN () is defined, which, as follows,
in the above formula, IP is an IP address;
if N is {1, 2., N }, hops is { hop }i|i∈N}，
Then it is determined that,
；
s6, according to the IP set IPs obtained in the step S5, searching an IP set hop to which each element in the IP set IPs belongs through backtracking analysisiThen searching the IP set hop respectivelyiCorresponding nodeiFinally according to nodeiRecord c tracing back to event attributioniThen, the routing node IP with the highest breakpoint risk in a certain Traceroute path can be obtained;
wherein IPs acquired through step S5 is the IP set with the highest interrupt risk, and hoss acquired through step S5 contains the IP set with the second highest interrupt risk.
2. The historical data awareness-based route interruption node detection method according to claim 1, wherein the step S6 further comprises:
the priorities of IP set IPs and IP set hos are sorted in ascending order by distance from the current interrupt event time.
3. A routing interruption node detection device based on historical data perception comprises: a processor, a storage medium storing instructions executable by the processor, characterized in that: the instructions are executable by the processor to implement the route interruption node detection method of claim 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810846487.3A CN109039815B (en) | 2018-07-27 | 2018-07-27 | Routing interruption node detection method and device based on historical data perception |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810846487.3A CN109039815B (en) | 2018-07-27 | 2018-07-27 | Routing interruption node detection method and device based on historical data perception |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109039815A CN109039815A (en) | 2018-12-18 |
| CN109039815B true CN109039815B (en) | 2022-03-18 |
Family
ID=64646230
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810846487.3A Active CN109039815B (en) | 2018-07-27 | 2018-07-27 | Routing interruption node detection method and device based on historical data perception |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109039815B (en) |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101471822A (en) * | 2007-12-29 | 2009-07-01 | 华为技术有限公司 | Method and system for locating network fault |
| CN102710450B (en) * | 2012-06-21 | 2015-05-06 | 华为技术有限公司 | Fault location method and device thereof |
| CN110740065B (en) * | 2019-10-29 | 2022-04-15 | 中国联合网络通信集团有限公司 | Method, device and system for identifying degradation fault point |
-
2018
- 2018-07-27 CN CN201810846487.3A patent/CN109039815B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109039815A (en) | 2018-12-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110020433B (en) | Industrial and commercial high-management name disambiguation method based on enterprise incidence relation | |
| CN104699835B (en) | For determining that Webpage includes the method and device of point of interest POI data | |
| US20130297581A1 (en) | Systems and methods for customized filtering and analysis of social media content collected over social networks | |
| US10592327B2 (en) | Apparatus, system, and method for analyzing logs | |
| US9159030B1 (en) | Refining location detection from a query stream | |
| TW201905733A (en) | Multi-source data fusion method and device | |
| JP2019512764A (en) | Method and apparatus for identifying the type of user geographical location | |
| WO2019069505A1 (en) | Information processing device, combination condition generation method, and combination condition generation program | |
| Dan et al. | Improving IP geolocation using query logs | |
| US10057155B2 (en) | Method and apparatus for determining automatic scanning action | |
| CN107026881A (en) | The processing method of business datum, apparatus and system | |
| CN104933171B (en) | Interest point data association method and device | |
| WO2017139247A1 (en) | Inconsistency detection and correction system | |
| Karimi et al. | Geocoding recommender: an algorithm to recommend optimal online geocoding services for applications | |
| CN110648172A (en) | Identity recognition method and system fusing multiple mobile devices | |
| CN112346950A (en) | Database index performance estimation system and method based on query log analysis | |
| Li et al. | GeoCAM: An IP-based geolocation service through fine-grained and stable webcam landmarks | |
| CN111985569B (en) | Anonymous node positioning method based on multi-source point clustering idea | |
| CN109039815B (en) | Routing interruption node detection method and device based on historical data perception | |
| WO2019069507A1 (en) | Feature value generation device, feature value generation method, and feature value generation program | |
| US20230046801A1 (en) | Source localization method for rumor based on full-order neighbor coverage strategy | |
| de Oliveira et al. | Leveraging VGI for gazetteer enrichment: A case study for geoparsing twitter messages | |
| CN107239461B (en) | Road island determination method and device | |
| CN114881430A (en) | Community life convenience evaluation method based on network map service | |
| CN110059272B (en) | Page feature recognition method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |