97. ADAPTIVE POLICIES FOR SCHEDULING OF ALL-OPTICAL DATA CENTERS

Department: Electrical & Computer Engineering
Research Institute Affiliation: Center for Networked Systems (CNS)
Faculty Advisor(s): Tara Javidi

Primary Student
Name: Changheng Wang
Email: chw009@ucsd.edu
Phone: 920-750-2504
Grad Year: 2018

Abstract
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 work 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 (AMW), is shown to exhibit better delay performance than all prior work.

Industry Application Area(s)
Control Systems | Electronics/Photonics | Internet, Networking, Systems

Related Links:

  1. http://arxiv.org/abs/1511.03417

« Back to Posters or Search Results


Contact:   researchexpo@soe.ucsd.edu   (858) 534-6068