Adaptive Load Balanced Routing for 2-Dilated Flattened Butterfly Switching Network
High-radix networks such as folded-Clos outperform other low radix networks in terms of cost and latency. The 2-Dilated Flattened Butterfly (2DFB) network is a non-blocking high-radix network with better path diversity and reduced diameter compared to the folded-Clos network. In this paper, the authors introduce an adaptive load balanced routing algorithm that is designed to exploit all the positive topological properties of a 2DFB network. The proposed algorithm achieves load balance by allowing one non minimal forwarding in each dimension in case of network congestion. This algorithm provides high throughput on adversarial traffic patterns and provides better latency on benign traffic patterns.