Ring Network Virtual Channel Balancing for Deadlock-Free Routing

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Ring-based network topologies suffer from deadlock and imbalanced data packet distribution, leading to reduced performance due to long virtual channel dependency chains and unfairness, especially in multi-dimensional torus and twisted torus networks.

Innovation Solution

Implementing dual-datelines in ring-based networks, where each dateline is separated by half the diameter, and using a routing algorithm that switches data packets to a second virtual channel based on a threshold hop value to balance load and ensure deadlock-free operation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If virtual channels are used to ensure deadlock-free operation, then deadlock prevention is improved, but network performance deteriorates due to imbalanced data packet distribution

Engineering Contradiction:

Improvedeadlock preventionVSAvoidnetwork performance

Core Design Contradiction:

ReliabilityVSProductivity

Solution Approach 1:

The patent implements dynamic virtual channel selection based on packet hop count. Packets dynamically switch between first and second virtual channels depending on their distance to destination, creating adaptive load balancing that prevents deadlock while optimizing performance

Inventive Principle:

Principle #15Dynamics

Solution Approach 2:

Different virtual channels are assigned different roles based on local conditions. The first virtual channel handles packets with more hops remaining, while the second virtual channel handles packets with fewer hops, creating localized optimization at each network node

Inventive Principle:

Principle #3Local quality

2Reliability

If a dateline is used to prevent deadlock, then deadlock-free operation is ensured, but long virtual channel dependency chains are created leading to compounding unfairness and throughput loss

Engineering Contradiction:

Improvedeadlock-free operationVSAvoidthroughput loss

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The patent segments the single long dependency chain into multiple shorter chains by introducing a second virtual channel. This divides the virtual channel dependency graph, reducing the maximum dependency chain length and preventing compounding unfairness while maintaining deadlock prevention

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent adds a second virtual channel dimension to the existing single virtual channel system. This dimensional expansion provides alternative routing paths that shorten dependency chains and reduce the impact of any single virtual channel bottleneck

Inventive Principle:

Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS12483497B2Virtual channel balancing in ring-based topologies

Publication Date: 2025.11.25 GOOGLE LLC

AI summary

Systems and method for routing data packets in ring network. A data packet being transmitted to a destination node may be received by a first structure at a first node. The first node may determine a number of hops the data packet will traverse as it is transmitted from the first node to the destination node and compare the determined number of hops to a threshold hop value to determine whether the number of hops is equal to or less than the threshold hop value. If the number of hops is greater than the threshold, the data packet may be transmitted to a dimension queuing structure for a first virtual channel within a second node, otherwise, the data packet may be transmitted to a dimension queuing structure for a second virtual channel or a turn queuing structure within the second node.