Global Attraction of ODE-based Mean Field Models with Hyperexponential Job Sizes
- 19 June 2019
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 3 (2), 1-23
- https://doi.org/10.1145/3341617.3326137
Abstract
Mean field modeling is a popular approach to assess the performance of large scale computer systems. The evolution of many mean field models is characterized by a set of ordinary differential equations that have a unique fixed point. In order to prove that this unique fixed point corresponds to the limit of the stationary measures of the finite systems, the unique fixed point must be a global attractor. While global attraction was established for various systems in case of exponential job sizes, it is often unclear whether these proof techniques can be generalized to non-exponential job sizes. In this paper we show how simple monotonicity arguments can be used to prove global attraction for a broad class of ordinary differential equations that capture the evolution of mean field models with hyperexponential job sizes. This class includes both existing as well as previously unstudied load balancing schemes and can be used for systems with either finite or infinite buffers. The main novelty of the approach exists in using a Coxian representation for the hyperexponential job sizes and a partial order that is stronger than the componentwise partial order used in the exponential case.Keywords
Funding Information
- FWO (G033119N)
This publication has 29 references indexed in Scilit:
- Load balancing via random local search in closed and open systemsACM SIGMETRICS Performance Evaluation Review, 2010
- A mean field model of work stealing in large-scale systemsACM SIGMETRICS Performance Evaluation Review, 2010
- Stochastic analysis of file-swarming systemsPerformance Evaluation, 2007
- Closed form solutions for mapping general distributions to quasi-minimal PH distributionsPerformance Evaluation, 2006
- Coupon replication systemsACM SIGMETRICS Performance Evaluation Review, 2005
- An EM-based technique for approximating long-tailed data sets with PH distributionsPerformance Evaluation, 2004
- Fitting world-wide web request traces with the EM-algorithmPerformance Evaluation, 2003
- Fast Jackson networksThe Annals of Applied Probability, 1999
- Fitting mixtures of exponentials to long-tail distributions to analyze network performance modelsPerformance Evaluation, 1998
- On the canonical representation of homogeneous markov processes modelling failure - time distributionsMicroelectronics Reliability, 1982