Analysis of Hypoexponential Computing Services for Big Data Processing

Abstract

The paper presents two analytical models to study the performance and availability of queueing systems with the hypo exponential service time and finite queue. The analytical results obtained are verified using discrete-event simulation. A few numerical examples for varying number of service stages, service rates and arrival rates are given. The results presented in the paper can be used for analysis of MapReduce and multi-stage Big Data processing.