An Approach for Energy Efficient Deadline-Constrained Flow Scheduling and Routing

With the development and extensive use of the network, its huge energy consumption has attracted more and more attentions. We mainly focus on the network-level energy-saving through the means of flow scheduling and routing, where flow means a certain amount of data that has to be transmitted from a specified source to a specified destination with hard deadline-constraint. We discuss the deadline-constrained flow scheduling and routing problem. Then we propose our EEDFSR method to reduce the active power consumption based on the SDN architecture. The proposed method can be used in both DCN and general topologies. The simulation result has shown that our EEDFSR has ascendancies in reducing the active power consumption of networks which have adequate connections.