SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
MAP-AMVA: Approximate mean value analysis of bursty systems
10 references·0 citing·28 second hop
MAP-AMVA: Approximate mean value analysis of bursty systems (2009)MAP-AMVA: Approximate mean value analysis…Model-Driven System Capacity Planning under Workload Burstiness (2009)Model-Driven System Capacity …KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes (2008)KPC-Toolbox: Simple Yet Effec…How to parameterize models with bursty workloads (2008)How to parameterize models wi…Bound analysis of closed queueing networks with workload burstiness (2008)Bound analysis of closed queu…Performance impacts of autocorrelated flows in multi-tiered systems (2007)Performance impacts of autoco…Queueing Networks and Markov Chains (2006)Queueing Networks and Markov …AMVA techniques for high service time variability (2000)AMVA techniques for high serv…Departure processes from MAP/PH/1 queues (1999)Departure processes from MAP/…Queueing Networks and Markov Chains (1998)Queueing Networks and Markov …Bound hierarchies for multiple-class queuing networks (1986)Bound hierarchies for multipl…The Single Server Queue (1983)Matrix-Geometric Solutions to Stochastic Models (1984)New results on the single server queue with a batch markovian arrival process (1991)Models of the departure process of a BMAP/MAP/1 queue (2005)Mean-Value Analysis of Closed Multichain Queuing Networks (1980)Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks (1981)Statistics for Long-Memory Processes. (1996)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Quantitative system performance: computer system analysis using queueing network models (1984)WAM—The Weighted Average Method for Predicting the Performance of Systems with Bursts of Customer Sessions (2011)Queueing Systems. Volume 1: Theory (1975)Theory, Volume 1, Queueing Systems (1975)Bound analysis of closed queueing networks with workload burstiness (2008)A Proof for the Queuing Formula: L = λ W (1961)A perspective on queueing models of computer performance (1989)Product Form Queueing Networks (2000)A unifying framework for the approximate solution of closed multiclass queuing networks (2002)Structured Stochastic Matrices of M/G/1 Type and Their Applications. (1991)A minimal representation of Markov arrival processes and a moments matching method (2007)A Heuristic Approach for Fitting MAPs to Moments and Joint Moments (2009)Cluster-based fitting of phase-type distributions to empirical data (2012)Statistics for Long-Memory Processes. (1996)Dynamic power management based on continuous-time Markov decision processes (2003)Operations Research and Management Science Handbook (2010)Continuous approximation of collective system behaviour: A tutorial (2013)Introduction to Queuing Theory (2008)LSTM networks for data-aware remaining time prediction of business process instances (2017)Time and activity sequence prediction of business process instances (2018)
this work references cited by second hop

References

  • 1998Queueing Networks and Markov Chains938 cited
  • 2006Queueing Networks and Markov Chains932 cited
  • 2007Performance impacts of autocorrelated flows in multi-tiered systems72 cited
  • 2008KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes64 cited
  • 1986Bound hierarchies for multiple-class queuing networks50 cited
  • 2008Bound analysis of closed queueing networks with workload burstiness39 cited
  • 2009Model-Driven System Capacity Planning under Workload Burstiness37 cited
  • 2008How to parameterize models with bursty workloads32 cited
  • 2000AMVA techniques for high service time variability23 cited
  • 1999Departure processes from MAP/PH/1 queues13 cited

Cited by

No citing works inside the corpus for this window.

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work