Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. An apparatus for routing data packets in a radio access network, the apparatus comprising: at least one processor; and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform: receiving a data packet from a source network node, the data packet comprising a data packet header and a data packet payload; inspecting the data packet by performing a first packet inspection on the data packet header to determine information on a source or a destination of the data packet from the data packet header, and by performing a second packet inspection on the data packet payload based on the information on the source or the destination of the data packet to determine information on an identification of the destination of the data packet; determining information on a subsequent network node based on the information on the identification of the destination of the data packet; and forwarding the data packet to the subsequent network node as an interim action or as a final action, wherein an interim action defines a mask and a table for a next look-up and a final action defines what to do with and where to forward a packet, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform determining the subsequent network node using one of a plurality of look-up tables, the one look-up table being selected from the plurality of look-up tables based the information on the identification of the destination of the data packet.
The apparatus is designed for routing data packets in a radio access network, addressing the need for efficient and intelligent packet forwarding based on both header and payload information. The system includes at least one processor and memory with executable code to perform packet routing operations. Upon receiving a data packet from a source network node, the apparatus inspects the packet in two stages: first, it examines the packet header to determine source or destination information, and second, it analyzes the packet payload based on the header-derived information to further identify the destination. Using this combined data, the apparatus determines the next network node for forwarding the packet. The forwarding action can be either interim or final. An interim action involves applying a mask and selecting a table for subsequent look-up, while a final action defines the packet's final disposition and forwarding destination. The apparatus selects a specific look-up table from multiple available tables based on the destination identification derived from the payload inspection. This approach enhances routing accuracy and flexibility in dynamic network environments.
2. The apparatus of claim 1 , wherein the source network node corresponds to one or more elements of the group of a network edge node, a network gateway, a mobility management entity, a radio network controller, a serving gateway, a control plane data packet processing entity, or a user plane data packet processing entity.
This invention relates to a network apparatus designed to optimize data routing in communication networks. The apparatus includes a source network node that identifies a target network node for data transmission, determines a routing path based on network conditions, and forwards data packets accordingly. The source network node can be any of several network elements, including a network edge node, gateway, mobility management entity, radio network controller, serving gateway, or a control/user plane data packet processing entity. The apparatus dynamically selects the most efficient routing path to improve data transmission performance, reduce latency, and enhance network efficiency. The solution addresses challenges in modern networks where static routing can lead to suboptimal performance, particularly in scenarios with varying traffic loads or network conditions. By intelligently determining the routing path, the apparatus ensures data is transmitted through the most suitable network elements, improving overall network reliability and user experience. The invention is particularly useful in mobile and wireless networks where dynamic routing is essential for maintaining seamless connectivity.
3. The apparatus of claim 1 , wherein the radio access network comprises a plurality of baseband processing units for processing baseband data for subsequent radio transmission, wherein a baseband processing unit is assigned to process data of a service of the destination of the data packet, and wherein the subsequent network node corresponds to the baseband processing unit which is assigned to a service the data packet payload relates to.
This invention relates to a radio access network (RAN) architecture for efficiently processing and routing data packets based on service type. The problem addressed is the need for optimized data handling in RANs, particularly in scenarios where different services (e.g., voice, video, IoT) require distinct processing paths to ensure quality of service (QoS) and resource efficiency. The apparatus includes a radio access network with multiple baseband processing units (BBUs) that handle baseband data before radio transmission. Each BBU is dedicated to processing data for a specific service type. When a data packet arrives, the system determines the service associated with the packet's payload and routes it to the corresponding BBU. This ensures that the packet is processed by the BBU specialized for that service, improving performance and resource allocation. The subsequent network node in the data path is the BBU assigned to the service type of the packet's payload. This approach allows the RAN to dynamically assign processing resources based on service requirements, reducing latency and improving overall network efficiency. The system avoids generic processing by tailoring the handling of each packet to its specific service needs, enhancing QoS for different applications.
4. The apparatus of claim 3 , wherein the plurality of baseband processing units comprises control data processing units and payload data processing units, and wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform determining whether the data packet is a control data packet or a payload data packet based on the information on the source or the destination of the data packet.
This invention relates to a wireless communication apparatus with specialized baseband processing units for handling different types of data packets. The apparatus addresses the challenge of efficiently processing diverse data traffic in wireless networks, where control and payload data often require distinct processing pathways to optimize performance and resource utilization. The apparatus includes multiple baseband processing units, categorized into control data processing units and payload data processing units. These units are designed to handle different types of data packets based on their source or destination. The system determines whether an incoming data packet is a control data packet or a payload data packet by analyzing information related to its source or destination. This classification ensures that each packet is routed to the appropriate processing unit, enhancing efficiency and reducing latency. The apparatus further includes at least one processor, memory, and computer program code configured to execute the classification and routing functions. By distinguishing between control and payload data, the system optimizes processing resources, improves throughput, and ensures timely handling of critical control signals. This approach is particularly beneficial in high-traffic environments where efficient data management is essential for maintaining network performance.
5. The apparatus of claim 1 , wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform one or more operations on the data packet as the second packet inspection based on the information on the source or destination of the data packet, wherein the one or more operations are in sequence, and wherein a subsequent operation is based on the result of a prior operation, wherein the one or more operations correspond to one or more elements of the group of a masking operation, a look-up operation in a look-up table, a replacement operation on address information, or a replacement of routing information.
This invention relates to network packet processing, specifically improving packet inspection and modification in network devices. The problem addressed is the need for efficient, sequential, and conditional packet processing based on source or destination information to enhance routing, security, or traffic management. The apparatus includes at least one processor, memory, and computer program code configured to perform a second packet inspection on data packets. This inspection involves one or more operations executed in sequence, where each subsequent operation depends on the result of the prior operation. The operations may include masking data, performing look-ups in a look-up table, modifying address information, or updating routing information. These operations are applied based on the packet's source or destination, allowing dynamic and context-aware processing. The sequential and conditional nature of the operations enables more sophisticated packet handling, such as filtering, rerouting, or transforming packets based on their origin or destination. This approach improves network efficiency, security, and flexibility in managing data traffic. The apparatus can be integrated into routers, firewalls, or other network devices to enhance their packet processing capabilities.
6. The apparatus of claim 1 , wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform selecting one of one or more look-up tables, wherein the one or more look-up tables are selected based on the information on the source or the destination determined with the first packet inspection, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform the second packet inspection based on the one look-up table.
This invention relates to network packet processing, specifically improving efficiency in packet inspection by dynamically selecting look-up tables based on source or destination information. The problem addressed is the computational overhead in packet inspection systems that rely on static or generic look-up tables, which can lead to inefficient processing and increased latency. The apparatus includes at least one processor, memory, and computer program code configured to perform packet inspection in a network. The system first performs a preliminary packet inspection to determine information about the packet's source or destination. Based on this information, the apparatus selects one of multiple available look-up tables. The selection is tailored to the specific source or destination, optimizing the inspection process. The second, more detailed packet inspection is then performed using the selected look-up table, improving accuracy and reducing unnecessary computations. The look-up tables are pre-configured to contain relevant inspection rules or data for specific sources or destinations, allowing the system to bypass irrelevant checks. This dynamic selection reduces processing time and resource usage compared to systems that apply a single, generic look-up table to all packets. The invention is particularly useful in high-traffic networks where efficient packet processing is critical.
7. The apparatus of claim 6 , wherein the one or more look-up tables comprise information on a subsequent operation on the data packet and wherein the second packet inspection comprises the subsequent operation, wherein the operation corresponds to one or more elements of the group of a masking operation, a look-up operation in a look-up table, a replacement operation on address information, or a replacement of routing information.
This invention relates to network packet processing, specifically improving efficiency in handling data packets by using look-up tables to guide subsequent operations. The problem addressed is the computational overhead in repeatedly performing the same operations on packets, such as masking, address replacement, or routing updates, which can slow down network performance. The apparatus includes a packet inspection system that uses one or more look-up tables to determine the next operation to perform on a data packet. These tables store information about subsequent operations, such as masking specific packet fields, performing look-up operations in other tables, replacing address information (e.g., source or destination IP addresses), or updating routing information (e.g., modifying next-hop details). The second packet inspection stage then executes these operations based on the look-up table entries, reducing redundant processing and improving throughput. By predefining operations in look-up tables, the system avoids recalculating or re-evaluating the same actions for similar packets, which is particularly useful in high-speed networking environments where latency and efficiency are critical. The operations may include bitwise masking, table-based look-ups, or direct replacements of packet metadata, ensuring consistent and optimized processing. This approach streamlines packet handling while maintaining flexibility for different network policies or protocols.
8. The apparatus of claim 6 , wherein a look-up table comprises multiple rows and wherein each row comprises a key-value as an input value, an action or operation to be performed as second packet inspection as a first output value, and a second output value as input value for the second packet inspection for the action or operation to be performed with.
The invention relates to network packet processing systems, specifically improving efficiency in packet inspection and handling. The problem addressed is the computational overhead and latency in performing multiple packet inspections, particularly when different inspection actions depend on prior results. Traditional systems often require sequential processing, leading to delays and resource consumption. The apparatus includes a look-up table structured with multiple rows, where each row contains a key-value pair as an input value. For each input, the table specifies an action or operation to perform as a second packet inspection, producing a first output value. Additionally, each row includes a second output value, which serves as the input for the subsequent packet inspection action. This design allows for chained or conditional processing, where the result of one inspection directly influences the next, reducing redundant computations and improving throughput. The look-up table enables dynamic and efficient routing of packets through multiple inspection stages based on predefined rules, optimizing performance in high-speed networking environments. The system is particularly useful in firewalls, intrusion detection systems, or other security appliances where rapid and accurate packet handling is critical.
9. The apparatus of claim 8 , wherein the look-up table comprises at least two rows with differing entry sizes.
A system for data processing, specifically for handling variable-length data elements within a fixed-size buffer, such as within a network packet processing unit. The system addresses the challenge of efficiently locating and extracting data that may not occupy a consistent number of bytes. The apparatus includes a memory structure designed as a look-up table. This look-up table is characterized by having a specific organizational feature: it comprises at least two rows, where each row is configured to store entries of different sizes. This structural diversity allows the look-up table to accommodate and reference data elements of varying lengths without requiring each entry to conform to a uniform size. This is particularly useful in scenarios where data fields can expand or contract, such as in flexible data formats or protocols where some fields are optional or have variable content. The differing entry sizes within the rows enable more compact and efficient storage and retrieval of information related to these variable-length data elements.
10. The apparatus of claim 1 , wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform looking up a subsequent operation and an input value for the subsequent operation from a look-up table based on a key-value, wherein the one or more processors are configured to iteratively run the look-up core, starting with the information on the source or destination as a first key value determined with the first packet inspection, to determine the information on the identification of the destination.
This invention relates to network packet processing, specifically improving the efficiency of identifying destination information in packet forwarding systems. The problem addressed is the computational overhead in determining destination identification during packet inspection, which can slow down network operations. The solution involves using a look-up table to streamline this process. The apparatus includes at least one processor, memory, and computer program code configured to perform packet inspection and subsequent operations. The system first inspects a packet to determine initial information about its source or destination. This information is used as a key value to look up a subsequent operation and an input value from a preconfigured look-up table. The look-up table maps key values to operations and inputs, allowing the system to dynamically determine the next processing steps without redundant computations. The look-up core is run iteratively, starting with the initial key value from the first packet inspection, to progressively refine and determine the destination identification. This approach reduces processing time by avoiding repeated calculations and leveraging pre-stored mappings. The system is particularly useful in high-speed networking environments where rapid packet forwarding is critical.
11. A method for routing data packets in a radio access network, the method comprising receiving a data packet from a source network node, the data packet comprising a data packet header and a data packet payload; inspecting the data packet by performing a first packet inspection on the data packet header to determine information on a source or a destination of the data packet from the data packet header, and performing a second packet inspection on the data packet payload based on the information on the source or the destination of the data packet to determine information on an identification of the destination of the data packet; determining information on a subsequent network node based on the information on the identification of the destination of the data packet; and forwarding the data packet to the subsequent network node as an interim action or as a final action, wherein an interim action defines a mask and a table for a next look-up and a final action defines what to do with and where to forward a packet, wherein the method further comprises determining the subsequent network node using one of a plurality of look-up tables, the one look-up table being selected from the plurality of look-up tables based the information on the identification of the destination of the data packet.
This invention relates to data packet routing in radio access networks, addressing the challenge of efficiently determining the destination of data packets for optimal forwarding. The method involves receiving a data packet with a header and payload from a source network node. The header is first inspected to extract information about the packet's source or destination. Based on this information, a second inspection is performed on the payload to further refine the destination identification. The method then determines the next network node for forwarding the packet by selecting an appropriate look-up table from a plurality of available tables, where the selection is based on the refined destination information. The packet is forwarded either as an interim action, which involves setting a mask and table for subsequent look-up, or as a final action, which specifies the final forwarding decision. This approach enhances routing efficiency by dynamically adjusting the inspection and forwarding process based on packet content and destination details.
12. A non-transitory computer-readable medium comprising program instructions for causing an apparatus to perform at least the following: receiving a data packet from a source network node, the data packet comprising a data packet header and a data packet payload; inspecting the data packet by: performing a first packet inspection on the data packet header to determine information on a source or a destination of the data packet from the data packet header, and performing a second packet inspection on the data packet payload based on the information on the source or the destination of the data packet to determine information on an identification of the destination of the data packet; determining information on a subsequent network node based on the information on the identification of the destination of the data packet; and forwarding the data packet to the subsequent network node as an interim action or as a final action, wherein an interim action defines a mask and a table for a next look-up and a final action defines what to do with and where to forward a packet, wherein the computer-readable medium comprises program instructions for causing the apparatus to perform at least determining the subsequent network node using one of a plurality of look-up tables, the one look-up table being selected from the plurality of look-up tables based the information on the identification of the destination of the data packet.
This invention relates to network packet processing, specifically a method for efficiently routing data packets through a network by performing multi-stage packet inspection and look-up operations. The system receives a data packet containing a header and payload from a source network node. The header is first inspected to determine source or destination information, which then guides a deeper inspection of the payload to further refine the destination identification. Based on this refined identification, the system selects an appropriate look-up table from a plurality of available tables to determine the next network node for forwarding the packet. The forwarding action can be either interim, which involves setting up a mask and table for subsequent look-up operations, or final, which directly determines the packet's final destination and handling instructions. This approach optimizes routing decisions by dynamically adjusting inspection depth and look-up strategies based on packet characteristics, improving network efficiency and performance. The system is implemented via program instructions stored on a non-transitory computer-readable medium, enabling flexible and scalable packet processing in network devices.
Unknown
July 7, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.