Hierarchical BAP Addressing for Multi-Hop IAB Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for multi-hop integrated access and backhaul (IAB) deployments in communications networks lead to waste of radio resources, increased latency, and energy wastage due to inefficient packet routing and bearer mapping.
Innovation Solution
Implementing a hierarchical Backhaul Adaptation Protocol (BAP) address scheme that allocates unique BAP addresses based on the number of hops between nodes, enabling optimized packet routing and scheduling to improve Quality of Service (QoS) and reduce signaling overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If existing packet routing methods are used in multi-hop IAB deployments, then basic connectivity is maintained, but radio resources are wasted and latency increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing optimal routing paths in routing tables before packets arrive. The network nodes have pre-established knowledge of the most efficient paths through the multi-hop network, allowing immediate packet forwarding without real-time calculation delays. This pre-computation approach eliminates routing decision latency while maintaining optimal paths.
Solution Approach 2:
The patent introduces routing tables as intermediary structures that mediate between packet sources and destinations. These routing tables act as pre-prepared guides that tell network nodes exactly how to forward packets through intermediate hops, eliminating the need for ad-hoc routing decisions and reducing both latency and signaling overhead.
2Reliability
If traditional routing methods are used, then network connectivity is maintained, but signaling overhead increases
Solution Approach 1:
The patent reduces signaling overhead by performing all routing calculations and path optimizations in advance during network setup. The routing tables are pre-configured with optimal paths, so when packets arrive, nodes simply lookup and forward without generating additional signaling traffic. This shifts the complexity from real-time operation to initial setup.
3Productivity
If inefficient bearer mapping is used, then basic service delivery is achieved, but energy is wasted
Solution Approach 1:
The patent optimizes energy efficiency by dynamically adjusting bearer mapping parameters based on network conditions and packet characteristics. The system changes mapping parameters to select the most energy-efficient transmission paths and modes, considering factors like hop count, traffic type, and available resources at each node.
Data Source
AI summary
A method performed by a first node. The first node operates in a communications network. The first node determines, based on a header of a packet, a first number of hops. The first number of hops are the hops the packet has to traverse in the communications network to reach a second node in the communications network. The header of the packet indicates a second number of hops between the second node and a third node in the communications network in a first path. The first node obtains a wired backhaul connection to a core network of the communications network from the third node. The first node then initiates routing the packet towards the second node based on the determined first number of hops.