Segmented Bit Mask for IP Routing Table Optimization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Configuring and maintaining large lookup lists in IP packet data networks is inefficient due to the fixed manner in which bit masks are applied to IP addresses, requiring substantial efforts for handling and updating, especially when dealing with a large number of entries.

Innovation Solution

A method for configuring network nodes that allows routing address information to be defined using a bit mask with relevant binary digits separated by non-relevant digits, enabling flexible handling and masking of IP addresses, thereby reducing the number of filters needed and simplifying the configuration process.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If bit masks are applied in a fixed manner to IP addresses using conventional lookup lists, then routing decisions can be made based on destination addresses, but substantial efforts are required for configuring, maintaining and updating lookup lists when dealing with a large number of entries

Engineering Contradiction:
Improverouting decision efficiencyVSAvoidlookup list management complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent segments the bit mask into multiple parts, where each part corresponds to a specific segment of the IP address. This allows different segments of the IP address to be masked independently, enabling more flexible and efficient routing decisions without requiring extensive lookup lists. The segmentation principle directly addresses the contradiction by reducing the number of entries needed in routing tables while maintaining routing efficiency.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a new dimension to traditional IP routing by applying bit masks not just to the entire IP address but to specific segments or dimensions of the IP address. This dimensional approach allows for more granular control over routing decisions, reducing the complexity of lookup lists while improving routing productivity through targeted masking of relevant IP address portions.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Adaptability or versatility

If conventional bit masking is used where masks are applied to the first n bits of IP addresses, then routing can be performed using standard lookup processes, but flexibility in handling and masking IP addresses is limited

Engineering Contradiction:
ImproveIP address masking flexibilityVSAvoidconfiguration simplicity
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The bit mask is divided into multiple segments that can be independently configured to mask different portions of the IP address. This segmentation provides flexibility in adapting to various routing scenarios while maintaining ease of operation through a structured approach to mask configuration. Each segment can be tailored to specific routing requirements without complicating the overall configuration process.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements dynamic bit masking where the mask can be adjusted and configured based on specific routing requirements. This dynamic approach enhances adaptability by allowing the masking behavior to change according to different routing scenarios, while the systematic method of applying masks keeps the operation simple and manageable.

Inventive Principle:
Principle #15Dynamics

3Measurement precision

If a large number of lookup list entries are maintained for comprehensive routing coverage, then routing accuracy is improved, but the efforts required for handling and updating the lookup lists increase substantially

Engineering Contradiction:
Improverouting accuracyVSAvoidlookup list maintenance time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

By segmenting the bit mask into multiple parts that can be independently configured, the patent achieves high routing accuracy without requiring an extensive number of lookup list entries. Each segment can be precisely tuned to match specific routing criteria, maintaining accuracy while significantly reducing the time required for maintaining and updating routing information.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the parameters of the routing lookup process by introducing configurable bit mask segments that can be adjusted to achieve the desired routing accuracy. This parameter-based approach allows for precise routing control while reducing the maintenance burden, as changes can be made by adjusting mask parameters rather than updating entire lookup list entries.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentEP3107268B1Method for configuring a network node of a telecommunications network, telecommunications network, network node, program and computer program product
Publication Date: 2018.12.19 DEUTSCHE TELEKOM AG
  • EP3107268B1 patent drawingFigure 1~3
  • EP3107268B1 patent drawing
  • EP3107268B1 patent drawing

AI summary

The invention relates to a method for configuring a network node of a telecommunications network, wherein the telecommunications network comprises a plurality of network nodes, wherein the telecommunications network is an IP (Internet Protocol) packet data network, wherein the network node provides a routing and/or forwarding and/or switching operation on the network layer (layer 3) according to the OSI model (Open Systems Interconnection model) such that a data packet, being an IPv6 data packet and being received by the network node from a further network node of the plurality of network nodes, is -- either rejected, -- or routed and/or forwarded and/or switched to a third network node of the plurality of network nodes of the telecommunications network, wherein the method comprises at least the following step: transmitting, as part of a configuration process of the network node, routing address information comprising source address information and/or destination address information, and wherein the routing address information is, at least partly, defined based on an address information and a bit mask, the bit mask defining at least a first relevant binary digit of the routing address information and/or the address information, and a second relevant binary digit of the routing address information and/or the address information such that the first and second relevant binary digits of the bit mask are separated - within the bit mask - by at least one non-relevant binary digit of the bit mask.