On fast algorithms for TDM switching assignments in terrestrial and satellite networks

Bipartite graph and network circulation formulations of the TDM switching assignment problem are compared; a correct proof is given of the existence of a feasible circulation in the network model corresponding to a valid switching assignment. Dividing users into groups, an O(K/sup 4/) algorithm for solving the assignment problem is described where K is the number of TDM lines, and a bound is derived on the number of switching configurations.<
>