Latest revision as of 05:19, 2 February 2021

Abstract

Datacenters provide the infrastructure for cloud computing services used by millions of users everyday. Many such services are distributed over multiple datacenters at geographically distant locations possibly in different continents. These datacenters are then connected through high speed WAN links over private or public networks. To perform data backups or data synchronization operations, many transfers take place over these networks that have to be completed before a deadline in order to provide necessary service guarantees to end users. Upon arrival of a transfer request, we would like the system to be able to decide whether such a request can be guaranteed successful delivery. If yes, it should provide us with transmission schedule in the shortest time possible. In addition, we would like to avoid packet reordering at the destination as it affects TCP performance. Previous work in this area either cannot guarantee that admitted transfers actually finish before the specified deadlines or use techniques that can result in packet reordering. In this paper, we propose DCRoute, a fast and efficient routing and traffic allocation technique that guarantees transfer completion before deadlines for admitted requests. It assigns each transfer a single path to avoid packet reordering. Through simulations, we show that DCRoute is at least 200 times faster than other traffic allocation techniques based on linear programming (LP) while admitting almost the same amount of traffic to the system.

Comment: 23rd IEEE International Conference on High Performance Computing (HiPC)

Document type: Conference object

Full document

Original document

The different versions of the original document can be found in:

• http://arxiv.org/abs/1707.04011

• http://arxiv.org/pdf/1707.04011

• http://dx.doi.org/10.31219/osf.io/2ec3q

• http://dx.doi.org/10.6084/m9.figshare.5881456 under the license https://creativecommons.org/licenses/by/4.0/legalcode

• http://dx.doi.org/10.6084/m9.figshare.5881456.v1 under the license https://creativecommons.org/licenses/by/4.0/legalcode

• https://zenodo.org/record/1161816 under the license http://creativecommons.org/licenses/by/4.0/legalcode

• http://xplorestaging.ieee.org/ielx7/7837798/7839653/07839672.pdf?arnumber=7839672,

http://dx.doi.org/10.1109/hipc.2016.019

• https://dblp.uni-trier.de/db/journals/corr/corr1707.html#Noormohammadpour17c,

http://ui.adsabs.harvard.edu/abs/2017arXiv170704011N/abstract,

http://export.arxiv.org/pdf/1707.04011,

https://arxiv.org/abs/1707.04011,

https://ieeexplore.ieee.org/document/7839672,

http://ieeexplore.ieee.org/document/7839672,

https://osf.io/6fq7s/#!,

https://tw.arxiv.org/abs/1707.04011,

http://arxiv.org/pdf/1707.04011.pdf,

https://academic.microsoft.com/#/detail/2583577150

• https://hal.archives-ouvertes.fr/hal-01819059,

https://hal.archives-ouvertes.fr/hal-01819059/document,

https://hal.archives-ouvertes.fr/hal-01819059/file/DCROUTE_HIPC_2016.pdf

• https://osf.io/2ec3q,

http://dx.doi.org/10.17605/osf.io/2ec3q

DOIS: 10.1109/hipc.2016.019 10.6084/m9.figshare.5881456.v1 10.6084/m9.figshare.5881456 10.31219/osf.io/2ec3q 10.17605/osf.io/2ec3q