Distributed ID generation system and method based on decentration

Abstract

The invention discloses a decentration-based distributed ID generation system and method, and particularly relates to the technical field of distributed ID generation, the system comprises a generation module, a data distribution module, an analysis module and a conversion module, and the modules are connected through signals; an independent distributed ID is generated at each service node through the generation module, a timestamp, a serial number and a node identifier of the distributed ID are generated, the IDs are distributed through the data distribution module, and the stability of the system is effectively improved by adopting a distributed ID generation scheme. By avoiding the crash risk of the centralized ID, the service interruption risk of the system caused by node crash is reduced. And by adopting the characteristics of the distributed architecture, the system can better deal with node faults, and the continuous availability of services is ensured. After the technologies are combined, the stability of the whole system is enhanced, and the reliability and continuity of the system under various conditions are ensured.

Description

Technical Field

[0001] The present invention relates to the field of target extraction technology, and more specifically, to a decentralized distributed ID generation system and method. Background Art

[0002] With the rapid development of Internet business, especially the sharp increase in data volume, the service system has become more demanding in terms of the speed of generating distributed IDs. Traditional centralized ID generation solutions have shown performance bottlenecks and there is a risk of centralized node downtime. These problems may cause the service system to experience serious problems such as freezes and service anomalies when obtaining distributed IDs, which in turn affects the stability and reliability of the overall system.

[0003] In order to solve the above defects, a technical solution is now provided. Summary of the invention

[0004] In order to overcome the above-mentioned defects of the prior art, an embodiment of the present invention provides a decentralized distributed ID generation system and method to solve the problems raised in the above-mentioned background technology.

[0005] To achieve the above object, the present invention provides the following technical solutions:

[0006] A decentralized distributed ID generation system and method, including a generation module, a data distribution module, an analysis module and a conversion module, wherein the modules are connected by signals;

[0007] Generate an independent distributed ID at each service node through the generation module, and generate the timestamp, serial number and node identifier of the distributed ID;

[0008] The ID is distributed through the data distribution module to avoid the interruption of distributed ID generation caused by single point failure;

[0009] Through the analysis module, the uniqueness of the timestamp, serial number and node identifier of the distributed ID is analyzed. If the analysis shows that the distributed ID is not unique, it returns to the generation module to regenerate it;

[0010] Convert the generated system into SDK form through the conversion module.

[0011] Preferably, the steps of generating the distributed ID by the generation module are as follows:

[0012] The generation module obtains the current timestamp on each service node and maintains an independent serial number counter. When the generation module generates an ID, the value of the counter is used as the serial number part of the ID. Finally, the unique identifier of the current node is determined;

[0013] Define the format of the obtained distributed ID, and clarify the position of the timestamp, sequence number, and node identifier in the ID

[0014] Combine the obtained timestamp, sequence number and node ID to form a globally unique distributed ID. Based on ts id-creator, the timestamp, sequence number and node ID are combined into a 64-bit binary number distributed

[0015] Preferably, the first 42 bits of the distributed ID of the 64-bit binary number are time bits in millimeters, the middle 11 bits are node bits for identifying different nodes, and the last 11 bits are count bits with a maximum count value of 2048, wherein different node bits have different node bit values, and these values ​​range from 0 to 2047;

[0016] Therefore, a single service node can theoretically generate up to 2,048,000 distributed IDs per second, and the entire distributed service can theoretically support up to 2048 different nodes. The entire service cluster can support a maximum of 4,194,304,000 distributed IDs per second.

[0017] Preferably, the steps of distributing the IDs by the data distribution module are as follows:

[0018] First, continuously monitor system performance and node status to promptly detect potential failures or load imbalances and make optimization adjustments;

[0019] Distributed IDs are assigned to each node based on a hash function;

[0020] According to the selected data distribution strategy, the generated distributed ID is assigned to each node or shard;

[0021] When allocating IDs, a distributed architecture and backup mechanism are adopted, and a fault recovery mechanism is implemented. When a node fails, the system can automatically replace or repair it.

[0022] Preferably, the steps of determining the global uniqueness of the distributed ID by the analysis module are as follows:

