Adaptive Load Balanced Routing for 2-Dilated Flattened Butterfly Switching Network

Ajithkumar Thamarakuzhi, John Chandy
High-radix networks such as folded-Clos outper-form other low radix networks in terms of cost and latency. The 2-dilated flattened butterfly (2DFB) network is a nonblocking high-radix network with better path diversity and reduced diameter compared to the folded-Clos network. In this paper, we 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
more » ... 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. We have compared the performance of our algorithm on a 2DFB network with an Adaptive Clos algorithm on a folded-Clos network and a Minimal routing algorithm on a 2DFB network for different traffic patterns. We observed that 2DFB network with the proposed algorithm provides the same throughput with reduced latency compared to the folded-Clos network with an Adaptive Clos algorithm for all the traffic patterns.