DaRTree deadline-aware multicast transfers in reconfigurable wide-area networks

• Published in: Proceedings of the International Symposium on Quality of Service pp. 1 - 10
• Main Authors: Luo, Long, Foerster, Klaus-Tycho, Schmid, Stefan, Yu, Hongfang
• Format: Conference Proceeding
• Language: English
• Published: New York, NY, USA ACM 24.06.2019
• Series: ACM Other Conferences
• Subjects: Data transfer; deadline; multicast transfers; Network topology; Networks > Network algorithms; Networks > Network performance evaluation; Optical fiber networks; reconfigurable networks; Steiner trees; Topology; Unicast; Wide area networks; reconfigurable networks; deadline; multicast transfers
• ISBN: 9781450367783; 145036778X
• DOI: 10.1145/3326285.3329063

The increasing amount of data replication across datacenters introduces a need for efficient bulk data transfer protocols which meet QoS guarantees, notably timely completion. We present DaRTree which leverages emerging optical reconfiguration technologies, to jointly optimize topology and multicast transfers, and thereby maximize throughput and acceptance ratio of transfer requests subject to deadlines. DaRTree is based on a novel integer linear program relaxation and deterministic rounding scheme. To this end, DaRTree uses multicast Steiner trees and adaptive routing based on the current network load. DaRTree provides its guarantees without need for rescheduling or preemption. Our evaluations show that DaRTree increases the network throughput and the number of accepted requests by up to 70%, especially for larger Wide-Area Networks (WANs). In fact, we also find that DaRTree even outperforms state-of-the-art solutions when the network scheduler is only capable of routing unicast transfers or when the WAN topology is bound to be non-reconfigurable.