Kevin: de Brujin-based topology with demand-aware links and greedy routing

Johannes Zerwas, Csaba Györgyi, Andreas Blenk, Stefan Schmid, Chen Avin

Research output: Working paper/PreprintPreprint

7 Downloads (Pure)

Abstract

We propose Kevin, a novel demand-aware reconfigurable rack-to-rack datacenter 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.
Original languageEnglish
Pages1-9
StatePublished - 1 Feb 2022

Keywords

  • Computer Science - Networking and Internet Architecture

Fingerprint

Dive into the research topics of 'Kevin: de Brujin-based topology with demand-aware links and greedy routing'. Together they form a unique fingerprint.

Cite this