An Approximation Method of Optimal Scheduling for Multicommodity Flows in Cloud-Service Scenarios

AbstractWith limited physical and virtual resources in cloud computing systems, it is not feasible to successively expand network infrastructure to adequately support the rapid growth in service. So the pervasive boundary in communication networks is that of allocating bandwidth to satisfy a given collection of service requests is hard to reach. In situations where there is limited network capacity but plethory of requests, the current optimal methodology of the choice of which requests to satisfy, thereby resulting in congestion and low utilization rate.It is imperative to develop new efficient scheduling methods. In this paper, we demonstrate these concepts through a case test study of scheduling for multicommodity flows in cloud-service environment by successive heuristics algorithms, and the heuristic solutions are then compared with the related network performance metrics obtained using the presented model. The effectiveness of the new technique was evaluated by comparison to the differentiated cost ...