Super Variants for Internationalized Domain Name Registration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The Domain Name System (DNS) faces challenges in handling internationalized domain names (IDNs) with non-ASCII characters, particularly in languages like Chinese, where character variants lead to registration and resolution issues due to the lack of support for non-English scripts, resulting in storage and interpretation complexities.
Innovation Solution
The solution employs generalized representations, or 'Super Variants,' of IDNs, which are stored in databases to deconflict registrations by comparing requested IDNs with registered ones, using deterministic algorithms to convert code points into representative forms, allowing for the recognition of variant matches without blocking or reserving all potential variants.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all potential variants of IDN names are blocked or reserved, then domain name uniqueness is improved, but storage requirements and system complexity become prohibitive
Solution Approach 1:
The patent extracts only the essential identifying features from the full set of character variants. Instead of storing all possible variants, the system extracts key characteristics (such as radical components in Chinese characters) to create a compressed representation that maintains uniqueness while dramatically reducing storage requirements.
Solution Approach 2:
The patent creates a simplified copy or representation of the character variants rather than storing the full original data. By using radical-based representations or canonical forms, the system maintains the essential identifying information while using significantly less storage space than would be required for complete variant enumeration.
2Reliability
If standardized translations of foreign characters to ACE format are used, then domain name resolution consistency is improved, but the ability to handle different character forms (e.g., traditional and simplified Chinese) is reduced
Solution Approach 1:
The patent creates a universal translation layer that can handle multiple character forms (traditional, simplified, and other variants) through a single standardized process. The system uses a comprehensive character mapping table that normalizes different forms into a common representation, allowing the same resolution mechanism to work for all character variants without requiring separate handling procedures.
3Reliability
If deterministic algorithms convert code points to representative forms, then registration deconfliction is improved, but the complexity of the conversion process increases
Solution Approach 1:
The patent performs the complex conversion work in advance by pre-computing and storing the representative forms for common character variants in lookup tables. During registration, the system simply queries these pre-computed tables rather than performing complex algorithms in real-time, significantly reducing the operational complexity while maintaining reliable deconfliction.
Data Source
AI summary
Systems and methods for registering a domain, including Internationalized Domain Names (IDNs), including receiving a request to register an IDN and determining a language category of the request. Code points of the request are converted to yield a generalized variant of the IDN. The generalized variant is compared to a stored database of registered IDNs that may include similar generalized variants of the registered IDNs. Based on the comparison, it is determined whether or not to resister the IDN. In the case the that IDN registration is allowed, the generalized variant of the IDN may be stored in the database to protect against later registration by similar IDNs. Converting the code points of the request may include identifying corresponding code points of variants within the language category, and converting each of the code points of the requested IDN based on a deterministic algorithm applied to the corresponding code points. The deterministic algorithm may be applied to a value of each of the corresponding code points to yield a representative code point from among the corresponding code points, and the generalized variant may include a representative code point for each of the code points of the request.