+44 (0)1509 263171
Please use this identifier to cite or link to this item:
|Title: ||Longer is better: Exploiting path diversity in data center networks|
|Authors: ||Tso, Fung Po|
Perkins, Colin S.
Pezaros, Dimitrios P.
|Keywords: ||Traffic engineering|
Data center networks
Software defined networking
|Issue Date: ||2013|
|Publisher: ||© IEEE|
|Citation: ||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.|
|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%.|
|Description: ||This paper is closed access.|
|Publisher Link: ||https://doi.org/10.1109/ICDCS.2013.36|
|Appears in Collections:||Closed Access (Computer Science)|
Files associated with this item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.