Harmonic broadcasting for video-on-demand service

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29199

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29199

题名:	Harmonic broadcasting for video-on-demand service
作者:	Juhn,LS;Tseng,LM
贡献者:	資訊工程研究所
日期:	1997
上传时间:	2010-06-29 20:16:10 (UTC+8)
出版者:	中央大學
摘要:	Using conventional broadcasting, if we want to support a 120-minute popular movie every 10 minutes, we need 12 video channels. Suppose the set-top box at client end call buffer portions of the playing video on disk. Pyramid broadcasting schemes can reduce the bandwidth. requirements to 5.7 channels. We present a new scheme which only needs 3.2 channels. For a movie with length D minutes, if we want to reduce the viewer waiting time to D/N minutes, we only need to allocate H(N) video channels to broadcast the movie periodically. Where H(N) is the harmonic number of N, H(N)=1+1/2+...+1/N. In order to support video-on-demand service for a popular movie, the new scheme greatly reduce the bandwidth requirements.
關聯:	IEEE TRANSACTIONS ON BROADCASTING
显示于类别:	[資訊工程研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	532	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing