TY - GEN
T1 - Power aware data center placement in WDM optical networks
AU - Zeb, Sanwal
AU - Ahmad, Arsalan
AU - Ahmed, Ashfaq
AU - Bianco, Andrea
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/1/9
Y1 - 2021/1/9
N2 - Due to the increasing trend in IP traffic, the placement of Data Centers (DCs) at network nodes has become a hot research topic. A proper DCs placement translates in reduced power consumption of overall network. The paper scope is to find the best placement of 'k' DCs nodes out of 'N' total nodes to reduce power consumption. To solve the problem, we propose two heuristics: EoDCP, based on Estimation of Distribution Algorithm (EDA), and MaxN-MinL. An exhaustive search based ESDCP algorithm is used as a lower bound to compare the performance of EoDCP and MaxN-MinL. Moreover, electronic traffic grooming technique is employed to further reduce the total network power consumption. A 20-Node Random network and a 17-Node German network are used to perform comparison of proposed heuristics. Performance of EoDCP algorithm is far better than those of MaxN-MinL, and is similar to the optimal solution obtained via ESDCP. Finally, using electronic traffic grooming improves power savings up-to 15% in the two considered topologies.
AB - Due to the increasing trend in IP traffic, the placement of Data Centers (DCs) at network nodes has become a hot research topic. A proper DCs placement translates in reduced power consumption of overall network. The paper scope is to find the best placement of 'k' DCs nodes out of 'N' total nodes to reduce power consumption. To solve the problem, we propose two heuristics: EoDCP, based on Estimation of Distribution Algorithm (EDA), and MaxN-MinL. An exhaustive search based ESDCP algorithm is used as a lower bound to compare the performance of EoDCP and MaxN-MinL. Moreover, electronic traffic grooming technique is employed to further reduce the total network power consumption. A 20-Node Random network and a 17-Node German network are used to perform comparison of proposed heuristics. Performance of EoDCP algorithm is far better than those of MaxN-MinL, and is similar to the optimal solution obtained via ESDCP. Finally, using electronic traffic grooming improves power savings up-to 15% in the two considered topologies.
KW - Data Center placement
KW - Estimation of Distribution Algorithm
KW - Traffic Grooming
UR - http://www.scopus.com/inward/record.url?scp=85102981085&partnerID=8YFLogxK
U2 - 10.1109/CCNC49032.2021.9369488
DO - 10.1109/CCNC49032.2021.9369488
M3 - Conference contribution
AN - SCOPUS:85102981085
T3 - 2021 IEEE 18th Annual Consumer Communications and Networking Conference, CCNC 2021
BT - 2021 IEEE 18th Annual Consumer Communications and Networking Conference, CCNC 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th IEEE Annual Consumer Communications and Networking Conference, CCNC 2021
Y2 - 9 January 2021 through 13 January 2021
ER -