A channel-based heuristic distribution protocol for video-on-demand
Proceedings. IEEE International Conference on Multimedia and Expo - Tập 1 - Trang 245-248 vol.1
Tóm tắt
We present a new dynamic broadcasting protocol improving upon existing protocols in two ways. First, our channel-based heuristic distribution protocol uses an heuristic segment allocation scheme for the k broadcasting channels assigned to each video. Second, it can require all customers to wait for a minimum waiting time before watching the video of their choice. As a result, our protocol performs as well as the best reactive distribution protocols at low request arrival rates and as well as the best broadcasting protocols at high request arrival rates.
Từ khóa
#Protocols #Broadcasting #Multimedia communication #Bandwidth #Video on demand #Computer science #US Department of Transportation #Buffer storage #FrequencyTài liệu tham khảo
10.1109/ICDSC.2001.918996
10.1109/ICCCN.1997.623313
10.1007/s005300050023
cai, 1999, Optimizing patching performance, Proc ACM/SPIE Multimedia Computing and Networking Conf
10.1109/11.713059
gao, 1999, Catching and selective catching: Efficient latency reduction techniques for delivering continuous multimedia streams, Proc 1999 ACM Multimedia Conf, 203
eager, 1999, Minimizing bandwidth requirements for on-demand data delivery, Proc 5th Int Workshop on Advances in Multimedia Information Systems
10.1007/s005300050016
p�ris, 2001, A fixed-delay broadcasting protocol for video-on-demand, Proc 10th Int Conf on Computer Communications and Networks, 418, 10.1109/ICCCN.2001.956299
p�ris, 2000, A universal distribution protocol for video-on-demand, Proc IEEE Int Conf Multimedia and Expo 2000, 1, 49