Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks

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 least 40

READ FULL TEXT
research
09/29/2018

On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN

Long flows contribute huge volumes of traffic over inter-datacenter WAN....
research
08/24/2019

Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing

Flow routing over inter-datacenter networks is a well-known problem wher...
research
08/29/2019

On Efficient Data Transfers Across Geographically Dispersed Datacenters

As applications become more distributed to improve user experience and o...
research
12/04/2018

Understanding Information Centrality Metric: A Simulation Approach

Identifying the central people in information flow networks is essential...
research
01/02/2018

QuickCast: Fast and Efficient Inter-Datacenter Transfers using Forwarding Tree Cohorts

Large inter-datacenter transfers are crucial for cloud service efficienc...
research
05/05/2019

Efficient Inter-Datacenter Bulk Transfers with Mixed Completion Time Objectives

Bulk transfers from one to multiple datacenters can have many different ...
research
09/27/2021

HTBQueue: A Hierarchical Token Bucket Implementation for the OMNeT++/INET Framework

The hierarchical token bucket (HTB) algorithm allows to specify per-flow...

Please sign up or login with your details

Forgot password? Click here to reset