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
Patent

Method for reduced bandwidth for on-demand data streaming using mini-clusters

TL;DR: In this article, the authors propose a decoupling of the channels used for the delivery of the video into leading and trailing groups, and a cluster defining on transmission of a program can then be broken into mini-clusters in the leading group.
Proceedings ArticleDOI

Exploiting client bandwidth for more efficient video broadcast

TL;DR: This work proposes a new technique which allows a video session to download data through several client channels and proves the correctness of this client-centric approach, and provides analytical evaluations to show that it has significantly better performance than skyscraper broadcasting technique which has been shown to offer the best performance to date.
Patent

Variant streams for real-time or near real-time streaming to provide failover protection

TL;DR: In this paper, the authors propose a failover protection mechanism for real-time streaming of content using transfer protocols such as HTTP compliant protocol, where a client attempts to download the playlist file(s) from a first uniform resource locator (URL) using a first stream associated with the first server device or the first content distribution service.
Patent

Method for caching of media files to reduce delivery cost

TL;DR: In this paper, the authors divide the programs into prefixes and suffixes of data and choose the prefixes so as to maximize the efficiency of data transfer taking into account the cost of storing the data as well as bandwidth costs.
Proceedings ArticleDOI

Scalable streaming for heterogeneous clients

TL;DR: A new periodic broadcast protocol is developed that can be optimized for a given population of clients with heterogeneous reception bandwidths and quality-of-service requirements, and complementary client protocols employing work-ahead buffering of data during playback are proposed to enable more uniform playback quality when the available bandwidth is time-varying.
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)