Data-intensive service system: Model and analysis

Cloud computing has been attracting more and more enterprises and researchers, and one goal of it is that computing is provided on demand as a service like water and electricity. Meanwhile, data-intensive service like MapReduce jobs is widely used in data centers. We model the data-intensive service system as an M/M(t)/n/k queueing system, where the input process can be seen as Poisson process, the mean service time is a function of time, and the system resources can be divided into n servers and a queue of maximum length of k. We analyze the simplified system where service provider enlarges the system scale in order to provide constant time service. We also study the problem of how to maximize profit for service provider.