摘要
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.
原文 | English |
---|---|
頁(從 - 到) | 247-260 |
頁數 | 14 |
期刊 | Journal of Parallel and Distributed Computing |
卷 | 69 |
發行號 | 3 |
DOIs | |
出版狀態 | Published - 2009 3月 |
All Science Journal Classification (ASJC) codes
- 軟體
- 理論電腦科學
- 硬體和架構
- 電腦網路與通信
- 人工智慧