Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/CCNC49032.2021.9369488 | 2021 IEEE 18TH ANNUAL CONSUMER COMMUNICATIONS & NETWORKING CONFERENCE (CCNC) |
Keywords | DocType | ISSN |
Data Center placement, Estimation of Distribution Algorithm, Traffic Grooming | Conference | 2331-9852 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanwal Zeb | 1 | 0 | 0.34 |
| Arsalan Ahmad | 2 | 0 | 0.34 |
| Ashfaq Ahmed | 3 | 0 | 0.34 |
| Andrea Bianco | 4 | 32 | 5.70 |