Shobha Venkataraman, Dawn Song, Phillip B. Gibbons +, Avrim Blum...  Home/Search
Context Related
| cmu.edu/~shobha/res...superspreaders.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~avrim/Papers/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: High-speed monitoring of Internet traffic is an important and challenging problem, with applications to realtime attack detection and mitigation, traffic engineering, etc. However, packet-level monitoring requires fast streaming algorithms that use very little memory and little communication among collaborating network monitoring points. (Update)
Cited by: More
Polymorphic Worm Detection Using Structural.. - Kruegel, Kirda.. (2005) (Correct)
A Robust System for Accurate Real-time Summaries of Internet.. - Keys, Moore, al. (2005) (Correct)
The Top Speed of Flash Worms - Stuart Staniford Nevis (2004) (Correct)
Active bibliography (related documents): More All
0.6: Automated Modeling and Nonlinear Axis Scaling - Leejay Wu (2005) (Correct)
0.4: Reverse Hashing for Sketch-based Change Detection.. - Schweller, Chen.. (2004) (Correct)
0.3: Reversible Sketches for Efficient and Accurate Change .. - Schweller, Gupta.. (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
Related documents from co-citation: More All
3: A Taxonomy of Computer Worms - Weaver, Paxson et al. - 2003
3: Internet Quarantine: Requirements for Containing SelfPropagating Code - Moore, Shannon et al. - 2003
3: distributed worm signature detection (context) - Kim, Karp et al. - 2004
BibTeX entry: (Update)
S. Venkataraman, D. Song, P. Gibbons, and A. Blum. New Streaming Algorithms for Fast Detection of Superspreaders. http://citeseer.ist.psu.edu/752049.html More
@misc{ venkataraman-new,
author = "S. Venkataraman and D. Song and P. Gibbons and A. Blum",
title = "New Streaming Algorithms for Fast Detection of Superspreaders",
text = "S. Venkataraman, D. Song, P. Gibbons, and A. Blum. New Streaming Algorithms
for Fast Detection of Superspreaders.",
url = "citeseer.ist.psu.edu/752049.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan - 1995
387 The space complexity of approximating the frequency moments - Alon, Matias et al. - 1999
181 Spacetime trade off hash coding with allowable error - time, in et al. - 1970
140 Snort - lightweight intrusion detection for networks (context) - Roesch - 1999
130 Models and issue in data stream systems (context) - Babcock, Babu et al. - 2002
111 New sampling-based summary statistics for improving approxim.. - Gibbons, Matias - 1998
83 New directions in traffic measurement and accounting - Estan, Varghese - 2002
67 Maintaining stream statistics over sliding windows - Datar, Gionis et al. - 2002
67 Approximate frequency counts over data streams - Manku, Motwani - 2002
48 Finding frequent items in data streams - Charikar, Chen et al. - 2002
35 Network applications of bloom filters: A survey - Broder, Mitzenmacher - 2002
31 Estimating simple functions on the union of data streams - Gibbons, Tirthapura - 2001
26 Frequency estimation of internet packet streams with limited.. (context) - Demaine, Lopez-Ortiz et al. - 2002
26 Probabilistic counting algorithms for data base applications (context) - Flajolet, Martin - 1985
25 A simple algorithm for finding frequent elements in streams .. - Karp, Shenker et al. - 2003
24 Size-estimation framework with applications to transitive cl.. (context) - Cohen - 1997
23 Fast portscan detection using sequential hypothesis testing - Jung, Paxson et al. - 2004
22 Very fast containment of scanning worms (context) - Weaver, Staniford et al. - 2004
18 Sketch-based change detection: methods (context) - Krishnamurthy, Sen et al. - 2003
18 Data streams: Algorithms and applications - Muthukrishnan - 2003
17 Estimating flow distributions from sampled flow statistics (context) - Duffield, Lund et al. - 2003
17 Towards estimation error guarantees for distinct values (context) - Charikar, Chaudhuri et al. - 2000
16 Automatically inferring patterns of resource consumption in .. - Estan, Savage et al. - 2003
13 Comparing data streams using hamming norms (context) - Cormode, Datar et al. - 2002
13 Bitmap algorithms for counting active flows on high speed li.. (context) - Estan, Varghese et al. - 2003
11 Distributed streams algorithms for sliding windows - Gibbons, Tirthapura - 2002
10 with an application to counting triangles in graphs (context) - Bar-Yossef, Kumar et al. - 2002
7 Identifying frequent items in sliding windows over online pa.. (context) - Golab, DeHaan et al. - 2003
7 Counting distinct elements in a data stream (context) - Bar-Yossef, Jayram et al. - 2002
4 What's new: Finding significant differences in network data .. - Cormode, Muthukrishnan - 2004
1 Space-code bloom filter for efficient traffic flow measureme.. - Kumar, Li et al. - 2004
1 Security and Privacy Magazine (context) - Moore, Paxson et al. - 2003
Documents on the same site (http://www.cs.cmu.edu/~avrim/Papers/pubs.html): More
Linear Approximation of Shortest Superstrings - Blum, Jiang, Li, Tromp.. (1991) (Correct)
Universal Portfolios With and Without Transaction Costs - Blum, Kalai (1997) (Correct)
A Constant-factor Approximation Algorithm for the k-MST Problem - Blum, Ravi, Vempala (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC