Toward online profit-driven scheduling of inter-DC data-transfers for cloud applications

摘要

For an inter-datacenter (inter-DC) network that carries multiple cloud applications, tasks may arise in the DCs and need to transfer data to others with different latency requirements. Therefore, it is desired that a highly efficient online scheduling algorithm could be developed to consider the request admission, routing selection and bandwidth allocation for the data-transfers jointly. In this work, we investigate this problem, and propose an online scheduling algorithm, namely, GlobeAny, to maximize the time-average profit from provisioning the requests. The proposed algorithm leverages Lyapunov optimization techniques and can achieve arbitrarily approaching to the optimal value within O(1/V) gap. We also show that by adjusting the application weights, it can provide differentiated services to requests with different latency requirements.