A distributed speed scaling and load balancing algorithm for energy efficient data centers

2014 ◽  
Vol 79 ◽  
pp. 120-133 ◽  
Author(s):  
Young Myoung Ko ◽  
Yongkyu Cho
2021 ◽  
Vol 11 (3) ◽  
pp. 34-48
Author(s):  
J. K. Jeevitha ◽  
Athisha G.

To scale back the energy consumption, this paper proposed three algorithms: The first one is identifying the load balancing factors and redistribute the load. The second one is finding out the most suitable server to assigning the task to the server, achieved by most efficient first fit algorithm (MEFFA), and the third algorithm is processing the task in the server in an efficient way by energy efficient virtual round robin (EEVRR) scheduling algorithm with FAT tree topology architecture. This EEVRR algorithm improves the quality of service via sending the task scheduling performance and cutting the delay in cloud data centers. It increases the energy efficiency by achieving the quality of service (QOS).


2020 ◽  
Vol 16 (6) ◽  
pp. 155014772093577
Author(s):  
Zan Yao ◽  
Ying Wang ◽  
Xuesong Qiu

With the rapid development of data centers in smart cities, how to reduce energy consumption and how to raise economic benefits and network performance are becoming an important research subject. In particular, data center networks do not always run at full load, which leads to significant energy consumption. In this article, we focus on the energy-efficient routing problem in software-defined network–based data center networks. For the scenario of in-band control mode of software-defined data centers, we formulate the dual optimal objective of energy-saving and the load balancing between controllers. In order to cope with a large solution space, we design the deep Q-network-based energy-efficient routing algorithm to find the energy-efficient data paths for traffic flow and control paths for switches. The simulation result reveals that the deep Q-network-based energy-efficient routing algorithm only trains part of the states and gets a good energy-saving effect and load balancing in control plane. Compared with the solver and the CERA heuristic algorithm, energy-saving effect of the deep Q-network-based energy-efficient routing algorithm is almost the same as the heuristic algorithm; however, its calculation time is reduced a lot, especially in a large number of flow scenarios; and it is more flexible to design and resolve the multi-objective optimization problem.


Author(s):  
Dzmitry Kliazovich ◽  
Sisay T. Arzo ◽  
Fabrizio Granelli ◽  
Pascal Bouvry ◽  
Samee Ullah Khan

2014 ◽  
Vol 989-994 ◽  
pp. 4794-4798 ◽  
Author(s):  
Yu Wen Wu ◽  
Wei Zhang

Cloud services have been explosively popular over the last decade. And data centers play an essential role in providing cloud services. Inside a data center, any server instance has the chance to inject traffic of various applications into the network. Yet how to balance the enormous internal load to make the best of data center network is a highly prioritized problem to be solved. To provide balanced traffic in data centers, this paper proposes an OpenFlow-based GLB load balancing algorithm in data center fat-tree networks. GLB uses a path-related weight to select path. This weight indicates how balanced of a path. We implement GLB algorithm as a module in an openflow controller platform, POX. On the self-defined modified mininet emulation platform, we conduct experiments in a fat-tree topology environment running random traffic to generate performance data. Experiment results demonstrate that our proposed GLB algorithm outperforms DLB algorithm in terms of load balancing.


2010 ◽  
Vol 57 (2) ◽  
pp. 69-100 ◽  
Author(s):  
Emad Samadiani ◽  
Yogendra Joshi ◽  
Janet K. Allen ◽  
Farrokh Mistree

Sign in / Sign up

Export Citation Format

Share Document