CN113542040B - Duration indication method and device and electronic equipment - Google Patents

Duration indication method and device and electronic equipment Download PDF

Info

Publication number
CN113542040B
CN113542040B CN202111084949.0A CN202111084949A CN113542040B CN 113542040 B CN113542040 B CN 113542040B CN 202111084949 A CN202111084949 A CN 202111084949A CN 113542040 B CN113542040 B CN 113542040B
Authority
CN
China
Prior art keywords
domain name
time
preset type
determining
duration
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
Application number
CN202111084949.0A
Other languages
Chinese (zh)
Other versions
CN113542040A (en
Inventor
陈剑
马晨迪
李志平
谢家贵
范晓天
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Academy of Information and Communications Technology CAICT
Original Assignee
China Academy of Information and Communications Technology CAICT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Academy of Information and Communications Technology CAICT filed Critical China Academy of Information and Communications Technology CAICT
Priority to CN202111084949.0A priority Critical patent/CN113542040B/en
Publication of CN113542040A publication Critical patent/CN113542040A/en
Application granted granted Critical
Publication of CN113542040B publication Critical patent/CN113542040B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0654Management of faults, events, alarms or notifications using network fault recovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0631Management 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/064Management 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 time analysis
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003Managing SLA; Interaction between SLA and QoS
    • H04L41/5009Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/45Network directories; Name-to-address mapping
    • H04L61/4505Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols
    • H04L61/4511Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols using domain name system [DNS]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The embodiment of the application provides a duration indication method and device and electronic equipment. The method comprises the following steps: and determining the tolerable operation time of the preset type domain name according to the analysis success rate of the preset type domain name and/or the variation condition of the average analysis time delay of the recursive cache side. And if the root fault notification is received, sending indication information to a root fault emergency strategy response system, wherein the indication information comprises the tolerable operation time length, and the indication information is used for indicating the root fault emergency strategy response system to make a root fault repair strategy based on the tolerable operation time length. Therefore, powerful support can be provided for formulating the root fault repairing strategy, and the rationality of the formulated strategy is improved.

Description

Duration indication method and device and electronic equipment
Technical Field
The application relates to the technical field of domain name resolution, in particular to a duration indication method, a duration indication device and electronic equipment.
Background
The domain name system is one of important infrastructures of the Internet, the root resolution service is the first step of domain name resolution, and stable and efficient operation of the root resolution service is of great significance for ensuring stable Internet application environment in China and promoting further development of Internet services. In the prior art, certain blindness exists in the process of formulating the root fault repairing strategy, so that the formulated root fault repairing strategy is not reasonable enough and does not accord with the actual requirement.
Disclosure of Invention
The embodiment of the application provides a duration indication method, a duration indication device and electronic equipment, which are used for providing tolerable operation duration of resolution service of a preset type domain name for a root fault emergency strategy response system when a root fault occurs, so that the root fault emergency strategy response system can formulate a reasonable root fault repair strategy based on the tolerable operation duration.
According to an aspect of the embodiments of the present application, there is provided a duration indication method, including: determining tolerable operation time length of the preset type domain name according to the analysis success rate of the preset type domain name and/or the change condition of the average analysis time length of a recursion cache side; and if the root fault notification is received, sending indication information to a root fault emergency strategy response system, wherein the indication information comprises the tolerable operation time length, and the indication information is used for indicating the root fault emergency strategy response system to make a root fault repair strategy based on the tolerable operation time length.
According to another aspect of the embodiments of the present application, there is provided a duration indicating device, including a duration determining module and a duration indicating module. The duration determining module is used for determining the tolerable operation duration of the preset type domain name according to the analysis success rate of the preset type domain name and/or the variation condition of the average analysis delay of the recursive cache side. The time length indicating module is used for sending indicating information to the root fault emergency strategy response system when receiving the root fault notification, wherein the indicating information comprises the tolerable operation time length, and the indicating information is used for indicating the root fault emergency strategy response system to prepare a root fault repair strategy based on the tolerable operation time length.
According to still another aspect of an embodiment of the present application, there is provided an electronic apparatus including: one or more processors; a memory; one or more programs stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to perform the duration indication method in the above embodiments.
According to still another aspect of an embodiment of the present application, there is provided a computer-readable storage medium having a program code stored thereon, the program code being called by a processor to execute the duration indication method in the above embodiment.
In the scheme provided by the embodiment of the application, the tolerable operation time of the preset type domain name after the root fault occurs is determined, and the tolerable operation time is carried in the indication information and sent to the root fault emergency strategy response system after the root fault occurs, so that the root fault emergency strategy response system can determine the available time for repairing the root fault according to the tolerable operation time, and a corresponding root fault repairing strategy is established according to the available time. Therefore, the scheme of the embodiment of the application provides powerful support for the formulation of the root fault repair strategy after the occurrence of the root fault, avoids the blindness of the formulation of the root fault repair strategy, and enables the root fault repair strategy formulated by the root fault emergency strategy response system to be more reasonable.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a schematic view of an application scenario provided in an embodiment of the present application;
fig. 2 is a flowchart illustrating a method for indicating duration according to an embodiment of the present disclosure;
FIG. 3 is a schematic diagram of a sub-step of step S210 shown in FIG. 2;
FIG. 4 is a schematic diagram of a sub-step of step S211 shown in FIG. 3;
FIG. 5 is a schematic diagram of a sub-step of step S401 shown in FIG. 4;
fig. 6 is a second flowchart illustrating a duration indication method according to an embodiment of the present application;
FIG. 7 is a schematic diagram of a sub-step of step S603 shown in FIG. 6;
FIG. 8 is a schematic diagram of a sub-step of the step S701 shown in FIG. 7;
FIG. 9 is a schematic diagram illustrating another sub-step of step S210 shown in FIG. 2;
FIG. 10 is a schematic diagram of a sub-step of step S215 shown in FIG. 9;
fig. 11 is a block diagram of a duration indicating device according to an embodiment of the present application;
fig. 12 is a schematic hardware architecture diagram of an electronic device according to an embodiment of the present disclosure.
Detailed Description
In order to realize stable and efficient operation of the domain name resolution service, when a root fault occurs, a reasonable root fault repair strategy needs to be formulated quickly and maintenance personnel needs to be scheduled reasonably. Research shows that the current root fault repair strategy formulation and maintenance personnel scheduling usually lack guiding information. Based on this, the embodiment of the application provides a duration indication method, a duration indication device and an electronic device, which can improve the rationality of a root fault repair strategy and a maintenance staff scheduling strategy by predetermining the tolerable operation duration of the domain name resolution service of the preset type domain name after the root fault in a targeted manner, so as to guide the root fault emergency strategy response system to make the root fault repair strategy and the maintenance staff scheduling strategy based on the tolerable operation duration when the root fault occurs.
It should be noted that the defects of the above methods are all the results after practice and careful study, and therefore, the discovery process of the above problems and the solutions proposed by the present application to the above problems should be the contributions of the present application in the invention process.
In order to make the technical solutions and advantages of the embodiments of the present application more apparent, the following further description of the exemplary embodiments of the present application with reference to the accompanying drawings makes it clear that the described embodiments are only a part of the embodiments of the present application, and are not exhaustive of all embodiments. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
Fig. 1 is a schematic diagram of an application scenario provided in an embodiment of the present application, where the application scenario includes a root fault analysis server 100, a dial testing server 200, a recursive node 300, a root fault emergency policy response system 400, and at least one authoritative server 500. Here, the recursive node 300 may be a public DNS (Domain Name System) recursive server, such as a public DNS recursive server with an IP address of 8.8.8.8, which is not limited in this embodiment. The authoritative server 500 may be any one of the levels of authoritative domain name servers, and the at least one authoritative server 500 may include various levels of authoritative domain name servers, for example. The present embodiment does not limit this.
The dial testing server 200 may be pre-established, and the dial testing server 200 and the root fault emergency policy response system 400 may be respectively in communication connection with the root fault analysis server 100. The dial test server 200 may be communicatively coupled to the recursion node 300 and the authoritative server 500. Illustratively, the dial testing server 200 may simulate a user sending commands to the recursion node 300 or the authoritative server 500, which may be, for example, dig commands, and may be, for example, dig and trace commands, as will be described in more detail below. It should be understood that the description is intended for purposes of illustration only and is not intended to limit the scope of the present disclosure.
It is worth to be noted that, the servers mentioned in the embodiment of the present application may be independent physical devices, may also be a server cluster or a distributed system formed by a plurality of physical servers, and may also be cloud servers providing basic cloud computing services such as cloud computing, big data or artificial intelligence platforms, and the like, which is not limited in the embodiment of the present application.
Referring to fig. 2, fig. 2 illustrates a time duration indication method according to an embodiment of the present application, where the method is applied to an electronic device, where the electronic device may be the root failure analysis server 100 shown in fig. 1. The method may include the following steps.
S210, determining tolerable operation time of the preset type domain name according to the analysis success rate of the preset type domain name and/or the change condition of the average analysis time of the recursive cache side.
The preset type domain name can be understood as a preset type domain name, and can be flexibly set according to needs. For example, the preset type domain name may be a domain name corresponding to a specific service (examination score inquiry service, ticket purchase service, etc.) or a specific institution. Wherein, the specific service or the specific mechanism can be set according to the time period and the user requirement.
As another example, the preset type domain name may be a domain name with a specific top-level domain name or a specific second-level domain name, which is not limited in this embodiment.
In the two cases, the tolerable operation time of the preset type domain name mainly reflects the service quality of the domain name resolution service of a part of domain names, and the tolerable time length of the domain name resolution service after the fault is up can be tolerated by a user.
For another example, the preset type domain name may be a domain name with the first N-bit cache-side query volume counted by the recursion side of the operator (which may be understood as all recursion servers of the operator) in a time period, and these domain names may be referred to as the recursion cache-side query volume Top N domain names of the operator hereinafter. N here may be set according to needs, for example, 1 ten thousand, 5 ten thousand, or 10 ten thousand, which is not limited in this embodiment. In this case, the tolerable operation duration of the preset type domain name can basically reflect the service quality of the domain name resolution service of all domain names, and the tolerable time length of the user can be obtained after the fault.
It should be noted that, for a domain name, the total amount of query requests for the domain name received by the recursion side of the operator in a time period is the query amount of the recursion cache side of the operator in the time period for the domain name.
Optionally, in this embodiment, the preset type domain name may be directly set manually on the root fault analysis server 100, or may be sent to the root fault analysis server 100 by another server, for example, the root fault emergency policy response system 400 may determine the preset type domain name according to its own needs, and then send the preset type domain name to the root fault analysis server 100. The present embodiment does not limit this.
Optionally, the recursive side of the operator caches the domain name with the query amount arranged in the top N bits, and there may be a plurality of obtaining manners.
In an embodiment, each recursion server of each operator may provide a domain name with the first N-bit query volume on the cache side in a specified time period to the root fault analysis server 100, and the root fault analysis server 100 may collect data reported by each recursion server of the operator to obtain the domain name with the first N-bit query volume on the cache side in the specified time period by the recursion side of the operator. Then, the root fault analysis server 100 summarizes the domain names with the cache side query volumes arranged in the first N bits of the domain names of different operators to obtain the domain names with the cache side query volumes arranged in the first N bits of the queried domain names of all the operator recursion sides in the specified time period, and uses the determined domain names as the preset type domain names in S210.
In another embodiment, each recursive server of an operator may collect, in the specified time period, domain names with the first N-bit query volumes on the cache side, to one recursive server of the operator (referred to as "target recursive server" herein), and report the domain names to the root fault analysis server 100 by the target recursive server, and the root fault analysis server 100 further collects data reported by the target recursive servers of the operators, so as to determine the domain names with the first N-bit query volumes on the cache side, among the domain names on the recursive sides of all the operators, and determine the domain names as the preset type domain name in S210.
In another embodiment, the domain name that is reported by each recursive server of each operator and that caches the side query amount Top N in a specified time period may be determined as the preset type domain name. Therefore, various preset type domain names can be provided, and for each preset type domain name, the tolerable operation time of the preset type domain name can be determined according to the method provided by the embodiment of the application.
In another embodiment, the recursive cache side query amount Top N domain names and their access amounts reported by the recursive servers of the same region may be summarized according to the different regions to which the recursive servers of the operator belong, so as to obtain the recursive cache side query amount Top N domain names of the operator in the region, and use them as the preset type domain names of the region. The area may be a geographical area or an administrative area, which is not limited by the embodiment. It will be appreciated that in this embodiment, the preset type domain name is associated with a zone.
In S210, the variation may be any information characterizing the variation trend, such as at least one of a first slope, a second slope, a minimum resolution success rate, a maximum recursive buffer side average resolution delay, and the like, which are described below. It should be understood that this is by way of example only and is not intended to limit the scope of the present application.
Here, the resolution success rate of the preset-type domain name may be understood as a resolution request ratio to be successfully responded to in a resolution request for the preset-type domain name. The average resolution delay of the recursive cache side of the preset type domain name is an average value of the resolution delays of the recursive cache sides of all resolution requests of the preset type domain name, and the resolution delay of the recursive cache side of one resolution request of the preset type domain name can be understood as the time from the time when the user side sends the resolution request to the time when the resolution result is successfully obtained.
And S220, if a root fault notification is received, sending indication information to a root fault emergency strategy response system, wherein the indication information comprises the tolerable operation time length, and the indication information is used for indicating the root fault emergency strategy response system to prepare a root fault repair strategy based on the tolerable operation time length.
The root fault notification may be sent to the root fault analysis server 100 by the root fault emergency policy response system 500, or may be sent to the root fault analysis server 100 by another root fault monitoring server, which is not limited in this embodiment.
After receiving the indication information, the root fault emergency policy response system 400 may extract the tolerable operation duration from the indication information, and make a root fault repair policy by using the tolerable operation duration as the root fault repair available duration (i.e., the time length that the root fault repair can be used). Optionally, the root fault emergency policy response system 400 may further make a scheduling policy of a service man based on the available time for repairing the root fault, which is not limited in this embodiment.
Optionally, the indication information may also carry type information of the preset type domain name. In one example, if the preset type domain name is all domain names with top-level domain name of gov, the indication information may carry a type field with a value of "gov". In this way, the root fault emergency policy response system may determine which domain name resolution services of the domain names are reflected in the tolerable operation duration in the indication information based on the value of the type field in the indication information. In this way, the indication information provides a more definite and referential indication for the root fault emergency policy response system.
Further, in an example, when the root fault analysis server 100 stores tolerable operation durations for a plurality of preset type domain names (e.g., a plurality of preset type domain names corresponding to a plurality of recursive servers, or a plurality of preset type domain names corresponding to a plurality of regions, respectively), the stored type information of each tolerable operation duration and the preset type domain name corresponding to each tolerable operation duration may be carried in the indication information and sent to the root fault emergency policy response system 500 together.
Through the scheme, when the root fault occurs, the basis and the indication for the root fault repair strategy formulation and the maintenance personnel scheduling strategy formulation are provided for the root fault emergency strategy response system, and the formulated strategy is enabled to be more reasonable, so that the root fault repair progress can be further enabled to accord with the actual expectation of the user on the domain name resolution service quality of the preset type domain name.
Optionally, in the embodiment of the present application, S210 may have various implementations. As described in detail below.
In one embodiment, as shown in FIG. 3, S210 may include S211-S214. The details are set forth below.
S211, acquiring the resolving success rate of the preset type domain name at different sampling time points.
S212, according to the first time interval, obtaining a first slope corresponding to the first time interval according to the analysis success rate of at least two sampling time points in each first time interval in sequence, and determining the minimum analysis success rate in the first time interval.
S213, when a first slope lower than a first threshold is calculated for the first time, determining a first time interval corresponding to the first slope as a first target interval, or when a minimum resolution success rate lower than a second threshold is found for the first time, determining a first time interval where the minimum resolution success rate is located as a first target interval.
S214, determining the sum of the first target interval and all first time intervals before the first target interval as the tolerable operation time length.
In step S211, a plurality of sampling time points may be sequentially determined from the start time, and the resolution success rate of the preset type domain name at each sampling time point is respectively obtained.
In this embodiment of the present application, the starting time may be understood as a time point at which the current remaining lifetime of each cache record of each preset-type domain name and its ancestor domain name at the recursion node is obtained hereinafter, for example.
Alternatively, the resolution success rate of the preset type domain name at any sampling time point may be obtained through the process shown in fig. 4. The detailed description is as follows.
S401, determining an effective domain name corresponding to the sampling time point.
S402, determining the resolution request quantity of the effective domain name corresponding to the sampling time point.
And S403, determining the resolution request quantity of the preset type domain name corresponding to the sampling time point.
S404, determining the ratio of the sum of the resolution request quantities of the effective domain names corresponding to the sampling time points to the sum of the resolution request quantities of the preset type domain names at the sampling time points as the resolution success rate of the preset type domain names at the sampling time points.
In this embodiment, when it is required to determine that the domain name of the preset type is at a certain sampling time point (for example,T j) The resolution success rate of (2), then the sampling time pointT jIs the sampling time point in S401.
The valid domain name corresponding to the sampling time point can be understood as follows: and the preset type domain name is valid at the sampling time point and at least one time point of the ending time point and the starting time point of the second time interval where the sampling time point is located. This can also be understood as follows: and resolving the preset type domain name with the unspent duration at the sampling time point and at least one of the ending time point and the starting time point of the second time interval where the sampling time point is located. Wherein the resolvable time duration of the preset type domain name valid at any time point is longer than the sum of all the second time intervals which have passed since the time point. Any sampling time point is in a second time interval. The resolvable duration of a preset type domain name represents the duration that the preset type domain name can be queried from the recursion node after the root fault.
In this embodiment, the sampling time point is usedT jFor example, S401 may have various embodiments.
In one embodiment, the sampling time point may be directly determinedT jThe time length between the time and the starting time (called 'the current elapsed time length') and the preset type domain name with the resolution time length being larger than the current elapsed time length is determined as the time point of samplingT jValid domain names of a predetermined type, i.e. sampling time pointsT jThe corresponding valid domain name.
In another embodiment, S401 may be implemented by the flow shown in fig. 5, which is described in detail as follows.
S501, determining a second time interval.
It is worth mentioning that any one sampling time point is in one second time interval.
In other words, if the second time interval ist 2Then, thent 2And sampling time pointT jThere may be a relationship: (n-1). sup. (R)t 2T j≤n*t 2Wherein n is an integer not less than 1.
S502, according to the second time intervals, sequentially determining the preset type domain name valid at the ending time point of each second time interval (also the starting time point of the next second time interval).
In detail, at the termination time point of each second time interval, determining the number of second time intervals (assuming that m, m is a positive integer) that each domain name of the preset type has passed at the termination time point of the second time interval, and then by comparing the sum of the resolvable time duration of the domain name of the preset type and the m second time intervals, determining whether the resolvable time duration of the domain name of the preset type is exhausted.
Specifically, if the resolvable duration of the preset type domain name is longer than the sum of m second time intervals, it is determined that the resolvable duration of the preset type domain name is not exhausted, in other words, the preset type domain name is valid.
It is worth noting that the resolvable duration of a domain name of a preset type represents the duration that the domain name of the preset type can be queried from the recursive node after the root fault.
S503, for any sampling time pointT jCan determine theT jAt a second time interval and will be atT jThe preset type domain name is valid at the starting time point of the second time interval and/orT jThe preset type domain name with the effective termination time point of the second time interval is determined as the sampling time pointT jThe corresponding valid domain name.
In another embodiment, the sampling time point determined by the above two methods can be usedT jEffective preset type domain names are all determined as sampling time pointsT jThe corresponding valid domain name. The present embodiment does not limit this.
In this embodiment, when a domain name is at a sampling time (e.g., as described above)T j) If valid, the domain name is at the sampling time pointT jCan be successfully resolved, in other words, at the sampling time pointT jA resolution request initiated for the domain name may be successfully responded to. When a domain name is at a sampling time pointT jFailure means that the domain name is at the sampling time pointT jCannot be successfully resolved, in other words, at the sampling time pointT jA resolution request initiated for the domain name cannot be successfully responded to.
Based on this, at the sampling time pointT jThe ratio of the analysis requests which can be successfully responded to in all the analysis requests initiated by all the preset domain names is the ratio of the preset domain names at the sampling time pointT jThe resolution success rate of (1).
In detail, still with samplingPoint in timeT jFor example, in S402, suppose the sampling time pointT jIf the corresponding valid domain names are K, it is necessary to respectively determine the sampling time points of the K valid domain namesT jThe request quantity of the K effective domain names is analyzed, and then the K effective domain names are respectively sampled at the time pointT jThe analysis request quantities are summed to obtain a first sum value. In S403, it is required to respectively determine that all the domain names of the preset types are respectively at the sampling time pointT jAnd analyzing the request quantity and respectively setting all the preset type domain names at the sampling time pointT jThe second sum is obtained by summing the analysis request quantities. It should be noted that the resolution request amount of a domain name corresponding to a sampling time point may be understood as the number of resolution requests initiated for the domain name at the sampling time point.
Then, the ratio of the first sum value to the second sum value is obtained, and the ratio is the sampling time point of the preset type domain nameT jThe resolution success rate of (1).
Optionally, before executing S401, the root fault resolution server 100 may further determine a time length that each preset type domain name and its ancestor domain name can be resolved, that is, a time length that each preset type domain name and its ancestor domain name can be queried on the recursion node after the root fault.
In this embodiment, the preset type domain name is composed of more than one set of ASCII (American Standard Code for Information exchange) or national language characters, each set of characters is separated by dot numbers, the rightmost character set is called a top-level domain name or a first-level domain name, the second last group is called a second-level domain name, the third last group is called a third-level domain name, and so on.
Assuming that the preset type domain name includes X (X is a positive integer greater than 1) character groups, then in order from left to right, for any one character group (e.g., the first one)x1 is less than or equal tox≤X,xIs a positive integer), the firstxThe domain name represented by the +1 character group to the Xth character group is the secondxThe upper level domain name of the domain name formed by the character groups to the Xth character group.
Taking the tertiary domain name "www.abc.com" as an example, X = 3. Com "is a top-level domain name of a domain name www.abc.com" composed of a third character group "www", a second character group "abc", and a third character group "com".
In this embodiment, an ancestor domain name of a preset type domain name refers to all levels of domain names from a parent domain name of the preset type domain name to a top level domain name.
Based on this, referring to fig. 6, before executing S401, the duration indication method provided in this embodiment may further include the steps shown in fig. 6.
S601, respectively obtaining each preset type domain name and the current remaining survival time of the ancestor domain name of the preset type domain name in the cache record of the recursion node.
S602, respectively obtaining the maximum survival time of each preset type domain name and the cache record of the ancestor domain name of the preset type domain name.
The recursion node here may be a common recursion node. In practical application, a user side can send an analysis request to a recursion node aiming at a certain domain name, the recursion node can firstly check whether a cache record of the domain name is cached locally, if not, the recursion node can inquire from an iteration side (corresponding domain name server), when an inquiry result is obtained, the recursion node can locally cache the domain name so as to form the cache record of the domain name, at the moment, the cache record has a lifetime, and the lifetime is the maximum lifetime of the domain name. The maximum lifetime of the cache record for each level of domain name may be obtained from the authoritative server 500 for that level.
The time-to-live of the cache record of a domain name in the recursion node is decreased from the maximum time-to-live with the increase of time. Accordingly, for each time point, there exists a current remaining lifetime for the cache record of the domain name, which can be obtained from the common recursion node.
In this embodiment, S601 may be implemented as follows: aiming at each preset type domain name and the ancestor domain name of the preset type domain name, simulating a user to query the recursion node through a dial testing server respectively so as to obtain the current remaining survival time of the cache records of the preset type and the ancestor domain name of the preset type in the recursion node respectively.
Alternatively, S602 may be implemented as follows: aiming at each preset type domain name and each level domain name in ancestor domain names of the preset type domain names, respectively simulating a user through the dial testing server to query an authoritative server of the level to which the domain name belongs so as to obtain the maximum survival time of the cache record of the domain name.
The dial-up test server 200 may be a pre-built server, which may respond to a request from the root fault analysis server 100, or actively send a dig command to the recursion node for each preset type domain name and each ancestor domain name thereof, so as to obtain the current remaining lifetime of the corresponding domain name returned by the recursion node.
Correspondingly, the dial testing server 200 may respond to the request of the root failure analysis server 100, or actively determine the level of each domain name in each preset type domain name and its ancestor domain name, and send a dig command and a trace command to the authoritative server 500 at the determined level, so that the authoritative server 500 returns the maximum lifetime of the domain name.
S603, taking each preset type domain name as a target domain name, and aiming at the target domain name and each level domain name in ancestor domain names of the target domain name, executing the following steps: if the current remaining lifetime of the current level domain name is greater than or equal to the resolvable duration of the previous level domain name, the resolvable duration of the current level domain name is the current remaining lifetime of the current level domain name; or, if the current remaining duration of the current-level domain name is less than the resolvable duration of the previous-level domain name, determining the resolvable duration of the current-level domain name according to the resolvable duration of the previous-level domain name, the current remaining lifetime of the current-level domain name and the maximum lifetime of the current-level domain name; wherein the resolvable time length of the root domain name of the target domain name is 0.
In this embodiment, a preset type domain name and its ancestor domain name may be regarded as a domain name group, and the domain name group includes at least one level domain name. It is worth mentioning that when the number of domain names included in a domain name group is greater than 1, the domain names in the domain name group belong to different levels, and the levels are consecutive to each other. In the implementation process, each domain name group may be processed in sequence, and the preset type domain name in the currently processed domain name group is the target domain name.
In the implementation process, the domain names in the domain name group can be sequentially determined as the domain names of the current level according to the size of the domain name level. For example, when the target domain name is www.abc.com, the set of domain names includes { www.abc.com,. abc.
In one example, the domain names in the domain name group may be determined as the current level domain names in sequence from the largest to the smallest of the domain name levels. In particular, www.abc.com may be first determined to be the current level domain name, then the domain name at the previous level is. Com is then determined to be the current level domain name, and the domain name at the previous level is com. And finally, determining com as the current level domain name, and then taking the upper level domain name as the root domain name.
In another example, the domain names in the domain name group may be determined as the domain names of the current level in order from small to large in the domain name level. In particular, com, abc, com, www.abc.com may be determined as the current level domain name in turn, and their respective corresponding previous level domain names may be referred to the description of the previous example.
After the current level domain name is determined, the current remaining lifetime and the maximum lifetime of the current level domain name and the resolvable duration of the domain name at the upper level of the current level domain name can be obtained. Then, the resolvable duration of the domain name at the previous level may be compared with the current remaining lifetime of the domain name at the current level, and if the current remaining lifetime of the domain name at the current level is greater than or equal to the resolvable duration of the domain name at the previous level, after the current remaining lifetime of the domain name at the current level is exhausted, the cache record of the domain name at the current level may not be formed based on the cache record of the domain name at the previous level. In other words, the resolvable duration of the current level domain name is the current remaining lifetime thereof.
It should be noted that, in the present embodiment, since the relevant processing in the case of a root fault is considered, the resolvable time length of the root domain name defaults to 0.
If the current remaining duration of the current-level domain name is less than the resolvable duration of the previous-level domain name, the resolvable duration of the current-level domain name at least includes the current remaining duration of the current-level domain name. And after the current remaining duration of the current level domain name is exhausted, because the cache record of the previous level domain name still exists, a new cache record of the current level domain name can be formed based on the cache record of the previous level domain name. Therefore, in this case, the resolvable duration of the current level domain name may be determined according to the resolvable duration of the previous level domain name, the current remaining lifetime of the current level domain name, and the maximum lifetime.
In this embodiment, optionally, in S603, the step of determining the resolvable time length of the current-level domain name according to the resolvable time length of the previous-level domain name, the current remaining time length of the current-level domain name, and the maximum time length of the current-level domain name may be implemented by the steps shown in fig. 7.
S701, determining the survivable time length of the current level domain name after the current remaining time length is exhausted.
S702, summing the survival time length and the current remaining time length of the current level domain name to obtain the time length which can be resolved of the current level domain name.
S701 may be implemented by the flow shown in fig. 8:
s801, obtaining a difference time length between the time length which can be analyzed of the domain name of the upper level and the current remaining survival time length of the domain name of the current level.
S802, rounding the quotient of the difference time length and the maximum survival time length of the current level domain name upwards to obtain a target number, and determining the product of the target number and the maximum survival time length of the current level domain name as the survival time length.
In this embodiment, after the current remaining duration of the current level domain name is exhausted, there are the following two cases:
1) the difference between the resolvable time length of the domain name at the upper level and the current remaining lifetime of the domain name at the current level is a positive integer of the maximum lifetime of the domain name at the current level (for example, the difference isy 1) The resolvable time of the current level domain name may further includey 1A maximum lifetime. At this time, the resolvable duration of the current level domain name is the current remaining duration of the current level domain name and the maximum lifetime duration of the y current level domain names. Where y may be considered the result of rounding up y.
2) The difference between the resolvable time length of the domain name at the previous level and the current remaining lifetime of the domain name at the current level is the fraction of the maximum lifetime of the domain name at the current level (for example, the difference isy 2) Multiple, the integer part of the decimal beingy 21The decimal part isy 22The resolvable duration of the current level domain name may further includey 21A maximum lifetime, andy 22within the corresponding time length, the current level domain name may also form a new cache record based on the cache record of the previous level domain name, and the cache record may maintain a maximum lifetime, that is, the time length for which the current level domain name may be resolved may further include a maximum lifetime. Thus, in this case, the resolvable duration of the current level domain name may be the current remaining duration of the current level domain name andy 21the maximum lifetime of +1 current level domain names. Wherein the content of the first and second substances,y 21+1 can be regarded as a pairy 2Rounding up the result.
Referring to fig. 3 again, in step S212, the first time interval is greater than or equal to the interval between two adjacent sampling time points. Thus, a first time interval (inclusive of endpoints) may comprise at least two sampling time points.
If the first time interval is usedt 1t 1>0) Means for any onet 1The corresponding first slope may be obtained in a variety of ways.
In an alternative manner, a first time interval includes only two sampling time points, a slope may be directly calculated based on the resolution success rates corresponding to the two sampling time points, and the slope may be used as a first slope corresponding to the first time interval.
In another alternative, a first time interval comprises at least three sampling points in time.
In this embodiment, on one hand, the analysis success rate corresponding to two sampling time points may be randomly selected from at least three sampling time points to perform slope calculation, so as to obtain the first slope. On the other hand, a sampling time point closest to the start time point of the first time interval and a sampling time point closest to the end time point of the first time interval may be selected from the at least three sampling time points, and slope calculation may be performed based on the analysis success rates corresponding to the two selected sampling time points, so as to obtain a first slope corresponding to the first time interval.
In another aspect, slope calculation may be sequentially performed based on the resolution success rates corresponding to two adjacent sampling time points, so that a plurality of slopes corresponding to a first time interval may be obtained, and a maximum slope of the plurality of slopes may be determined as a first slope corresponding to the first time interval.
It can be understood that the minimum analysis success rate in the first time interval is a minimum value of the analysis success rates respectively corresponding to the sampling time points included in the first time interval.
Regarding step S213, in a possible implementation manner, starting from the starting time, for each first time interval, it may be determined whether a first slope corresponding to the first time interval is lower than a first threshold, and whether a minimum resolution success rate in the first time interval is lower than a second threshold. If any one of the determination results is yes, the current first time interval may be determined as the first target interval.
In another possible implementation manner of step S213, when a first slope that is lower than a first threshold occurs is calculated for the first time, a first time interval corresponding to the first slope may be determined as a candidate first target interval; and when the minimum analysis success rate lower than the second threshold value is found for the first time, determining the first time interval where the minimum analysis success rate is located as a candidate first target interval. In this way, two candidate first target intervals may be found, and one of them, which is closer to the start time, may be determined as the final first target interval.
In implementing step S214, it may be determined that the first target interval is the nth first time interval from the starting time, so that the product of n and the first time interval may be determined as the tolerable operating duration of the preset type domain name.
Referring again to fig. 2, in another embodiment of S210, S210 may include S215-S218 shown in fig. 9.
S215, obtaining the average resolution time delay of the recursive cache side of the preset type domain name at different sampling time points.
S216, according to a first time interval, sequentially obtaining a second slope corresponding to the first time interval according to the average analysis time delay of the recursive cache sides of at least two sampling time points in each first time interval, and determining the maximum average analysis time delay of the recursive cache sides in the first time interval, wherein the first time interval is greater than or equal to the interval of two adjacent sampling time points.
S217, when the second slope reaching the third threshold is calculated for the first time, determining a first time interval corresponding to the second slope as a second target interval, or when the maximum recursive cache side average resolution delay reaching the fourth threshold is found for the first time, determining a first time interval in which the maximum recursive cache side average resolution delay is located as the second target interval.
S218, determining the sum of the second target interval and all first time intervals before the second target interval as the tolerable operation time length.
In step S215, the definition of the sampling time point is similar to that described above, and is not described herein again.
In the implementation process, the average resolution time delay of the preset type domain name at the recursive cache side of the sampling time point can be obtained at each sampling time point in sequence from the starting time.
It should be noted that the average resolution delay of the recursive cache side of a sampling time point refers to an average value of resolution delays of all resolution requests accessing the domain name of the preset type at the sampling time point by the recursive node. The resolution delay of a resolution request by a recursion node refers to the time length from the time when a user initiates a resolution request (also referred to as a "query request") to the recursion node to the time when the recursion node returns a resolution result.
Alternatively, the recursive buffer-side average resolution delay of the preset type domain name at a sampling time point may be obtained through the process shown in fig. 10, which is described in detail below.
S1001, obtaining the resolving success rate of the preset type domain name at the sampling time point.
In this embodiment, the detailed implementation manner of S1001 is similar to that of S401-S404 shown in fig. 4, and reference may be specifically made to the above description of the steps shown in fig. 4, which is not described herein again.
And S1002, according to the resolution success rate and the resolution failure rate of the preset type domain name at the sampling time point, carrying out weighted summation on the overall average time delay and the overtime time delay of the recursion node to obtain the average resolution time delay of the preset type domain name at the recursion cache side of the sampling time point.
Wherein the resolution failure rate is a difference between 1 and the resolution success rate, for example, if the preset type domain name is at a sampling time pointT jHas a resolution success rate ofα jIf the resolution failure rate of the preset type domain name at the sampling time point is 1-α j
In this embodiment, for an analysis request for a preset type domain name that can be successfully analyzed, it may be default that the analysis delay is an overall average delay, that is, an average analysis delay of the preset type domain name when no root fault occurs.
The recursion node is usually provided with a timeout delay, and when the processing of an analysis request exceeds the timeout delay and still cannot obtain an analysis result, the processing is not continued. For the analysis request aiming at the preset type domain name which cannot be successfully analyzed, the analysis result can not be obtained within the overtime delay usually, so that the analysis delay can be determined as the overtime delay set by the recursion node. In this case, the resolution success rate will beα jAs the overall average delay of 1-α jThe resolution failure rate is used as the weight of the overtime delay, and the total average delay and the overtime delay are subjected to weighted summation to obtain the preset type domain name at the sampling time pointT jThe recursive buffer side of (2) averages the resolution delay.
In step S216, the definition of the first time interval is similar to that described above, and is not described herein again.
In implementation, for any one of the first time intervals, the corresponding first slope may be obtained in various ways. The details are as follows.
In a possible manner, a first time interval includes only two sampling time points, and then a slope may be directly calculated based on the analysis success rates corresponding to the two sampling time points, and the slope may be used as a second slope corresponding to the first time interval.
In another alternative, the first time interval comprises at least three sampling time points. In an example of this embodiment, the average analysis delay on the recursive buffer side corresponding to two sampling time points may be randomly selected from at least three sampling time points to perform slope calculation, so as to obtain a second slope corresponding to the first time interval. In another example, a sampling time point closest to a start time point of the first time interval and a sampling time point closest to an end time point of the first time interval may be selected from at least three sampling time points, and slope calculation may be performed based on the average resolution delay on the recursive cache side corresponding to the selected two sampling time points, so as to obtain a second slope corresponding to the first time interval.
In another example, slope calculation may be sequentially performed based on the average resolution delay at the recursive cache side corresponding to two adjacent sampling time points, so that a plurality of slopes corresponding to a first time interval may be obtained, and a maximum slope of the plurality of slopes may be determined as a second slope corresponding to the first time interval.
It can be understood that the maximum recursive cache side average resolution delay in the first time interval is a maximum value in the recursive cache side average resolution delays corresponding to each sampling time point included in the first time interval.
In a possible implementation manner of step S217, starting from the starting time, for each first time interval, it may be determined whether a second slope corresponding to the first time interval reaches a third threshold, and whether a maximum recursive buffer-side average resolution delay in the first time interval reaches a fourth threshold. If any one of the determination results is yes, the current first time interval may be determined as the second target interval.
In another possible implementation manner of step S217, when a first occurring second slope reaching the third threshold value is determined, a first time interval corresponding to the second slope may be determined as a candidate second target interval; and when the maximum recursive cache side average analysis time delay reaching the fourth threshold is found for the first time, determining a first time interval corresponding to the maximum recursive cache side average analysis time delay as a candidate second target interval. Then, one of the two determined candidate second target intervals that is closer to the start time may be determined as a final second target interval.
In step S218, it may be determined that the second target interval is the nth 'first time interval from the starting time, so that the product of n' and the first time interval may be determined as the tolerable operating duration of the preset type domain name.
It should be noted that the first target interval and the second target interval may be the same first time interval or different first time intervals. In a possible manner, in the case where the first target interval and the second target interval are different first time intervals (i.e., n is different from n '), a preset priority of the resolution success rate and the average resolution delay of the recursive cache side may be determined, and if the preset priority of the resolution success rate is higher than the preset priority of the average resolution delay of the recursive cache side, a product of n and the first time interval may be determined as a final tolerable operation duration, otherwise, a product of n' and the first time interval may be determined as the final tolerable operation duration. In another possible way, one of the first target interval and the second target interval which is closer to the starting time may be selected, and the product of the sequence number (n or n') of the selected interval and the first time interval may be determined as the final tolerable operating duration.
It should be appreciated that the above description is merely exemplary, and that the manner of how the tolerable operating time period is determined based on the first target interval and the second target interval may be other manners when the first target interval and the second target interval are different. The present embodiment does not limit this.
In this embodiment, S211-S214 shown in fig. 3 and S215-S218 shown in fig. 9 may be in an alternative execution relationship, or may be in a parallel execution relationship. In the case of parallel execution, there may be no strict timing relationship between the two processes, or S211-S214 may be executed first, and then S215-S218 may be executed based on the analysis success rate calculated in the execution process of S211-S214. The present embodiment is not strictly limited thereto.
Through the design, the tolerable operation time of the preset type domain name can be basically and accurately determined, so that the root fault emergency strategy response system is provided after the root fault occurs and is carried in the indication information in time, and powerful support is provided for formulation of a root fault repair strategy and a maintenance personnel scheduling strategy.
For the convenience of understanding of those skilled in the art, the following takes a domain name with a preset type domain name being the Top 10 ten thousand digits of the recursive cache side query volume of the operator (hereinafter referred to as "cache side query volume Top 10 ten thousand domain name") as an example, and an application flow of the time duration indication method provided by the embodiment of the present application is exemplarily described.
1. Each operator of each administrative area can pass SFTP (Secure File Transfer Protoco)l, secure file transfer protocol) respectively acquiring time periods of all recursive servers of the clientT 1The internal cache side query amount Top 10 thousands of domain names and their access amounts are reported to the root failure analysis server 100.
The cache side query volume of an operator can be understood as the number of query requests sent by a user side to the recursive server of the operator, and one query request corresponds to one domain name. Then, during a time period (referred to herein as a target time period), a domain name may correspond to one or more query requests. In implementation, a certain recursive server or the root failure analysis server 100 of an operator may count the number of all query requests for a domain name received by the recursive side (all recursive servers) of an operator in the target time period, that is, the query amount of the domain name at the recursive cache side of the operator.
Further, the query quantity of the domain name at the recursive cache side of each operator in the target time period may be summed to obtain the query quantity of the domain name at the recursive cache side of the operator in the target time period. And sequencing the query quantity of all the domain names on the cache side in the target time period, and finding out the domain name with the top 10 ten thousand digits, namely the domain name with the preset type in the example.
2. And setting up a dial testing server for simulating a user to access the domain name. In implementation, for each of the domain names (i.e. the preset type domain names) in the cache side query volume Top 10, a query request (which may also be understood as a "resolution request") is initiated to the recursion node (e.g. 8.8.8.8), and a TTL value of the domain name in the recursion node 8.8.8.8 is obtained (TTL value is: (a)TTL cache) Here, the TTL value may serve as the current remaining lifetime in the above embodiment.
Wherein root fault analysis server 100 may obtain a domain name by dial testing the server to send a dig command to recursion node 8.8.8.8TTL cache
3. For each domain name in the 10 ten thousand domain names of the cache side query quantity Top, the authority server 500 at the level of the domain name obtains the domain nameMaximum survival time: (TTL max) The maximum lifetime here may serve as the maximum lifetime in the above-described embodiment.
Wherein, the root fault analysis server 100 may send a dig command and a trace command to the authority server 500 through the dial test server, thereby obtaining a domain nameTTL max
4. Aiming at each domain name in the 10 ten thousands of domain names of the cache side query quantity Top, the domain name is based on the corresponding domain of each level of the domain nameTTL cacheAndTTL maxand calculating the time length of the domain name which still can obtain the analysis result after the root fault, wherein the time length is the remaining survival time of the domain name.
The remaining lifetime here may serve as the resolvable time duration in the above embodiments. Accordingly, taking the preset type domain name as an example, the preset type domain name and the ancestor domain name of the preset type domain name in the above embodiments may be understood as the respective level domains of the preset type domain name.
It can be understood that the remaining lifetime of a domain name after a root failure, i.e. the time spent by the domain name one layer from the top domain to the full domain name.
In actual DNS resolution, theoretically, when a previous domain (which can be understood as a previous domain name) still survives in the recursive cache, a next domain (which can be understood as a next domain name) keeps an update available. Only after the previous domain cannot be updated, the next domain starts to really decay. Therefore, the remaining lifetime of a domain name after a root failure can be calculated as follows:
for each two adjacent level domains, taking n and n +1 (n is an integer, n is not less than 0) as an example, calculating the residual survival time of the n +1 level domain when the n level domain failsTTL n+1_usable
It should be noted that, in the following description,TTL n_cachethe remaining lifetime of the cache record of the nth domain name on the recursion node after the root fault is represented may be used as the current remaining lifetime of the previous level domain name in the above embodiment.TTL n_maxRepresenting maximum survival defined by nth level domain name in authoritative serverThe time may serve as the maximum lifetime of the domain name of the previous level in the above embodiment.TTL n_usableThe time that the nth level domain name can be queried recursively after representing the root fault can serve as the resolvable time duration of the last level domain name in the above embodiment.
TTL n+1_cacheThe remaining lifetime of the cache record of the n +1 th level domain name on the recursion node after the root fault is represented may be used as the current remaining lifetime of the current level domain name in the above embodiment.TTL n+1_maxThe maximum lifetime that represents the definition of the n +1 th level domain name in the authoritative server may serve as the maximum lifetime of the current level domain name in the above embodiment.
In particular, the amount of the solvent to be used,TTL n+1_usablecan be calculated by:
1) if it isTTL n+1_cacheTTL n_usableThen, thenTTL n+1_usable=TTL n+1_cache
It is worth mentioning that it is possible to show,TTL 0_usableindicating the availability time of the root, in the case of a root failure,TTL 0_usableand = 0. At this time, the process of the present invention,TTL 1_cache(i.e., the current remaining lifetime or remaining lifetime of the top-level domain name) must be greater than or equal toTTL 0_usableThen it will have toTTL 1_usable=TTL 1_cache
2) If it isTTL n+1_cache< TTL n_usableAnd then:
TTL n+1_usable=⌈( TTL n_usable-TTL n+1_cache)/ TTL n+1_max ⌉* TTL n+1_max+TTL n+1_cache, (1)
the meaning of the above expression (1) is as follows: for a domain name of level n +1, it can survive firstTTL n+1_cacheWhen is coming into contact withTTL n+1_cacheIs exhausted ifTTL n_usable>TTL n+1_cacheThen the n +1 th level domain name can be generatedStorage ⌈ ( TTL n_usable-TTL n+1_cache)/ TTL n+1_max ⌉* TTL n+1_max. Wherein, "⌈x⌉' represents a pairxAnd rounding up.
5. Determining analysis time granularityt a(e.g., may be 1 hour) at intervalst aFor each domain name in the 10 ten thousand domain names of the cache side query quantity Top, whether the remaining survival time of the domain name after the root fault is greater than or not is judgedt aM, m is the number of analysis time granularities that have currently been experienced. If yes, the domain name cannot be successfully resolved, namely the domain name is a failure domain name.
It is worth to be noted that, heret aMay serve as the second time interval in the above-described embodiment.
6. Determining a plurality of sampling time points for a certain sampling time pointT j((n-1)* t aT j≤n*t aN is more than or equal to 1 and is an integer), the total access amount aiming at the cache side query amount Top 10 ten thousand domain names isN j(ii) a Counting sampling time pointsT jThe resolution request amount of each non-failure domain name (namely, effective domain name) isM jkIf the number of valid domain names is K, sampling time pointsT jThe resolution success rate is as follows:
Figure 38610DEST_PATH_IMAGE001
in this way, multiple resolution success rates within the target time period may be obtained.
7. And calculating the average resolution time delay of the recursive cache side.
Assuming that the timeout delay set by the recursive node is 5 seconds, the maximum resolution delay on the cache side of the recursive node is 5 seconds. For the resolution request of the invalid domain name, the resolution delay of the resolution request at the recursive cache side is the maximum resolution delay at the recursive cache side, namely 5 seconds.
For a certain sampling time point, e.g. as described aboveT jCorresponding theretoAverage resolution time delay at recursive buffer sideβ jCan be calculated by the following expression (3):
Figure 27294DEST_PATH_IMAGE002
wherein the content of the first and second substances,γ 1which represents the overall average time delay and is,γ 2representing the time-out delay set by the recursive node. The total average delay may be directly obtained from a value reported by an operator, or may be obtained from an empirical value, such as 3 seconds or 5 seconds. Here, the value reported by the operator may be an average resolution delay of the cache side query amount Top 10 ten thousand domain names when no root fault occurs.
In this way, a plurality of average analytic delays within the target time period may be obtained.
8. For each time intervalt bt bGreater than or equal to two adjacent sampling time pointsT jInterval (d). At the ith time intervalt bFor example, the ith is obtainedt bThe success rate of the analysis of each sampling time point in the data acquisition unit is calculated, and a first slope (which can be understood as the ith slope) is calculated based on the acquired datat bTotal slope of inner resolution success rate), and itht bMinimum resolution success rate; get the itht bThe average analytic time delay of each sampling time point in the time delay unit, and a second slope (which can be understood as the ith slope) is calculated based on the acquired datat bTotal slope of inner average analytic delay), and itht bMaximum average resolution delay within.
Herein, thet bMay serve as the first time interval in the above-described embodiment.
9. If at least one of the following conditions is satisfied, the following conditions may be satisfiedt bI is used as the tolerable operation duration of the domain name resolution service after the root fault:
the itht bThe corresponding first slope is lower than a first threshold;
the itht bCorresponding second slope reachesA third threshold value;
the itht bThe corresponding minimum resolution success rate is lower than a second threshold;
the itht bAnd the average resolution time delay of the corresponding maximum recursive cache reaches a fourth threshold.
10. And updating the currently stored tolerable operation time length after the fault to the tolerable operation time length calculated in the step 9.
11. And when a root fault notification is received, sending fault repair indication information to a root fault emergency strategy response system, wherein the fault repair indication information at least carries the currently stored tolerable operating time length.
In practical application, the root fault emergency policy response system may also be a preset communication terminal, where the preset communication terminal may be a communication terminal of a pre-configured related person responsible for making a root fault repair policy and a maintenance staff scheduling policy.
Referring to fig. 11, a duration indicating apparatus 1100 according to an embodiment of the present application is shown, where a duration indicating module 1100 includes a duration determining module 1110 and a duration indicating module 1120.
The duration determining module 1110 is configured to determine a tolerable operation duration of the preset type domain name according to a resolution success rate of the preset type domain name and/or a variation of an average resolution delay of a recursive cache side.
The duration indication module 1120 is configured to, when receiving the root fault notification, send indication information to the root fault emergency policy response system, where the indication information includes the tolerable operation duration, and the indication information is used to instruct the root fault emergency policy response system to prepare a root fault repairing policy based on the tolerable operation duration.
Optionally, the duration determination module 1110 may include a first determination submodule 1111 and/or a second determination submodule 1112.
The first determination sub-module 1111 is configured to:
acquiring the resolving success rate of the preset type domain name at different sampling time points; according to a first time interval, obtaining a first slope corresponding to the first time interval according to the analysis success rate of at least two sampling time points in each first time interval in sequence, and determining the minimum analysis success rate in the first time interval, wherein the first time interval is greater than or equal to the interval of two adjacent sampling time points; when a first slope lower than a first threshold value is calculated for the first time, determining a first time interval corresponding to the first slope as a first target interval, or when a minimum analysis success rate lower than a second threshold value is found for the first time, determining the first time interval where the minimum analysis success rate is located as the first target interval; determining the first target interval and the sum of all first time intervals before the first target interval as the tolerable operating duration.
Second determination submodule 1112 is configured to:
acquiring the average resolution time delay of the recursive cache side of the preset type domain name at different sampling time points; according to a first time interval, sequentially obtaining a second slope corresponding to the first time interval according to the average analysis time delay of the recursive cache side of at least two sampling time points in each first time interval, and determining the maximum average analysis time delay of the recursive cache side in the first time interval, wherein the first time interval is greater than or equal to the interval of two adjacent sampling time points; when a second slope reaching a third threshold value is calculated for the first time, determining a first time interval corresponding to the second slope as a second target interval, or when the average resolution time delay of the maximum recursive cache side reaching a fourth threshold value is found for the first time, determining a first time interval in which the average resolution time delay of the maximum recursive cache side is located as the second target interval; determining the second target interval and the sum of all first time intervals before the second target interval as the tolerable operating duration.
Optionally, the duration determination module 1110 may further include a third determination submodule 1113.
The third determination submodule 1113 is configured to: acquiring the resolution success rate of the preset type domain name at the sampling time point; according to the resolution success rate and the resolution failure rate of the preset type domain name at the sampling time point, carrying out weighted summation on the overall average time delay and the overtime time delay of the recursion node to obtain the average resolution time delay of the preset type domain name at the recursion cache side of the sampling time point; the analysis failure rate is a difference value between 1 and the analysis success rate, and the total average time delay is the average analysis time delay of the preset type domain name when no root fault occurs.
Optionally, the duration determination module 1110 may further include a fourth determination submodule 1114.
The fourth determination submodule 1114 is configured to:
determining an effective domain name corresponding to the sampling time point; the effective domain name corresponding to the sampling time point is the preset type domain name which is effective at least one time point of the sampling time point and the termination time point and the starting time point of the second time interval where the sampling time point is located; the resolvable time length of the preset type domain name which is effective at any time point is longer than the sum of all second time intervals which have passed by the time point, and any sampling time point is in one second time interval; the resolvable time length of a preset type domain name represents the time length from the recursive node to the preset type domain name after a root fault occurs; determining the resolution request quantity of the effective domain name corresponding to the sampling time point; determining the analysis request quantity of the preset type domain name corresponding to the sampling time point; and determining the ratio of the sum of the resolution request quantities of the effective domain names corresponding to the sampling time points to the sum of the resolution request quantities of the preset type domain names at the sampling time points as the resolution success rate of the preset type domain names at the sampling time points.
Optionally, the duration determination module 1110 may further include a fifth determination sub-module 1115.
The fifth determination submodule 1115 is configured to:
respectively acquiring each preset type domain name and the current remaining survival time of the ancestor domain name of the preset type domain name in the cache record of the recursion node; respectively acquiring the maximum survival time of each preset type domain name and the cache record of the ancestor domain name of the preset type domain name; taking each preset type domain name as a target domain name, and executing the following steps aiming at the target domain name and the domain name of each level in the ancestor domain name of the target domain name: if the current remaining lifetime of the current level domain name is greater than or equal to the resolvable duration of the previous level domain name, the resolvable duration of the current level domain name is the current remaining lifetime of the current level domain name; or, if the current remaining duration of the current-level domain name is less than the resolvable duration of the previous-level domain name, determining the resolvable duration of the current-level domain name according to the resolvable duration of the previous-level domain name, the current remaining lifetime of the current-level domain name and the maximum lifetime of the current-level domain name; wherein the resolvable time length of the root domain name of the target domain name is 0.
Optionally, the fifth determining sub-module 1115 may determine, according to the resolvable time duration of the previous level domain name, the current remaining time duration and the maximum time duration of the current level domain name, the resolvable time duration of the current level domain name according to:
determining the survivable time length of the current level domain name after the current remaining time length is exhausted; and summing the survivable time length and the current remaining time length of the current level domain name to obtain the analyzable time length of the current level domain name.
Optionally, the fifth determining sub-module 1115 may determine the survivable time length of the current level domain name after the current remaining time length is exhausted by:
acquiring the difference time length between the analyzable time length of the domain name of the upper level and the current remaining survival time length of the domain name of the current level; and rounding the quotient of the difference time length and the maximum survival time length of the current level domain name upwards to obtain a target number, and determining the product of the target number and the maximum survival time length of the current level domain name as the survival time length.
Optionally, the fifth determining sub-module 1115 simulates, by a dial-up measurement server, a user to query the recursive node for each preset type domain name and an ancestor domain name of the preset type domain name, respectively, so as to obtain current remaining lifetime of the cache record of each of the preset type and the ancestor domain name of the preset type at the recursive node.
Optionally, the fifth determining sub-module 1115 is configured to, for each preset type domain name and each level of domain name in the ancestor domain name of the preset type domain name, respectively simulate, by the dial-up test server, a user to query an authoritative server of the level to which the domain name belongs, so as to obtain the maximum lifetime of the cache record of the domain name.
For the detailed implementation principle of the above functional modules, reference may be made to the foregoing description of related method embodiments, which are not described herein again.
Through the design, the duration indicating device 1100 can provide powerful guidance information for the root fault emergency strategy response system after the root fault, so that the root fault emergency strategy response system can make a reasonable root fault repair strategy and a maintenance personnel scheduling strategy.
Referring to fig. 12, an architecture diagram of an electronic device 1200 provided in an embodiment of the present application is shown, where the electronic device 1200 may be, for example, the root failure analysis server 100 described above.
The electronic device 1200 in the embodiments of the present application may include one or more of the following components: a processor 1210, a memory 1220, and one or more programs, wherein the one or more programs may be stored in the memory 1220 and configured to be executed by the one or more processors 1210, the one or more programs configured to perform the duration indication method as described in the foregoing embodiments.
Processor 1210 may include one or more processing cores. The processor 1210, using various interfaces and connections throughout the electronic device 1200, performs various functions and processes data of the electronic device 1200 by executing or executing instructions, programs, code sets, or instruction sets stored in the memory 1220, and invoking data stored in the memory 1220. Alternatively, the processor 1210 may be implemented in hardware using at least one of Digital Signal Processing (DSP), Field-Programmable Gate Array (FPGA), and Programmable Logic Array (PLA). The processor 1210 may integrate one or more of a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), a modem, and the like. Wherein, the CPU mainly processes an operating system, a user interface, an application program and the like; the GPU is used for rendering and drawing display content; the modem is used to handle wireless communications. It is understood that the modem may not be integrated into the processor 1210, but may be implemented by a communication chip.
The Memory 1220 may include a Random Access Memory (RAM) or a Read-Only Memory (Read-Only Memory). The memory 1220 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for implementing at least one function, instructions for implementing the various method embodiments described below, and the like. The stored data area may also store data created by the electronic device 1200 during use (such as the preset type domain name, above), and the like.
It should be noted that the architecture shown in fig. 12 is merely exemplary. The electronic device 1200 provided in the embodiment of the present application may further include more or fewer components than those shown in fig. 12, for example, may further include a communication unit, or has a matching value completely different from that shown in fig. 12, which is not limited in this embodiment. Further, the components shown in fig. 12 may be implemented by hardware, software, or a combination thereof.
Embodiments of the present application also provide a computer-readable storage medium, having program code stored thereon, where the program code may be invoked by a processor (for example, the processor 1210 shown in fig. 12) to perform at least some of the steps of the duration indication method provided by the above embodiments of the present application.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, apparatus, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more machine-readable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having machine-executable instructions embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by machine executable instructions. These machine-executable instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These machine-executable instructions may also be stored in a machine-readable storage medium that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the machine-readable storage medium produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks (e.g., the automatic control apparatus 800 described above).
These machine-executable instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In the description of the present application, it is to be understood that the terms "first", "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implying any number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present application, "plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
While the preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims (12)