[0023] The analysis module first checks whether the distributed ID already exists in the system by querying the list of generated IDs;

[0024] If the analysis module finds that the generated distributed ID is not unique, it will notify the generation module to regenerate the distributed ID;

[0025] If the analysis module determines that the generated distributed ID is unique, it returns it to the analysis system in the form of an SDK.

[0026] Preferably, the distributed system uses the Gossip protocol to maintain the node position values ​​of each instance. Each instance obtains its own node position value by preemption. When an online instance goes offline, the node position value it occupies will be released, and the subsequent newly launched instances can preempt these released node position values.

[0027] Preferably, the SDK integrates a negotiation mechanism based on the Goss ip protocol to automatically negotiate and seize node bit values;

[0028] The SDK adopts the singleton mode for management and uses concurrent locks to ensure that only one thread can obtain the distributed ID at the same time;

[0029] When users introduce the SDK into their applications, they can directly call the corresponding functions to obtain the distributed ID without any additional configuration or processing.

[0030] Preferably, when the distributed ID can be analyzed by the analysis module, the distributed ID is marked as S, the timestamp is marked as T, the sequence number is marked as S, the node identifier is marked as N, and the output of the analysis module is marked as D, and the formula is: When D=0, it returns to regenerate.

[0031] A decentralized distributed ID generation method, applied to the decentralized distributed ID generation system, comprises the following steps:

[0032] Generate an independent distributed ID at each service node, and generate the timestamp, serial number and node identifier of the distributed ID;

[0033] Distribute the IDs to avoid interruption of distributed ID generation caused by single point failures;

[0034] Analyze the uniqueness of the timestamp, serial number and node identifier of the distributed ID. If the analysis shows that the distributed ID is not unique, return to the generation module to regenerate it;

[0035] Convert the build system to SDK form.

[0036] Technical effects and advantages of the present invention:

[0037] 1. The present invention adopts a distributed ID generation scheme to effectively improve the stability of the system. By avoiding the downtime risk of centralized ID, the risk of service interruption caused by node downtime is reduced. And by adopting the characteristics of distributed architecture, the system can better cope with node failures and ensure the continuous availability of services. The combination of the above technologies enhances the stability of the entire system and ensures the reliability and sustainability of the system in various situations.

[0038] 2. This application reduces the dependence on the network by independently generating distributed IDs at each service node, eliminating the network overhead when obtaining distributed IDs. This distributed generation solution can quickly generate IDs locally, avoiding the performance bottleneck caused by network communication delays in traditional centralized solutions. Therefore, the system can respond to requests more quickly in high-concurrency scenarios, improving the overall performance of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to facilitate understanding by those skilled in the art, the present invention is further described below in conjunction with the accompanying drawings;

[0040] Figure 1 This is a schematic diagram of the process of Example 1 of the present invention;

[0041] Figure 2 This is a structural diagram of the design of the distributed ID of the present invention. DETAILED DESCRIPTION

[0042] 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.

[0043] Example 1

[0044] Figure 1-2 The present invention provides a decentralized distributed ID generation system and method, including a generation module, a data distribution module, an analysis module and a conversion module, and the modules are connected by signals.

[0045] The generation module generates an independent distributed ID at each service node, and generates the timestamp, serial number and node identifier of the distributed ID. Each service node can generate a distributed ID independently, so even if some nodes fail or are unavailable, other nodes can continue to generate IDs, ensuring the high availability of the system. Since the distributed ID is generated on each service node, there is no need to obtain the ID through the network or other communication methods, which can reduce the delay in ID generation and improve the performance of the system. It avoids additional network communication in the distributed system to obtain the ID, saving network bandwidth and resources. The generation process of the distributed ID is distributed to each service node, avoiding the impact of a single point of failure on the entire system, improving the stability and reliability of the system, and allowing the system to operate normally even if some nodes fail.

