URSP Matching Table for Traffic Route Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The implementation of User Equipment Route Selection Policy (URSP) rules on communication terminals is non-clearly defined, making it challenging to match traffic and assign it to the correct PDU sessions, especially when traffic descriptors other than IP addresses are used, such as application identifiers or data network names.
Innovation Solution
A matching table is introduced within the communication terminal to associate traffic-related information items, including internal identifiers like DSCP or VLAN IDs, with URSP rules, enabling the terminal to identify services and traffic and assign them to appropriate routes, extending the functionality of URSP rules and providing an additional matching level.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If URSP rules are implemented on user equipment, then route selection for traffic and services is enabled, but the implementation is non-clearly defined making traffic matching challenging
Solution Approach 1:
The patent introduces a matching table as an intermediary component between the URSP rule engine and the traffic flow. This matching table stores pre-defined associations between traffic descriptors (IP addresses, application identifiers, data network names) and route selection descriptors, serving as a lookup mechanism that simplifies the complex matching process and provides clear implementation guidance for user equipment
Solution Approach 2:
The patent performs preliminary action by pre-populating the matching table with traffic descriptor to route selection descriptor mappings before actual traffic routing occurs. This allows the system to have route selection policies ready and configured in advance, enabling faster and more deterministic traffic matching without complex real-time analysis
2Measurement precision
If traffic descriptors other than IP addresses are used (such as application identifiers or data network names), then more specific traffic identification is achieved, but the matching process becomes more difficult
Solution Approach 1:
The matching table is designed to be universal by supporting multiple types of traffic descriptors (IP addresses, application identifiers, data network names) in a unified structure. This allows the same matching mechanism to handle diverse identification requirements without needing separate processing logic for each descriptor type, thereby maintaining simplicity while achieving precise traffic identification
Solution Approach 2:
The matching table acts as an intermediary that standardizes different traffic descriptor types into a common format that can be efficiently processed by the URSP rule engine, converting diverse identification requirements into a uniform lookup operation
Data Source
AI summary
A method for selecting a route for outgoing data traffic includes receiving, by a communication terminal, at least one user equipment route selection policy rule, which comprises a traffic descriptor and at least one route selection component. The communication terminal detects a traffic-related information item which is related to at least one outgoing data unit. The communication terminal selects a user equipment route selection policy rule from the at least one received user equipment route selection policy rule, where a traffic descriptor of the selected user equipment route selection policy rule is associated with the detected traffic-related information item on the basis of a matching table that is stored in the communication terminal. The communication terminal selects a route for the at least one outgoing data unit on the basis of a route selection component of the selected user equipment route selection policy rule.