The enhanced staircase broadcasting for VBR videos

Yu, Hsiang‐Fu; Yang, Hung-Chang; Tseng, Li-Ming; Chen, Yiming

doi:10.1016/j.comcom.2005.02.016

Cited by 10 publications

(1 citation statement)

References 17 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Researchers more and more take into account the possibility of using variable bitrate (VBR) encoded video, since for a given video quality, only half of the average bitrate is necessary when compared to constant bitrate (CBR) [Kong and Lee 2002;Nikolaus et al 2005;Yu et al 2005]. However, for convenience it is usually assumed that a video is CBR encoded for a fixed bitrate b, and one virtual channel is the amount of bandwidth that is necessary to transport b bits/s, both from the hard disks to the server, and from the server to the clients.…”

Section: Related Workmentioning

confidence: 99%

Hierarchical video patching with optimal server bandwidth

Hlavacs

Buchinger

2008

ACM Trans. Multimedia Comput. Commun. Appl.

View full text Add to dashboard Cite

Video patching is a way for transporting true video-on-demand, that is, instantaneous without any delay, from a video server to several clients. Instead of sending a unique stream to each newly arriving client, clients share as many multicast transmissions as possible, and are serviced only those parts of the video that they have missed.We present a novel video patching scheme using hierarchies of patches. Our scheme minimizes the bandwidth needed by the video server, and may result in the fact that clients receive several streams in parallel. We show analytically that for Poisson arrival our algorithm achieves the optimal possible server bandwidth for all schemes where clients share multicast transmissions.We also show, how our approach can be combined with batching. This combination requires less server bandwidth than all fixed start point periodic broadcast algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%