Improving Routing Performance via Dynamic Programming in Large-Scale Data Centers

摘要

The Internet of Things has become a spotlight for a long period of time and generates massive amounts of sensor data. Thus, data centers play more and more crucial roles in processing and analyzing the explosively increasing data. To remedy the shortcomings of traditional tree-based structure, many novel server-centric network structures have been proposed in recent years. Their original routing mechanisms based on divide and conquer (DC) are not able to work out the shortest paths. So, there is still promotion room for communication delay reduction. Since dynamic programming (DP) is a classical strategy to obtain optimal solution, this paper proposes a routing mechanism based on DP and applies it to data center for better solving the weakness occurred by DC. Experiments firmly support the conclusion that adopting DP in routing calculation achieves appealing performance of short latency, great fault-tolerance and reasonable resource consumption. Theoretical analysis also proves that it is applicable to most popular structures.