Radio Bearer Traffic Management via Peer Node Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Cellular networks face challenges in reducing latency, particularly in industrial environments where low latency is crucial for real-time control applications, while maintaining low communication complexity.
Innovation Solution
A method and system for managing radio bearer traffic between radio network nodes by establishing peer connections with tunnels, ensuring routing tables are updated with user equipment attachments, and routing traffic accordingly, allowing direct communication between nodes with reduced computational overhead and support for different communication priorities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If traditional routing methods are used in cellular networks, then communication complexity is managed, but latency increases and real-time control applications are affected
Solution Approach 1:
The patent segments the routing function by implementing separate routing tables for different types of traffic (local UEs, peer UEs, and forwarded traffic). This segmentation allows the system to optimize routing paths for different traffic types independently, reducing latency for real-time applications while maintaining manageable complexity through specialized routing logic for each segment.
Solution Approach 2:
The patent introduces peer radio network nodes as intermediaries in the routing architecture. These peer nodes exchange routing information and assist in forwarding traffic directly between them, bypassing the core network. This intermediary mechanism reduces latency for local traffic while the standardized peer-to-peer interface keeps the added complexity manageable.
2Speed
If direct peer-to-peer routing is implemented between radio network nodes, then latency is reduced for real-time applications, but the complexity of managing routing tables and peer connections increases
Solution Approach 1:
The patent implements a universal routing table structure that handles multiple types of traffic (local UE traffic, peer UE traffic, and forwarded traffic) through a single integrated data structure. This universal approach allows the system to achieve fast direct routing for real-time applications while managing complexity through a standardized, multi-functional routing mechanism that can handle different traffic types uniformly.
Solution Approach 2:
The patent applies preliminary action by pre-establishing peer connections and exchanging routing information between radio network nodes before actual data transmission occurs. Routing tables are populated in advance with information about peer nodes and their attached UEs, enabling immediate direct routing when traffic needs to be forwarded, thus reducing latency while the one-time setup complexity is amortized over many subsequent transmissions.
3Reliability
If separate tunnels are established for each peer radio network node, then mobility is supported and latency is reduced, but the number of connections and computational overhead increases
Solution Approach 1:
The patent implements dynamic connection management where peer connections and their associated tunnels are established, maintained, or torn down based on real-time network conditions and UE mobility patterns. The system dynamically adjusts the number and configuration of peer connections, maintaining separate tunnels for active peer nodes while allowing connections to be released when no longer needed, thus supporting mobility while managing computational overhead through selective connection maintenance.
Data Source
AI summary
It is provided a method for managing radio bearer traffic between radio network nodes. The method is performed in a first radio network node and comprises the steps of: establishing a peer connection with a peer radio network node, the peer connection comprising a tunnel; ensuring a routing table of the first radio network node contains entries for each one of a local set of UEs attached to the first radio network node; transmitting an output route update message indicating that each one of the local set of UEs is attached to the first radio network node; receiving an input route update message from the peer radio network node, the input route update message indicating that each one in a peer set of UEs is attached to the peer radio network node; adjusting the routing table based on the peer set of UEs; and routing radio bearer traffic.