Network Topology Partition Detection via Path Analysis

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Network topologies can become partitioned due to link or device failures, leading to isolated network devices that fail to receive necessary information for proper network operation, causing functional issues.

Innovation Solution

A method for detecting network topology partitions by analyzing a set of paths representing the information sharing topology, where network devices check connectivity and create unions of connected nodes, allowing for the identification and reconnection of partitioned devices.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of information

If network devices share information through routing protocols in a network topology, then information distribution and network connectivity are improved, but the network becomes vulnerable to partitioning when link or device failures occur

Engineering Contradiction:
Improveinformation sharingVSAvoidnetwork connectivity
Core Design Contradiction:
Loss of informationVSReliability

Solution Approach 1:

The patent applies preliminary action by pre-computing and storing a set of paths representing the information sharing topology before failures occur. When a failure happens, the system can quickly detect partitions by checking connectivity along these pre-established paths, avoiding the need for extensive real-time exploration and enabling rapid recovery actions.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system implements feedback by continuously monitoring network connectivity through path analysis. When connectivity changes are detected (indicating potential partitions), the system provides feedback to trigger partition detection algorithms that analyze the pre-stored paths, identify affected devices, and initiate reconnection procedures to restore information sharing.

Inventive Principle:
Principle #23Feedback

2Measurement precision

If extensive data structures are used to track network topology and detect partitions, then detection accuracy is improved, but storage requirements and device complexity increase

Engineering Contradiction:
Improvepartition detection accuracyVSAvoiddata structure requirements
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent segments the network topology into a set of paths, where each path represents a sequence of devices in the information sharing topology. Instead of maintaining a single large complex data structure of the entire topology, the system divides it into manageable path segments that can be independently analyzed for connectivity, reducing overall storage requirements while maintaining detection accuracy.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system extracts only the essential connectivity information needed for partition detection by storing sets of paths rather than complete topology details. This extraction approach retains sufficient information to detect partitions accurately while eliminating redundant data, thereby reducing storage requirements and device complexity.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS12184501B2Topology partition detection
Publication Date: 2024.12.31 ARISTA NETWORKS INC
  • US12184501B2 patent drawing
  • US12184501B2 patent drawing
  • US12184501B2 patent drawing

AI summary

Techniques described herein relate to a method for topology partition detection. Network devices within a network topology often share information to achieve desired network functionality. However, when a network topology becomes partitioned such that not all network devices are directly or indirectly connected to the other network devices, the information sharing may fail. Techniques described herein detect such network topology partitioning by analyzing information that represents the network topology, and the connections therein (e.g., a set of paths).