Data center networks are typically characterized by high density communication components that process and exchange large amount of information using shortest paths. Mostly, data centers network topologies contain multi-rooted tree with multiple equal cost shortest paths between pairs of hosts. Usually, data center networks operation is based on the result of shortest path algorithms and per-flow static hashing which may cause poor network utilization rates with some links becoming congested while some parts of the network are underused. This work presents a flow scheduling algorithm that exploits the path diversity in data center topologies and dynamically reroutes large flows through less congested shortest and non-shortest paths based on the current state of the network without causing packets reordering. The algorithm aims to minimize flows latency while maximizing the network utilization rates. Results show that the algorithm proposed in this work reduces flows completion time by 13–24% over Equal-Cost Multi-Path routing, while improving the average network utilization by up to 10%.
- Data centers
- Flow scheduling solution
- Performance guarantee
- Short paths routing
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering