Burst scheduling algorithms for SS/TDMA systems
Takeshi Mizuike, Yasuhiko Ito, Dale J. Kennedy, Lan N. Nguyen · IEEE Transactions on Communications · 1991
Efficient algorithms that generate a detailed operation plan for satellite-switched time-division multiple access (SS/TDMA) systems are proposed. A burst time plan generation problem is analyzed and two algorithms for burst scheduling are presented. The first method is an algorithm based upon a bin pack problem. The other algorithm schedules new bursts while reassigning already scheduled bursts by a single machine scheduling model. These algorithms are shown to be applicable to practical systems operating with transponder hopping and multidestination bursts. Simulation results for a number of example problems are presented.>