Domain name registration method

Abstract

The invention relates to a domain name registration method, and belongs to the technical field of domain name registration, and the method comprises the steps: 1, carrying out the grouping processing of domain names to be registered according to a grouping formula, and calculating the time range of the deletion and release of the domain names; 2, registering in a domain name deletion release period; 3, after registration is finished, the data of the deleted and released domain names in the current period are reset; and step 4, optimizing the grouping formula according to a redisk result. Through the grouping formula, the to-be-registered domain name can be accurately registered after the domain name is released, the error is small, and the efficiency and the registration success rate are higher.

Description

Technical Field

[0001] The present invention relates to the technical field of domain name registration, in particular to a domain name registration method. Background Art

[0002] Domain name preemptive registration is similar to most preemptive purchases or resource grabbing businesses, and generally considers high concurrency processing. Resource investment has become the most important condition affecting the success rate of this business, and is even considered by most people to be the only feasible condition.

[0003] However, as the industry continues to grow, more and more people are involved in this behavior. The operating pressure of the domain name registration service of the registry is constantly challenged. In order to ensure the stability of the service and take into account the fairness of the market, Verisign, the COM domain name registry, has issued relevant restrictive rules on domain name preemption: each domain name registrar can only participate in the preemption business with a limited number of connections and requests. This means that for each domain name registrar, the window of opportunity to preemptively register the target domain name is limited. Therefore, the plan to expand resource investment is limited, unless more registrars are sought to cooperate, and the registrar qualification application is becoming increasingly stringent, and the cost is not small, which poses a considerable challenge to the input-output ratio of the preemption business. So from another perspective, how to effectively use each request number to accurately issue a registration command when the domain name is released is a more brokerage and scientific method.

[0004] Verisign has nearly 100,000 domain names entering the deletion and release period every day, which are gradually processed between 2:00 and 4:00 a.m. Beijing time. Unlike smaller registries that only take a few seconds to complete the deletion and release of all domain names, Verisign often takes more than an hour to complete the deletion and release of domain names for the day. Therefore, the processing time of each domain name on this list of nearly 100,000 domain names to be deleted and released may become a regular arrangement. Studying this time arrangement to determine the exact time when the target domain name is deleted and investing the most request resources during this time has become a means to fight against the "rough" registrar alliance.

[0005] However, even though VeriSign has a so-called "execution schedule" for domain name deletion and release every day, this data is not publicly available, and there is no relevant accurate data before or after the deletion and release. Therefore, the only solution that can be thought of is to review the daily deletion and release list to obtain the re-registered domain names and their re-registration time to prove the existence of this "schedule". Among 100,000 domain names every day, only about 10,000 domain names are re-registered before 4 o'clock. For those that exceed this time, it can be considered that the registration time has deviated too much from the domain name deletion and release time. Fortunately, in this 10% of the data, the existence of this time distribution pattern was found. Since there is still a certain time difference from the deletion and release of a domain name to the re-registration, and this time difference will vary depending on the "attention level" of the domain name. The more popular the domain name, the shorter the time difference, and the larger the error for relatively unpopular domain names. Obviously, more accurate time provided by popular domain names is needed to infer a timeline that is more in line with the actual situation, so as to avoid the error of unpopular domain names affecting this result. Summary of the invention

[0006] In order to solve the above-mentioned problems in the prior art, the present invention provides a domain name registration method.

[0007] A domain name registration method comprises the following steps:

[0008] Step 1: Group the registered domain names according to the grouping formula and calculate the time range for domain name deletion and release;

[0009] Step 2: Register during the domain name deletion release period;

[0010] Step 3: After registration is completed, review the data of domain names deleted and released in this period;

[0011] Step 4: Optimize the grouping formula based on the review results.

[0012] Furthermore, the step 1 specifically includes:

[0013] Step 101: Obtain a deletion and release list of a domain name;

[0014] Step 102: Search the location of the domain name to be registered in the deletion and release list;

[0015] Step 103: Allocate the domain name to be registered to a designated group according to the grouping formula;

[0016] Step 104: Calculate the time range for the domain name to be deleted and released.

[0017] Furthermore, the formula for calculating the time range for the domain name to be deleted and released is:

[0018]

[0019] Among them, x represents the position of the domain name in the list, t represents the duration of each group, n represents the number of domain names in the group, f1(x) represents the start time when the domain name is released, and f2(x) represents the end time when the domain name is released.

[0020] Furthermore, the step 2 specifically includes:

[0021] Step 201: When the domain name deletion release period arrives, a group at the current time point is taken out;

[0022] Step 202: Determine whether the current system time exceeds the maximum group. If so, end the registration; if not, determine whether there is a domain name in the current group, and take out all the domain names in the group in turn for registration;

[0023] Step 203: The successfully registered domain name is stored in the database.

[0024] Furthermore, the specific process of registration in step 202 is: taking out a domain name from the group in turn, checking whether it can be registered, and if so, registering the domain name;

