Tree Aggregation Network Load Distribution

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing network architectures struggle to provide effective load distribution and redundancy against both link and node failures without modifying the functionality of interior nodes, which is undesirable for service providers.

Innovation Solution

A Tree Aggregation Group (TRAG) network architecture that uses multiple disjoint trees with common leaf nodes and no shared interior nodes, allowing data to be distributed across trees by hashing on frame fields, and employing a Tree Aggregation Method (TRAM) to redirect loads and refresh Filtering Database entries using control frames to prevent network flooding.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If multiple trees are used for load distribution and redundancy, then network bandwidth and availability are improved, but device complexity increases due to the need for virtual switch architecture and paired interior nodes

Engineering Contradiction:
Improvenetwork availabilityVSAvoidvirtual switch architecture
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The network is segmented into multiple disjoint trees, each handling a portion of the traffic load. This segmentation allows load distribution across trees without requiring complex virtual switch architecture, as each tree operates independently with standard interior nodes.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a new dimension of redundancy by creating multiple disjoint trees instead of pairing interior nodes. This dimensional approach to network topology provides redundancy and load distribution capabilities without modifying interior node functionality or requiring virtual switch architecture.

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

2Reliability

If interior nodes are paired and interconnected via dedicated links to form virtual interior nodes, then protection against node failures is provided, but modification of interior node functionality is required

Engineering Contradiction:
Improveprotection against node failuresVSAvoidinterior node modification
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

Instead of pairing and modifying interior nodes, the network is segmented into multiple disjoint trees with separate interior nodes. This segmentation provides redundancy without requiring any interior node modification, as each tree's interior nodes remain standard and unmodified.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent creates multiple copies of the tree structure with disjoint interior nodes, eliminating the need to modify existing interior nodes. Each tree is a independent copy that can handle traffic independently, providing redundancy without functional modification.

Inventive Principle:
Principle #26Copying

3Productivity

If Link Aggregation is used to distribute data among multiple links, then load distribution and link failure protection are achieved, but node failure protection is not provided

Engineering Contradiction:
Improveload distributionVSAvoidnode failure protection
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent extends load distribution from the link level (Link Aggregation) to the tree level by creating multiple disjoint trees. This dimensional extension provides both load distribution and node failure protection, as traffic can be redirected to alternative trees when node failures occur.

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

Data Source

PatentUS8015320B2Load distribution and redundancy using tree aggregation
Publication Date: 2011.09.06 FUTUREWEI TECHNOLOGIES INC
  • US8015320B2 patent drawing
  • US8015320B2 patent drawing
  • US8015320B2 patent drawing

AI summary

A network comprising a plurality of trees each comprising at least one ingress leaf node, at least one interior node, and at least one egress leaf node, wherein at least some of the ingress leaf nodes and the egress leaf nodes are common to the trees, and wherein the ingress leaf node is configured to transport data to the egress leaf node using any of the trees is disclosed. Also disclosed is a network component comprising a processor configured to implement a method comprising selecting one of a plurality of trees associated with information contained within a frame, directing the frame to the selected tree, and maintaining a filtering database (FDB) entry in an interior node in the unselected tree or trees.