[0046] The ID is distributed through the data distribution module to avoid the interruption of distributed ID generation caused by a single point of failure. The generation of distributed IDs does not rely on a single node, but is distributed on multiple nodes. This means that even if a node fails, other nodes can still continue to generate IDs, thus avoiding the interruption of ID generation caused by a single point of failure and improving the availability of the system. By avoiding the interruption of ID generation caused by a single point of failure, the stability of the system is enhanced. The continuity and availability of distributed IDs are guaranteed, which helps to ensure that the system continues to operate stably and meet the needs of users.

[0047] By determining the analysis module, the uniqueness of the timestamp, serial number and node identifier of the distributed ID is analyzed. If the analysis shows that the distributed ID is not unique, it returns to the generation module for regeneration; the generated distributed ID is checked by the analysis module to ensure that each distributed ID is unique in the entire system. This step helps to avoid conflicts and duplications between distributed IDs, ensuring that each distributed ID in the system is a unique identifier, thereby avoiding data errors or system anomalies caused by ID conflicts. When the analysis module finds that the generated distributed ID is not globally unique, it will process these non-unique IDs in a timely manner and may regenerate these IDs, which helps to reduce the waste of system resources and improve the performance and stability of the system.

[0048] The conversion module converts the generation system into an SDK form. By converting the generation system into an SDK form, it can be made easier to use and maintain, thereby improving the usability and stability of the system. The conversion module is responsible for converting the functions of the generation system into an SDK form, which makes it easier for users to integrate and use the distributed ID generation function.

[0049] In this embodiment, the steps of generating a distributed ID by the generation module are as follows:

[0050] The generation module obtains the current timestamp on each service node and maintains an independent serial number counter. When the generation module generates an ID, the value of the counter is used as the serial number part of the ID. Finally, the unique identifier of the current node is determined; when generating a distributed ID, the generation module uses an independent counter and uses its value as the serial number part of the ID. This ensures that each distributed ID is incremented on the same service node, avoiding conflicts and duplications between IDs. At the same time, the generation module determines the unique identifier of the current node, which can be the node's IP address, host name, or other unique identifier. Including the node's unique identifier in the distributed ID ensures that each distributed ID is associated with a specific node, thereby enhancing the uniqueness and traceability of the ID.

[0051] Define the format of the obtained distributed ID, and specify the location of the timestamp, sequence number, and node identifier in the ID;

[0052] The obtained timestamp, sequence number and node ID are combined to form a globally unique distributed ID. The timestamp, sequence number and node ID are combined into a 64-bit binary number based on ts id-creator. By combining the timestamp, sequence number and node ID into a 64-bit binary number based on ts id-creator, it can adapt to various scenarios and needs. This design ensures that each generated ID is globally unique. The combination of timestamp, sequence number and node ID forms a unique identifier, which effectively avoids ID conflicts and duplications and ensures the uniqueness of each ID in the system. At the same time, after defining the format and composition of the distributed ID, the parsing and processing process of the ID can be simplified. The system can quickly and accurately parse the timestamp, sequence number and node ID according to a fixed format, so as to perform subsequent processing and analysis more efficiently. This clear and specific design makes the system's ID generation and processing more reliable and efficient.

[0053] In this embodiment, the first 42 bits of the 64-bit binary distributed ID are time bits in millimeters, the middle 11 bits are node bits used to identify different nodes, and the last 11 bits are count bits with a maximum count value of 2048, where different node bits have different node bit values, and these values ​​range from 0 to 2047; by using the timestamp as the time bit, the node identifier as the node bit, and the serial number as the count bit, it can be ensured that each generated distributed ID is globally unique. This division method can effectively avoid ID conflicts and duplications, and ensure the uniqueness of each ID in the system. By using 11 node bits to identify different nodes, each node bit has a different node bit value ranging from 0 to 2047, which can adapt to distributed nodes of different sizes and numbers.

[0054] Therefore, a single service node can theoretically generate up to 2,048,000 distributed IDs per second, while the entire distributed service can theoretically support up to 2048 different nodes, and the entire service cluster can theoretically support the generation of up to 4,194,304,000 distributed IDs per second. By using the 11-bit count as the count with a maximum count value of 2048, each node can theoretically support the generation of up to 2,048,000 distributed IDs per second, and the entire service cluster can theoretically support the generation of up to 4,194,304,000 distributed IDs per second. This design can meet the requirements for the speed of distributed ID generation in high-concurrency scenarios and ensure the performance and response speed of the system.