[0025] Furthermore, an asynchronous operation mode is adopted for checking and registering each domain name.

[0026] Furthermore, the review in step 3 is: rechecking each deleted and released domain name to confirm whether it has been re-registered and the exact time of registration.

[0027] Furthermore, the optimization process in step 4 is: substituting the re-registered domain name data in the review result data into the formula, calculating the accuracy rate based on the obtained time result and the actual time when the domain name was re-registered; and adjusting the fixed coefficient of the formula to achieve the highest accuracy rate, thereby completing the optimization of the formula.

[0028] Furthermore, the grouping formula is expressed as: f(x)=[x / n,(x / n)+1], where f(x) represents the grouping range to which the domain name belongs, n represents the number of domain names in the group, and x represents the position of the domain name in the list.

[0029] The beneficial effects of the present invention are reflected in that the present invention can accurately complete the registration of a registered domain name after the domain name is released through a grouping formula, with small errors, higher efficiency and higher registration success rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 The figure is a flow chart of the method of the present invention. DETAILED DESCRIPTION

[0031] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0032] In this embodiment: refer to Figure 1 As shown, a domain name registration method according to an embodiment of the present invention comprises the following steps:

[0033] Step 1: Group the registered domain names according to the grouping formula and calculate the time range for domain name deletion and release;

[0034] Step 2: Register during the domain name deletion release period;

[0035] Step 3: After the registration is completed, the data of the domain names deleted and released in this period will be reviewed; the review is: re-check each deleted and released domain name to confirm whether it has been re-registered and the exact time of registration. It will provide a basis for the subsequent analysis of the domain name value and the calculation of the exact time of domain name deletion and release.

[0036] Step 4: Optimize the grouping formula based on the review results. The optimization process is: substitute the re-registered domain name data in the review result data into the formula, calculate the accuracy based on the obtained time result and the actual time when the domain name was re-registered; adjust the fixed coefficient of the formula to achieve the highest accuracy and complete the optimization of the formula. Since the data source itself is not completely reliable (many reasons affect the accuracy of the data), the final formula can achieve an accuracy of 83% within a 3-minute error. The smaller the error time requirement, the lower the accuracy.

[0037] Wherein, step 1 specifically includes:

[0038] Step 101: Obtain a deletion and release list of a domain name;

[0039] Step 102: Search the location of the domain name to be registered in the deletion and release list;

[0040] Step 103: Allocate the domain name to be registered to a designated group according to the grouping formula;

[0041] Step 104: Calculate the time range for the domain name to be deleted and released.

[0042] The grouping formula can be expressed as: f(x)=[x / n,(x / n)+1], where f(x) represents the grouping range to which the domain name belongs, n represents the number of domain names in the group, and x represents the position of the domain name in the list.

[0043] The formula for calculating the time range for domain name deletion and release is:

[0044] Among them, x represents the position of the domain name in the list, t represents the duration of each group, n represents the number of domain names in the group, f1(x) represents the start time when the domain name is released, and f2(x) represents the end time when the domain name is released.

[0045] Wherein, step 2 specifically includes:

[0046] Step 201: When the domain name deletion release period arrives, a group at the current time point is taken out;

[0047] Step 202: Determine whether the current system time exceeds the maximum group. If so, end the registration; if not, determine whether there is a domain name in the current group, and take out all the domain names in the group in turn for registration;

[0048] Step 203: The successfully registered domain name is stored in the database.

[0049] The specific process of registration in step 202 is as follows: taking out a domain name from the group in turn, checking whether it can be registered, and if so, registering the domain name; checking and registering each domain name adopts an asynchronous operation mode.

[0050] In this embodiment, the grouping formula is generated based on the fact that the domain name list to be deleted and released provided by Verisign is a data list numbered in a specific order, and according to historical records, the domain names re-registered in this list show a regular linear relationship in time. After multiple data review and optimization, a formula is obtained with the position of the domain name in the list as the variable (x), the duration of each group (t) and the number of domain names in the group (n) as fixed coefficients, so as to accurately calculate the time range for the domain name to be deleted and released.

[0051] In this embodiment, the time control is to continuously check the system time in a loop, and the program countdown cannot be used to avoid deviations caused by the time overhead generated by the program's own operation. The check and registration actions of a single domain name are performed asynchronously to ensure that the main program is in efficient and accurate task distribution processing.

[0052] The design of domain name preemptive registration program is usually a rough loop execution, which checks and registers the pending domain name data in sequence, kicks the registered domain name out of the queue, and repeats this cycle until the pending data is cleared or the deletion release time ends. It is easy to see that the density of the number of attempts per unit time for a single domain name determines the success rate of preemptive registration. And this density will be affected by the volume of data to be processed. The more the number, the lower the density and the lower the success rate. Therefore, most registrars will choose to invest more resources to strive for more concurrency to ensure the success rate. However, the rules and constraints of the registry result in the actual limited number of concurrent resources. Under limited resources, it has become a more meaningful topic to reasonably arrange the preemptive registration time for each domain name. The idea in this case is to conduct research in this direction. In the assumed limited number of attempts, strive for a greater chance of trying for each domain name.

