An adaptive scheduling algorithm for TDM switching systems

[[abstract]]Consideration is given to the scheduling problem for avoiding output conflicts in time-division multiplex (TDM) switching systems. In many applications, if a source transmits a packet to a destination in a frame, it is highly probable that it will also transmit another packet to the same destination in the next frame. So it is not necessary to schedule incoming packets for every frame if all the switching patterns for the nearest scheduled frame can be preserved and the patterns updated appropriately according to changes in traffic demand. An adaptive algorithm of a lower time complexity which assigns time slots to packets according to the changes in traffic demands is given. This algorithm has the worst case time complexity O(N2L), where L is the TDM frame length and N is the switch size. Simulation results show that the algorithm is efficient for interdependent traffic and for random traffic.[[fileno]]2030201030007[[department]]資訊工程學