2006 · 26 citations · 32 references
ComputingComputer ScienceComputer SystemsDatabasesDistributed SystemsQueuing TheoryDistributed MonitoringLatency OptimizationQuery ProcessingStream ProcessingStreaming AlgorithmsSystem MonitoringBurst HandlingData Stream Management SystemsNetwork MonitoringQuery Performance MonitoringReal-time MonitoringStream Processing PerformanceStream Query ProcessingStreaming Databases
Many of the data sources used in stream query processing are known to exhibit bursty behavior. We focus here on passive network monitoring, an application in which the data rates typically exhibit a large peak-to-average ratio. Provisioning a stream query processor to handle peak rates in such a setting can be prohibitively expensive. In this paper, we propose to solve this problem by provisioning the query processor for typical data rates instead of much higher peak data rates. To enable this strategy, we present mechanisms and policies for managing the tradeoffs between the latency and accuracy of query results when bursts exceed the steady-state capacity of the query processor. We describe the current status of our implementation and present experimental results on a testbed network monitoring application to demonstrate the utility of our approach
32
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text
Wide area traffic: the failure of Poisson modeling
Vern Paxson, Sally Floyd · IEEE/ACM Transactions on Networking · 1995 · 3.7K citations · Full text
Random sampling with a reservoir
Jeffrey Scott Vitter · ACM Transactions on Mathematical Software · 1985 · 1.8K citations · Full text
Finding frequent items in data streams
Moses Charikar, Kevin Chen, Martı́n Farach-Colton · Theoretical Computer Science · 2003 · 1.3K citations