An adaptive time slot assignment algorithm for variable bandwidth switching systems

In this paper, we consider an optimal (i.e., minimum scheduling length) time slot assignment (for short, TSA) problem in variable bandwidth switching systems. In previous studies, the interdependencies between two consecutive switching configurations were neglected. However, it is highly probable that the amount of change between the switching configurations will be small. Therefore, it is unnecessary to schedule all traffic for each configuration if we preserve the previous switching configuration and update the switching configuration appropriately according to changes in traffic demand. The adaptive TSA algorithm proposed in this paper employs such an idea and reduces the computational burden of finding switching configurations. The computational complexity of the proposed algorithm and simulation results are reported. The results show that our algorithm is more efficient than existing optimal TSA algorithms.