Transaction Packet Routing Without ECRC Recalculation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In shared infrastructure systems, modifying packet integrity checks like ECRC at intermediate points can lead to corruption, especially when different protocols are used, and existing solutions struggle to maintain data integrity during routing and address modifications.

Innovation Solution

A method that inserts additional routing information at predetermined bit positions in transaction packets without altering the ECRC value, allowing for flexible routing while reinstating the original bit values, thereby preserving data integrity across the infrastructure.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If additional routing information is added to transaction packets at intermediate infrastructure points, then routing flexibility and protocol adaptability are improved, but packet integrity (ECRC) may be corrupted

Engineering Contradiction:
Improverouting flexibilityVSAvoidpacket integrity
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The packet structure is segmented into fixed portions (original fields with predetermined bit values) and variable portions (additional routing information). This segmentation allows the packet to carry extended routing information while preserving the integrity of the original ECRC-calculated fields.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Predetermined bit values are established in advance at specific positions where additional routing information will be inserted. This preliminary setup allows intermediate infrastructure points to add routing information without needing to recalculate the ECRC, as the predetermined values are already accounted for in the original ECRC calculation.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If ECRC is recalculated at intermediate points to maintain integrity, then packet reliability is improved, but system complexity and potential for error increase

Engineering Contradiction:
Improvepacket integrityVSAvoidintegrity checking complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The problem of ECRC recalculation is extracted and eliminated by using predetermined bit values. Instead of recalculating ECRC at intermediate points (which adds complexity and potential for error), the system extracts only the necessary routing information from the packet while leaving the ECRC intact.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The original ECRC value serves itself by being valid for both the original packet contents and the extended packet with additional routing information. The predetermined bit values are designed so that the original ECRC calculation remains valid, eliminating the need for intermediate ECRC recalculation.

Inventive Principle:
Principle #25Self-service

3Ease of operation

If packet modifications are made for routing purposes, then routing functionality is improved, but data integrity may be compromised

Engineering Contradiction:
Improverouting capabilityVSAvoiddata integrity
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

Different portions of the packet are assigned different qualities/functions. The predetermined bit positions are designated specifically for additional routing information, while other portions maintain their original integrity-checking properties. This local differentiation allows routing modifications without compromising overall data integrity.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS8223745B2Adding packet routing information without ECRC recalculation
Publication Date: 2012.07.17 ORACLE AMERICAN INC
  • US8223745B2 patent drawing
  • US8223745B2 patent drawing
  • US8223745B2 patent drawing

AI summary

Additional routing information is added to a transaction packet without recalculating an ECRC by inserting the additional routing information at predetermined bit positions in the transaction packet known to have predetermined bit values. The modified transaction packet can then be routed using the additional routing information. The predetermined bit values can subsequently be reinstated at the predetermined bit positions in the packet.