Sciweavers

105 search results - page 14 / 21
» Data streaming algorithms for estimating entropy of network ...
Sort
View
PODC
2006
ACM
14 years 1 months ago
Sketching asynchronous streams over a sliding window
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
Srikanta Tirthapura, Bojian Xu, Costas Busch
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 7 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
TMA
2010
Springer
150views Management» more  TMA 2010»
13 years 5 months ago
Validation and Improvement of the Lossy Difference Aggregator to Measure Packet Delays
One-way packet delay is an important network performance metric. Recently, a new data structure called Lossy Difference Aggregator (LDA) has been proposed to estimate this metric m...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Jose...
TON
2008
135views more  TON 2008»
13 years 7 months ago
Measurement-based admission control at edge routers
Abstract-- It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality-of-service (QoS)...
Seung Yeob Nam, Sunggon Kim, Dan Keun Sung
PVLDB
2008
116views more  PVLDB 2008»
13 years 7 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan