Minimum overhead scheduling of optical packet switches
光分组交换的最小开销调度法

During scheduling optical packets in an optical switch, the main problem focus on finding a schedule to send all packets to the output ports in minimum makespan, which include the actual traffic-sending time and the reconfiguration delay. In order to attain this aim, a new Traffic Exhaust Matching (TEM) algorithm based on leaky bucket is presented in this paper. The time complexity of this novel algorithm is O(N2) and it can achieve 100% throughput. Simulation results demonstrate that TEM is superior to other algorithms such as ADJUST and DOUBLE in terms of traffic transmission delay and time complexity.