1. A method for indicating duration, comprising:
determining tolerable operation time length of the preset type domain name according to the analysis success rate of the preset type domain name and/or the change condition of the average analysis time length of a recursion cache side;
and if the root fault notification is received, sending indication information to a root fault emergency strategy response system, wherein the indication information comprises the tolerable operation time length, and the indication information is used for indicating the root fault emergency strategy response system to make a root fault repair strategy based on the tolerable operation time length.
2. The method according to claim 1, wherein the determining the tolerable operation time length of the preset type domain name according to the resolution success rate of the preset type domain name and/or the variation of the average resolution time length of the recursive cache side comprises:
acquiring the resolving success rate of the preset type domain name at different sampling time points;
according to a first time interval, obtaining a first slope corresponding to the first time interval according to the analysis success rate of at least two sampling time points in each first time interval in sequence, and determining the minimum analysis success rate in the first time interval, wherein the first time interval is greater than or equal to the interval of two adjacent sampling time points;
when a first slope lower than a first threshold value is calculated for the first time, determining a first time interval corresponding to the first slope as a first target interval, or when a minimum analysis success rate lower than a second threshold value is found for the first time, determining the first time interval where the minimum analysis success rate is located as the first target interval;
determining the first target interval and the sum of all first time intervals before the first target interval as the tolerable operating duration.
3. The method according to claim 1, wherein the determining the tolerable operation time length of the preset type domain name according to the resolution success rate of the preset type domain name and/or the variation of the average resolution time length of the recursive cache side comprises:
acquiring the average resolution time delay of the recursive cache side of the preset type domain name at different sampling time points;
according to a first time interval, sequentially obtaining a second slope corresponding to the first time interval according to the average analysis time delay of the recursive cache side of at least two sampling time points in each first time interval, and determining the maximum average analysis time delay of the recursive cache side in the first time interval, wherein the first time interval is greater than or equal to the interval of two adjacent sampling time points;
when a second slope reaching a third threshold value is calculated for the first time, determining a first time interval corresponding to the second slope as a second target interval, or when the average resolution time delay of the maximum recursive cache side reaching a fourth threshold value is found for the first time, determining a first time interval in which the average resolution time delay of the maximum recursive cache side is located as the second target interval;
determining the second target interval and the sum of all first time intervals before the second target interval as the tolerable operating duration.
4. The method according to claim 3, wherein the recursive buffer-side average resolution delay of the domain name of the preset type at any sampling time point is obtained by the following steps:
acquiring the resolution success rate of the preset type domain name at the sampling time point;
according to the resolution success rate and the resolution failure rate of the preset type domain name at the sampling time point, carrying out weighted summation on the overall average time delay and the overtime time delay of the recursion node to obtain the average resolution time delay of the preset type domain name at the recursion cache side of the sampling time point; the analysis failure rate is a difference value between 1 and the analysis success rate, and the total average time delay is the average analysis time delay of the preset type domain name when no root fault occurs.
5. The method according to claim 2 or 4, wherein the resolution success rate of the domain name of the preset type at a sampling time point is obtained by the following steps:
determining an effective domain name corresponding to the sampling time point; the effective domain name corresponding to the sampling time point is the preset type domain name which is effective at least one time point of the sampling time point and the termination time point and the starting time point of the second time interval where the sampling time point is located; the resolvable time length of the preset type domain name which is effective at any time point is longer than the sum of all second time intervals which have passed by the time point, and any sampling time point is in one second time interval; the resolvable time length of a preset type domain name represents the time length from the recursive node to the preset type domain name after a root fault occurs;
determining the resolution request quantity of the effective domain name corresponding to the sampling time point;
determining the analysis request quantity of the preset type domain name corresponding to the sampling time point;
and determining the ratio of the sum of the resolution request quantities of the effective domain names corresponding to the sampling time points to the sum of the resolution request quantities of the preset type domain names at the sampling time points as the resolution success rate of the preset type domain names at the sampling time points.
6. The method of claim 5, wherein prior to said determining the valid domain name corresponding to the sampling time point, the method further comprises:
respectively acquiring each preset type domain name and the current remaining survival time of the ancestor domain name of the preset type domain name in the cache record of the recursion node;
respectively acquiring the maximum survival time of each preset type domain name and the cache record of the ancestor domain name of the preset type domain name;
taking each preset type domain name as a target domain name, and executing the following steps aiming at the target domain name and the domain name of each level in the ancestor domain name of the target domain name:
if the current remaining lifetime of the current level domain name is greater than or equal to the resolvable duration of the previous level domain name, the resolvable duration of the current level domain name is the current remaining lifetime of the current level domain name; or, if the current remaining duration of the current-level domain name is less than the resolvable duration of the previous-level domain name, determining the resolvable duration of the current-level domain name according to the resolvable duration of the previous-level domain name, the current remaining lifetime of the current-level domain name and the maximum lifetime of the current-level domain name; wherein the resolvable time length of the root domain name of the target domain name is 0.
7. The method according to claim 6, wherein the determining the resolvable duration of the current level domain name according to the resolvable duration of the previous level domain name, the current remaining lifetime of the current level domain name and the maximum lifetime comprises:
determining the survivable time length of the current level domain name after the current remaining time length is exhausted;
and summing the survivable time length and the current remaining time length of the current level domain name to obtain the analyzable time length of the current level domain name.
8. The method of claim 7, wherein determining the survivability duration of the current level domain name after the current remaining duration is exhausted comprises:
acquiring the difference time length between the analyzable time length of the domain name of the upper level and the current remaining survival time length of the domain name of the current level;
and rounding the quotient of the difference time length and the maximum survival time length of the current level domain name upwards to obtain a target number, and determining the product of the target number and the maximum survival time length of the current level domain name as the survival time length.
9. The method according to any one of claims 6 to 8, wherein the separately obtaining each preset type domain name and the current remaining lifetime of the cache record of the ancestor domain name of the preset type domain name in the recursion node comprises:
aiming at each preset type domain name and an ancestor domain name of the preset type domain name, simulating a user to query the recursion node through a dial testing server respectively so as to obtain the current remaining survival time of the cache records of the preset type and the ancestor domain name of the preset type in the recursion node respectively;
the obtaining of the maximum lifetime of each cache record of each preset type domain name and the ancestor domain name of the preset type domain name respectively includes:
aiming at each preset type domain name and each level domain name in ancestor domain names of the preset type domain names, respectively simulating a user through the dial testing server to query an authoritative server of the level to which the domain name belongs so as to obtain the maximum survival time of the cache record of the domain name.
10. A duration indicating device, comprising:
the time length determining module is used for determining the tolerable operation time length of the preset type domain name according to the analysis success rate of the preset type domain name and/or the change condition of the average analysis time delay of the recursive cache side;
and the time length indicating module is used for sending indicating information to the root fault emergency strategy response system when receiving the root fault notification, wherein the indicating information comprises the tolerable operation time length, and the indicating information is used for indicating the root fault emergency strategy response system to make a root fault repair strategy based on the tolerable operation time length.
11. An electronic device, comprising:
one or more processors;
a memory;
one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to perform the method of any of claims 1-9.
12. A computer-readable storage medium, characterized in that the computer-readable storage medium stores program code that can be invoked by a processor to perform the method according to any one of claims 1 to 9.
CN202111084949.0A 2021-09-16 2021-09-16 Duration indication method and device and electronic equipment Active CN113542040B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111084949.0A CN113542040B (en) 2021-09-16 2021-09-16 Duration indication method and device and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111084949.0A CN113542040B (en) 2021-09-16 2021-09-16 Duration indication method and device and electronic equipment

