Information security – Monitoring or scanning of software or data including attack...
Reexamination Certificate
2004-09-30
2010-02-23
Moazzami, Nasser G (Department: 2436)
Information security
Monitoring or scanning of software or data including attack...
Reexamination Certificate
active
07669241
ABSTRACT:
A distinct-count estimate is obtained in a guaranteed small footprint using a two level hash, distinct count sketch. A first hash fills the first-level hash buckets with an exponentially decreasing number of data-elements. These are then uniformly hashed to an array of second-level-hash tables, and have an associated total-element counter and bit-location counters. These counters are used to identify singletons and so provide a distinct-sample and a distinct-count. An estimate of the total distinct-count is obtained by dividing by the distinct-count by the probability of mapping a data-element to that bucket. An estimate of the total distinct-source frequencies of destination address can be found in a similar fashion. By further associating the distinct-count sketch with a list of singletons, a total singleton count and a heap containing the destination addresses ordered by their distinct-source frequencies, a tracking distinct-count sketch may be formed that has considerably improved query time.
REFERENCES:
patent: 5197002 (1993-03-01), Spencer
patent: 5852822 (1998-12-01), Srinivasan et al.
patent: 6138114 (2000-10-01), Horowitz
patent: 7464410 (2008-12-01), Halasz et al.
patent: 2003/0002436 (2003-01-01), Anderson et al.
patent: 2003/0018688 (2003-01-01), Sternin
S. Ganguly, et al. “Processing Data-Stream Join Aggregates Using Skimmed Sketches”, published online in Feb. 2004, and as pp. 569-586 in “Lecture Notes in Computer Science”, vol. 2992/2004, “Advanced in Database Technology—EDBT 2004: 9th International Conference on Extending Database Technology, Heraklion, Crete, Greece, Mar. 14-18, 2004”, edited by Elisa Bertino et al., published by Springer-Verlang, Heidelberg, German, 2004.
“Sketch-Base Multi-Query Processing Over Data Streams” by A. Dobra et al., in “lecture Notes in Compute Science”, vol. 2992/2004, “Advanced in Database Technology—EDBT 2004; 9th International Conference on Extending Database Technology, Heraklion, Crete, Greece, Mar. 14-18, 2004”, edited by Bertino et al., pp. 551-568, published by Springer-Verlag, Heidelberg 2004.
S. Ganguly et al entitled “Processing Set Expressions over Continuous Update Streams”, published in the Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, California, USA, Jun. 9-12, 2003 edited by A. Halevy et al. and published by Association for Computing Machinery (ACM), New York, NY 2003, ISBN 1-58113-634-X, pp. 265-276 (2003).
S. Ganguly et al, entitled “Tracking set-expression Cardinalities over Continuous Update Stream”, published in the VLDB Journal: The International Journal on Very Large Databases, vol. 13, No. 4, Dec. 2004 pp. 354-369, published by Springer-Verlag, Heidelberg, 2004.
Ganguly Sumit
Garofalakis Minos
Rastogi Rajeev
Sabnani Krishan
Alcatel-Lucent USA Inc.
Carlson & Gaskey & Olds
McNally Michael S
Moazzami Nasser G
LandOfFree
Streaming algorithms for robust, real-time detection of DDoS... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Streaming algorithms for robust, real-time detection of DDoS..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Streaming algorithms for robust, real-time detection of DDoS... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4166468