View in EDS

Reverse Fast Broadcasting (RFB) for Video-on-Demand Applications.

Saved in:
Bibliographic Details
Title: Reverse Fast Broadcasting (RFB) for Video-on-Demand Applications.
Authors: Hsiang-Fu Yu1,2 yu@dslab.csie.ncu.edu.tw, Hung-Chang Yang1 cyht@dslab.csie.ncu.edu.tw, Li-Ming Tseng1 tsenglm@ncu.edu.tw
Source: IEEE Transactions on Broadcasting. Mar2007 Part 1, Vol. 53 Issue 1, p103-111. 9p. 8 Diagrams, 1 Chart, 4 Graphs.
Subjects: Video on demand, Broadcasting industry, Digital communications, Digital video, Streaming technology, Data transmission systems, Streaming video & television, Videos, Technological innovations
Abstract: A popular video can be broadcast by partitioning the video into segments, which are broadcast on several channels simultaneously and periodically. This method allows multiple users to share channels, leading to higher bandwidth utilization. Previous studies mainly focus on reducing viewers' waiting time. This work studies another important issue, namely client buffer' savings. A reverse fast broadcasting (RFB) scheme is proposed to alleviate the buffer problem. There are two specific properties for RFB. First, this scheme arranges the segments in descending order of their numeric indices on each channel at the server end. Second, RFB requires a client to receive segments as late as possible, such that the client buffers the smallest number of segments. RFB has the same waiting time as the fast broadcasting (FB) scheme, but just needs a half of buffer spaces required by FB. RFB also requires smaller client buffers than the pyramid broadcasting (PB), skyscraper broadcasting (SkB), greedy disk-conserving broadcasting (GDB), BroadCatch, and recursive frequency-splitting schemes. Moreover, if we apply the same changes to the PB, SkB and GDB schemes, their buffer requirements decrease by 25% to 75%. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Broadcasting is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:A popular video can be broadcast by partitioning the video into segments, which are broadcast on several channels simultaneously and periodically. This method allows multiple users to share channels, leading to higher bandwidth utilization. Previous studies mainly focus on reducing viewers' waiting time. This work studies another important issue, namely client buffer' savings. A reverse fast broadcasting (RFB) scheme is proposed to alleviate the buffer problem. There are two specific properties for RFB. First, this scheme arranges the segments in descending order of their numeric indices on each channel at the server end. Second, RFB requires a client to receive segments as late as possible, such that the client buffers the smallest number of segments. RFB has the same waiting time as the fast broadcasting (FB) scheme, but just needs a half of buffer spaces required by FB. RFB also requires smaller client buffers than the pyramid broadcasting (PB), skyscraper broadcasting (SkB), greedy disk-conserving broadcasting (GDB), BroadCatch, and recursive frequency-splitting schemes. Moreover, if we apply the same changes to the PB, SkB and GDB schemes, their buffer requirements decrease by 25% to 75%. [ABSTRACT FROM AUTHOR]
ISSN:00189316
DOI:10.1109/TBC.2006.888917