ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article Throughput-maximizing timeslot scheduling for interactive satellite multiclass services
Cited 17 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Ki-Dong Lee, Ho-Jin Lee, Yong-Hoon Cho, Deock Gil Oh
Issue Date
2003-06
Citation
IEEE Communications Letters, v.7, no.6, pp.263-265
ISSN
1089-7798
Publisher
IEEE
Language
English
Type
Journal Article
DOI
https://dx.doi.org/10.1109/LCOMM.2003.813997
Abstract
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.
KSP Keywords
Assignment problem, Binary Integer Programming, Computational Efficiency, Multiclass services, Multimedia networks, Optimal Solution, sub-problems