Solution of an assignment problem using a rerrangement procedure
Abstract
A heuristic algorithm is developed for optimizing access to telecommunications satellites in order to maximize the traffic flow. The algorithm takes into account the total traffic accessing the satellite components, i.e., the transmission bus, the repeaters, emitters, etc. The goal is to minimize the transmission time within the traffic matrix. The model notes the number of available channels, the traffic levels and message lengths, and proceeds to assign signals to open channels. It is assumed that the demand is not be random, so statistical means are defined for anticipating the distribution of the transmissions for scheduling the access to emitters and receivers. The robustness of the algorithm is concluded sufficient for its use in evolving traffic situations.
 Publication:

Annales des Telecommunications
 Pub Date:
 April 1986
 Bibcode:
 1986AnTel..41..121L
 Keywords:

 Communication Theory;
 Resource Allocation;
 Telecommunication;
 Traffic Control;
 Transmission Efficiency;
 Computerized Simulation;
 Dynamic Programming;
 Heuristic Methods;
 Matrices (Mathematics);
 Run Time (Computers);
 Communications and Radar