Competitive analysis for online scheduling in software-defined optical WAN

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 optical layer. While these solutions show it is promising to significantly reduce data transfer times by centralized cross-layer 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 3-competitive 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.

[1]  Ming Zhang,et al.  Guaranteeing deadlines for inter-datacenter transfers , 2015, EuroSys.

[2]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[3]  Srikanth Kandula,et al.  Calendaring for wide area networks , 2015, SIGCOMM 2015.

[4]  Edward G. Coffman,et al.  Scheduling File Transfers , 1985, SIAM J. Comput..

[5]  Srikanth Kandula,et al.  Achieving high utilization with software-driven WAN , 2013, SIGCOMM.

[6]  Guy Kortsarz,et al.  Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees , 2002, J. Algorithms.

[7]  Ming Zhang,et al.  Efficiently Delivering Online Services over Integrated Infrastructure , 2016, NSDI.

[8]  Klaus Jansen,et al.  On the Complexity of Scheduling Incompatible Jobs with Unit-Times , 1993, MFCS.

[9]  Wei Xu,et al.  Optimizing Bulk Transfers with Software-Defined Optical WAN , 2016, SIGCOMM.

[10]  Sanjay Ranka,et al.  Advance Reservations and Scheduling for Bulk Transfers in Research Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[11]  Edward G. Coffman,et al.  Mutual Exclusion Scheduling , 1996, Theor. Comput. Sci..

[12]  Alexander Souza,et al.  SRPT is 1.86-competitive for completion time scheduling , 2010, SODA '10.

[13]  Guy Kortsarz,et al.  The Minimum Color Sum of Bipartite Graphs , 1997, ICALP.

[14]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[15]  Fedor V. Fomin,et al.  Equitable Colorings of Bounded Treewidth Graphs , 2004, MFCS.

[16]  Dániel Marx,et al.  RAPH COLORING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING , 2022 .

[17]  Dana Ron,et al.  Scheduling with conflicts: online and offline algorithms , 2009, J. Sched..

[18]  Michael Sirivianos,et al.  Inter-datacenter bulk transfers with netstitcher , 2011, SIGCOMM.

[19]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[20]  Rajiv Gandhi,et al.  Improved bounds for scheduling conflicting jobs with minsum criteria , 2008, TALG.

[21]  Amin Vahdat,et al.  BwE: Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing , 2015, Comput. Commun. Rev..

[22]  Pascale Vicat-Blanc Primet,et al.  Scheduling deadline-constrained bulk data transfers to minimize network congestion , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[23]  Krithi Ramamritham,et al.  Tutorial on hard real-time systems , 1989 .

[24]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[25]  Fedor V. Fomin,et al.  Equitable colorings of bounded treewidth graphs , 2005, Theor. Comput. Sci..

[26]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[27]  Guy Kortsarz,et al.  Sum Multicoloring of Graphs , 2000, J. Algorithms.

[28]  Rajeev Motwani,et al.  Non-clairvoyant scheduling , 1994, SODA '93.

[29]  Marek Kubale,et al.  Edge-chromatic sum of trees and bounded cyclicity graphs , 2000, Inf. Process. Lett..

[30]  Olivier Bonaventure,et al.  A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks , 2015, SIGCOMM.

[31]  Min Zhu,et al.  B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.

[32]  Srikanth Kandula,et al.  Traffic engineering with forward fault correction , 2014, SIGCOMM.