[0053] Assuming that the time cost of each attempt for each domain name is 1 second, then if it is expected to be scheduled within 1 second of being deleted and released, it must make at least 3,600 attempts within the 1 hour of the deletion and release period. The grouping formula shown in this case can ensure that it only needs to make attempts within the calculated 3 minutes, which actually only requires 180 attempts. The other time windows can be allocated to domain names in other locations. This allows more pending domain names to be processed and a greater chance of successful registration.

[0054] However, since the accepted domain names are selected by the customers, this solution obviously expects the pending domain names to be evenly distributed in the deletion and release list. If the pending domain names are more concentrated, the probability that they fall in the same time minute is greater. The more domain names are grouped in the same time period, the lower the relative chance. Further reducing the grouping time span can avoid such a situation, and in theory, the final result is to accurately evaluate the deletion and release time of each domain name to seconds (since the smallest unit of research data is seconds).

[0055] However, it is believed that the time distribution of VeriSign's domain name deletion and release is not deliberately arranged, but is simply the result of program execution and system performance. Therefore, time errors are inevitable. This error will eventually cause the actual execution results of each day to deviate from the predicted arrangement. Once the deviation is not processed, the too small time grouping granularity will eventually cause the entire group of domain names to miss the actual deletion and release time.

[0056] This solution tried to change the grouping time from 1 minute to 5 minutes. The accuracy rate was only about 50% in 1 minute, more than 80% in 3 minutes, and about 85% in 5 minutes. Since the success rate can only be improved by more than 3 minutes, 3 minutes can support more domain names to be processed than 5 minutes, so 3 minutes was finally chosen.

[0057] The following list is part of the experimental data (NPG: number of people per group, TPG: duration of people per group).

[0058]

[0059] In the description of the embodiments of the present invention, the terms "first", "second", "third", and "fourth" are used for descriptive purposes only and are not to be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first", "second", "third", and "fourth" may explicitly or implicitly include one or more of the features. In the description of the present invention, unless otherwise specified, "multiple" means two or more.

[0060] In the description of the embodiments of the present invention, the term "and / or" herein only describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B may represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " herein generally indicates that the associated objects before and after are in an "or" relationship.

[0061] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A domain name registration method, characterized in that: The following steps are involved: Step 1: Group the registered domain names according to the grouping formula and calculate the time range for domain name deletion and release; Step 2: Register during the domain name deletion release period; Step 3: After registration is completed, review the data of domain names deleted and released in this period; Step 4: Optimize the grouping formula based on the review results.

2. A domain name registration method according to claim 1, characterized in that: The step 1 specifically includes: Step 101: Obtain a deletion and release list of a domain name; Step 102: Search the location of the domain name to be registered in the deletion and release list; Step 103: Allocate the domain name to be registered to the designated group according to the grouping formula; Step 104: Calculate the time range for the domain name to be deleted and released.

3. A domain name registration method according to claim 1, characterized in that: The formula for calculating the time range of domain name deletion and release is: Among them, x represents the position of the domain name in the list, t represents the duration of each group, n represents the number of domain names in the group, f1(x) represents the start time when the domain name is released, and f2(x) represents the end time when the domain name is released.

4. A domain name registration method according to claim 1, characterized in that: The step 2 specifically includes: Step 201: When the domain name deletion release period arrives, a group at the current time point is taken out; Step 202: determine whether the current system time exceeds the maximum group, if so, end the registration; if not, determine whether there is a domain name in the current group, and take out all the domain names in the group in turn for registration; Step 203: The successfully registered domain name is stored in the database.

5. A domain name registration method according to claim 4, characterized in that: The specific process of registration in step 202 is: taking out a domain name from the group in turn, checking whether it can be registered, and if so, registering the domain name.

6. A domain name registration method according to claim 5, characterized in that: The inspection and registration of each domain name is performed asynchronously.

7. A domain name registration method according to claim 1, characterized in that: The review in step 3 is: rechecking each deleted and released domain name to confirm whether it has been re-registered and the exact time of registration.

8. A domain name registration method according to claim 7, characterized in that: The optimization process in step 4 is as follows: substituting the re-registered domain name data in the re-check result data into the formula, calculating the accuracy rate based on the obtained time result and the actual time when the domain name was re-registered; and adjusting the fixed coefficient of the formula to achieve the highest accuracy rate, thereby completing the optimization of the formula.

9. A domain name registration method according to claim 1, characterized in that: The grouping formula is expressed as: f(x)=[x / n,(x / n)+1], where f(x) represents the grouping range to which the domain name belongs, n represents the number of domain names in the group, and x represents the position of the domain name in the list.

Images