Correlating packets
US7729256B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 13, 2005 |
| Grant date | Jun 1, 2010 |
| Priority date | — |
| Expiry date | Oct 25, 2028 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2012/565
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A system/method searches a traffic stream for a sequence of “matching” packets that exhibit a high degree of correlation or similarity to a sequence of “reference” packets. The correlation between matching and reference packets is based on a degree of correspondence between individual packets, as well as the sequence-order of the corresponding packets. A variation of the Needleman-Wunsch algorithm is preferably used to select corresponding packets in the traffic stream that provide a sequence-order that best matches the sequence-order of the reference packets, based on a measure of the correspondence for each match, and a penalty associated with each non-match. The algorithm is further modified to reduce the required search-space for finding corresponding packets in the traffic stream.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.