Dual-Layer Link Aggregation for Bandwidth and Redundancy
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current link aggregation methods in communication networks fail to fully exploit bandwidth and redundancy, leading to suboptimal performance due to the inability to effectively manage traffic routing between nodes and maintain high bandwidth even in the event of link failures.
Innovation Solution
The implementation of dual-layer link aggregation, which includes inner-layer and outer-layer link aggregations, with peer and distant link aggregations, ensures efficient traffic distribution and redundancy by using hashing algorithms and L2 hardware lookup tables to manage packet routing and header information, allowing for increased bandwidth utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional link aggregation is used to provide redundancy, then reliability is improved, but bandwidth utilization deteriorates because redundant links cannot be fully exploited for increased throughput
Solution Approach 1:
The patent divides link aggregation into two distinct layers: inner-layer aggregation groups physical links between directly connected nodes, while outer-layer aggregation groups paths between non-directly-connected nodes. This segmentation allows different aggregation strategies to be applied at each layer, enabling full bandwidth utilization while maintaining reliability through the outer-layer redundancy paths.
Solution Approach 2:
The patent introduces a hierarchical two-layer structure that adds a dimensional perspective to traditional link aggregation. By distinguishing between inner-layer (direct connection) and outer-layer (indirect connection via intermediate nodes) aggregations, the system exploits multiple dimensions of network topology to simultaneously achieve high bandwidth utilization and fault tolerance.
2Productivity
If traffic is distributed across multiple physical links, then bandwidth is increased, but traffic routing complexity deteriorates making it difficult to manage packet forwarding
Solution Approach 1:
The patent introduces L2 hardware lookup tables as intermediary structures that automatically manage packet routing decisions. These lookup tables store pre-computed forwarding information and enable switches to rapidly determine the appropriate egress port based on packet destination, eliminating the need for complex real-time routing computations and simplifying traffic distribution across aggregated links.
Solution Approach 2:
The patent replaces complex software-based routing algorithms with hardware-based lookup table mechanisms. By substituting mechanical/computational routing decision-making with pre-computed hardware lookups, the system achieves high-speed packet forwarding without the overhead of complex routing management software.
3Reliability
If multiple physical links are aggregated into a single virtual port, then redundancy is provided, but the ability to exploit full bandwidth of all links deteriorates
Solution Approach 1:
The patent segments the aggregation function into two layers: inner-layer aggregation provides local redundancy and load balancing between directly connected nodes, while outer-layer aggregation provides path diversity through intermediate nodes. This segmentation allows each layer to independently utilize full bandwidth of its constituent links while providing multi-path redundancy, resolving the contradiction between reliability and bandwidth exploitation.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method and apparatus for link aggregation in a data communications network. A dual-layer link aggregation is formed, including two peer nodes, each connected to at least a third node. The dual-layer link aggregation is formed of a peer link aggregation of ports for communicating with a peer node, distant link aggregation of ports for communicating with a third node, and an outer-layer link aggregation of the ports included in the peer link aggregation and the distant link aggregation. The third node may implement an inter-node link aggregation aggregating links to each of the peer nodes. Packets may be received and forwarded by the peer nodes in such a manner as to each link aggregation to be active simultaneously.