Latest revision as of 19:59, 28 January 2021

Abstract

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%.

Original document

The different versions of the original document can be found in:

• http://csperkins.org/publications/2013/07/tso2013longer.pdf

• http://xplorestaging.ieee.org/ielx7/6679374/6681559/06681612.pdf?arnumber=6681612,

http://dx.doi.org/10.1109/icdcs.2013.36

• https://csperkins.org/publications/2013/07/tso2013longer.pdf,

http://eprints.gla.ac.uk/77332,

https://dblp.uni-trier.de/db/conf/icdcs/icdcs2013.html#TsoHWPP13,

https://ieeexplore.ieee.org/document/6681612,

http://ieeexplore.ieee.org/document/6681612,

https://dx.doi.org/10.1109/ICDCS.2013.36,

https://dl.acm.org/citation.cfm?id=2549753,

https://academic.microsoft.com/#/detail/2001128841