Abstract:
Globally distributed datacenters replicate service data for more cloud services to improve quality and reliability. Replication generates many one-to-many bulk data transfers over inter-datacenter networks.
These data transfers must be completed within deadlines to guarantee end-user services. This paper discusses guaranteeing deadlines for one-to-many transfers, which has been neglected despite data demand’s exponential growth.
This paper proposes a centralized admission control and scheduling algorithm, deAdline-Guaranteed transfEr (AGE), to guarantee data transfer deadlines and maximize network capacity. The key 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 received a copy.
AGE maximizes deadline-satisfied transfers by jointly allocating receiver sources, bandwidth, and routing paths for data transfers. Our simulations show that AGE guarantees the deadline for up to 70% more transfers, achieves at least 2× higher network throughput, and reduces completion time by 80% compared to the state-of-the-art.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
