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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
