Incremental time-slot assignment in SS/TDMA satellite systems

The heterogeneous traffic in this environment can be categorized into a rapidly changing type composed of packet switched data traffic and a relatively static type composed of circuit switched voice traffic. From the time-slot assignment viewpoint, the problem is to construct an efficient TDMA frame that permits the static voice traffic to be transmitted and, then, on a frame-by-frame basis to attempt to insert the data packets into the slots that are unused by the voice traffic. It is proved that the problem is NP-complete, even for very simple traffic configurations. Several suboptimal fast heuristic algorithms are presented and empirically compared by experiments on randomly generated traffic patterns. The experiments reveal that, on the average, the algorithms give close to the optimal performance