Timeslot assignment for an interactive satellite multimedia network with multiclass RCSTs and services

In this paper we suggest an efficient method for timeslot assignment in an interactive satellite multimedia network with two types of RCSTs and multiple service classes. We mathematically formulate the timeslot assignment problem (TAP) as a nonlinear binary integer programming problem, and convert that problem into an equivalent reduced problem. Then we decompose that reduced problem into two subproblems. With this reduction and decomposition, we promote the computational efficiency in finding the efficient solution of the original problem TAP.