[0055] In this embodiment, the steps of distributing the IDs by the data distribution module are as follows:

[0056] First, continuously monitor system performance and node status, promptly detect potential faults or load imbalance problems, and make optimization adjustments; this application can promptly detect potential faults or load imbalance problems by continuously monitoring system performance and node status, so that the system can be optimized and adjusted, thereby improving the overall performance of the system, preventing the occurrence of faults, and ensuring the stability and reliability of the system.

[0057] Distributed IDs are assigned to each node based on a hash function; by using a hash function to assign distributed IDs to each node, data can be evenly distributed among the nodes. This can prevent a single node from being overloaded, improve the system's load balancing capabilities, and ensure efficient access and processing of data.

[0058] According to the selected data distribution strategy, the generated distributed ID is assigned to each node or shard; in this way, the most appropriate data distribution strategy can be selected according to actual needs, thereby improving the flexibility and adaptability of the system.

[0059] When allocating IDs, a distributed architecture and backup mechanism are used, and a fault recovery mechanism is implemented. When a node fails, the system can automatically replace or repair it. The use of a distributed architecture and backup mechanism and the implementation of a fault recovery mechanism can ensure that the system has high fault tolerance and reliability. When a node fails, the system can automatically or manually replace or repair it, thereby ensuring the continuous and stable operation of the system and reducing the impact and risk of the system caused by node failures.

[0060] In this embodiment, the steps of determining whether the analysis module analyzes the global uniqueness of the distributed ID are as follows:

[0061] The analysis module first checks whether the distributed ID already exists in the system by querying the generated ID list; the analysis module checks whether the distributed ID already exists in the system by querying the generated ID list, thereby ensuring that each generated distributed ID is globally unique. This can avoid ID duplication and conflict and ensure the uniqueness of each ID in the system.

[0062] If the analysis module finds that the generated distributed ID is not unique, it will notify the generation module to regenerate the distributed ID; if the analysis module determines that the generated distributed ID is unique, it will return it to the analysis system in the form of SDK. By timely discovering and processing non-unique distributed IDs, data errors or system anomalies caused by ID conflicts can be avoided, thereby improving the stability and reliability of the system and reducing the risk of system problems. The analysis module can monitor the newly generated distributed ID in real time and find out whether there are duplicates in time. If it is found that the ID is not unique, the analysis module will immediately notify the generation module to regenerate the distributed ID to ensure that there are no duplicate IDs in the system, thereby ensuring the accuracy and integrity of the system data. The performance of the system can be optimized through the inspection and processing of the analysis module. Timely processing of duplicate IDs can reduce the waste of system resources, improve the operating efficiency of the system, and thus improve the overall performance of the system.

[0063] In this embodiment, the distributed system maintains the node position value of each instance through the Goss ip protocol. Each instance obtains its own node position value by preemption. When an online instance goes offline, the node position value it occupies will be released, and the subsequent newly launched instance can preempt these released node position values. Through the Goss ip protocol, the distributed system can dynamically manage the node position values ​​of each instance. In this way, the nodes in the system can be effectively managed, and each instance can be ensured to obtain a unique node position value, thereby ensuring the global uniqueness of the distributed ID. Obtaining one's own node position value by preemption can automatically allocate node position values, reduce the need for manual intervention, and also avoid conflicts in node position values.

[0064] In this embodiment, the SDK integrates a negotiation mechanism based on the Goss ip protocol to automatically negotiate and seize node bit values; the SDK integrates a negotiation mechanism based on the Goss ip protocol to automatically negotiate and seize node bit values. This can simplify the management process of node bit values ​​and improve the reliability and stability of the system.

[0065] The SDK uses a singleton mode for management and concurrent locks to ensure that only one thread can obtain a distributed ID at a time. The SDK uses a singleton mode for management and concurrent locks to ensure that only one thread can obtain a distributed ID at a time. This can avoid data confusion and errors caused by multi-threaded concurrent operations and ensure the correctness of distributed IDs.

