Work2008

Bound analysis of closed queueing networks with workload burstiness

Giuliano Casale · Ningfang Mi A · Evgenia Smirni A

39 citations0/0 files storedACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Interconnection Networks and Systems

Abstract

Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models as these features are responsible of significant performance degradations. However, existing models and approximations for networks of first-come first-served (FCFS) queues with general independent (GI) service are unable to predict performance of systems with temporal dependence in workloads.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 39 citations exist upstream.

References

1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers 1980Mean-Value Analysis of Closed Multichain Queuing Networks 1984Quantitative system performance: computer system analysis using queueing network models 1991Structured Stochastic Matrices of M/G/1 Type and Their Applications.1998Queueing Networks and Markov Chains 1993The Markov-modulated Poisson process (MMPP) cookbook 1975Parametric Analysis of Queuing Networks 1979A Queueing Network Analysis of Computer Communication Networks with Window Flow Control

Cited by

2009Model-Driven System Capacity Planning under Workload Burstiness 2008How to parameterize models with bursty workloads 2011WAM—The Weighted Average Method for Predicting the Performance of Systems with Bursts of Customer Sessions 2010Approximate analysis of load-dependent generally distributed queuing networks with low service time variability

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.