US6633835B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Prioritized data capture, classification and filtering in a network monitoring environment
Assignee: Network General Technology Corp
•
Filing: 2002-01-11
•
Granted: 2003-10-14
•
Expires: 2022-01-11
Abstract
Abstract A system, method and computer program product are provided for adaptive priority data filtering. Data is collected from a network segment and classified into multiple flows. The flows are prioritized into high and low priority flows. High priority flows are stored in a high priority queue prior to processing, while low priority flows are stored in a low priority queue prior to processing. An amount of data in the high priority flows is monitored. Buffers from the low priority queue are reallocated to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold.</PTEXT>
Inventors
- 👤 Mike Moran
- 👤 Tauras Liubinskas
- 👤 Jack Goral
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 09:14
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/24; H04L47/2425; H04L47/2433; H04L47/2441; H04L47/2458; H04L47/29; H04L47/32; H04L47/326; H04L47/70; H04L47/74; H04L47/745; H04L47/76; H04L47/762; H04L49/00; H04L49/90
Claims Analysis
Total Claims: 26
Claim 1
Independent Claim
97 words
A method for priority data filtering, comprising: collecting data from a network segment; classifying the data into multiple flows; prioritizing the flows into high and low priority flows; storing high priority flows in a high priority queue prior to processing; storing low priority flows in a low priority queue prior to processing; monitoring an amount of data in the high priority flows; reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and randomly removing flows from the high priority queue.
Claim 2
Independent Claim
97 words
A method for priority data filtering, comprising: collecting data from a network segment; classifying the data into multiple flows; prioritizing the flows into high and low priority flows; storing high priority flows in a high priority queue prior to processing; storing low priority flows in a low priority queue prior to processing; monitoring an amount of data in the high priority flows; reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and randomly removing flows from the high priority queue.
Claim 3
Dependent Claim
37 words
The method as recited in claim 1 , further comprising reallocating buffers from the high priority queue to the low priority queue if the amount of data in the high priority flows is below a predetermined threshold.
Claim 4
Dependent Claim
22 words
The method as recited in claim 1 , further comprising selectively removing flows from the high priority queue based on predetermined criteria.
Claim 5
Dependent Claim
28 words
The method as recited in claim 1 , further comprising identifying a flow of data as being important, and forwarding additional data from the identified flow for processing.
Claim 6
Dependent Claim
23 words
The method as recited in claim 1 , wherein prioritizing the flows includes matching packets to a set of matching priority filter criteria.
Claim 7
Independent Claim
92 words
A method for priority data filtering, comprising: collecting data from a network segment; classifying the data into multiple flows; prioritizing the flows into high and low priority flows; storing high priority flows in a high priority queue prior to processing; storing low priority flows in a low priority queue prior to processing; monitoring an amount of data in the high priority flows; reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and declassifying inactive flows.
Claim 8
Independent Claim
92 words
A method for priority data filtering, comprising: collecting data from a network segment; classifying the data into multiple flows; prioritizing the flows into high and low priority flows; storing high priority flows in a high priority queue prior to processing; storing low priority flows in a low priority queue prior to processing; monitoring an amount of data in the high priority flows; reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and declassifying inactive flows.
Claim 9
Dependent Claim
127 words
A computer program product for priority data filtering, comprising: computer code for collecting data from a network segment; computer code for classifying the data into multiple flows; computer code for prioritizing the flows into high and low priority flows; computer code for storing high priority flows in a high priority queue prior to processing; computer code for storing low priority flows in a low priority queue prior to processing; computer code for monitoring an amount of data in the high priority flows; computer code for reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and computer code for randomly removing flows from the high priority queue based on predetermined criteria.
Claim 10
Dependent Claim
127 words
A computer program product for priority data filtering, comprising: computer code for collecting data from a network segment; computer code for classifying the data into multiple flows; computer code for prioritizing the flows into high and low priority flows; computer code for storing high priority flows in a high priority queue prior to processing; computer code for storing low priority flows in a low priority queue prior to processing; computer code for monitoring an amount of data in the high priority flows; computer code for reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and computer code for randomly removing flows from the high priority queue based on predetermined criteria.
Claim 11
Dependent Claim
118 words
A computer program product for priority data filtering, comprising: computer code for collecting data from a network segment; computer code for classifying the data into multiple flows; computer code for prioritizing the flows into high and low priority flows; computer code for storing high priority flows in a high priority queue prior to processing; computer code for storing low priority flows in a low priority queue prior to processing; computer code for monitoring an amount of data in the high priority flows; computer code for reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and computer code for declassifying inactive flows.
Claim 12
Dependent Claim
118 words
A computer program product for priority data filtering, comprising: computer code for collecting data from a network segment; computer code for classifying the data into multiple flows; computer code for prioritizing the flows into high and low priority flows; computer code for storing high priority flows in a high priority queue prior to processing; computer code for storing low priority flows in a low priority queue prior to processing; computer code for monitoring an amount of data in the high priority flows; computer code for reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and computer code for declassifying inactive flows.
Claim 13
Dependent Claim
39 words
The computer program product as recited in claim 8 , further comprising reallocating buffers from the high priority queue to the low priority queue if the amount of data in the high priority flows is below a predetermined threshold.
Claim 14
Dependent Claim
24 words
The computer program product as recited in claim 8 , further comprising selectively removing flows from the high priority queue based on predetermined criteria.
Claim 15
Dependent Claim
36 words
The computer program product as recited in claim 8 , further comprising identifying a flow of data as being important, and using the identification as criteria for forwarding additional data from the identified flow for processing.
Claim 16
Dependent Claim
25 words
The computer program product as recited in claim 8 , wherein prioritizing the flows includes matching packets to a set of matching priority filter criteria.
Claim 17
Independent Claim
122 words
A system for adaptive priority data filtering, comprising: (a) logic for collecting data from a network segment; (b) logic for classifying the data into multiple flows; (c) logic for prioritizing the flows into high and low priority flows; (d) logic for storing high priority flows in a high priority queue prior to processing; (e) logic for storing low priority flows in a low priority queue prior to processing; (f) logic for monitoring an amount of data in the high priority flows; and (g) logic for reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold (h) logic for randomly removing flows from the high priority queue.
Claim 18
Independent Claim
122 words
A system for adaptive priority data filtering, comprising: (a) logic for collecting data from a network segment; (b) logic for classifying the data into multiple flows; (c) logic for prioritizing the flows into high and low priority flows; (d) logic for storing high priority flows in a high priority queue prior to processing; (e) logic for storing low priority flows in a low priority queue prior to processing; (f) logic for monitoring an amount of data in the high priority flows; and (g) logic for reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold (h) logic for randomly removing flows from the high priority queue.
Claim 19
Independent Claim
116 words
A method for priority data filtering, comprising: allocating all buffers to a low priority queue; collecting data from a network segment; storing the collected data in the low priority queue; classifying the data into multiple flows; prioritizing the flows into high and low priority flows; storing high priority flows in a high priority queue prior to processing; storing low priority flows in the low priority queue prior to processing; monitoring an amount of data in the high priority flows; reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and processing data in both the high and low priority queues.
Claim 20
Independent Claim
116 words
A method for priority data filtering, comprising: allocating all buffers to a low priority queue; collecting data from a network segment; storing the collected data in the low priority queue; classifying the data into multiple flows; prioritizing the flows into high and low priority flows; storing high priority flows in a high priority queue prior to processing; storing low priority flows in the low priority queue prior to processing; monitoring an amount of data in the high priority flows; reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and processing data in both the high and low priority queues.
Claim 21
Dependent Claim
39 words
The method as recited in claim 14 , further comprising randomly relegating high priority flows from the high priority queue to the low priority queue if the amount of data in the high priority queue surpasses a predetermined threshold.
Claim 22
Dependent Claim
20 words
The method as recited in claim 15 , further comprising removing inactive high priority flows from the high priority queue.
Claim 23
Independent Claim
221 words
A method for adaptive priority data filtering, comprising: (a) allocating all buffers to a low priority queue; (b) collecting data from a network segment; (c) storing the collected data in the low priority queue; (d) classifying the data into multiple flows; (e) prioritizing the flows into high and low priority flows; (f) storing high priority flows in a high priority queue prior to processing; (g) storing low priority flows in the low priority queue prior to processing; (h) monitoring an amount of data in the high priority flows; (i) reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; (j) processing data in both the high and low priority queues; (k) randomly relegating high priority flows from the high priority queue to the low priority queue if the amount of data in the high priority queue surpasses a predetermined threshold; (l) removing inactive high priority flows from the high priority queue; (m) reallocating buffers from the high priority queue to the low priority queue if the amount of data in the high priority flows is below a predetermined threshold; and (n) identifying a flow of data as being important, and using the identification as criteria for forwarding additional data from the identified flow for processing.
Claim 24
Independent Claim
221 words
A method for adaptive priority data filtering, comprising: (a) allocating all buffers to a low priority queue; (b) collecting data from a network segment; (c) storing the collected data in the low priority queue; (d) classifying the data into multiple flows; (e) prioritizing the flows into high and low priority flows; (f) storing high priority flows in a high priority queue prior to processing; (g) storing low priority flows in the low priority queue prior to processing; (h) monitoring an amount of data in the high priority flows; (i) reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; (j) processing data in both the high and low priority queues; (k) randomly relegating high priority flows from the high priority queue to the low priority queue if the amount of data in the high priority queue surpasses a predetermined threshold; (l) removing inactive high priority flows from the high priority queue; (m) reallocating buffers from the high priority queue to the low priority queue if the amount of data in the high priority flows is below a predetermined threshold; and (n) identifying a flow of data as being important, and using the identification as criteria for forwarding additional data from the identified flow for processing.
Claim 25
Independent Claim
119 words
A method for adaptive priority data filtering, comprising: collecting data from a network segment; classifying the data into multiple flows; prioritizing the flows into high and low priority flows; storing high priority flows in a high priority queue prior to processing; storing low priority flows in a low priority queue prior to processing; monitoring an amount of data in the high priority flows; reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and randomly relegating high priority flows from the high priority queue to the low priority queue if the amount of data in the high priority queue surpasses a predetermined threshold.
Claim 26
Independent Claim
119 words
A method for adaptive priority data filtering, comprising: collecting data from a network segment; classifying the data into multiple flows; prioritizing the flows into high and low priority flows; storing high priority flows in a high priority queue prior to processing; storing low priority flows in a low priority queue prior to processing; monitoring an amount of data in the high priority flows; reallocating buffers from the low priority queue to the high priority queue if the amount of data in the high priority flows surpasses a predetermined threshold; and randomly relegating high priority flows from the high priority queue to the low priority queue if the amount of data in the high priority queue surpasses a predetermined threshold.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2006-10-13 | 2007-04-14 | 2007-10-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2010-10-13 | 2011-04-14 | 2011-10-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2014-10-13 | 2015-04-14 | 2015-10-14 | $7700.00 | Window Closed / Lapsed |