Scheduling packet transfers in a class of TDM hierarchical switching systems

A tree network is studied which consists of a set of sending users, connected to a bank of multiplexers, followed by a bank of demultiplexers, which are connected to a set of receiving users. Special cases of this network include satellite-switch/TDM networks. A scheduling algorithm is presented that minimizes the amount of time to transfer a set of packets through the network, where it is assumed the packets are of equal length. The time complexity of the algorithm is O(N/sup 4/C), where N is the number of users and C is the average capacity of the input and output links. The time complexity is an improvement over time complexities of existing algorithms.<
>