完整後設資料紀錄
DC 欄位語言
dc.contributor.authorTseng, YCen_US
dc.contributor.authorYang, MHen_US
dc.contributor.authorChang, CHen_US
dc.date.accessioned2014-12-08T15:42:05Z-
dc.date.available2014-12-08T15:42:05Z-
dc.date.issued2002-08-01en_US
dc.identifier.issn0090-6778en_US
dc.identifier.urihttp://dx.doi.org/10.1109/TCOMM.2002.801466en_US
dc.identifier.urihttp://hdl.handle.net/11536/28596-
dc.description.abstractOne way to broadcast a popular/hot video is to let multiple users share a few channels. The stress on the scarce channels can be alleviated without sacrificing viewer waiting time. One common approach is to partition the video into fixed-length segments, which are broadcast on several channels periodically. Two representative approaches are the Fast Broadcasting scheme and the PAGODA scheme, which can broadcast a video using k channels by having new viewers wait no longer than Theta(D/2(k)) and Theta(D/5(k/2)) time, respectively, where D is the length of the video. In this paper, we propose a new scheme, called Recursive Frequency Splitting (RFS), that significantly improves on existing schemes in terms of viewer waiting time. Some lower bounds on the viewers' waiting time are also developed.en_US
dc.language.isoen_USen_US
dc.subjectbroadband networksen_US
dc.subjectbroadcastingen_US
dc.subjectcable TVen_US
dc.subjectdigital video broadcastingen_US
dc.subjectschedulingen_US
dc.subjectvideo-on-demand (VOD)en_US
dc.titleRecursive frequency-splitting scheme for broadcasting hot videos in VOD serviceen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/TCOMM.2002.801466en_US
dc.identifier.journalIEEE TRANSACTIONS ON COMMUNICATIONSen_US
dc.citation.volume50en_US
dc.citation.issue8en_US
dc.citation.spage1348en_US
dc.citation.epage1355en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000177644800022-
dc.citation.woscount82-
顯示於類別:期刊論文


文件中的檔案:

  1. 000177644800022.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。