A Recursive Frequency-Splitting Scheme for Broadcasting Hot Videos

• Main Authors: Chi-He Chang, 張致和
• Other Authors: Yu-Chee Tseng
• Format: Others
• Language: zh-TW
• Published: 2000
• Online Access: http://ndltd.ncl.edu.tw/handle/77795543002996354329

碩士 === 國立中央大學 === 資訊工程研究所 === 88 === One 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-coming viewers to wait no longer than O(D/2^k) and O(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 over existing schemes in terms of viewer waiting time. Some lower bounds on the waiting time are also developed.