Patent US5832235A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5832235A Expired / Lapsed US ⏱️ 0.0 years remaining

System and method for pattern matching using checksums

Assignee: Agilent Technologies Inc
•
Filing: 1997-03-26
•
Granted: 1998-11-03
•
Expires: 2017-03-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for detecting that a vector matches a pattern compares a checksum for the vector to a precomputed checksum that acts as a signature for the pattern. Other systems and methods are disclosed.

Inventors

  • 👤 John Wilkes

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 20:48
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1004

Claims Analysis

Total Claims: 32
Claim 1
Independent Claim 96 words
A computer readable storage media comprising instructions for controlling the operation of a computer system, including instructions for: determining a checksum for a vector to be transmitted; comparing the checksum with the stored checksums; if the checksum matches one of the stored checksums, determining if the vector matches the pattern corresponding to the checksum, and if the vector matches the pattern, transmitting an indication of the match; receiving data packets on the data link; and analyzing a received data packet to determine if the received packet is an indication that a vector matched a known pattern.
Claim 2
Dependent Claim 96 words
A computer readable storage media comprising instructions for controlling the operation of a computer system, including instructions for: determining a checksum for a vector to be transmitted; comparing the checksum with the stored checksums; if the checksum matches one of the stored checksums, determining if the vector matches the pattern corresponding to the checksum, and if the vector matches the pattern, transmitting an indication of the match; receiving data packets on the data link; and analyzing a received data packet to determine if the received packet is an indication that a vector matched a known pattern.
Claim 3
Dependent Claim 44 words
The computer readable storage media of claim 1, further including instructions for: while computing a checksum comparing each word in the vector to a particular value; and if each word in the vector matches the particular value, transmitting only an indication of such matching.
Claim 4
Dependent Claim 28 words
The computer readable storage media of claim 2, further comprising instructions for discarding a vector matching the pattern and storing an indication that the vector matches the pattern.
Claim 5
Dependent Claim 26 words
The computer readable storage media of claim 3, further comprising instructions for detecting an indication that a vector matches the pattern and for creating the vector.
Claim 6
Dependent Claim 14 words
The computer readable storage media of claim 2, wherein the particular value is zero.
Claim 7
Dependent Claim 23 words
The computer readable storage media of claim 2, wherein the particular value is the value stored in the first word of the vector.
Claim 8
Dependent Claim 26 words
The computer readable storage media of claim 1, wherein the instructions for determining a checksum, comprises: reading the checksum from a field in a communications message.
Claim 9
Independent Claim 61 words
A method of detecting a particular data pattern in a vector in a computer system, comprising: storing a value corresponding to a checksum for the data pattern; obtaining a checksum for a vector; comparing the checksum and the stored value; and if the checksum is not equal to the stored value, indicating that the vector does not match the data pattern.
Claim 10
Independent Claim 61 words
A method of detecting a particular data pattern in a vector in a computer system, comprising: storing a value corresponding to a checksum for the data pattern; obtaining a checksum for a vector; comparing the checksum and the stored value; and if the checksum is not equal to the stored value, indicating that the vector does not match the data pattern.
Claim 11
Dependent Claim 19 words
The method of claim 8, wherein the step of obtaining a checksum comprises: receiving the checksum from another device.
Claim 12
Dependent Claim 23 words
The method of claim 9, wherein the step of obtaining a checksum comprises: receiving the checksum as a field in a communications message.
Claim 13
Dependent Claim 27 words
The method of claim 10, wherein the communications message is a message selected from the set including a TCP message, a UDP message, and an AAL message.
Claim 14
Dependent Claim 51 words
The method of claim 8, further comprising: if the checksum is equal to the stored value, comparing the vector to the particular data pattern; and if the vector matches the data pattern, indicating that the vector matches the data pattern; otherwise, indicating that the vector does not match the data pattern.
Claim 15
Dependent Claim 30 words
The method of claim 12, wherein the particular data pattern is a vector wherein all words have the same value and wherein that value is stored in a storage location.
Claim 16
Dependent Claim 19 words
The method of claim 13, wherein the value equals a value stored in the first word in the vector.
Claim 17
Dependent Claim 13 words
The method of claim 8, wherein the data pattern is a zero-filled page.
Claim 18
Dependent Claim 16 words
The method of claim 8, wherein the step of obtaining a checksum comprises: computing the checksum.
Claim 19
Independent Claim 98 words
A method of detecting zero-filled pages in a computer system, comprising: storing a value corresponding to a checksum for a zero-filled page; obtaining a checksum for a page; comparing the checksum to the value; if the checksum is not the same as the value, indicating that the page is not a zero-filled page; and if the checksum is the same as the value: scan the page for non-zero data values; if all the data values in the page are zero, indicating that the page is a zero-filled page; otherwise, indicating that the page is not a zero-filled page.
Claim 20
Independent Claim 98 words
A method of detecting zero-filled pages in a computer system, comprising: storing a value corresponding to a checksum for a zero-filled page; obtaining a checksum for a page; comparing the checksum to the value; if the checksum is not the same as the value, indicating that the page is not a zero-filled page; and if the checksum is the same as the value: scan the page for non-zero data values; if all the data values in the page are zero, indicating that the page is a zero-filled page; otherwise, indicating that the page is not a zero-filled page.
Claim 21
Dependent Claim 24 words
The method of claim 17, wherein the step of obtaining a checksum further comprises: retrieving the checksum from a field in a communications message.
Claim 22
Dependent Claim 25 words
The method of claim 18, wherein the communications message is selected from a set including a TCP message, a UDP message, and an AAL message.
Claim 23
Dependent Claim 17 words
The method of claim 17, wherein the step of obtaining a checksum further comprises: computing the checksum.
Claim 24
Independent Claim 112 words
A method of communicating packets of data in a network, wherein both recipients and transmitters store a checksum corresponding to at least one pattern, and wherein a data link connect transmitters to receivers, comprising: determining a checksum for a vector to be transmitted; comparing the checksum with the stored checksums; if the checksum matches one of the stored checksums, determining if the vector matches the pattern corresponding to the checksum, and if the vector matches the pattern, transmitting an indication of the match; receiving data packets on the data link; and analyzing a received data packet to determine if the received packet is an indication that a vector matched a known pattern.
Claim 25
Independent Claim 112 words
A method of communicating packets of data in a network, wherein both recipients and transmitters store a checksum corresponding to at least one pattern, and wherein a data link connect transmitters to receivers, comprising: determining a checksum for a vector to be transmitted; comparing the checksum with the stored checksums; if the checksum matches one of the stored checksums, determining if the vector matches the pattern corresponding to the checksum, and if the vector matches the pattern, transmitting an indication of the match; receiving data packets on the data link; and analyzing a received data packet to determine if the received packet is an indication that a vector matched a known pattern.
Claim 26
Dependent Claim 22 words
The method of claim 21 further comprising: upon receiving an indication that a vector matched a known pattern, creating the corresponding vector.
Claim 27
Independent Claim 79 words
A method of detecting a particular pattern vector in a computer system, comprising: while computing a checksum for a vector, comparing each word in the vector to a particular value; if all words in the vector match the particular value, indicating that the vector matches a pattern having all words equal to the particular value; and if any word in the vector fails to match the particular value, indicating that the vector is not a match for the pattern.
Claim 28
Independent Claim 79 words
A method of detecting a particular pattern vector in a computer system, comprising: while computing a checksum for a vector, comparing each word in the vector to a particular value; if all words in the vector match the particular value, indicating that the vector matches a pattern having all words equal to the particular value; and if any word in the vector fails to match the particular value, indicating that the vector is not a match for the pattern.
Claim 29
Dependent Claim 11 words
The method of claim 23, wherein the particular value is zero.
Claim 30
Dependent Claim 20 words
The method of claim 23, wherein the particular value is a value contained in the first word in the vector.
Claim 31
Dependent Claim 33 words
The method of claim 23, further comprising: if all words in the vector match the particular value, transmitting only the indication of the pattern match, and not transmitting the contents of the vector.
Claim 32
Dependent Claim 33 words
The method of claim 23, further comprising: if all words in the vector match the particular value, storing only an indication of the pattern match and not storing the contents of the vector.

References Cited (Backward Citations)

US5150368A Cited
US5293379A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-11-02 2002-05-04 2002-11-03 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-11-02 2006-05-04 2006-11-03 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-11-02 2010-05-04 2010-11-03 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag