DNS Response Message Scheduling for Large Query Payloads
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing DNS systems face inefficiencies and failures when handling data messages exceeding the 512-byte limit, leading to truncation or the need for additional queries, which can result in low query efficiency and response failures.
Innovation Solution
Implementing a round-robin algorithm to select a predetermined number of response messages when the data volume exceeds a threshold, ensuring each message has an equal chance of being selected, thus avoiding truncation and maintaining response efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If truncation processing is performed for large data messages, then the domain name system can process the message, but the query efficiency decreases and response failures occur
Solution Approach 1:
The patent segments the response message into multiple parts and uses round-robin scheduling to distribute them across multiple queries. Instead of sending one large truncated message, the system divides the response into manageable segments that can be transmitted in separate query-response cycles, maintaining both reliability and efficiency.
Solution Approach 2:
The patent implements dynamic response handling by adapting the query strategy based on message size. When a large data message is detected, the system dynamically switches to round-robin segmentation and multi-query transmission, whereas normal-sized messages are handled with standard single-query responses. This dynamic adaptation resolves the contradiction between handling large messages reliably and maintaining high query efficiency.
2Adaptability or versatility
If the data message volume exceeds the 512-byte limit, then the domain name system cannot process it, but forcing truncation or re-initiation reduces query efficiency
Solution Approach 1:
The patent applies segmentation by dividing the large data message into multiple smaller segments that individually fit within the 512-byte limit. These segmented messages are then transmitted using round-robin scheduling across multiple query cycles, enabling the system to handle large data volumes without exceeding the byte limit while avoiding the time loss associated with repeated truncation and re-initiation.
Solution Approach 2:
The patent performs preliminary action by detecting the data message size before processing and proactively applying round-robin segmentation when the volume exceeds the threshold. This preliminary detection and preparation prevents subsequent processing issues and eliminates the need for time-consuming re-initiations, thereby reducing overall query time while maintaining adaptability to large data volumes.
3Productivity
If truncation processing is applied to large data messages, then the system can respond, but information loss occurs and additional queries are needed
Solution Approach 1:
The patent uses segmentation to divide the large data message into complete segments that preserve all information. Unlike traditional truncation that loses data, this segmentation maintains data completeness while enabling the system to process large messages through round-robin scheduling across multiple queries, thus achieving both productivity and information integrity.
Solution Approach 2:
The patent implements feedback mechanisms that track which segments have been successfully transmitted and received. This feedback allows the system to verify data completeness and ensure that all information is delivered without loss, while maintaining efficient response processing speeds through the round-robin transmission strategy.
Data Source
AI summary
Provided in the present application are a data message response method and apparatus, an electronic device and a storage medium. The method comprises: receiving request information, and searching for a plurality of response messages corresponding to the request information; and according to the plurality of response messages, executing a response process. The response process comprises: determining whether the data volume of the plurality of response messages is greater than a first threshold value; and when determining that the data volume of the plurality of response messages is greater than the first threshold value, using round-robin algorithm to select, in the manner of round robin, from the plurality of response messages a first predetermined number of target response messages for response, the first predetermined number being less than the total number of the response messages.