Practical Low Delay Broadcast of Compressed Variable Bit Rate Movies

Cherniavsky, Neva; Ladner, Richard E.

doi:10.1109/dcc.2006.66

Cited by 3 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The highperformance algorithms of Backward Segmentation with Equal Bandwidth (BSEB-PC) [14] and Forward Segmentation with Equal Bandwidth (FSEB) [15] are derived from GEBB. The PLDB [16] uses Round Robin schedule to solve windows scheduling for VBR encoded video broadcasting, which also inherited from the algorithm for CBR encoded video [17]. There is a special algorithm Loss-Less Bandwidth-Efficient (LLBE) [18], which uses dynamic programming to do segmentation for minimizing the total bandwidth to broadcast the VBR encoded video for a given number of channels.…”

Section: Introductionmentioning

confidence: 99%

Bandwidth-Scalable video Broadcasting for VBR encoded videos with High Performance

Wang¹,

Gu²,

Kai-zhong³

et al. 2007

The 9th International Conference on Advanced Communication Technology

View full text Add to dashboard Cite

In VOD system, allocating more bandwidths to broadcast hotter videos, the minimal average client waiting time will be achieved. But the hot degree of videos is fluctuating dynamically, and it requires the algorithm to be scalable. According to the research of broadcasting algorithm for CBR encoded video, most of the bandwidth-effective algorithms (such as Greedy Equal Bandwidth Broadcasting (GEBB) and PolyHarmonic Broadcasting (PHB) etc) use narrower channel bandwidth than the video's actual playing rate and greedy downloading method. Based on this theory, some derived highperformance algorithms for VBR encoded videos were proposed, such as FSEB, BSEB-PC, VBHB and SVBR etc. But there is no one that has the capability of changing the bandwidth dynamically at running time( which was also called Channel Transition). This paper presents the first algorithm named Bandwidth-Scalable Broadcasting for VBR encoded videos (SB-VBR) which is able to dynamically shift bandwidth at running time. To get the high performance, this algorithm places the possible longest segments from the last channel to previous channels by utilizing the best bandwidth-effective algorithm model. A new method of Byte Align for B frame is put forward in this paper in order to enhance the performance. With adoption of additional channels, the process of Channel Transition is transparent to clients and easier to be realized. Furthermore, this paper presents a simple method to compute the limitation of performance. Using data from real videos, we compare the total bandwidth needed by our algorithm with the theoretical minimum bandwidth and other algorithms for VBR encoded videos. The experimental results demonstrated that the algorithm is high-performance and practical.

show abstract

Section: Introductionmentioning

confidence: 99%

Bandwidth-Scalable video Broadcasting for VBR encoded videos with High Performance

Wang¹,

Gu²,

Kai-zhong³

et al. 2007

The 9th International Conference on Advanced Communication Technology

View full text Add to dashboard Cite

show abstract

“…Recently, our greedy algorithm for the windows scheduling problem with arbitrary job lengths (presented in Sect. 5) was used in an implementation of an algorithm for periodic broadcast of variable bit rate movies (Cherniavsky and Ladner 2006). In this paper, the induced periodic broadcast problem is mapped into a windows scheduling problem that is solved with the greedy algorithm.…”

Section: Related Workmentioning

confidence: 99%