Competitive analysis for online scheduling in software-defined optical WAN

Su Jia, Xin Jin, Golnaz Ghasemiesfeh, Jiaxin Ding, Jie Gao
2017 IEEE INFOCOM 2017 - IEEE Conference on Computer Communications  
Modern planetary-scale online services have massive data to transfer over the wide area network (WAN). Due to the tremendous cost of building WANs and the stringent timing requirement of distributed applications, it is critical for network operators to make efficient use of network resources to optimize data transfers. By leveraging software-defined networking (SDN) and reconfigurable optical devices, recent solutions design centralized systems to jointly control the network layer and the
more » ... l layer. While these solutions show it is promising to significantly reduce data transfer times by centralized crosslayer control, they do not have any theoretical guarantees on the proposed algorithms. This paper presents approximation algorithms and theoretical analysis for the online transfer scheduling problem over optical WANs. The goal of the scheduling problem is to minimize the makespan (the time to finish all transfers) or the total sum of completion times. We design and analyze various greedy, online scheduling algorithms that can achieve 3competitive ratio for makespan, 2-competitive ratio for minimum sum completion time for jobs of unit size, and 3↵-competitive ratio for jobs of arbitrary transfer size and each node having degree constraint d, where ↵ = 1 when d = 1 and ↵ = 1.86 when d 2. We also evaluated the performance of these algorithms and compared the performance with prior heuristics.
doi:10.1109/infocom.2017.8056969 dblp:conf/infocom/JiaJGDG17 fatcat:csqvjbyewfhdpiq4ehq3y43pdq