Invention Grant
- Patent Title: Highly probable identification of related messages using sparse hash function sets
-
Application No.: US16376429Application Date: 2019-04-05
-
Publication No.: US11115297B2Publication Date: 2021-09-07
- Inventor: Charles F. Barry , Sumanta Saha
- Applicant: LUMINOUS CYBER CORPORATION
- Applicant Address: US CA San Jose
- Assignee: LUMINOUS CYBER CORPORATION
- Current Assignee: LUMINOUS CYBER CORPORATION
- Current Assignee Address: US CA San Jose
- Agency: Kramer Amado PC
- Main IPC: G06F15/173
- IPC: G06F15/173 ; H04L12/26 ; H04L12/24 ; H04L12/743 ; H04W40/04 ; H04L12/58

Abstract:
Methods, systems, and apparatus for network monitoring and analytics are disclosed. The methods, systems, and apparatus for network monitoring and analytics perform highly probable identification of related messages using one or more sparse hash function sets. Highly probable identification of related messages enables a network monitoring and analytics system to trace the trajectory of a message traversing the network and measure the delay for the message between observation points. The sparse hash function value, or identity, enables a network monitoring and analytics system to identify the transit path, transit time, entry point, exit point, and/or other information about individual packets and to identify bottlenecks, broken paths, lost data, and other network analytics by aggregating individual message data.
Public/Granted literature
- US20190238430A1 HIGHLY PROBABLE IDENTIFICATION OF RELATED MESSAGES USING SPARSE HASH FUNCTION SETS Public/Granted day:2019-08-01
Information query