Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Journal of Beijing University of Posts and Telecommunications ›› 2020, Vol. 43 ›› Issue (2): 46-51.doi: 10.13190/j.jbupt.2019-105

• PAPERS • Previous Articles     Next Articles

Deadline-Aware and Energy Efficient Routing Optimization Algorithm in SD-DCN

YAO Zan, WANG Ying, QIU Xue-song, WEN Yu-qi   

  1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2019-05-30 Published:2020-04-28

Abstract: Based on link speed-scaling energy consumption strategy, Floyd-Warshall dynamic planning & rerouting parts of flows strategy based routing optimization algorithm was proposed. Considering the condition of flow deadline-aware and balanced transmission of flows strategy in space and time, controller in software defined data center network sorts the online incoming flows and chooses the route and calculates the transmission rate for every flow. In case of routing failure, the algorithm improves the acceptance rate of network traffic with less overhead. Simulations show that the algorithm effectively reduces energy consumption and improves the acceptance rate of network traffic.

Key words: software defined data center network, energy efficient routing, deadline-aware

CLC Number: