IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v16y2020i6p1550147720935775.html
   My bibliography  Save this article

DQN-based energy-efficient routing algorithm in software-defined data centers

Author

Listed:
  • Zan Yao
  • Ying Wang
  • Xuesong Qiu

Abstract

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.

Suggested Citation

  • Zan Yao & Ying Wang & Xuesong Qiu, 2020. "DQN-based energy-efficient routing algorithm in software-defined data centers," International Journal of Distributed Sensor Networks, , vol. 16(6), pages 15501477209, June.
  • Handle: RePEc:sae:intdis:v:16:y:2020:i:6:p:1550147720935775
    DOI: 10.1177/1550147720935775
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147720935775
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147720935775?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:16:y:2020:i:6:p:1550147720935775. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.