In the context of extensive data transmission and exchange operations in data centers, there is a high-performance demand for switching equipment. Switching equipment not only needs to exhibit excellent scalability but also must provide large bandwidth and low switching delay. Fast optical switches possess superior performance with extremely faster switching rates and access bandwidth than electrical switches. Faced with the ever-growing demand for data exchange in the present day, the structure of switches is evolving towards all-optical directions to achieve greater access rates and processing performance. In the study of fast optical switches, the scheduling algorithms focus on achieving a 100% throughput, with relatively less emphasis on ensuring Quality of Service (QoS).

This paper proposes an iterative scheduling algorithm for optical switches that ensures latency, based on the principles of matrix decomposition and traffic shaping. We combine iteration and round robin mechanisms, and propose the Iterative Round Robin (IRR) scheduling algorithm. Initially, the IRR algorithm maps the traffic rate matrix to a traffic matrix, and then calculates the service requirement matrix sequence based on the service requirements of the traffic matrix. Finally the scheduling matrix sequence is extracted from the service requirement matrix sequence.

Theoretical analysis validates that the IRR scheduling algorithm can provide port-based guaranteed latency and provides a method for calculating latency upper bounds under the given traffic conditions.

The IRR scheduling algorithm can be applied in optimizing the latency performance of optical switches and in designing optical switch systems with guaranteed latency.This contributes crucial support to the provision of deterministic QoS for the next generation all-optical networks.