Per-packet load-balanced, low-latency routing for clos-based data center networks

  • Authors:

  • Jiaxin Cao;Rui Xia;Pengkun Yang;Chuanxiong Guo;Guohan Lu;Lihua Yuan;Yixin Zheng;Haitao Wu;Yongqiang Xiong;Dave Maltz

  • Affiliations:

  • Microsoft Research Asia, University and Science and Technology of China, Beijing, Hefei, China;Microsoft Research Asia, University and Science and Technology of China, Beijing, Hefei, China;University of Illinois at Urbana-Champaign, Urbana, Champaign, USA;Microsoft, Redmond, USA;Microsoft, Redmond, USA;Microsoft, Redmond, USA;Tsinghua University, Beijing, China;Microsoft Research Asia, Beijing, China;Microsoft Research Asia, Beijing, China;Microsoft, Redmond, USA

  • Venue:
  • Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Clos-based networks including Fat-tree and VL2 are being built in data centers, but existing per-flow based routing causes low network utilization and long latency tail. In this paper, by studying the structural properties of Fat-tree and VL2, we propose a per-packet round-robin based routing algorithm called Digit-Reversal Bouncing (DRB). DRB achieves perfect packet interleaving. Our analysis and simulations show that, compared with random-based load-balancing algorithms, DRB results in smaller and bounded queues even when traffic load approaches 100%, and it uses smaller re-sequencing buffer for absorbing out-of-order packet arrivals. Our implementation demonstrates that our design can be readily implemented with commodity switches. Experiments on our testbed, a Fat-tree with 54 servers, confirm our analysis and simulations, and further show that our design handles network failures in 1-2 seconds and has the desirable graceful performance degradation property.