Title :
On fast algorithms for TDM switching assignments in terrestrial and satellite networks
Author_Institution :
Telecom Australia Res. Labs., Clayton, Vic., Australia
fDate :
8/1/1995 12:00:00 AM
Abstract :
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(K4) 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
Keywords :
graph theory; satellite communication; switching networks; telecommunication traffic; time division multiple access; time division multiplexing; TDM lines; TDM switching assignments; TDMA; bipartite graph; fast algorithms; network circulation formulations; network model; satellite networks; switching configurations bound; terrestrial networks; traffic; Bipartite graph; Downlink; Feeds; Intelligent networks; Routing; Satellites; Switches; Telecommunication traffic; Time division multiple access; Time division multiplexing;
Journal_Title :
Communications, IEEE Transactions on
