Data Routing Fast Fail Hunting Anchor Node

Solution Overview

Problem

Current data routing methods in networks require multiple retries to find a successful route, leading to increased elapsed time and processing effort due to the lack of efficient failure handling and route selection strategies.

Innovation Solution

Implementing a 'fast fail hunting' mechanism that uses an operator-configurable 'anchor' node to skip 'similar' routes that have failed, allowing for quicker selection of alternative routes by representing routes as a tree structure and omitting child nodes that share common characteristics with failed routes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If normal Hunting method is used to try different routes one after another, then all possible routes are eventually tried to find a successful route, but the elapsed time and processing effort increase significantly

Engineering Contradiction:

Improveroute selection reliabilityVSAvoidelapsed time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-organizing routes into groups based on common characteristics (such as shared network elements or path segments) before routing decisions are needed. When a route fails, the system has already prepared the grouped structure, allowing it to quickly identify and skip other routes in the same group that would likely fail for the same reason, without having to analyze each route individually during the routing process.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent segments the routing table by grouping routes that share common characteristics into distinct groups. This segmentation allows the system to treat entire groups as units during route selection - when one route in a group fails, the system can skip all other routes in that group at once, rather than testing each route individually. This dramatically reduces the number of attempts needed to find a successful route.

Inventive Principle:

Principle #1Segmentation

2Reliability

If normal Hunting method is used to try different routes one after another, then all possible routes are eventually tried to find a successful route, but the processing effort increases significantly

Engineering Contradiction:

Improveroute selection reliabilityVSAvoidprocessing effort

Core Design Contradiction:

ReliabilityVSProductivity

Solution Approach 1:

The patent applies preliminary action by pre-organizing routes into groups based on common characteristics (such as shared network elements or path segments) before routing decisions are needed. When a route fails, the system has already prepared the grouped structure, allowing it to quickly identify and skip other routes in the same group that would likely fail for the same reason, without having to analyze each route individually during the routing process.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent segments the routing table by grouping routes that share common characteristics into distinct groups. This segmentation allows the system to treat entire groups as units during route selection - when one route in a group fails, the system can skip all other routes in that group at once, rather than testing each route individually. This dramatically reduces the number of attempts needed to find a successful route.

Inventive Principle:

Principle #1Segmentation

3Adaptability or versatility

If all routes are considered for each routing attempt, then no route is prematurely excluded, but the time to find a successful route increases

Engineering Contradiction:

Improveroute selection flexibilityVSAvoidtime to find successful route

Core Design Contradiction:

Adaptability or versatilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-organizing routes into groups based on common characteristics (such as shared network elements or path segments) before routing decisions are needed. When a route fails, the system has already prepared the grouped structure, allowing it to quickly identify and skip other routes in the same group that would likely fail for the same reason, without having to analyze each route individually during the routing process.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent segments the routing table by grouping routes that share common characteristics into distinct groups. This segmentation allows the system to treat entire groups as units during route selection - when one route in a group fails, the system can skip all other routes in that group at once, rather than testing each route individually. This dramatically reduces the number of attempts needed to find a successful route.

Inventive Principle:

Principle #1Segmentation

Data Source

PatentUS10057160B2Data routing

Publication Date: 2018.08.21 MICROSOFT TECHNOLOGY LICENSING LLC

AI summary

Measures for use in routing data in a data communications network. A request to route data to a given destination in the network is received. A route to the given destination is first selected from a plurality of routes to the given destination stored in a routing table. Routing the data to the given destination using the first selected route is attempted. In response to receipt of an indication that routing the data to the given destination via the first route failed, a second, different route to the given destination is second selected from the plurality of routes to the given destination stored in the routing table. The second selecting includes omitting, for the purposes of the second selection, at least one route to the given destination from the plurality of routes to the given destination stored in the routing table.