Adaptive Policies for Scheduling With Reconfiguration Delay: An End-to-End Solution for All-Optical Data Centers

All-optical switching networks have been considered a promising candidate for the next generation data center networks thanks to its scalability in data bandwidth and power efficiency. However, the bufferless nature and the nonzero reconfiguration delay of optical switches remain great challenges in deploying all-optical networks. This paper considers the end-to-end scheduling for all-optical data center networks with no in-network buffer and nonzero reconfiguration delay. A framework is proposed to deal with the nonzero reconfiguration delay. The proposed approach constructs an adaptive variant of any given scheduling policy. It is shown that if a scheduling policy guarantees its schedules to have schedule weights close to the MaxWeight schedule (and thus is throughput optimal in the zero reconfiguration regime), then the throughput optimality is inherited by its adaptive variant (in any nonzero reconfiguration delay regime). As a corollary, a class of adaptive variants of the well-known MaxWeight policy is shown to achieve throughput optimality without prior knowledge of the traffic load. Furthermore, through numerical simulations, the simplest such policy, namely, the Adaptive MaxWeight, is shown to exhibit better delay performance than all prior work.

[1]  Eytan Modiano,et al.  Dynamic scheduling with reconfiguration delays , 2016, Queueing Syst. Theory Appl..

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

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

[4]  B.P. Keyworth ROADM subsystems and technologies , 2005, OFC/NFOEC Technical Digest. Optical Fiber Communication Conference, 2005..

[5]  Ivan Plander,et al.  MEMS technology in optical switching , 2017, 2017 IEEE 14th International Scientific Conference on Informatics.

[6]  Cheng-Shang Chang,et al.  Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  B. Hajek Notes for ECE 534 An Exploration of Random Processes for Engineers , 2009 .

[8]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

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

[10]  R. Srikant,et al.  Optimal WDM schedules for optical star networks , 1999, TNET.

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

[12]  Nicholas Bambos,et al.  Adaptive Batch Scheduling for Packet Switching with Delays , 2007 .

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

[14]  Nick McKeown,et al.  Maximum size matching is unstable for any packet switch , 2003, IEEE Communications Letters.

[15]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[16]  Tara Javidi,et al.  WiCOD: Wireless control plane serving an all-optical data center , 2015, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[17]  Leandros Tassiulas,et al.  Adaptive back-pressure congestion control based on local information , 1995, IEEE Trans. Autom. Control..

[18]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[19]  Devavrat Shah,et al.  Delay bounds for approximate maximum weight matching algorithms for input queued switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Devavrat Shah,et al.  Fastpass: a centralized "zero-queue" datacenter network , 2015, SIGCOMM 2015.

[21]  Joseph E. Ford,et al.  A Multiport Microsecond Optical Circuit Switch for Data Center Networking , 2013, IEEE Photonics Technology Letters.

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

[23]  Devavrat Shah,et al.  Optimal Scheduling Algorithms for Input-Queued Switches , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[25]  Tara Javidi,et al.  A General Class of Throughput Optimal Routing Policies in Multi-Hop Wireless Networks , 2009, IEEE Transactions on Information Theory.

[26]  Shivendra S. Panwar,et al.  Frame-based matching algorithms for optical switches , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[27]  Eytan Modiano,et al.  Scheduling in networks with time-varying channels and reconfiguration delay , 2012, 2012 Proceedings IEEE INFOCOM.

[28]  Eytan Modiano,et al.  Scheduling in Networks With Time-Varying Channels and Reconfiguration Delay , 2015, IEEE/ACM Trans. Netw..

[29]  Nicholas Bambos,et al.  Projective Cone Scheduling (PCS) Algorithms for Packet Switches of Maximal Throughput , 2009, IEEE/ACM Transactions on Networking.

[30]  Nick McKeown,et al.  Analysis of scheduling algorithms that provide 100% throughput in input-queued switches , 2001 .

[31]  Paolo Giaccone,et al.  Randomized scheduling algorithms for high-aggregate bandwidth switches , 2003, IEEE J. Sel. Areas Commun..

[32]  Devavrat Shah,et al.  Fastpass , 2014, SIGCOMM.