1802.09080.pdf (169.34 kB)
Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks
Version 3 2018-06-30, 04:11
Version 2 2018-03-13, 04:51
Version 1 2018-02-27, 03:27
journal contribution
posted on 2018-06-30, 04:11 authored by Mohammad NoormohammadpourMohammad Noormohammadpour, Cauligi S. RaghavendraInter-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.
History
Usage metrics
Categories
Keywords
traffic engineeringwide area networksflow completion timefctbandwidthadaptive routingRouting protocolsdnSoftware Defined Networkssoftware defined networkingbulk transfersNetworking and CommunicationsComputer Communications NetworksData CommunicationsOptical Fibre CommunicationsPhotonics, Optoelectronics and Optical CommunicationsOptical Networks and SystemsComputer EngineeringEngineering Systems Design
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC