VLAN Path Selection Algorithm for Network Resource Utilization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing shortest path bridging protocols, such as IEEE 802.1aq, fail to fully utilize all available communication paths in networks, leading to inefficient use of resources and suboptimal traffic distribution, especially in highly meshed environments.
Innovation Solution
A method that utilizes a path selection algorithm based on V mod N, where V is the sequential ID number for a VLAN and N is the total number of available equal-hop, equal-cost paths, to maximize the selection of communication paths across a network, ensuring all paths are considered for traffic assignment.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If STP protocol is used to prevent loops and find lowest cost paths, then network stability is improved, but network resource utilization deteriorates due to blocking redundant links
Solution Approach 1:
The patent implements dynamic path selection where the system transitions from static link blocking (STP) to dynamic path assignment (SPB). The spanning tree topology is dynamically calculated and multiple dynamic paths are assigned to different VLANs, allowing the network to adaptively utilize redundant links while maintaining loop prevention. This resolves the contradiction by making the system dynamic rather than static, enabling both stability and resource utilization.
Solution Approach 2:
The patent changes the parameter of path selection from single-path blocking to multi-path assignment. By calculating multiple equal-cost paths and assigning different VLANs to different paths, the system transforms the network from underutilized (STP) to fully utilized (SPB) while maintaining stability through controlled path assignment.
2Productivity
If IEEE 802.1aq SPB protocol is used to determine EHEC paths, then network resource utilization is improved, but path selection completeness deteriorates due to limitations in ECT protocol path assignment
Solution Approach 1:
The patent segments the path selection process into distinct phases: first calculating all available EHEC paths using SPB, then systematically assigning VLANs to these paths. The segmentation allows complete path enumeration followed by comprehensive VLAN assignment, ensuring no path is missed and all network resources are utilized.
Solution Approach 2:
The patent implements a feedback mechanism where the system continuously monitors network topology changes and recalculates EHEC paths. When topology changes occur, the path selection process is triggered again, ensuring the system adapts to new conditions and maintains complete path selection awareness.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
A manner of selecting communication traffic paths through a LAN, WAN, or similar communication network. Traffic received at a source bridge is forwarded to a destination bridge along a communication path selected from a plurality of possible, preferably EHEC paths. The paths may be discovered by a breadth first search and stored in a path selection table in association with a sequential index number. The paths are selected, for example by assigning a path to a VLAN by determining V mod N, comparing the result to indices on a path selection table that associates an unique index with each of the plurality of communication paths, and selecting the path associated with an index equal to the result, wherein N is the number of paths in the plurality of paths and V is a group identifier. The selected paths may be stored in the path selection table in association with the respective VLAN, and any received traffic for that VLAN is forwarded along the selected path.