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
Book ChapterDOI

HSM: A Hybrid Streaming Mechanism for Delay-Tolerant Multimedia Applications

TL;DR: Simulation results demonstrate that by leveraging the delay tolerance of clients, and by combining the dynamic download and streaming mechanisms, HSM performs better than directly streaming from edge servers, serving on an average 40% more client requests.
Proceedings ArticleDOI

Facilitating multicast in VoD systems by content pre-placement and multistage batching

TL;DR: A novel, scalable video on demand delivery approach that attempts to take advantage of multicast in hierarchical distribution networks, and proposes two approaches, DWaFiL and WaFiL that outperform popular alternatives such as caching and replication in terms of scalability and server bandwidth.
Dissertation

Near-optimal Heuristic Solution for Truncated Harmonic Windows Scheduling and Harmonic Group Windows Scheduling

Zhiwen Lin
TL;DR: The Generalized Fixed-Delay Pagoda Broadcasting (GFDPB), based on the fixed-delay policy, improves Bar-Noy et al.'s greedy algorithm for the Harmonic Windows Scheduling Problem and presents a hybrid broadcasting scheme, Preloading Page-Set Broadcasting (PPSB), which compromises between the average waiting time and the maximum waiting time of HPB.
Proceedings ArticleDOI

Hybrid broadcasting protocols: a comparative study

TL;DR: A comparative study between previous known hydride protocols namely the universal broadcasting protocols (UD), the dynamic heuristic broadcasting protocol (DHB), and the recent hybrid protocol slotted stream tapping (SST) is presented, showing that SST outperforms the two others at low workloads.
Proceedings ArticleDOI

An Efficient Periodic Broadcasting Scheme for Mobile Video-on-Demand System

TL;DR: The proposed scheme improves the existing Staggered Broadcasting scheme by partitioning the network channels into regular and sub-channels for reducing the service latency of mobile users as well as minimizing the server bandwidth requirement.
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)