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

by   Max Noormohammadpour, et al.

Flow routing over inter-datacenter networks is a well-known problem where the network assigns a path to a newly arriving flow potentially according to the network conditions and the properties of the new flow. An essential system-wide performance metric for a routing algorithm is the flow completion times, which affect the performance of applications running across multiple datacenters. Current static and dynamic routing approaches do not take advantage of flow size information in routing, which is practical in a controlled environment such as inter-datacenter networks that are managed by the datacenter operators. In this paper, we discuss Best Worst-case Routing (BWR), which aims at optimizing the tail completion times of long-running flows over inter-datacenter networks with non-uniform link capacities. Since finding the path with the best worst-case completion time for a new flow is NP-Hard, we investigate two heuristics, BWRH and BWRHF, which use two different upper bounds on the worst-case completion times for routing. We evaluate BWRH and BWRHF against several real WAN topologies and multiple traffic patterns. Although BWRH better models the BWR problem, BWRH and BWRHF show negligible difference across various system-wide performance metrics, while BWRHF being significantly faster. Furthermore, we show that compared to other popular routing heuristics, BWRHF can reduce the mean and tail flow completion times by over 1.5× and 2×, respectively.


page 1

page 5


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

Long flows contribute huge volumes of traffic over inter-datacenter WAN....

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

Inter-datacenter networks connect dozens of geographically dispersed dat...

Contra: A Programmable System for Performance-aware Routing

We present Contra, a system for performance-aware routing that can adapt...

Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing

In this paper we consider the problem of optimizing the ecological conne...

On Efficient Data Transfers Across Geographically Dispersed Datacenters

As applications become more distributed to improve user experience and o...

PACER: Peripheral Activity Completion Estimation and Recognition

Embedded peripheral devices such as memories, sensors and communications...

Network Coding Gaps for Completion Times of Multiple Unicasts

Arguably the most common network communication problem is multiple-unica...

Please sign up or login with your details

Forgot password? Click here to reset