Deadline-Aware Fast One-to-Many Bulk Transfers over Inter-Datacenter Networks

Abstract

An increasing number of cloud services are operated globally, where the service data are frequently replicated across geographically distributed datacenters to improve service quality and reliability. Such replication generates many one-to-many bulk data transfers over inter-datacenter networks from one datacenter to many receiver datacenters. To provide end-users with guaranteed services, these data transfers are usually required to be completed within designated deadlines. Despite the exponential growth in data demand, there has been little work on guaranteeing deadlines for one-to-many transfers, which is the subject of this paper. This paper proposes a centralized admission control coupled with a scheduling algorithm, named deAdline-Guaranteed transfEr (AGE), to guarantee the deadline of admitted data transfers and utilize the network capacity efficiently. The key idea is to flexibly select the source datacenter for receiver datacenters and allow the remaining receivers to obtain a replica from either the original source or the other receivers that have already received a copy. By jointly allocating the source for receivers and the bandwidth and routing paths for every data transfer, AGE maximizes the number of deadline-satisfied transfers. Our simulations show that compared to the state-of-the-art, AGE guarantees the deadline for up to 70% more transfers, achieves at least 2× higher network throughput, and reduces the completion time up to 80%.

BDS+: An Inter-Datacenter Data Replication System With Dynamic Bandwidth Separation

“…As comparison, BDS+ decouples the whole algorithm into scheduling and routing stages. Further, some deadline-aware algorithms like [78], [79] are also emerging, but in our scenario, the data need to be transferred are large amount of bulk data, so we treat small block the same priority, except some special cases (as explained in Section 4.3).…”

A Partial Store-and-Forward Scheduling Method for Inter-Datacenter Bulk Data Transfers

“…Assume α=0.4 and hence get N s =2. Based on the aforementioned selection scheme, node 1 and node 3 are involved in scheduling, i.e., S = [1,3,4].…”

“…This will not be actually executed in Algorithm 1. Then, Algorithm 2 is executed to merge the spatial links within the segment [1,3]. Fig.…”

“…Thus, in Fig. 10(a), link 1-3 is busy at t=0, since the minimum residual bandwidth within [1,3] is zero at t=0.…”