HIGHLY PROBABLE IDENTIFICATION OF RELATED MESSAGES USING SPARSE HASH FUNCTION SETS

HIGHLY PROBABLE IDENTIFICATION OF RELATED MESSAGES USING SPARSE HASH FUNCTION SETS

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 relat...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: BARRY, Charles F, Saha, Sumanta
Format: Patent
Sprache:eng
Schlagworte:
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
WIRELESS COMMUNICATIONS NETWORKS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator BARRY, Charles F
Saha, Sumanta
description 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.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2021399959A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2021399959A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2021399959A13</originalsourceid><addsrcrecordid>eNqNyr0KwjAQAOAuDqK-w4GzYFscMl7Tyw_EpOSSoVMpEifRQn1_BPEBnL7l21bRWG3cCEMMHXaOwPbkk1VWYrLBQ1AQyWGiHq7EjJoYMluvgQeMTGCQDajs5bczJd5Xm_v8WMvh5646KkrSnMrymsq6zLfyLO8pc3Nu6lYIcRFYt_-tD5PeMLA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>HIGHLY PROBABLE IDENTIFICATION OF RELATED MESSAGES USING SPARSE HASH FUNCTION SETS</title><source>esp@cenet</source><creator>BARRY, Charles F ; Saha, Sumanta</creator><creatorcontrib>BARRY, Charles F ; Saha, Sumanta</creatorcontrib><description>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.</description><language>eng</language><subject>ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; WIRELESS COMMUNICATIONS NETWORKS</subject><creationdate>2021</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20211223&amp;DB=EPODOC&amp;CC=US&amp;NR=2021399959A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20211223&amp;DB=EPODOC&amp;CC=US&amp;NR=2021399959A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>BARRY, Charles F</creatorcontrib><creatorcontrib>Saha, Sumanta</creatorcontrib><title>HIGHLY PROBABLE IDENTIFICATION OF RELATED MESSAGES USING SPARSE HASH FUNCTION SETS</title><description>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.</description><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>WIRELESS COMMUNICATIONS NETWORKS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2021</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyr0KwjAQAOAuDqK-w4GzYFscMl7Tyw_EpOSSoVMpEifRQn1_BPEBnL7l21bRWG3cCEMMHXaOwPbkk1VWYrLBQ1AQyWGiHq7EjJoYMluvgQeMTGCQDajs5bczJd5Xm_v8WMvh5646KkrSnMrymsq6zLfyLO8pc3Nu6lYIcRFYt_-tD5PeMLA</recordid><startdate>20211223</startdate><enddate>20211223</enddate><creator>BARRY, Charles F</creator><creator>Saha, Sumanta</creator><scope>EVB</scope></search><sort><creationdate>20211223</creationdate><title>HIGHLY PROBABLE IDENTIFICATION OF RELATED MESSAGES USING SPARSE HASH FUNCTION SETS</title><author>BARRY, Charles F ; Saha, Sumanta</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2021399959A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2021</creationdate><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>WIRELESS COMMUNICATIONS NETWORKS</topic><toplevel>online_resources</toplevel><creatorcontrib>BARRY, Charles F</creatorcontrib><creatorcontrib>Saha, Sumanta</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>BARRY, Charles F</au><au>Saha, Sumanta</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>HIGHLY PROBABLE IDENTIFICATION OF RELATED MESSAGES USING SPARSE HASH FUNCTION SETS</title><date>2021-12-23</date><risdate>2021</risdate><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.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2021399959A1
source esp@cenet
subjects ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
WIRELESS COMMUNICATIONS NETWORKS
title HIGHLY PROBABLE IDENTIFICATION OF RELATED MESSAGES USING SPARSE HASH FUNCTION SETS
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T04%3A26%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=BARRY,%20Charles%20F&rft.date=2021-12-23&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2021399959A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true