Routing Table Interface Key for Concurrent Network Transmission

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The prior art computing system faces challenges in transmitting packets into multiple networks simultaneously, handling asymmetric input/output flows, and correctly routing identical destination addresses across different networks, due to its reliance on a single default entry in the routing table.

Innovation Solution

The improved routing table approach uses a destination address and a specific interface as a lookup key, allowing for multiple default entries and enabling symmetric communication, correct handling of identical destination addresses, and concurrent reachability across varied networks by incorporating a functional layer that determines the correct outbound interface based on conditions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If a single default entry is used in the routing table, then the routing table structure is simple, but the system cannot transmit packets into multiple networks simultaneously

Engineering Contradiction:
Improveconcurrent packet transmission capabilityVSAvoidrouting table structure
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The routing table is segmented into multiple default entries, each associated with a specific outbound interface. This allows the system to maintain multiple default routes simultaneously, enabling concurrent packet transmission into different networks while keeping each individual routing entry relatively simple.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The routing table structure is extended by adding a new dimension - the outbound interface identifier. Instead of having a single default entry, the system now has multiple default entries differentiated by their associated interfaces. This dimensional extension resolves the contradiction by allowing multiple defaults without increasing the complexity of individual entries.

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

2Reliability

If a single default entry is used in the routing table, then the routing logic is simple, but asymmetric input/output flows cannot be handled correctly

Engineering Contradiction:
Improveasymmetric flow handlingVSAvoidrouting logic
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

Each default routing entry is assigned a specific outbound interface, creating local quality differentiation. This allows the routing logic to select the appropriate default entry based on the desired outbound interface, enabling correct handling of asymmetric flows where incoming and outgoing packets may use different interfaces.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

The routing logic becomes dynamic by selecting among multiple default entries based on runtime conditions, specifically the desired outbound interface. This dynamic selection capability allows the system to adapt to asymmetric flow requirements without requiring a completely complex routing table structure.

Inventive Principle:
Principle #15Dynamics

3Reliability

If a single default entry is used in the routing table, then the routing lookup is simple, but identical destination addresses across different networks cannot be correctly routed

Engineering Contradiction:
Improvedestination address resolutionVSAvoidrouting lookup process
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The routing table segments destination addresses by associating them with specific outbound interfaces. When multiple networks have identical destination addresses, each network's routes are separated into different default entries with different interface associations, allowing correct differentiation during lookup.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The outbound interface identifier acts as an intermediary that disambiguates identical destination addresses across different networks. By including the interface information in the routing lookup key, the system can correctly identify which network a destination address belongs to, even when addresses are identical.

Inventive Principle:
Principle #24Intermediary (Mediator)

4Productivity

If multiple default entries are allowed, then concurrent packet transmission across multiple networks is enabled, but the routing table complexity increases

Engineering Contradiction:
Improveconcurrent network transmissionVSAvoidrouting table structure
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The routing table structure is extended by adding the outbound interface as a new dimension. This allows multiple default entries to coexist without creating complex multi-level hierarchies, as each entry is differentiated by its interface association rather than requiring complex nesting or categorization.

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

Solution Approach 2:

The routing table structure is designed to be universal by accommodating multiple default entries with a consistent format. Each default entry follows the same structure but is associated with a different outbound interface, allowing the system to handle multiple networks simultaneously without requiring different data structures for different scenarios.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS8681791B2Outbound transmission of packet based on routing search key constructed from packet destination address and outbound interface
Publication Date: 2014.03.25 APPLE INC
  • US8681791B2 patent drawing
  • US8681791B2 patent drawing
  • US8681791B2 patent drawing

AI summary

A method is described that involves associating an outbound packet with a first network interface and constructing a search key from an identifier of the first network interface and the outbound packet's destination address. The method further entails submitting the search key to a routing function where the routing function identifies the outbound packet's next hop address. The method also involves transmitting the outbound packet to a node identified by the next hop address from the first network interface.