Generating asymptotically optimal broadcasting schedules to minimize average waiting time
文献类型：期刊论文
| 作者 | Sun, Yi2; Ma, Fei3; Kameda, Tsunehiko1 |
| 刊名 | Discrete mathematics
 |
| 出版日期 | 2009-09-28 |
| 卷号 | 309期号:18页码:5714-5723 |
| 关键词 | Scheduling Video-on-demand Video broadcasting Bandwidth minimization |
| ISSN号 | 0012-365X |
| DOI | 10.1016/j.disc.2008.05.025 |
| 通讯作者 | Kameda, tsunehiko(tiko@cs.sfu.ca) |
| 英文摘要 | The performance of a video-on-demand broadcasting scheme is commonly evaluated by the maximum waiting time encountered by the customer before viewing can start. this paper addresses the issue of minimizing the average waiting time. recently, we proposed harmonic block windows scheduling to specifically minimize the average waiting time for given bandwidth. here, we present an efficient heuristic algorithm that generates asymptotically optimal harmonic block windows schedules. using simulation, we demonstrate that, as we increase the "block size", the normalized average waiting time of these schedules approaches the theoretical minimum achievable by any "fixed start points" schedule. (c) 2008 elsevier b.v. all rights reserved. |
| WOS关键词 | ON-DEMAND SERVICE |
| WOS研究方向 | Mathematics |
| WOS类目 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000271375600024 |
| 出版者 | ELSEVIER SCIENCE BV |
| URI标识 | http://www.irgrid.ac.cn/handle/1471x/2394594 |
| 专题 | 中国科学院大学 |
| 通讯作者 | Kameda, Tsunehiko |
| 作者单位 | 1.Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada 2.Chinese Acad Sci, Grad Sch, Beijing, Peoples R China 3.Microsoft Corp, Redmond, WA 98052 USA |
| 推荐引用方式 GB/T 7714 | Sun, Yi,Ma, Fei,Kameda, Tsunehiko. Generating asymptotically optimal broadcasting schedules to minimize average waiting time[J]. Discrete mathematics,2009,309(18):5714-5723. |
| APA | Sun, Yi,Ma, Fei,&Kameda, Tsunehiko.(2009).Generating asymptotically optimal broadcasting schedules to minimize average waiting time.Discrete mathematics,309(18),5714-5723. |
| MLA | Sun, Yi,et al."Generating asymptotically optimal broadcasting schedules to minimize average waiting time".Discrete mathematics 309.18(2009):5714-5723. |
入库方式： iSwitch采集
来源：中国科学院大学
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。