Switching Mesh Load Balancing via Path Tagging and Hashing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional network switches lack efficient methods for load balancing and path management in switching meshes, leading to suboptimal performance and increased latency due to the lack of effective traffic distribution across multiple paths.
Innovation Solution
The implementation of a method that uses path tagging and hashing mechanisms to distribute traffic across multiple paths in a switching mesh, where a hash function generates an index value based on packet data to select a path tag, and weights can be applied to prioritize paths based on usage and performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If path tagging and hashing mechanisms are implemented for load balancing, then traffic distribution efficiency is improved, but device complexity increases
Solution Approach 1:
The patent segments the traffic distribution process into distinct components: path tags for path identification, hash functions for deterministic selection, and weight mechanisms for prioritization. This segmentation allows each component to be optimized independently while working together to achieve efficient load balancing across the switching mesh.
Solution Approach 2:
The path tag acts as an intermediary element between the packet data and the physical path selection. The hash function processes packet data to generate an index, which then maps to a path tag, which finally determines the output port. This intermediary mechanism simplifies the overall complexity by breaking down the decision-making process into manageable stages.
2Productivity
If multiple paths are utilized for load balancing, then network throughput is improved, but path management complexity increases
Solution Approach 1:
The system implements self-service path selection through deterministic hashing. Once the hash function is established and path tags are assigned, the path selection becomes automatic and independent of manual intervention. The hash function consistently maps packet data to the same path tag, ensuring predictable and self-managing traffic distribution without requiring complex centralized control.
Solution Approach 2:
The patent utilizes parameter changes through weight assignments to path tags. By adjusting the weights associated with different paths, the system can dynamically prioritize certain paths over others based on current network conditions without changing the fundamental path selection mechanism. This allows flexible path management through parameter adjustment rather than structural complexity.
3Reliability
If weighted path selection is implemented, then critical traffic stream performance is improved, but processing time increases
Solution Approach 1:
The system performs preliminary action by pre-calculating and storing path tags with their associated weights in a lookup structure. When a packet arrives, the hash function quickly maps the packet data to a path tag, and the weight information is already prepared, allowing for rapid selection without real-time complex calculations. This preliminary preparation minimizes processing time while maintaining reliable critical traffic performance.
Data Source
AI summary
One embodiment disclosed relates to a method of load balancing traffic in a switching mesh. A packet is received at a switch of the mesh. A MAC destination address is gathered from the packet. An entry in a MAC address table is found with the MAC destination address, and a switch identifier associated with the MAC destination address is obtained. An entry in a switch table is found with the switch identifier, and data associated with the switch identifier is obtained. A hash function is used on field data from the packet to generate a hash value, and the hash value and the associated data are used to generate an index value. An entry in the tag table is found with the index value, and a path tag associated with the index value is obtained. The path tag is inserted into the packet. The path tags may be weighted.