On Optimal Broadcasting Scheme for Popular Video Service

This thesis addresses the issue of reliable media delivery over broadcast channels. Sophisticated Video-on-Demand (VoD) broadcasting schemes based on Harmonic Broadcasting (HB) and Pyramidal Broadcasting (PB) allow receivers to tune into the ongoing transmission session of a video-stream at arbitrary time, while still being able to receive the multimedia sequence from the beginning and in complete, after short initial playout latency. Raptor codes, a class of fountain codes, are integrated in the broadcasting schemes by applying them to the application layer (AL-FEC). In addition, we provide service enhancements by using scalable video coding (SVC) to address heterogeneous receiver capabilities and receiving conditions as well as multiple site reception. We propose a Nested Harmonic broadcast scheme and suggest a set of guidelines of how transmission bandwidth should be allocated to the different quality layers in order to obtain best playout times. A realistic protocol environment is only slightly modified to support our system concept. Simulations of a DVB-h system show that our proposed scheme provides high gains in terms of early playouts compared to traditional broadcasting schemes with the same bandwidth expansion. Results also show the superiority of Raptor codes in the sense that it is always better to use Raptor codes for the whole bandwidth allocated for FEC instead of the IP layer multi-protocol encapsulation FEC (MPE-FEC) as DVB-h mandates.

1999

Broadcasting protocols can improve the efficiency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers. We present here two broadcasting protocols that achieve nearly the same low bandwidth as the best extant broadcasting protocol while guaranteeing a lower maximum access time. Our first protocol, cautious harmonic broadcasting, requires somewhat more bandwidth than our second protocol, quasi-harmonic broadcasting, but is also much simpler to implement.

We present a simple fixed-delay broadcasting (SFDB) protocol for video-on-demand. Our protocol assumes that each video to be broadcast will be partitioned into segments of equal duration to be transmitted over a fixed number of video channels. In addition, it requires all customers to wait for the same fixed delay before watching the video they have selected. Our protocol uses timedivision multiplexing to obtain the best transmission schedule for the channel that broadcasts the first segments of the video. The same multiplexing scheme is then reproduced on all the remaining channels. Despite its simplicity, our simple fixed delay broadcasting protocol achieves waiting times comparable to those of much more sophisticated broadcasting protocols. We also show how the protocol can be modified to handle set-top boxes that cannot receive data at more than two or three times the video consumption rate.

Proceedings of the Euromedia 2000 …, 2000

Broadcasting protocols can lower the cost of video-ondemand services by more efficiently distributing all videos that are simultaneously watched by many viewers. The most efficient broadcasting protocols require a customer settop box capable of capturing data from five to seven video channels at the same time.

Broadcasting protocols can improve the eeciency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers. It has been recently shown that broadcasting protocols using a very large numberofvery low bandwidth streams for each video required less total bandwidth than protocols using a few high-bandwidth streams shared by all videos. We present a h ybrid broadcasting protocol that combines the advantages of these two classes of protocols. Our pagoda broadcasting protocol uses only a small number of high-bandwidth streams and requires only slightly more bandwidth than the best extant protocols to achieve a given maximum waiting time.

2001

Dynamic broadcasting protocols for video-on-demand combine features of reactive and proactive distribution protocols to offer good performance over a wide range of request arrival rates. We present a new dynamic broadcasting protocol based upon the fast broadcasting and the new pagoda broadcasting protocols. At low to medium arrival rates, our dynamic fast-pagoda broadcasting protocol performs as well as the best reactive protocols. Its bandwidth requirements at high arrival rates are within ten percent of those of the best static broadcasting protocols

Broadcasting protocols reduce the cost of video-ondemand services by distributing more efficiently videos that are likely to be simultaneously watched by many viewers. Rather than answering individual customer requests, they broadcast the contents of each video according to a fixed schedule.

Electronic …, 1999

Broadcasting protocols can improve the e ciency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by m a n y v i e w ers. It has been recently shown that broadcasting protocols using a very large numberofvery low bandwidth streams for each video required less total bandwidth than protocols using a few high-bandwidth streams shared by all videos.

1998

Broadcasting protocols can improve the efficiency of video on demand services by reducing the bandwidth required to transmit videos that are simultaneously watched by many viewers. We present here a polyharmonic broadcasting protocol that requires less bandwidth than the best extant protocols to achieve the same low maximum waiting time.

1999

Broadcasting protocols can reduce the cost of video-ondemand services by using much less bandwidth to transmit videos that are simultaneously watched by many viewers. Unfortunately, the most efficient broadcasting protocols are also the most difficult to implement because they allocate a multitude of very low bandwidth streams to each video.