Publications (2)

Publication Number Publication Date
CN113542040A CN113542040A (en) 2021-10-22
CN113542040B true CN113542040B (en) 2021-11-26

Family

ID=78092668

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111084949.0A Active CN113542040B (en) 2021-09-16 2021-09-16 Duration indication method and device and electronic equipment

Country Status (1)

Country Link
CN (1) CN113542040B (en)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101431539B (en) * 2008-12-11 2011-04-20 华为技术有限公司 Domain name resolution method, system and apparatus
CN108124502B (en) * 2017-03-31 2021-01-05 北京大学深圳研究生院 Top-level domain name management method and system based on alliance chain
US10719417B2 (en) * 2018-01-30 2020-07-21 EMC IP Holding Company, LLC Data protection cluster system supporting multiple data tiers
CN108449444B (en) * 2018-03-29 2021-06-18 江苏省未来网络创新研究院 Regional data transmission method, self-circulation domain name resolution system and method
CN109617740A (en) * 2018-12-28 2019-04-12 广东亿迅科技有限公司 A kind of method and device that application failure quickly positions

Also Published As

Publication number Publication date
CN113542040A (en) 2021-10-22

Similar Documents

Publication Publication Date Title
US10686722B2 (en) Methods and apparatus to throttle media access by web crawlers
CN101044463B (en) Method and system for monitoring performance of a client-server architecture
JP2015505097A (en) Computer-implemented process, computer program product, and apparatus for repair delivery system
CN108319550A (en) A kind of test system and test method
JP2007532993A (en) How to identify transactions and manage capacity to support transactions
CN111064780B (en) Multitask content updating method, device, equipment and medium
CN113098733B (en) Network address translation equipment test system and method
CN108259618A (en) The data interactive processing method and device of a kind of synchronization
CN107924345B (en) Data store for aggregated measurements of metrics
CN113542040B (en) Duration indication method and device and electronic equipment
US7287144B2 (en) Hit ratio estimation device, hit ratio estimation method, hit ratio estimation program and recording medium
CN113176968B (en) Security test method, device and storage medium based on interface parameter classification
WO2021262344A1 (en) Method and apparatus to detect scripted network traffic
CN115119197B (en) Wireless network risk analysis method, device, equipment and medium based on big data
CN113704765A (en) Operating system identification method and device based on artificial intelligence and electronic equipment
CN109428788A (en) Function test method and system
CN111311014A (en) Service data processing method and device, computer equipment and storage medium
CN114465919B (en) Network service testing method, system, electronic equipment and storage medium
CN112181485B (en) Script execution method and device, electronic equipment and storage medium
CN101494654A (en) Method and apparatus for determining server accessibility
CN114266288A (en) Network element detection method and related device
CN109150871B (en) Security detection method and device, electronic equipment and computer readable storage medium
CN108551484B (en) User information synchronization method, device, computer device and storage medium
CN111800409A (en) Interface attack detection method and device
CN109246206B (en) Generate and record the method and network of information

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