Results 1 - 10 of 27

Video-on-Demand Broadcasting Protocols: A Comprehensive Study

by Ailan Hu - In Proceedings of IEEE INFOCOM , 2001
"... Broadcasting protocols are proved to be efficient for transmitting most of the popular videos in video-on-demand systems. We propose a generalized analytical approach to evaluate the efficiency of the broadcasting protocols and derive the theoretical lower bandwidth requirement bound for any periodi ..."
Abstract - Cited by 106 (0 self) - Add to MetaCart
Broadcasting protocols are proved to be efficient for transmitting most of the popular videos in video-on-demand systems. We propose a generalized analytical approach to evaluate the efficiency of the broadcasting protocols and derive the theoretical lower bandwidth requirement bound for any periodic broadcasting protocols. By means of the proposed analytical tool - temporal-bandwidth map, the approach can be used to direct the design of periodic broadcasting protocols to achieve different goals, e.g., server bandwidth requirement, client waiting time, client I/O bandwidth requirement etc. As the most important performance index in VOD system is the required server bandwidth, we give the solution to achieve the optimal bandwidth efficiency given client waiting time requirement and the length of the video. To take into account the popular compressed video with variable bit rate, the optimal approach is applied readily to the VBR videos and can achieve zero loss and best bandwidth efficiency. We give proof why existing techniques such as smoothing and prefetching is not necessary and in some cases inefficient in broadcasting protocols. We also discuss how broadcasting schemes can be tailored to support true and interactive VOD service. An insightful comparison between broadcasting and multicasting schemes is also given in this paper. I.
(Show Context)

An Interactive Broadcasting Protocol for Video-on-Demand

by Jehan-Francois Paris - Proceedings of the 1999 Multimedia Computing and Networking Conference , 2001
"... Broadcasting protocols reduce the cost of video-ondemand services by distributing more efficiently videos that are likely to be simultaneously watched by several viewers. Unfortunately, they do not allow the customer to pause, move fast forward or backward while watching a video. We present an inte ..."
Abstract - Cited by 71 (8 self) - Add to MetaCart
Broadcasting protocols reduce the cost of video-ondemand services by distributing more efficiently videos that are likely to be simultaneously watched by several viewers. Unfortunately, they do not allow the customer to pause, move fast forward or backward while watching a video. We present an interactive pagoda broadcasting protocol that provides these functions at a very reasonable cost. Our protocol is based on the pagoda broadcasting protocol and requires a set-top box buffer large enough to keep in storage all video data until the customer has watched the entire video. As a result, rewind and pause interactions do not require any server intervention. To minimize the bandwidth requirements of fast forward interactions, the server only transmits the segments that are not available on any of the server broadcasting channels. We evaluate the overhead of these fast forward operations through a probabilistic model. Our data indicate that the most costly fast forward operations are those starting at the beginning of the video and jumping to the beginning of the second half of the video while most fast-forward operation taking place during the second half of the video require little or no additional data. 1.

Harmonic Broadcasting Is Bandwidth-Optimal Assuming Constant Bit Rate

by Lars Engebretsen, Madhu Sudan - in Proc. Annual ACM-SIAM Symposium on Discrete Algorithms 2002 , 2002
"... Harmonic broadcasting was introduced by Juhn and Tseng in 1997 as a way to reduce the bandwidth requirements required for video-on-demand broadcasting. ..."
Abstract - Cited by 16 (0 self) - Add to MetaCart
Harmonic broadcasting was introduced by Juhn and Tseng in 1997 as a way to reduce the bandwidth requirements required for video-on-demand broadcasting.
(Show Context)

Tabbycat: an Inexpensive Scalable Server for Video-on-Demand

by Karthik Thirumalai, Jehan-François Pâris, et al. - IN PROC. OF IEEE INT'L. CONF. ON COMMUNICATIONS , 2003
"... Tabbycat is a video server prototype demonstrating the benefits of a proactive approach for distributing popular videos on demand to a large customer base. Rather than reacting to individual customer requests, Tabbycat broadcasts the contents of the most popular videos according to a fixed schedule. ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
Tabbycat is a video server prototype demonstrating the benefits of a proactive approach for distributing popular videos on demand to a large customer base. Rather than reacting to individual customer requests, Tabbycat broadcasts the contents of the most popular videos according to a fixed schedule. As a result, the number of customers watching a given video does not affect the cost of distributing it. We found that one workstation with a single ATA disk drive and a Fast Ethernet interface could distribute three two-hour videos while achieving a maximum customer waiting time of less than four minutes.

An efficient VOD broadcasting scheme with user bandwidth limit

by Edward Mingjun Yan, Tiko Kameda - Proc. SPIE/ACM Conf. on Multimedia Computing and Networking , 2003
"... To address the scalability issue in video-on-demand systems, many broadcasting schemes have been proposed to date. The major performance parameters of such a broadcasting scheme are the server broadcast bandwidth, the user bandwidth and the user’s initial waiting time. The broadcasting schemes with ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
To address the scalability issue in video-on-demand systems, many broadcasting schemes have been proposed to date. The major performance parameters of such a broadcasting scheme are the server broadcast bandwidth, the user bandwidth and the user’s initial waiting time. The broadcasting schemes with the least server bandwidth requirement currently known require the same bandwidth on the user side as that on the server side. We propose a new broadcast scheme, named Generalized Fibonacci Broadcasting (GFB), to address the issue of limiting the user-side bandwidth requirement. For any given combination of the server and user bandwidths, GFB can always achieve the least user waiting time among all the currently known broadcasting schemes. Furthermore, it would be very easy to implement GFB. 1.
(Show Context)

