Search

In this work, we propose a reverse-order scheduling (ROS) method for broadcasting a video over a single channel. The method firstly partitions the video into equal-length segments, then divides these segments into groups, and finally broadcasts the segments in the same group over the same subchannel in the reverse order of their indices. Further, we also provide a thorough analysis of the performance of the ROS method. The main contribution of the ROS method is to exhibit not only a shorter waiting time but also a smaller buffer requirement. Compared with the Alternative Broadcasting (AB), Hopping-Insertion (HI), and SingBroad methods, the proposed ROS method reduces the average waiting time by 38%\sim96%, 18%\sim63%, and 3%\sim18%, respectively, while the bandwidth of a single channel is capable of more than triple the consumption rate. Further, the ROS method reduces the buffer requirement by 30%\sim70% and 30%\sim55% as compared with the AB and SingBroad methods, respectively, while the buffer requirement of the HI method is not given. [ABSTRACT FROM PUBLISHER]

In the real world, the viewers may want to have an ability to choose a desired video from some interested videos by scanning the first few minutes of these videos. Obviously, a broadcasting method, which allows subscribers buffering the data of the first few minutes of all popular videos, could provide this service without the startup latency. Fortunately, the capacity of harddisk or flash memory will increase and prices will become more affordable, enough to support the space needed to save such a large amount of data. In this work, we propose a zero-latency scheduling scheme (ZLSS) for broadcasting popular movies. The ZLSS method not only provides a zero-latency service for subscribers who buffering the data of the first few minutes of a video, but also provides a service with a shorter waiting time for subscribers who buffering nothing of the desired video. Compared with the previous method, the ZLSS method reduces the buffer requirement and the maximum waiting time by 10~50%1. [ABSTRACT FROM AUTHOR]