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

Seamless channel transition for slotted generalized fibonacci broadcasting

TL;DR: A seamless channel transition enhancement on top of the Generalized Fibonacci Broadcasting scheme is proposed so that the service provider is capable of adjusting the channel allocation policy to make the most benefit out of the available bandwidth.
Journal ArticleDOI

Scalable on-demand media streaming for heterogeneous clients

TL;DR: A new periodic broadcast protocol that can be optimized for a given population of clients with heterogeneous reception bandwidths and quality-of-service requirements is developed and complementary client protocols employing work-ahead buffering of data during playback are proposed so as to enable more uniform playback quality when the reception bandwidth is time-varying.
Journal ArticleDOI

Channel folding - an algorithm to improve efficiency of multicast video-on-demand systems

TL;DR: This paper presents this channel folding algorithm in the context of UVoD and derives a performance model to obtain the system latency, the near-optimal channel partition policy, and the client buffer requirement.
Book ChapterDOI

Providing Interactive Functions through Active Client-Buffer Management in Partitioned Video Multicast VoD Systems

TL;DR: The concept of feasible points which can guarantee the continuity of playback after resuming normal play following VCR actions are introduced and show that the active buffer management scheme can implement interactive actions through buffering with a very high probability in a wide range of user interaction levels.
Patent

Channel merging method for vod system

TL;DR: In this paper, the authors propose a channel merging method for a VOD system, which comprises the steps of: in response to requests from a plurality of clients for a video program, establishing a root channel (S1) and at least one sub-channel (S11), said root channel being established according to a request from a client that makes the earliest request, each of said sub-channels (S 11) being established in respond to a later request, and monitoring variation of the number of the clients that are using each of the established channels, and maintaining the
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)