Data Block Reordering in Any-to-Any Transmission Systems

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In data processing systems, the recombination of data streams from multiple processing paths often results in out-of-order blocks due to differential delays, which is particularly challenging in 'any-to-any' scenarios where blocks are distributed across paths without known destinations, making existing sorting algorithms impractical.

Innovation Solution

A data processing system that receives data blocks, load balances them across multiple paths, hashes to determine transmission paths, and reorders them to maintain the original order, ensuring correct sequencing before transmission.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If data blocks are distributed across multiple processing paths to increase throughput, then processing speed is improved, but data block ordering is lost due to differential delays

Engineering Contradiction:
Improveprocessing throughputVSAvoiddata block ordering
Core Design Contradiction:
SpeedVSStability of the object's composition

Solution Approach 1:

The patent segments the data stream into multiple independent processing paths, allowing parallel processing to increase throughput. Each path processes data blocks independently, and the system later reassembles them in the correct order using sequence numbers, thus resolving the contradiction between speed and ordering stability

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent attaches sequence numbers to data blocks before they are distributed across processing paths. This preliminary action enables the system to track and reorder blocks later, ensuring correct sequencing is maintained even though blocks travel through different paths with different delays

Inventive Principle:
Principle #10Preliminary action

2Stability of the object's composition

If existing sorting algorithms are used to restore order in any-to-any situations, then data ordering can be maintained, but system complexity increases significantly

Engineering Contradiction:
Improvedata block orderingVSAvoidsorting algorithm complexity
Core Design Contradiction:
Stability of the object's compositionVSDevice complexity

Solution Approach 1:

The patent applies local quality by assigning sequence numbers specifically to data blocks from each input stream. This localized tagging approach simplifies the reordering process compared to global sorting algorithms, as the system only needs to sort blocks within each stream independently rather than managing complex inter-stream ordering relationships

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The patent uses sequence numbers as an intermediary mechanism to track data block positions. Instead of implementing complex sorting algorithms, the system uses these simple numerical identifiers to mediate the reordering process, significantly reducing computational complexity while maintaining ordering stability

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS8125997B1Systems and methods for processing any-to-any transmissions
Publication Date: 2012.02.28 HEWLETT PACKARD ENTERPRISE DEV LP
  • US8125997B1 patent drawing
  • US8125997B1 patent drawing
  • US8125997B1 patent drawing

AI summary

A data processing system performs any-to-any transmission of data blocks. The system receives the data blocks on incoming data streams, and load balances the data blocks across a number of processing paths. The processing paths process the data blocks causing one or more of the data blocks to become out of order relative to an order in which the data blocks were received. The system hashes the data blocks to determine a manner in which to transmit the data blocks, reorders the data blocks to restore the order in which the data blocks were received, and transmits the reordered data blocks on outgoing data streams.