论文信息 - Throughput-maximizing timeslot scheduling for interactive satellite multiclass services

Throughput-maximizing timeslot scheduling for interactive satellite multiclass services

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.

Ho-Jin Lee | Ki-Dong Lee | Deock-Gil Oh | Yong-Hoon Cho

[1] J. Neale,et al. Interactive channel for multimedia satellite networks , 2001, IEEE Commun. Mag..

[2] Pedro Velez-Belchi. Interaction channel for satellite distribution systems , 2000 .

[3] Ki-Dong Lee,et al. Optimal Design of Superframe Pattern for DVB-RCS Return Link , 2002 .

[4] Y. H. Cho. Broadband satellite access network (BSAN) system for interactive multimedia services , 2001 .

[5] Nirwan Ansari,et al. Searching for optimal frame patterns in an integrated TDMA communication system using mean field annealing , 1998, IEEE Trans. Neural Networks.

[6] Sungsoo Park,et al. An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links , 2001, Eur. J. Oper. Res..

[7] C. R. Sergeant. Linear and Combinatorial Programming , 1977 .

[8] Sehun Kim,et al. Time slot assignment in a heterogeneous environment of a SS/TDMA system , 1997 .

[9] Ho-Jin Lee,et al. Optimal scheduling for timeslot assignment in MF-TDMA broadband satellite communications , 2002, Proceedings IEEE 56th Vehicular Technology Conference.