[0066] After the user introduces the SDK into the application, he can directly call the corresponding function to obtain the distributed ID without additional configuration or processing. After the user introduces the SDK into the application, he can directly call the corresponding function to obtain the distributed ID without additional configuration or processing. This can simplify the user's operation process, improve development efficiency, and reduce the possibility of errors.

[0067] In this embodiment, when the distributed ID can be analyzed by the analysis module, the distributed ID is marked as S, the timestamp is marked as T, the sequence number is marked as S, the node identifier is marked as N, and the output of the analysis module is marked as D. The formula is: When D = 0, it returns to regenerate. When the distributed ID can be analyzed by the analysis module, the distributed ID is marked as S, the timestamp is marked as T, the sequence number is marked as S, the node identifier is marked as N, and the output of the analysis module is marked as D. The formula is: D = When D=0, it returns to regenerate.

[0068] Explanation of relevant terms

[0069] Distributed ID: Distributed ID is a way to generate unique identifiers in a distributed system. It is used to solve ID conflicts and performance bottlenecks that may occur when multiple nodes process requests in parallel.

[0070] SDK (Software Development Kit): is a collection of development tools and documents to help developers quickly build and integrate applications for specific platforms, frameworks, or systems.

[0071] The present invention adopts a distributed ID generation scheme to effectively improve the stability of the system. By avoiding the downtime risk of centralized ID, the risk of service interruption caused by node downtime is reduced. And by adopting the characteristics of distributed architecture, the system can better cope with node failures and ensure the continuous availability of services. Combining the above technologies enhances the stability of the entire system and ensures the reliability and sustainability of the system in various situations.

[0072] This application generates distributed IDs independently at each service node, reducing the system's reliance on the network and eliminating the network overhead when obtaining distributed IDs. This distributed generation solution can quickly generate IDs locally, avoiding the performance bottleneck caused by network communication delays in traditional centralized solutions. Therefore, the system can respond to requests more quickly in high-concurrency scenarios, improving the overall performance of the system.

[0073] A decentralized distributed ID generation method, applied to the decentralized distributed ID generation system, comprises the following steps:

[0074] An independent distributed ID is generated at each service node, and a timestamp, serial number and node identifier of the distributed ID are generated; the distributed ID generation process is distributed to each service node, avoiding the impact of a single point failure on the entire system, improving the stability and reliability of the system, and the system can still operate normally even if some nodes fail.

[0075] Distribute the IDs to avoid interruption of distributed ID generation caused by single point failure;

[0076] Analyze the uniqueness of the timestamp, serial number and node identifier of the distributed ID. If the analysis shows that the distributed ID is not unique, return to the generation module for regeneration. Analyze the uniqueness of the timestamp, serial number and node identifier of the distributed ID. If the analysis shows that the distributed ID is not unique, return to the generation module for regeneration. Check the generated distributed ID through the analysis module to ensure that each distributed ID is unique in the entire system.

[0077] If the ID is found to be not unique, the analysis module will immediately notify the generation module to regenerate the distributed ID to ensure that there are no duplicate IDs in the system, thereby ensuring the accuracy and integrity of the system data. Through the inspection and processing of the analysis module, the performance of the system can be optimized. Timely processing of duplicate IDs can reduce the waste of system resources, improve the operating efficiency of the system, and thus improve the overall performance of the system.

[0078] Convert the build system to SDK form.

[0079] The above formulas are all dimensionless and numerical calculations. The formula is a formula for the most recent real situation obtained by collecting a large amount of data and performing software simulation. The preset parameters in the formula are set by technicians in this field according to actual conditions.

[0080] The above embodiments can be implemented in whole or in part by software, hardware, firmware or any other combination. When implemented by software, the above embodiments can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from one website site, computer, server or data center to another website site, computer, server or data center by wired or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that contains one or more available media sets. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium. The semiconductor medium can be a solid-state hard disk.

