IP Address Assignment via Router Database Capacity Checks

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Current information handling systems face challenges in efficient address handling within computer networks, particularly in mapping IP addresses to MAC addresses, leading to inefficiencies in packet forwarding and resource utilization.

Innovation Solution

The proposed solution involves generating candidate IP addresses and checking their installability in both fast and slow databases within routers, such as hardware and software ARP tables, to ensure effective mapping, with a fallback mechanism to alternative addresses if initial installations fail, optimizing the use of available resources.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If IP address assignment is performed without checking router database capacity, then address assignment is simple and fast, but router mapping database becomes overloaded and packet forwarding efficiency deteriorates

Engineering Contradiction:

Improvepacket forwarding efficiencyVSAvoidaddress assignment complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent performs preliminary checks of router database capacity before assigning IP addresses. The DHCP server queries routers about their available mapping database entries and selects IP addresses that ensure successful installation in router ARP tables, preventing future forwarding inefficiencies.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The system implements feedback mechanisms where routers report their database status to the DHCP server, and the DHCP server adjusts address assignment decisions based on this feedback. This closed-loop control ensures optimal utilization of router mapping resources.

Inventive Principle:

Principle #23Feedback

2Reliability

If multiple databases are used for IP-MAC mapping, then mapping capacity and reliability improve, but address assignment complexity and processing time increase

Engineering Contradiction:

Improveaddress mapping reliabilityVSAvoidaddress assignment time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The patent segments the mapping database into multiple hierarchical levels (fast local ARP tables in data plane, slower ARP tables in control plane, and remote DHCP server databases). Each segment serves specific functions and is queried in an optimized sequence to balance reliability and speed.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The system dynamically changes operational parameters such as database selection and query depth based on network conditions, router capacity, and address assignment context, optimizing the balance between reliability and processing time for each assignment operation.

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS10764241B2Address assignment and data forwarding in computer networks

Publication Date: 2020.09.01 DELL PROD LP

AI summary

When a network host (110H.1) requests an IP address (via DHCP for example), and a candidate IP address is generated, the candidate IP address and the host's MAC address are installed in the ARP table(s) of at least one router present in the host's LAN. If installation is unsuccessful, e.g. due to the ARP table being full or due to a hash collision, the candidate IP address is declined, and another IP address is generated. Other features are also provided.