Modeling Resource Scheduling in Optical Switching DCNs Under Bursty and Skewed Traffic

Abstract

When optical switching is deployed in Data Center Networks (DCNs), the reconfiguration of the optical switching matrix leads to substantially longer overheads, posing a significant impact on the system performance. Despite the extensive studies on the scheduling algorithms based on demand matrix decomposition (DMD), the stateful and irregular nature of the scheduling processes hinders the development of quantitative models, thereby limiting our understanding of resource scheduling in optical switching DCNs based on DMD. In this article, we model the DMD based resource scheduling process under a bursty and skewed traffic pattern and derive closed-form equations for the burst completion time. Our study shows that an increased reconfiguration delay will lead to an approximate linear increase in the burst completion time. Our study also demonstrates that the size of the slot and the maximum allowed duration of one match are approximately inversely proportional to the burst completion time, with diminishing marginal returns.