Binary Search Hop Count Determination

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Traditional methods for determining hop count between network devices are time-consuming and generate excessive network traffic, with traceroute operations being inefficient and netmask operations providing inaccurate results.

Innovation Solution

A system and method utilizing a binary search to determine hop count by sending packets with varying hop count thresholds from a source device to a destination device, reducing the number of packets needed to accurately identify the hop count through iterative bisection of the hop count range.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traceroute operations are used to determine hop count, then the hop count can be determined, but the process is time consuming and generates significant network traffic

Engineering Contradiction:

Improvehop count determinationVSAvoidtime consuming

Core Design Contradiction:

Measurement precisionVSLoss of time

Solution Approach 1:

The patent changes the parameter of hop count threshold from sequential incrementing to binary search values. By setting thresholds at midpoints of ranges (e.g., 64, 32, 16, 8, 4, 2, 1) rather than sequential values (1, 2, 3, 4, 5, 6, 7), the system reduces the number of packets needed to determine hop count from linear to logarithmic complexity, significantly reducing time and network traffic while maintaining accurate measurement.

Inventive Principle:

Principle #35Parameter changes

2Measurement precision

If traceroute operations are used to determine hop count, then the hop count can be determined, but significant network traffic is generated

Engineering Contradiction:

Improvehop count determinationVSAvoidnetwork traffic

Core Design Contradiction:

Measurement precisionVSQuantity of substance

Solution Approach 1:

The patent changes the parameter of hop count threshold from sequential incrementing to binary search values. By setting thresholds at midpoints of ranges (e.g., 64, 32, 16, 8, 4, 2, 1) rather than sequential values (1, 2, 3, 4, 5, 6, 7), the system reduces the number of packets needed to determine hop count from linear to logarithmic complexity, significantly reducing network traffic while maintaining accurate measurement.

Inventive Principle:

Principle #35Parameter changes

3Loss of time

If netmask operations are used to determine hop count, then the process is faster, but inaccurate determinations are provided

Engineering Contradiction:

Improveprocessing speedVSAvoidhop count accuracy

Core Design Contradiction:

Loss of timeVSMeasurement precision

Solution Approach 1:

The patent implements feedback by sending packets with different hop count thresholds and analyzing the responses (time-to-live expired messages vs. successful deliveries). This feedback mechanism allows the system to iteratively narrow down the hop count range through binary search, achieving both speed and accuracy by adjusting the search strategy based on actual network responses rather than relying on inaccurate netmask calculations.

Inventive Principle:

Principle #23Feedback

Data Source

PatentUS8411684B1System, method, and computer program product for determining a hop count between network devices utilizing a binary search

Publication Date: 2013.04.02 MAGENTA SECURITY HOLDINGS LLC

AI summary

A system, method, and computer program product are provided for determining a hop count between network devices utilizing a binary search. In use, a hop count range is identified based on a maximum hop count value. Furthermore, a plurality of packets are sent from a source device to a destination device for determining a hop count between the source device and the destination device, each of the packets having a different hop count threshold configured based on a binary search applied to the hop count range.