Scalable streaming for heterogeneous clients

by Liqi Shi, Phillipa Sessini, Zongpeng Li, Derek L. Eager - In Proc. of ACM Multimedia , 2006
"... Periodic broadcast protocols enable the efficient streaming of highly popular media files to large numbers of concurrent clients. Most previous periodic broadcast protocols, however, assume that all clients can receive at the same rate, and also assume that available bandwidth is not time-varying. I ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Periodic broadcast protocols enable the efficient streaming of highly popular media files to large numbers of concurrent clients. Most previous periodic broadcast protocols, however, assume that all clients can receive at the same rate, and also assume that available bandwidth is not time-varying. In this paper, we first develop a new periodic broadcast protocol, Optimized Heterogeneous Periodic Broadcast (OHPB), that can be optimized for a given population of clients with heterogeneous reception bandwidths and quality-of-service requirements. The OHPB protocol utilizes an optimized segment size progression determined by solving a linear optimization model that takes as input the client population characteristics and an objective function such as mean client startup delay. We then propose complementary client protocols employing work-ahead buffering of data during playback, so as to enable more uniform playback quality when the available bandwidth is time-varying.

General frame level segmentation for periodic broadcast of vbr videos

by Shufang Wu - Proc. 12th Int’l Conf. on Conference on Computer Communications and Networks (IC3N’03 , 2003
"... Abstract—Broadcast schemes scale well in transporting popular movies in video-on-demand (VOD) systems. A large number of broadcast schemes have been proposed, a small number of which deal with the variable bit rate (VBR) encoded videos used in practice. Among them, some take the frame sequence of a ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
Abstract—Broadcast schemes scale well in transporting popular movies in video-on-demand (VOD) systems. A large number of broadcast schemes have been proposed, a small number of which deal with the variable bit rate (VBR) encoded videos used in practice. Among them, some take the frame sequence of a VBR video into consideration. Although a few of them can achieve optimal server bandwidth under certain conditions, they cannot ensure proper decoding and full display of each downloaded segment if there are frames, for example, B frames in MPEG, that require future reference frames for decoding. Here we present a novel lossless scheme, General Frame Level Segmentation (GFLS), to solves the above two problems. GFLS uses a segment-end-flag (SEF) sequence based on the frame interdependency to ensure continuous display of the whole video. Its important feature is that, both frame sequences in transmission order and in display order of a video have the same SEF sequence. We provide an efficient algorithm that uses the SEF sequence to implement GFLS. Keywords-video-on-demand; periodic broadcast; VBR videos; frame level segmentation. I.
(Show Context)

On-Demand Media Streaming on the Internet: Trends and Issues

by Anirban Mahanti
"... Recent years have seen significant deployment of multimedia applications. In many of these applications, stored media files are delivered on-demand, as for example in video-on-demand systems. Such applications require high bandwidth, and are sensitive to loss and delay. The current "best effort ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Recent years have seen significant deployment of multimedia applications. In many of these applications, stored media files are delivered on-demand, as for example in video-on-demand systems. Such applications require high bandwidth, and are sensitive to loss and delay. The current "best effort" Internet, however, does not provide any quality of service (QoS) guarantees, thus posing several impediments. This paper presents a survey of the current research efforts towards effective on-demand media streaming, focusing on server design issues, network infrastructure support, and application-level QoS support. The key topics covered include standardization efforts, multicast service models, stream merging, rate control, and caching. The paper concludes with a brief summary of the important results, and a few pointers for future work.

Scalable On-Demand Media Streaming for Heterogeneous Clients

by Phillipa Gill, Liqi Shi, Zongpeng Li, Derek L. Eager
"... Periodic broadcast protocols enable efficient streaming of highly popular media files to large numbers of concurrent clients. Most previous periodic broadcast protocols, however, assume that all clients can receive at the same rate, and also assume that reception bandwidth is not time-varying. In th ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Periodic broadcast protocols enable efficient streaming of highly popular media files to large numbers of concurrent clients. Most previous periodic broadcast protocols, however, assume that all clients can receive at the same rate, and also assume that reception bandwidth is not time-varying. In this article, we first develop a new periodic broadcast protocol, Optimized Heterogeneous Periodic Broadcast (OHPB), that can be optimized for a given population of clients with heterogeneous reception bandwidths and quality-of-service requirements. The OHPB protocol utilizes an optimized segment size progression determined by solving a linear optimization model that takes as input the client population characteristics and an objective function such as mean client startup delay. We then develop a generalization of the OHPB linear optimization model that allows optimal server bandwidth allocation among multiple concurrent OHPB broadcasts, wherein each media file and its clients may have different characteristics. Finally, we propose complementary client protocols employing work-ahead buffering of data during playback, so

Limiting the Client Bandwidth of Broadcasting Protocols for Video-on-Demand

by Jehan-françois Pâris, Darrell D. E. Long - Proceedings of the Euromedia 2000 Conference , 2000
"... pagoda broadcasting. 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 ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
pagoda broadcasting. 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. We show how to modify existing broadcasting protocols so that their client bandwidth would never exceed three to four channels and apply our method to the fast broadcasting and the new pagoda broadcasting protocols. Our data show that this modification has only a moderate effect on the overall performance of the two protocols because their server bandwidth never increases by more than 15 percent. 1.