[0081] It should be understood that in the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0082] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A decentralized distributed ID generation system, characterized by: It includes a generation module, a data distribution module, an analysis module and a conversion module, and the modules are connected by signals; Generate an independent distributed ID at each service node through the generation module, and generate the timestamp, serial number and node identifier of the distributed ID; The ID is distributed through the data distribution module to avoid the interruption of distributed ID generation caused by single point failure; The analysis module can analyze the uniqueness of the timestamp, serial number and node identifier of the distributed ID. If the analysis shows that the distributed ID is not unique, it will return to the generation module to regenerate it. Convert the generated system into SDK form through the conversion module.

2. A decentralized distributed ID generation system according to claim 1, characterized in that: The steps of generating a distributed ID by the generation module are as follows: The generation module obtains the current timestamp on each service node and maintains an independent serial number counter. When the generation module generates an ID, the value of the counter is used as the serial number part of the ID. Finally, the unique identifier of the current node is determined; Define the format of the obtained distributed ID, and specify the location of the timestamp, sequence number, and node identifier in the ID; The obtained timestamp, serial number and node ID are combined to form a globally unique distributed ID. Based on tsid-creator, the timestamp, serial number and node ID are combined into a 64-bit binary number for distribution.

3. A decentralized distributed ID generation system according to claim 2, characterized in that: The first 42 bits of the distributed ID of the 64-bit binary number are time bits in millimeters, the middle 11 bits are node bits used to identify different nodes, and the last 11 bits are count bits with a maximum count value of 2048. Different node bits have different node bit values, and these values ​​range from 0 to 2047. Therefore, a single service node can theoretically generate up to 2,048,000 distributed IDs per second, and the entire distributed service can theoretically support up to 2048 different nodes. The entire service cluster can support a maximum of 4,194,304,000 distributed IDs per second.

4. A decentralized distributed ID generation system according to claim 2, characterized in that: The steps for the data distribution module to distribute the IDs are as follows: First, continuously monitor system performance and node status to promptly detect potential failures or load imbalances and make optimization adjustments; Distributed IDs are assigned to each node based on a hash function; According to the selected data distribution strategy, the generated distributed ID is assigned to each node or shard; When allocating IDs, a distributed architecture and backup mechanism are adopted, and a fault recovery mechanism is implemented. When a node fails, the system can automatically replace or repair it.

5. According to claim 1, a decentralized distributed ID generation system is characterized by: The steps to determine the global uniqueness of the distributed ID in the analysis module are as follows: The analysis module first checks whether the distributed ID already exists in the system by querying the list of generated IDs; If the analysis module finds that the generated distributed ID is not unique, it will notify the generation module to regenerate the distributed ID; If the analysis module determines that the generated distributed ID is unique, it returns it to the analysis system in the form of an SDK.

6. A decentralized distributed ID generation system and method according to claim 1, characterized in that: The Gossip protocol is used in the distributed system to maintain the node position values ​​of each instance. Each instance obtains its own node position value by preemption; when an online instance goes offline, the node position value it occupies will be released, and the subsequent newly launched instances can preempt these released node position values.

7. A decentralized distributed ID generation system and method according to claim 1, characterized in that: The SDK integrates a negotiation mechanism based on the Gossip protocol to automatically negotiate and seize node bit values. The SDK is managed in singleton mode and uses concurrent locks to ensure that only one thread can obtain the distributed ID at the same time. Users can directly introduce the SDK into their applications and directly call the corresponding functions to obtain the distributed ID without additional configuration or processing.

8. A decentralized distributed ID generation system and method according to claim 2, characterized in that: When the distributed ID can be analyzed by the analysis module, the distributed ID is marked as S, the timestamp is marked as T, the sequence number is marked as S, the node identifier is marked as N, and the output of the analysis module is marked as D. The formula is: When D=0, it returns to regenerate.

9. A decentralized distributed ID generation method, applied to the decentralized distributed ID generation system according to any one of claims 1 to 8, characterized in that: Includes the following steps: Generate an independent distributed ID at each service node, and generate the timestamp, serial number and node ID of the distributed ID; Distribute the IDs to avoid interruption of distributed ID generation caused by single point failure; Analyze the uniqueness of the timestamp, serial number and node identifier of the distributed ID. If the analysis shows that the distributed ID is not unique, return to the generation module to regenerate it; Convert the build system to SDK form.

Images