A Weighted Optimal Scheduling Scheme for Congestion Control in Cloud Data Center Networks

Abstract

Cloud services are experiencing a remarkable increase in the number of users and the resource required over the past few years. Thus, it has become a great challenge for the internet vendors to make a robust framework to serve the customers with low cost and delay. Congestion control is one of the essential topics of routing algorithms in cloud data center networks. In this paper, we propose a weighted optimal scheduling scheme WSPR for congestion control in cloud data center networks which prevents the congestion in advance with the global view so that it can make good use of vacant network resources. We choose BCube as our network model and modify the network topology to fit software-defined networks so as to have a full view of the topology. First, we design the SP graph which contains all shortest paths between a source server and a destination server. Second, we propose WSPR to allocate the most appropriate path to each flow for congestion control. We implement a system to simulate a data center, and evaluate our proposed scheme WSPR by comparing WSPR with other classical methods. The experimental results demonstrate that our proposed scheme WSPR has the best performance in terms of the maximum delay, average delay, and throughput among all compared methods.