Flowtable-Free Routing for Data Center Networks: A Software-Defined Approach

Ren, Yi, Tsai, Tsung-Han, Huang, Ji-Cheng, Wu, Cheng-Wei and Tseng, Yu-Chee (2018) Flowtable-Free Routing for Data Center Networks: A Software-Defined Approach. In: GLOBECOM 2017 - 2017 IEEE Global Communications Conference. IEEE Press. ISBN 978-1-5090-5020-8

[img] PDF (Accepted manuscript) - Submitted Version
Download (960kB)

Abstract

The paradigm shift toward SDN has exhibited the following trends: (1) relying on a centralized and more powerful controller to make intelligent decisions, and (2) allowing a set of relatively dumb switches to route packets. Therefore, efficiently looking up the flowtables in forwarding switches to guarantee low latency becomes a critical issue. In this paper, following the similar paradigm, we propose a new routing scheme called KeySet which is flowtable-free and enables constant-time switching at the forwarding switches. Instead of looking up long flowtables, KeySet relies on a residual system to quickly calculate routing paths. A switch only needs to do simple modular arithmetics to obtain a packet's forwarding output port. Moreover, KeySet has a nice fault- tolerant capability because in many cases the controller does not need to update flowtables at switches when a failure occurs. We validate KeySet through extensive simulations by using general as well as Facebook fat-tree topologies. The results show that the KeySet outperforms the KeyFlow scheme [1] by at least 25% in terms of the length of the forwarding label. Moreover, we show that KeySet is very efficient when applied to fat-trees.

Item Type: Book Section
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Pure Connector
Date Deposited: 26 Jan 2018 15:30
Last Modified: 30 Sep 2020 00:02
URI: https://ueaeprints.uea.ac.uk/id/eprint/66108
DOI: 10.1109/GLOCOM.2017.8254761

Actions (login required)

View Item View Item