Abstract: Thanks to the reconfigurable ability of optical switching technologies, data centers are able to adjust topologies at runtime to adapt to traffic dynamics generated by new technologies and applications. However, existing solutions for reconfigurable and traffic scheduling suffer from the high flexibility of configurations and traffic dynamics. Static solutions overlook practical constraints, fail to adapt to real-production environments. Meanwhile, dynamic solutions cannot guarantee global optimization, resulting in decrease in overall network performance. To bridge the gap, this paper first formalizes the joint reconfiguration and traffic scheduling as the k-weight limited matching problem and proposes an approximation algorithm for global updates based on priority queues and greedy iteration. Then, this paper divides the traffic dynamics into three different scenarios, each of which is addressed by an efficient local scheduling algorithm. To further improve network performance of both global update and local scheduling, this paper proposes SYNC (Static and Dynamic Network Coordinator) through a periodic global optimization and graph structure-aware mechanism to achieve the trade-off between throughput and scheduling efficiency. This paper conducted simulation experiments based on real-world examples and synthetic datasets generated by RMAT. Experiments show that SYNC provides an efficient, stable and scalable scheduling solution for reconfigurable data center networks. Compared with existing solutions, SYNC reduces running time by 36.56%, and exhibits high stability at runtime.