Best First Fit (BFF): An Approach to Partially Reconfigurable Hybrid Circuit and Packet Switching

Hybrid switching for data center networks (DCN) has received considerable research attention recently. A hybrid-switched DCN employs a much faster circuit switch that is reconfigurable with a nontrivial cost, and a much slower packet switch, to interconnect its racks of servers. The research problem is, given a traffic demand (between the racks), how to properly schedule the circuit switch so that it removes most of the traffic demand, leaving little for the slower packet switch to handle. All existing solutions make a convenient but unnecessarily restrictive assumption that when the circuit switch changes from one configuration to another, all input ports have to stop data transmission during the reconfiguration period. However, the circuit switch can usually readily support partial reconfiguration in the following sense: Only the input ports affected by the reconfiguration need to pay a reconfiguration delay, while unaffected input ports can continue to transmit data during the reconfiguration. In this work, we propose BFF (best first fit), the first solution to exploit this partial reconfigurability in hybrid-switched DCNs. BFF not only significantly outperforms but also has much lower computational complexity than the state of the art solutions that do not exploit this partial reconfigurability.

[1]  Amin Vahdat,et al.  Helios: a hybrid electrical/optical switch architecture for modular data centers , 2010, SIGCOMM '10.

[2]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[3]  G. Papen,et al.  A 10 µs hybrid optical-circuit/electrical-packet network for datacenters , 2013, 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC).

[4]  William J. Dally,et al.  Guaranteed scheduling for switches with configuration overhead , 2003, IEEE/ACM Trans. Netw..

[5]  Konstantina Papagiannaki,et al.  c-Through: part-time optics in data centers , 2010, SIGCOMM 2010.

[6]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[7]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[8]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[9]  Chak-Kuen Wong,et al.  Minimizing the Number of Switchings in an SS/TDMA System , 1985, IEEE Trans. Commun..

[10]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[11]  Nikhil R. Devanur,et al.  ProjecToR: Agile Reconfigurable Data Center Interconnect , 2016, SIGCOMM.

[12]  Madeleine Glick,et al.  Design and demonstration of an all-optical hybrid packet and circuit switched network platform for next generation data centers , 2010, 2010 Conference on Optical Fiber Communication (OFC/NFOEC), collocated National Fiber Optic Engineers Conference.

[13]  He Liu,et al.  Circuit Switching Under the Radar with REACToR , 2014, NSDI.

[14]  Frank Werner,et al.  Heuristic Algorithms for Open Shop Scheduling to Minimize Mean Flow Time , Part I : Constructive Algorithms , 2005 .

[15]  Tara Javidi,et al.  End-to-end scheduling for all-optical data centers , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[16]  Lena Wosinska,et al.  Adaptive Open-Shop Scheduling for Optical Interconnection Networks , 2017, Journal of Lightwave Technology.

[17]  Ran Duan,et al.  A scaling algorithm for maximum weight matching in bipartite graphs , 2012, SODA.

[18]  Srinivasan Seshan,et al.  Scheduling techniques for hybrid circuit/packet networks , 2015, CoNEXT.

[19]  Amin Vahdat,et al.  Integrating microsecond circuit switching into the data center , 2013, SIGCOMM.

[20]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[21]  Srinivasan Seshan,et al.  Using Indirect Routing to Recover from Network Traffic Scheduling Estimation Error , 2017, 2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[22]  Mounir Hamdi,et al.  On scheduling optical packet switches with reconfiguration delay , 2003, IEEE J. Sel. Areas Commun..

[23]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[24]  Victor J. Rayward-Smith,et al.  Open shop scheduling with delays , 1992, RAIRO Theor. Informatics Appl..

[25]  Ankit Singla,et al.  OSA: An Optical Switching Architecture for Data Center Networks With Unprecedented Flexibility , 2012, IEEE/ACM Transactions on Networking.

[26]  Albert G. Greenberg,et al.  Ananta: cloud scale load balancing , 2013, SIGCOMM.

[27]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[28]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[29]  Ola Svensson,et al.  Minimizing the sum of weighted completion times in a concurrent open shop , 2010, Oper. Res. Lett..

[30]  Pramod Viswanath,et al.  Costly circuits, submodular schedules and approximate Carathéodory Theorems , 2016, Queueing Syst. Theory Appl..

[31]  Tara Javidi,et al.  Heavy traffic queue length behavior in switches with reconfiguration delay , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[32]  Himanshu Shah,et al.  FireFly , 2014, SIGCOMM.

[33]  Bin Wu,et al.  NXG05-6: Minimum Delay Scheduling in Scalable Hybrid Electronic/Optical Packet Switches , 2006, IEEE Globecom 2006.

[34]  Xiaohong Jiang,et al.  Cost and delay tradeoff in three-stage switch architecture for data center networks , 2013, 2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR).

[35]  Casimer DeCusatis,et al.  Optical Interconnect Networks for Data Communications , 2014, Journal of Lightwave Technology.