Network Function Profile Search Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication systems face inefficiencies in searching large lists of network function profiles due to the use of linear search algorithms, which are computationally intense and time-consuming.
Innovation Solution
The implementation of non-linear search algorithms on sorted lists of network function profiles, where the lists are pre-sorted based on specific attributes and the sort order is indicated, allowing for more efficient searches.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If linear search algorithms are used to search network function profiles, then the search can be performed on unsorted lists, but the search time and computational intensity increase significantly
Solution Approach 1:
The patent applies preliminary action by pre-sorting the network function profile lists before search operations. The NRF (Network Repository Function) maintains sorted lists of NF profiles based on various attributes (NF type, service capabilities, status, etc.), so that when search requests arrive, the data is already organized for efficient non-linear search algorithms, eliminating the need to sort at search time.
Solution Approach 2:
The patent changes the parameter of data organization from unsorted to sorted based on multiple attributes. By defining sort orders for different attributes (NF type, service capabilities, geographic location, load status), the system transforms the search space into a structured format that enables binary search and other non-linear algorithms to achieve O(log n) complexity instead of O(n).
2Productivity
If non-linear search algorithms are used on sorted lists, then search efficiency improves to logarithmic time, but the system complexity increases due to sorting requirements
Solution Approach 1:
The NRF performs preliminary sorting actions when NF profiles are registered or updated. The system automatically maintains sorted lists based on configured sort attributes, so the complexity of sorting is handled in advance rather than at search time. This allows search functions to simply query the already-sorted data using efficient non-linear algorithms.
Solution Approach 2:
The system implements self-service by automatically maintaining the sorted state of NF profile lists. When NF profiles are added, modified, or removed, the NRF automatically re-sorts the affected lists based on the configured sort attributes, without requiring manual intervention or complex search-time sorting logic. This automation manages the complexity internally while presenting a simple interface to consumers.
3Speed
If lists are pre-sorted based on specific attributes, then search speed increases, but the initial processing time and computational resources increase
Solution Approach 1:
The patent applies partial action by sorting only on specific attributes that are most commonly used for search queries. Rather than sorting on all possible attributes, the system identifies and sorts on key attributes (such as NF type, service capabilities, or geographic location) based on search patterns, reducing the sorting overhead while maintaining search efficiency for the most frequent query types.
Solution Approach 2:
The sorting is performed preliminarily when NF profiles are registered or updated in the NRF, rather than at search time. This spreads the computational cost of sorting over the lifecycle of data maintenance operations, so that when searches occur, the data is already sorted and ready for fast retrieval, amortizing the processing resources over time.
Data Source
AI summary
Various example embodiments of the subject disclosure relate to apparatuses, methods and computer programs. There is provided, for example, an apparatus including means for determining at least one sorted list of elements from a plurality of lists of elements and means for providing information including the at least one sorted list to a network function, the information including an indication of the sorted list.