Token-Based Spanning Tree Algorithm for Loop Prevention
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication networks with mesh-like topologies, characterized by loops, face issues such as broadcast storms due to packet accumulation, leading to network collapse, and existing algorithms to convert these networks into tree-like structures are complex and resource-intensive.
Innovation Solution
A low-complexity token-based spanning tree algorithm that uses a distributed sequential approach with a single token to disable loops, where only the node in possession of the token can disable network ports, and loop prevention is initiated by a root node using loop discovery frames, reducing ingress data rate during the process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If sophisticated dynamic algorithms are employed to construct and reconfigure tree topology, then network performance is optimized and adaptability to topology changes is improved, but device complexity and computing power requirements increase significantly
Solution Approach 1:
The patent uses simple, static spanning tree structures instead of complex dynamic algorithms. Each network device maintains a basic spanning tree configuration that does not require sophisticated computation or frequent reconfiguration, effectively using simple structures to replace complex adaptive mechanisms.
Solution Approach 2:
The patent changes the operational parameters of network devices by disabling dynamic algorithm execution and enforcing static spanning tree configurations. This parameter change reduces computational complexity while maintaining essential loop prevention functionality through simplified rules.
2Reliability
If mesh-like topology with loops is maintained for redundancy, then network reliability is improved, but broadcast storms occur due to packet accumulation leading to network collapse
Solution Approach 1:
The patent segments the network into a spanning tree structure that divides the mesh topology into hierarchical levels. This segmentation breaks potential broadcast storm loops by establishing directed paths from root to leaf nodes, preventing packets from circulating indefinitely while maintaining network connectivity.
Solution Approach 2:
The root node acts as an intermediary that controls broadcast traffic distribution. By positioning a single root node at the top of the spanning tree hierarchy, the patent creates a controlled distribution point that prevents uncontrolled packet multiplication while maintaining redundancy through the tree structure.
3Object-affected harmful factors
If spanning tree algorithm is implemented to prevent loops, then broadcast storms are avoided, but computational complexity and resource consumption increase
Solution Approach 1:
Network devices automatically configure themselves according to simple spanning tree rules without requiring complex centralized control or intensive computation. Each device independently determines its role in the spanning tree based on basic criteria, reducing the need for resource-intensive algorithm execution while maintaining loop prevention.
Data Source
AI summary
Aspects of a method and system for a low-complexity spanning tree algorithm in communication networks may comprise preventing loops in a communications network utilizing a distributed sequential algorithm in which there is a single token. Only a network node in possession of this single token may disable a network port. A spanning tree may be generated based on loop prevention. The network ports that may be disabled may be chosen from a port map, where the port map may be obtained by combining a port map identifying ports that are connected to loops with a port map indicating network ports that are to remain enabled. The loop prevention may be initiated by a root node and a token may be generated by the root node when completing the prevention. Network nodes may reduce ingress data rate during loop prevention.