This paper investigates the time-constrained data scheduling problem for broadcasting data of non-uniform length under multiple broadcast channel environments. We first define and analyze the problem of time-constrained services and then propose an effective scheduling algorithm that constructs a broadcast program to satisfy as many clients' requirements within the expected times as possible. The performance study reveals the superiority of the proposed method.
|頁（從 - 到）||247-260|
|期刊||Journal of Parallel and Distributed Computing|
|出版狀態||Published - 2009 3月|
All Science Journal Classification (ASJC) codes