Fault Localization in Multiple Spanning Tree Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing fault localization methods in networks, such as SNMP and IEEE 802.1ag, lack a complete solution for efficiently redirecting traffic around failures in multiple spanning tree based architectures, particularly in networks with non-manageable or misconfigured nodes, and fail to provide effective failover mechanisms.
Innovation Solution
A method that monitors connectivity across partially disjoint spanning trees, uses Alive and Failure messages to identify and notify network management of lost connectivity, and redirects traffic to unaffected trees, determining the fault location by analyzing common elements in failed trees and excluding those in operational trees, without introducing extra overhead to edge-nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple spanning trees are used for fault tolerance, then network reliability is improved, but fault localization complexity increases
Solution Approach 1:
The network is segmented into multiple spanning trees, each handling specific VLANs or traffic flows. When a fault occurs, only the affected tree needs to be analyzed rather than the entire network, reducing localization complexity while maintaining reliability through redundant paths
Solution Approach 2:
A centralized controller or management system acts as an intermediary that collects topology information from all spanning trees and performs fault localization analysis. This external mediator handles the complexity of analyzing multiple trees, keeping individual network devices simple while achieving accurate fault localization
2Device complexity
If static spanning trees are configured before network operation, then device complexity is reduced, but adaptability to failures worsens
Solution Approach 1:
Spanning trees are pre-configured and calculated before network operation, with all necessary topology information stored in advance. This preliminary setup reduces real-time computational complexity while maintaining adaptability through pre-planned alternative paths that can be activated immediately upon failure detection
Solution Approach 2:
While the spanning tree topology itself remains static for simplicity, the system dynamically selects which pre-configured trees to use based on real-time failure conditions. This dynamic selection mechanism provides adaptability to failures without requiring dynamic recalculation of the trees themselves
3Speed
If distributed failure detection is implemented in edge-nodes, then detection speed is improved, but information loss increases
Solution Approach 1:
Individual detection results from multiple edge-nodes are merged and correlated by a centralized controller that has the complete topology view. This combination approach maintains the fast detection capability of distributed monitoring while compensating for local information loss through global context available at the controller
Data Source
Figure 1~2
Figure 3~4
Figure 5
AI summary
A method of localising a fault in a network is disclosed. The network comprises nodes (SWl... SW4) links, and edge-nodes (ENl... EN4) arranged as a plurality of spanning trees (Tl, T2,T3) , the spanning trees being partially disjoint. The network further comprises means for network management. The method comprising the steps of receiving information on the configuration of the plurality of tree topologies in the network; monitoring connectivity in the network; upon detection of a loss of connectivity in the network, identifying the failed tree (s) , and determining the network elements common to the failed tree(s) .