Loughborough University

File(s) under permanent embargo

Reason: This item is currently closed access.

Longer is better: Exploiting path diversity in data center networks

conference contribution
posted on 2018-08-01, 08:48 authored by Fung Po TsoFung Po Tso, Gregg Hamilton, Rene Weber, Colin S. Perkins, Dimitrios P. Pezaros
Data Center (DC) networks exhibit much more centralized characteristics than the legacy Internet, yet they are operated by similar distributed routing and control algorithms that fail to exploit topological redundancy to deliver better and more sustainable performance. Multipath protocols, for example, use node-local and heuristic information to only exploit path diversity between shortest paths. In this paper, we use a measurement-based approach to schedule flows over both shortest and non-shortest paths based on temporal network-wide utilization. We present the Baatdaat flow scheduling algorithm which uses spare DC network capacity to mitigate the performance degradation of heavily utilized links. Results show that Baatdaat achieves close to optimal Traffic Engineering by reducing network-wide maximum link utilization by up to 18% over Equal-Cost Multi-Path (ECMP) routing, while at the same time improving flow completion time by 41% - 95%.



  • Science


  • Computer Science

Published in

IEEE International Conference on Distributed Computing Systems (ICDCS)


TSO, F.P. ... et al, 2013. Longer is better: Exploiting path diversity in data center networks. IN: IEEE 33rd International Conference on Distributed Computing Systems (ICDCS), Philadelphia, PA, USA, 8-11 July 2013, pp.430-439.




  • VoR (Version of Record)

Publisher statement

This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/

Publication date



This paper is closed access.




  • en