Mesh Network Loop Detection Using Neighbor Graph Traversal
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The EasyMesh network can be paralyzed by the presence of loops, which existing technologies like STP cannot effectively detect or address without additional resource consumption and device compatibility issues.
Innovation Solution
A novel mesh network loop detection method using directed graph search to create a neighbor graph, traverse it, and detect loops, followed by breaking them based on link weights and priorities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional STP (Spanning Tree Protocol) is used for loop detection in EasyMesh network, then loop detection capability is provided, but additional resource consumption and device compatibility issues occur
Solution Approach 1:
The patent makes mesh network devices self-aware of loop conditions by having them independently exchange topology maintenance messages and perform graph traversal algorithms on their own, eliminating the need for external STP controllers and reducing resource consumption from centralized loop prevention mechanisms
Solution Approach 2:
The patent replaces the traditional STP mechanical protocol with a software-based directed graph search algorithm that operates on topology information already collected through EasyMesh's existing message exchange mechanisms, avoiding the overhead of additional protocol processing
2Reliability
If traditional STP is used for loop detection in EasyMesh network, then loop detection capability is provided, but device compatibility issues occur
Solution Approach 1:
The patent makes the topology maintenance message serve multiple functions: it both maintains network topology information for EasyMesh operation and simultaneously provides the data needed for loop detection through graph traversal, eliminating the need for separate STP protocol support
Solution Approach 2:
The patent creates a virtual copy of the physical network topology in the form of a neighbor graph data structure, allowing loop detection to operate on this abstract representation without requiring actual protocol compatibility issues between diverse hardware devices
3Measurement precision
If directed graph search is used for loop detection, then loop detection accuracy is improved, but computational complexity increases
Solution Approach 1:
The patent performs preliminary actions by collecting all topology information and constructing the complete neighbor graph before initiating loop detection, so that the graph traversal algorithm operates on pre-processed data rather than gathering information during the detection process itself
Solution Approach 2:
The patent segments the loop detection process into distinct phases: topology message exchange, neighbor graph construction, and graph traversal detection, allowing each phase to be optimized independently and processed efficiently
Data Source
AI summary
The present invention provides a loop detection method applicable to a mesh network including a plurality of links among a plurality of devices, including: creating a neighbor graph based on a topology maintenance message, wherein the neighbor graph represents a network structure of the mesh network; traversing the neighbor graph; and detecting whether there is a loop existing in the mesh network according to a result from traversing the neighbor graph.