Expander-Based DC Routing: A Programmable Data Plane Perspective
Mohamad Al Adraa, Abdeltif Azzizi, Chadi M. Assi, Michael Y. Frankel, Vladimir Pelekhaty · 2024
This research introduces an innovative routing protocol designed to operate within the switch data plane, capitalizing on the unique advantages offered by Expander-based next-generation Data Center Networks (DCNs). Expander graphs, the foundational structures of Expander-based data centers, are renowned for their high edge expansion, which translates to shorter average path lengths and heightened connectivity among all network nodes. Traditional routing methods, such as Equal-Cost Multi-Path (ECMP) and Shortest Path (SP), are not adequate to fully harness the abundant path diversity intrinsic to these DC topologies. Hence, there exists a compelling demand for an efficient routing protocol capable of realizing the full potential of this path diversity. Furthermore, the advent of programmable switches in modern network technology underscores the need for routing techniques that can be seamlessly implemented within the data plane to achieve line-rate packet processing speed.