Average delay SLAs in Cloud computing

In this paper, we conduct feasibility studies on the average delay space for Cloud computing, and we propose a heuristic method to control the vector of average delays, subject to predefined delay constraints. Our work is strongly motivated by the fact that delay control plays a critical role to improve Service Level Agreements (SLA) between users and Cloud service providers, which is necessary for empowering online business. Specifically, our main contributions are two-fold: First, the feasible regions of various routing algorithms for the system´s dispatcher are investigated in depth. Second, a simple heuristic algorithm is designed, to move the average delay point along the feasible direction until achieving the delay constraints. Average delay is dependent on multiple factors such as job size, inter-arrival time, flow rate, and the dispatching rules of the system. Therefore, we vary their distribution, parameters and routing rules to examine how the feasible regions move or change. After establishing the feasible delay space, then by moving along the feasible directions, we show that a simple heuristic algorithm can achieve the delay constraints for a two queue system.