Efficient Inter-Datacenter Bulk Transfers with Mixed Completion Time Objectives

Bulk transfers from one to multiple datacenters can have many different completion time objectives ranging from quickly replicating some k copies to minimizing the time by which the last destination receives a full replica. We design an SDN-style wide-area traffic scheduler that optimizes different completion time objectives for various requests. The scheduler builds, for each bulk transfer, one or more multicast forwarding trees which preferentially use lightly loaded network links. Multiple multicast trees are used per bulk transfer to insulate destinations that have higher available bandwidth and can hence finish quickly from congested destinations. These decisions--how many trees to construct and which receivers to serve using a given tree--result from an optimization problem that minimizes a weighted sum of transfers' completion time objectives and their bandwidth consumption. Results from simulations and emulations on Mininet show that our scheduler, Iris, can improve different completion time objectives by about 2.5×.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
12/16/2018

Fast and Efficient Bulk Multicasting over Dedicated Inter-Datacenter Networks

Several organizations have built multiple datacenters connected via dedi...
research
07/07/2017

DCCast: Efficient Point to Multipoint Transfers Across Datacenters

Using multiple datacenters allows for higher availability, load balancin...
research
02/25/2018

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

Inter-datacenter networks connect dozens of geographically dispersed dat...
research
12/30/2017

Online Multicast Traffic Engineering for Software-Defined Networks

Previous research on SDN traffic engineering mostly focuses on static tr...
research
05/07/2019

Network Coding Gaps for Completion Times of Multiple Unicasts

Arguably the most common network communication problem is multiple-unica...
research
01/14/2019

Kelly Cache Networks

We study networks of M/M/1 queues in which nodes act as caches that stor...

Please sign up or login with your details

Forgot password? Click here to reset