Loopback Label Stack for Network Failure Differentiation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current Bidirectional Forwarding Detection (BFD) protocols struggle to differentiate between node failures and link failures in communications networks, leading to unnecessary bypassing of operational nodes and increased operational complexity, especially in multi-hop environments.

Innovation Solution

The implementation of loopback packets with a path list or label stack that defines a path looping back to the originating node, allowing the Point of Local Repair (PLR) node to determine if a failure is a node failure or a link failure by transmitting and analyzing the return of these packets through the network.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If BFD protocol is used to detect faults between nodes, then fault detection capability is improved, but the ability to differentiate between node failure and link failure deteriorates

Engineering Contradiction:
Improvefault detection capabilityVSAvoidfailure type differentiation
Core Design Contradiction:
ReliabilityVSMeasurement precision

Solution Approach 1:

The patent segments the fault detection process into multiple independent probe packets, each testing a specific path or aspect of the network connection. By sending multiple probe packets with different characteristics (e.g., different paths, different formats), the system can analyze which packets succeed and which fail to determine whether the failure is at the node level or link level, thereby achieving precise failure differentiation while maintaining reliable detection.

Inventive Principle:
Principle #1Segmentation

2Reliability

If protection paths are arranged to avoid a node assumed to have failed, then network protection is improved, but traffic loss increases when the node is actually operational

Engineering Contradiction:
Improvenetwork protectionVSAvoidtraffic loss
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The patent implements a feedback mechanism where the results of probe packet transmissions are analyzed to determine the actual status of nodes and links. This feedback information is used to dynamically adjust protection path selection, ensuring that traffic is only rerouted when truly necessary. By continuously monitoring probe packet success/failure patterns, the system avoids unnecessary protection path activation and minimizes traffic loss while maintaining network protection when actually needed.

Inventive Principle:
Principle #23Feedback

3Reliability

If multi-hop BFD or Seamless BFD is implemented to detect node operability, then detection scope is improved, but operational complexity increases

Engineering Contradiction:
Improvenode operability detectionVSAvoidconfiguring process complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent enables the PLR device to automatically perform failure type differentiation using its own resources and capabilities. The PLR sends probe packets, analyzes the results, and determines whether failures are at the node or link level without requiring complex external assistance or manual configuration. This self-service approach extends detection scope to multi-hop scenarios while keeping operational complexity manageable by leveraging existing BFD infrastructure and automatic analysis algorithms.

Inventive Principle:
Principle #25Self-service

Data Source

PatentEP4199465A1Creating a packet with a loopback label stack to detect network link/node failures
Publication Date: 2023.06.21 CIENA CORP
  • EP4199465A1 patent drawingFigure 1~2
  • EP4199465A1 patent drawingFigure 3A~3B
  • EP4199465A1 patent drawingFigure 4A~4C

AI summary

Systems and methods for creating loopback packets for transmission through a section of a network (10) for the purpose of testing the operability of links and nodes in this section of the network (10) are provided. A method (60), according to one implementation, includes a step of obtaining (62) information, by a Network Element (NE), about the topology of the network related to at least the nodes in direct communication with a peer node. The method also includes a step of generating (64) one or more loopback packets, where each loopback packet includes at least a header having a path list including one or more nodes of the plurality of nodes in the network. Each path list defines an order of nodes through which the respective loopback packet is to be transmitted.