Approximating Multiple Arrival Streams by Using Aggregation
From MaRDI portal
Recommendations
- On Estimating Path Aggregates over Streaming Graphs
- A general method for estimating correlated aggregates over a data stream
- Algorithms and estimators for summarization of unaggregated data streams
- Tight bounds for delay-sensitive aggregation
- Tight bounds for delay-sensitive aggregation
- Lower bounds for multi-pass processing of multiple data streams
Cites work
- An Analytic Approach to a General Class of G/G/s Queueing Systems
- Applied Probability and Queues
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues
- Constructing a correlated sequence of matrix exponentials with invariant first-order properties
- scientific article; zbMATH DE number 805121 (Why is no real title available?)
- Marked point processes as limits of Markovian arrival streams
- Performance analysis of multi-server tandem queues with finite buffers and blocking
Cited in
(9)- Algorithms and estimators for summarization of unaggregated data streams
- Competitive Analysis of Aggregate Max in Windowed Streaming
- Approximation of Some Markov-Modulated Poisson Processes
- ON COMPARISON OF ACCURACY OF APPROXIMATIONS IN THE CROSS AGGREGATION METHOD
- Markov meco: a simple markovian model for approximating nonrenewal arrival processes
- scientific article; zbMATH DE number 1559156 (Why is no real title available?)
- The superposition of Markovian arrival processes: moments and the minimal Laplace transform
- A general method for estimating correlated aggregates over a data stream
- Approximating a class of superposition processes
This page was built for publication: Approximating Multiple Arrival Streams by Using Aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446501)