scispace - formally typeset
Proceedings ArticleDOI

Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems

Kien A. Hua, +1 more
- Vol. 27, Iss: 4, pp 89-100
Reads0
Chats0
TLDR
This study investigates a novel multicast technique, called Skyscraper Broadcasting (SB), for video-on-demand applications, and is able to achieve the low latency of PB while using only 20% of the buffer space required by PPB.
Abstract
We investigate a novel multicast technique, called Skyscraper Broadcasting (SB), for video-on-demand applications. We discuss the data fragmentation technique, the broadcasting strategy, and the client design. We also show the correctness of our technique, and derive mathematical equations to analyze its storage requirement. To assess its performance, we compare it to the latest designs known as Pyramid Broadcasting (PB) and Permutation-Based Pyramid Broadcasting (PPB). Our study indicates that PB offers excellent access latency. However, it requires very large storage space and disk bandwidth at the receiving end. PPB is able to address these problems. However, this is accomplished at the expense of a larger access latency and more complex synchronization. With SB, we are able to achieve the low latency of PB while using only 20% of the buffer space required by PPB.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Improving bandwidth efficiency of video-on-demand servers

TL;DR: Stream tapping is described, a system called stream tapping that allows clients to “tap” into existing streams on the VOD server, and it performs better than many other strategies designed to improve VOD servers.
Journal ArticleDOI

Joint server scheduling and proxy caching for video delivery

TL;DR: In this paper, the authors consider the delivery of video assets over a best-effort network, possibly through a caching proxy located close to the clients generating the requests, and propose a joint server scheduling and prefix/partial caching strategy that minimizes the aggregate transmission rate over the backbone network under a cache of given capacity.
Journal ArticleDOI

Segmentation of multimedia streams for proxy caching

TL;DR: Compared with whole media caching, segmentation-based caching is more effective not only in increased byte-hit ratio but also in lowered fraction of requests that requires delayed start; pyramid segmentation, where segment size increases exponentially, is the best segmentation approach.
Proceedings ArticleDOI

CPM: Adaptive Video-on-Demand with Cooperative Peer Assists and Multicast

TL;DR: The architecture and how CPM is designed to dynamically adapt to a wide range of situations including highly different peer-upload bandwidths, content popularity, user request arrival patterns, video library size, and subscriber population are described.
Journal ArticleDOI

Data broadcasting and seamless channel transition for highly demanded videos

TL;DR: A novel seamless channel transition enhancement is proposed on top of the fast broadcasting (FB) scheme to dynamically change the number of channels assigned to a video on-the-fly to minimize the average waiting experienced by all viewers.
References
More filters
Proceedings ArticleDOI

Scheduling policies for an on-demand video server with batching

TL;DR: It is shown that an FCFS policy that schedules the movie with the longest outstanding request can perform better than the MQL policy that chooses the film with the maximum number of outstanding requests.
Journal ArticleDOI

Metropolitan area video-on-demand service using pyramid broadcasting

TL;DR: This paper provides analytical and experimental evaluations of pyramid broadcasting based on its implementation on an Ethernet LAN, gaining a radical improvement in access time and bandwidth use by using storage at the receiving end.
Journal ArticleDOI

Dynamic batching policies for an on-demand video server

TL;DR: It is shown that a first come, first served (FCFS) policy that schedules the video with the longest outstanding request can perform better than the maximum queue length (MQL) policy, and multicasting is better exploited by scheduling playback of the most popular videos at predetermined, regular intervals (hence, termed FCFS-n).
Journal ArticleDOI

The Asynchronous Transfer Mode: a tutorial

TL;DR: This report is a tutorial aimed at providing the reader with background information that is necessary to understand the debate about potential virtues and shortcomings of the ATM.
Proceedings ArticleDOI

On optimal batching policies for video-on-demand storage servers

TL;DR: This study proposes a batching policy that schedules the video with the maximum factored queue length and shows that MFQ yields excellent empirical results in terms of standard performance measures such as average latency time, defection rates and fairness.
Related Papers (5)