TY - UNPB
T1 - Kevin
T2 - de Brujin-based topology with demand-aware links and greedy routing
AU - Zerwas, Johannes
AU - Györgyi, Csaba
AU - Blenk, Andreas
AU - Schmid, Stefan
AU - Avin, Chen
PY - 2022/2/11
Y1 - 2022/2/11
N2 - We propose Kevin, a novel demand-aware reconfigurable rack-to-rackdata center network realized with a simple and efficient control plane. In particular, Kevin makes effective use of the network capacity by supporting integrated and multi-hop routing as well as work-conserving scheduling. To this end, Kevin relies on local greedy routing with small forwarding tables which require local updates only during topological reconfigurations, making this approach ideal for dynamic networks. Specifically, Kevin is based on a de Brujin topology (using a small number of optical circuit switches) in which static links are enhanced with opportunistic links.
AB - We propose Kevin, a novel demand-aware reconfigurable rack-to-rackdata center network realized with a simple and efficient control plane. In particular, Kevin makes effective use of the network capacity by supporting integrated and multi-hop routing as well as work-conserving scheduling. To this end, Kevin relies on local greedy routing with small forwarding tables which require local updates only during topological reconfigurations, making this approach ideal for dynamic networks. Specifically, Kevin is based on a de Brujin topology (using a small number of optical circuit switches) in which static links are enhanced with opportunistic links.
KW - Computer Science - Networking and Internet Architecture
U2 - 10.48550/arXiv.2202.05487
DO - 10.48550/arXiv.2202.05487
M3 - Preprint
SP - 1
EP - 9
BT - Kevin
ER -