Sorting Apparatus Using Unit Search and Location Pointer Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing packet-switched telecommunications networks face inefficiencies in packet scheduling due to contention and queuing, particularly in sorting packets in ascending or descending order, which affects scheduling priority and speed as network demands increase.
Innovation Solution
A sorting apparatus utilizing a unit search structure and a unit location pointer structure, allowing for flexible design and separate execution of sorting and retrieval, with a multi-bit tree search structure and distributed memory architecture to efficiently place units in a pre-determined order within a unit storage structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If repeated searching for the tag having the lowest value is used to service packets in ascending order, then the packets can be serviced in the correct priority order, but the sorting speed and network throughput deteriorate due to repeated linear searches
Solution Approach 1:
The patent applies preliminary action by pre-organizing tags into a sorted data structure (such as a binary search tree or heap) before servicing is needed. This allows the system to maintain sorted order continuously rather than performing repeated searches, thereby resolving the contradiction between sorting accuracy and sorting speed.
Solution Approach 2:
The patent replaces the mechanical linear search process with a more efficient data structure-based retrieval mechanism. By using structures like binary search trees or heaps, the system substitutes O(n) linear search with O(log n) or O(1) retrieval operations, improving sorting speed while maintaining accuracy.
2Manufacturing precision
If sorting the tags into ascending order and repeated reading of the tag at the beginning of the order is used, then packet scheduling priority is maintained, but device complexity and memory management complexity increase
Solution Approach 1:
The patent applies self-service by designing data structures that automatically maintain sorted order through their inherent structure. As tags are inserted or updated, the data structure self-adjusts to maintain sort order without requiring complex external memory management interventions, thereby reducing device complexity while preserving scheduling priority.
3Adaptability or versatility
If the unit search structure directly accesses the unit storage structure, then the sorting function can be integrated with retrieval, but the design flexibility and ability to separate sorting from retrieval deteriorate
Solution Approach 1:
The patent applies segmentation by dividing the memory system into separate functional components: a search structure for maintaining sorted order and a storage structure for holding data. This segmentation allows independent optimization of sorting and retrieval operations, providing design flexibility while maintaining retrieval efficiency through the use of location pointers that connect the two structures.
4Productivity
If conventional sorting methods are used in packet-switched telecommunications networks, then packet scheduling can be performed, but the network speed and scheduling efficiency deteriorate as network demands increase
Solution Approach 1:
The patent applies preliminary action by pre-organizing packet tags into efficiently searchable data structures before scheduling decisions are needed. This allows the network to handle high throughput demands without incurring scheduling delays, as the sorted structure enables rapid retrieval of highest-priority packets even as network traffic increases.
Data Source
AI summary
A sorting apparatus and method for sorting units into a unit storage structure in accordance with a pre-determined order, the sorting apparatus comprising a unit search structure containing a record of units in the unit storage structure, and a unit location pointer structure containing location pointers for units in the unit storage structure, wherein the sorting apparatus receives a unit being sorted, the unit search structure reads the unit being sorted, uses its record of units in the unit storage structure to search for a closest matching unit to the unit being sorted, accesses the unit location pointer structure and retrieves a location pointer for the closest matching unit, and the sorting apparatus uses the location pointer of the closest matching unit to access the unit storage structure and to place the unit being sorted into the unit storage structure in an appropriate position in accordance with the pre-determined order.