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

  title={On Minimizing the Completion Times of Long Flows Over Inter-Datacenter WAN},
  author={Mohammad Noormohammadpour and Ajitesh Srivastava and Cauligi S. Raghavendra},
  journal={IEEE Communications Letters},
Long flows contribute huge volumes of traffic over inter-datacenter WAN. The flow completion time (FCT) is a vital network performance metric that affects the running time of distributed applications and the users’ quality of experience. Flow routing techniques based on propagation or queuing latency or instantaneous link utilization are insufficient for minimization of the long flows’ FCT. We propose a routing approach that uses the remaining sizes and paths of all ongoing flows to minimize… 

Figures from this paper

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

This paper discusses 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, and investigates two heuristics, BWRH and BWRHF, which use two different upper bounds on the worst-case completion times for routing.

DeepRoute: Herding Elephant and Mice Flows with Reinforcement Learning

Inspired by recent advances in AI to manage resources, DeepRoute is presented, a model-less reinforcement learning approach that translates the path computation problem to a learning problem and is shown to improve average network path utilization to 30% and potentially reduce possible congestion across the whole network.


MAC filtering is more effective in wired network, since it is more difficult for attacker to identify authorized MAC address, which can also be used in the process of exploiting security of a system.



Calendaring for wide area networks

Datacenter WAN traffic consists of high priority transfers that have to be carried as soon as they arrive alongside large transfers with pre-assigned deadlines on their completion (ranging from

Online multicast routing with bandwidth guarantees: a new approach using multicast network flow

A multicast tree selection heuristic that is based on the idea of deferred loading of certain critical links that, if heavily loaded, would make it impossible to satisfy future demands between certain ingress-egress pairs is developed.

Inside the Social Network's (Datacenter) Network

The contrasting locality, stability, and predictability of network traffic in Facebook's datacenters are reported on, and their implications for network architecture, traffic engineering, and switch design are commented on.

B4 and after: managing hierarchy, partitioning, and asymmetry for availability and scale in google's software-defined WAN

This paper presents the five-year evolution of B4, Google's private software-defined WAN, and describes the techniques employed to incrementally move from offering best-effort content-copy services to carrier-grade availability, while concurrently scaling B4 to accommodate 100x more traffic.

Software defined network: Future of networking

Software Defined Networking is an emerging paradigm that separates the network's control logic from the underlying routers and switches, promoting logical centralization of network control and introducing the ability to program the network.

Software-defined networking

Novel architecture allows programmers to quickly reconfigure network resource usage as well as provide real-time information about how the network is being used.

Data Networks

and a at

The xishacorene natural products are structurally unique apolar diterpenoids that feature a bicyclo[3.3.1] framework. These secondary metabolites likely arise from the well-studied, structurally

B4: experience with a globally-deployed software defined wan

This work presents the design, implementation, and evaluation of B4, a private WAN connecting Google's data centers across the planet, using OpenFlow to control relatively simple switches built from merchant silicon.

and s