DNS Cache Segregation for Constant Lookup Time
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current DNS caching systems are inefficient in translating domain names to IP addresses due to the combined storage of referral and answer information in the same tree structure, leading to increased query times as the number of labels in the domain name grows.
Innovation Solution
Implementing a segregated cache system with a flat data structure for answer information and a tree-based structure for referral information, allowing for efficient look-up techniques and hierarchical navigation, respectively, to improve DNS data retrieval efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If referral information and answer information are stored in the same tree structure, then the cache structure is simple, but the query time increases proportionally with the number of labels in the domain name
Solution Approach 1:
The patent divides the unified cache into two separate caches: a referral cache storing referral information in a tree structure, and an answer cache storing answer information in a flat structure. This segmentation allows each cache to use the most appropriate data structure for its specific purpose, resolving the contradiction between structural simplicity and query efficiency.
Solution Approach 2:
The patent applies different data structure qualities to different parts of the cache system: the referral cache uses a tree structure suitable for hierarchical domain name resolution, while the answer cache uses a flat structure optimized for rapid lookup. This local optimization resolves the contradiction by matching data structure properties to specific functional requirements.
2Ease of operation
If a tree structure is used for storing cache data, then hierarchical navigation is enabled, but the search time grows in proportion to the number of labels in the domain name
Solution Approach 1:
The patent segments the cache functionality into referral lookup (requiring hierarchical navigation) and answer retrieval (requiring fast search). By separating these functions into different caches with different data structures, the patent enables hierarchical navigation where needed while achieving constant-time search where possible.
Solution Approach 2:
The referral cache acts as an intermediary that uses tree structure for hierarchical navigation to locate the appropriate authoritative servers, while the answer cache serves as a separate intermediary that uses flat structure for rapid answer retrieval. This intermediary approach resolves the contradiction by using each data structure only where it provides advantage.
Data Source
AI summary
Systems and methods of determining DNS information, such as an IP address, associated with a domain name. The methods using a cache segregated to store various domain name system (DNS) data in different data structures. The data structures are configured for minimization of data retrieval times. In some embodiments, answer information is stored in a hash table. In these and other embodiments, times required to search for answers are essentially constant as a function of the number of labels comprising the domain name.