Interval Group Data Structure for RAN Subscription ID Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems for managing subscription IDs in near-real-time radio access networks (RAN) are inefficient due to the time and space complexities associated with ID generation and reuse, particularly when the list capacity is reached, requiring frequent list reallocation and data copying.
Innovation Solution
Implementing an interval group data structure that uses binary search to efficiently locate and reinsert subscription IDs, allowing for dynamic adjustment of interval groups through merging and splitting, thereby optimizing memory usage and reducing time complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If the system uses a fixed-size list (65535) for subscription ID management, then the initial space allocation is simple, but frequent list reallocation and data copying occur when capacity is reached, increasing time complexity
Solution Approach 1:
The patent transforms the static fixed-size list into a dynamic interval group structure that can adapt its organization based on usage patterns. Instead of copying entire lists when capacity is reached, the system dynamically manages intervals of available IDs, allowing efficient allocation without mass data copying operations.
Solution Approach 2:
The patent segments the continuous range of subscription IDs into multiple interval groups (e.g., Group 1: 1-1000, Group 2: 1001-2000). Each interval group independently tracks available IDs, allowing the system to operate on smaller subsets rather than managing one large list, thereby reducing the time complexity of allocation operations.
2Reliability
If the system allocates a large list upfront (65535 elements), then space is prepared in advance, but memory usage is inefficient when fewer IDs are actually needed, wasting space
Solution Approach 1:
The system dynamically allocates and merges interval groups based on actual usage. When interval groups are released, they can be merged back into larger intervals, allowing the memory structure to adapt to the actual number of active subscriptions rather than maintaining a fixed large allocation.
Solution Approach 2:
The patent implements merging of adjacent interval groups when they become contiguous after releases. For example, if Group 1 (1-1000) and Group 2 (1001-2000) both have releases that make them adjacent, they merge into a single interval, reducing the overhead of managing multiple small intervals and optimizing memory structure.
3Ease of manufacture
If the system uses a simple list structure for ID management, then the implementation is straightforward, but operations become inefficient when the list capacity is reached requiring reallocation and copying
Solution Approach 1:
The patent segments the ID management into interval groups with start and end pointers. This segmentation allows the system to work with smaller, manageable intervals rather than one large list, improving operational efficiency while maintaining conceptual simplicity through the interval group abstraction.
Solution Approach 2:
The interval group structure acts as an intermediary layer between the simple list concept and the actual ID management operations. By introducing interval groups with start/end pointers and merge capabilities, the system mediates between simplicity and efficiency, providing a structured approach that improves performance without excessive complexity.
Data Source
AI summary
The technology described herein is directed towards maintaining an interval group data structure of one or more interval groups that each contain ranges of one or more available values such as subscription identifiers. The subscription identifiers can be used by a radio access network (RAN) intelligent controller (a near-real-time RIC) for xApp-to-E2 node subscriptions. When a subscription identifier is needed, a value from an interval group is selected and returned, and removed from the interval group as no longer being eligible for use, until released. This can be the lowest value in the lowest interval group. When a subscription identifier is released, the value is reinserted into the interval group data structure. This may be by modifying an existing interval group, or creating a new interval group for the released value. Reinsertion can result in two (or three) adjacent interval groups, which can be merged into a single interval group.