Résumé: We develop an efficient method for optimal timeslot scheduling in an interactive satellite multimedia network. We formulate the timeslot assignment problem as a binary integer programming (BIP) problem, where the throughput is maximized, and decompose this BIP problem into two sub-problems. With this decomposition, we promote the computational efficiency in finding the optimal solution of the original BIP problem.

Langue: Anglais