Customer Satisfaction-Aware Scheduling for Utility Maximization on Geo-distributed Cloud Data Centers

With the increasingly growing amount of service requests from the world-wide customers, the cloud systems is capable of providing services while meeting the customers' satisfaction. Recently, to achieve the better reliability and performance, the cloud systems has been largely depending on the geographically distributed data centers. Nevertheless, the dollar cost of service placement by service providers (SP) differ from the multiple regions. Accordingly, it is crucial to design a request dispatching and resource allocation algorithm to maximize net profit. The existing algorithms are either built upon energy-efficient schemes alone, or multi-type requests and customer satisfaction oblivious. They cannot be applied to multi-type requests and customer satisfaction-aware algorithm design with the objective of maximizing net profit. This paper proposes a customer satisfaction-aware algorithm based on the Ant-Colony Optimization (AMP) for geo-distributed data centers. By introducing the model of customer satisfaction, we formulate the utility (or net profit) maximization issue as an optimization problem under the constraints of customer satisfaction and data centers. AMP maximizes SP net profit by dispatching service requests to the proper data centers and generating the appropriate amount of Virtual Machines (VMs) to meet customer satisfaction. To evaluate the proposed algorithm, we have conducted the comprehensive simulation and compared with the other state-of-the-art algorithms. Conclusive results have demonstrated the effectiveness of AMP both in small and large scale problem.

[1]  Quanyan Zhu,et al.  Dynamic Service Placement in Geographically Distributed Clouds , 2012, IEEE Journal on Selected Areas in Communications.

[2]  Ming Zhao,et al.  Profit Aware Load Balancing for Distributed Cloud Data Centers , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[3]  Wonjun Lee,et al.  Resource pricing game in geo-distributed clouds , 2013, 2013 Proceedings IEEE INFOCOM.

[4]  D D O'Brien It's not easy. , 1990, Journal of post anesthesia nursing.

[5]  Margaret Martonosi,et al.  Capping the brown energy consumption of Internet services at low cost , 2010, International Conference on Green Computing.

[6]  Lachlan L. H. Andrew,et al.  Greening Geographical Load Balancing , 2015, IEEE/ACM Transactions on Networking.

[7]  Shaolei Ren,et al.  Provably-Efficient Job Scheduling for Energy and Fairness in Geographically Distributed Data Centers , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[8]  Gang Quan,et al.  On-Line Real-Time Service Allocation and Scheduling for Distributed Data Centers , 2011, 2011 IEEE International Conference on Services Computing.

[9]  Xue Liu,et al.  Minimizing Electricity Cost: Optimization of Distributed Internet Data Centers in a Multi-Electricity-Market Environment , 2010, 2010 Proceedings IEEE INFOCOM.

[10]  Albert Y. Zomaya,et al.  Tradeoffs Between Profit and Customer Satisfaction for Service Provisioning in the Cloud , 2011, HPDC '11.

[11]  Minglu Li,et al.  Energy-efficient scheduling on multi-FPGA reconfigurable systems , 2013, Microprocess. Microsystems.

[12]  Bruce M. Maggs,et al.  Cutting the electric bill for internet-scale systems , 2009, SIGCOMM '09.

[13]  Baochun Li,et al.  Joint request mapping and response routing for geo-distributed cloud services , 2013, 2013 Proceedings IEEE INFOCOM.

[14]  Binoy Ravindran,et al.  Time-utility function-driven switched Ethernet: packet scheduling algorithm, implementation, and feasibility analysis , 2004, IEEE Transactions on Parallel and Distributed Systems.

[15]  Srinivasan Keshav,et al.  It's not easy being green , 2012, CCRV.