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%.
Network Function Visualization (NFV) enables the softwarization of network functions on standardized commodity hardware, which is promising to help the network carriers to achieve a lower investment cost, a shorter time to deployment, as well as a more flexible and dynamic way of network configuration and management. One of the key challenges is how to efficiently place and chain the software-based virtual network functions in the physical substrate to provision the requested network service while minimizing the physical network cost. In this paper, we mathematically formulate the virtual network function chaining problem using Integer Linear Programming (ILP), in order to facilitate an optimal solution. In addition, we propose a set of heuristic algorithms to efficiently solve this problem. The proposed Close To Destination (CTD) algorithm can achieve a near-optimal physical network cost that is close to the optimal result obtained from the ILP solution, but with a very low computational complexity. Comprehensive simulations are conducted to evaluate the proposed approaches, and the results demonstrate the effectiveness of the proposed CTD algorithm.