Latency Analysis Packet for Network Monitoring
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for measuring network latency in packet switched networks require significant bandwidth, memory, and processing time, as they involve sending packets round trip between each spoke node and a hub node and querying each node for delay information, which is inefficient.
Innovation Solution
A method where a latency-analysis packet is sent to multiple nodes along a predetermined path, receiving timestamps at each node, and returning to a management crossover server to calculate delays between nodes, reducing the need for extensive bandwidth and processing by aggregating data through timestamp subtraction and generating Service Level Agreement graphs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a packet is sent round trip between each spoke node and a hub node to measure latency, then latency measurement accuracy is improved, but bandwidth consumption and processing time increase significantly
Solution Approach 1:
The patent combines multiple latency measurements into a single packet traversal. Instead of sending separate round-trip packets between each spoke node and hub node, the invention merges measurements by having a single packet traverse multiple nodes sequentially, collecting latency data from each node in one pass through the network.
Solution Approach 2:
The patent creates a universal measurement packet that can measure latency across multiple nodes simultaneously. This single packet structure serves multiple measurement functions by visiting different spoke nodes and the hub node in sequence, eliminating the need for separate dedicated measurement packets for each node pair.
2Loss of information
If each node stores delay information in its MIB database, then complete latency data is captured, but memory requirements and data aggregation complexity increase
Solution Approach 1:
The patent extracts latency measurement data directly from the measurement packet itself rather than storing it in separate node databases. The packet carries its own timestamp records, allowing the measurement data to be self-contained and eliminating the need for complex MIB database storage and retrieval operations at each node.
Solution Approach 2:
The patent uses timestamp copying where each node copies its reception and transmission timestamps directly into the measurement packet. This creates a self-contained record of latency data that travels with the packet, eliminating the need for separate database storage and reducing memory requirements at each node.
3Reliability
If a server queries each node to aggregate latency data, then comprehensive network monitoring is achieved, but processing time and bandwidth consumption increase
Solution Approach 1:
The patent inverts the traditional data collection approach. Instead of having the server query each node for latency data, the measurement packet itself carries all the necessary latency information as it traverses the network. The server receives the complete measurement data in a single packet arrival, eliminating the need for multiple queries.
Solution Approach 2:
The patent performs preliminary data collection by having each node along the packet path record its timestamps directly into the measurement packet during normal packet traversal. This preliminary action of collecting data as the packet passes through each node eliminates the need for subsequent query operations, as all data is already aggregated in the packet when it returns to the server.
Data Source
AI summary
A packet and a method for analyzing network latency are disclosed. The disclosed systems and methods measure the latency between nodes in a network and do so while using less bandwidth and processing than traditional methods by using a packet to traverse a network and collect timestamps at various nodes so that the delay in transit time between nodes can be calculated when the packet returns to a server.