Data Structure Update via Pointer and Dynamic Change Indicator

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In local area networks, updating address assignments between IP and MAC addresses in address tables can cause delays and data packet loss when existing assignments time out, leading to performance degradation and loss of quality of service.

Innovation Solution

A data administration unit and data access unit manage a data structure update process that allows continuous data packet processing by generating a dynamic change indicator or pointer to a new data structure, enabling seamless substitution without stopping data packet reception, and using synchronization signals to coordinate updates without buffering.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If address assignments are updated in the address table when timer values expire, then address table accuracy is improved, but data packet processing is interrupted causing performance degradation

Engineering Contradiction:
Improveaddress table accuracyVSAvoiddata packet processing continuity
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The address table is segmented into a first data structure (currently active) and a second data structure (being updated). The data administration unit generates a pointer to the first data structure and a dynamic change indicator, while the data access unit uses the pointer to access the active data structure. This segmentation allows updates to occur in the second data structure without interrupting packet processing in the first data structure.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The data administration unit performs preliminary actions by generating the pointer to the first data structure and the dynamic change indicator before the update is complete. The data access unit receives these preliminary indicators and begins using them immediately, allowing the transition to the updated data structure to occur seamlessly without waiting for the entire update process to complete.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If address table updates are performed by stopping data packet reception, then update accuracy is improved, but network latency increases and quality of service deteriorates

Engineering Contradiction:
Improveupdate accuracyVSAvoidnetwork latency
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The data access unit continuously processes data packets using the pointer to the first data structure while the data administration unit updates the second data structure. The dynamic change indicator ensures that packet processing continues uninterrupted, maintaining network performance and quality of service while updates occur in the background.

Inventive Principle:
Principle #20Continuity of useful action

3Reliability

If buffering is implemented to prevent data packet loss during updates, then data packet loss is reduced, but device complexity and memory requirements increase

Engineering Contradiction:
Improvedata packet deliveryVSAvoidbuffering mechanism complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The pointer and dynamic change indicator act as intermediaries between the data administration unit and the data access unit. Instead of implementing complex buffering mechanisms, the system uses these lightweight indicators to coordinate access to the first and second data structures, significantly reducing device complexity while preventing data packet loss.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS9935815B2Data administration unit, data access unit, network element, network, and method for updating a data structure
Publication Date: 2018.04.03 NXP USA INC
  • US9935815B2 patent drawing
  • US9935815B2 patent drawing
  • US9935815B2 patent drawing

AI summary

A data administration unit for updating a first data structure in a first memory may comprise a second memory, a data structure generator for setting up a second data structure in the second memory, a pointer generator for setting at least one of a dynamic change indicator and a pointer in the first data structure, a waiting unit for waiting for a finalization of a data access of a data access unit, and a data structure over-writer for overwriting the first data structure using data of the second data structure. An data access unit for accessing a first data structure in a first memory may comprise a data access driver, a first synchronization signal evaluator for reception and evaluation of a first synchronization signal, and a synchronization approval signal generator for generation and submission of a first synchronization signal.