Poster abstract: Minimizing flow completion times using adaptive routing over inter-datacenter wide area networks

Abstract

Inter-datacenter networks connect dozens of geographically dispersed datacenters and carry traffic flows with highly variable sizes and different classes. Adaptive flow routing can improve efficiency and performance by assigning paths to new flows according to network status and flow properties. A popular approach widely used for traffic engineering is based on current bandwidth utilization of links. We propose an alternative that reduces bandwidth usage by up to at least 50% and flow completion times by up to at least 40% across various scheduling policies and flow size distributions.

Original document

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

• http://arxiv.org/pdf/1802.09080

• http://xplorestaging.ieee.org/ielx7/8401302/8406774/08406853.pdf?arnumber=8406853,

http://dx.doi.org/10.1109/infcomw.2018.8406853

• https://dblp.uni-trier.de/db/journals/corr/corr1802.html#abs-1802-09080,

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

http://ui.adsabs.harvard.edu/abs/2018arXiv180209080N/abstract,

https://arxiv.org/pdf/1802.09080,

https://arxiv.org/abs/1802.09080,

https://export.arxiv.org/pdf/1802.09080,

https://osf.io/2cfyq/#!,

http://export.arxiv.org/abs/1802.09080,

https://tw.arxiv.org/abs/1802.09080,

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