Ring Network Traffic Transmission Path Selection

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current network switching devices face challenges in meeting the increasing bandwidth requirements due to the need for packet reordering at destination nodes, which consumes significant resources, power, and causes delays in multi-node ring network structures.

Innovation Solution

A method and system for traffic transmission where traffic is sent on a specified path between nodes with equal hop counts, eliminating the need for packet reordering at destination nodes, and optimizing resource usage by ensuring non-blocking switching and reducing network congestion.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If load balancing is implemented using shortest path first algorithm in multi-node ring network, then bandwidth utilization is improved, but packet reordering is required at destination node consuming computing resources

Engineering Contradiction:
Improvebandwidth utilizationVSAvoidpacket reordering complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by pre-determining the forwarding path at the source node before traffic transmission begins. The source node selects one of the two equal-hop paths and forwards all packets of a flow through that predetermined path, eliminating the need for destination node reordering operations while maintaining load balancing across the network

Inventive Principle:
Principle #10Preliminary action

2Reliability

If packet reordering is performed at destination node to ensure normal traffic use, then traffic correctness is improved, but computing resource consumption increases

Engineering Contradiction:
Improvetraffic correctnessVSAvoidcomputing resource consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent inverts the traditional approach by performing path selection at the source node rather than at the destination node. Instead of allowing packets to arrive out of order and then reordering them, the source node deterministically selects a single forwarding path for each flow, ensuring packets arrive in correct order without requiring destination node reordering computations

Inventive Principle:
Principle #13The other way round (Inversion)

3Productivity

If multiple switching devices form small ring network system, then switching capability is improved, but area and power consumption of chip increase

Engineering Contradiction:
Improveswitching capabilityVSAvoidchip area
Core Design Contradiction:
ProductivityVSArea of stationary object

Solution Approach 1:

The patent applies segmentation by dividing the network into multiple independent nodes in a ring topology, where each node can independently forward traffic. This segmentation allows the system to achieve high switching capability distributed across multiple nodes while each individual node maintains compact design without requiring large on-chip reordering buffers

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS12040963B2Method, node, and system for traffic transmission
Publication Date: 2024.07.16 HUAWEI TECH CO LTD
  • US12040963B2 patent drawing
  • US12040963B2 patent drawing
  • US12040963B2 patent drawing

AI summary

A method is applied to a ring link, where the ring link includes a first node, a second node, a third node, and a fourth node in sequence. According to the method, the first node receives first traffic, where the first node is a source node that sends the first traffic on the ring link; and the first node sends the first traffic to the third node, where two reachable paths with equal hop counts are included from the first node to the third node, the first node sends the first traffic to the third node on a preset first transmission path, the first transmission path passes through the second node, and the first transmission path is one of the two reachable paths with equal hop counts. This method can reduce computing load of nodes while implementing non-blocking switching of traffic between the nodes.