VoD QAM resource allocation algorithms

Authors:
Jiong Gong;David Reed;Terry Shaw;Daniel Vivanco;Jim Martin
Affiliations:
Cable Television Laboratories, Inc., Louisville, CO;Cable Television Laboratories, Inc., Louisville, CO;Cable Television Laboratories, Inc., Louisville, CO;Cable Television Laboratories, Inc., Louisville, CO;Department of Computer Science, Clemson University
Venue:
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Year:
2006

Citing 8
Cited 0

Scheduling policies for an on-demand video server with batching

MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Dynamic batching policies for an on-demand video server

Multimedia Systems
Adaptive piggybacking: a novel technique for data sharing in video-on-demand storage servers

Multimedia Systems
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Merging video streams in a multimedia storage server: complexity and heuristics

Multimedia Systems
The Split and Merge Protocol for Interactive Video-on-Demand

IEEE MultiMedia
Introduction to Probability Models, Ninth Edition

Introduction to Probability Models, Ninth Edition
On Optimal Batching Policies for Video-on-Demand Storage Servers

ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new Quadrature Amplitude Modulation (QAM) resource allocation algorithm for Video on Demand (VoD) when there is a mixture of standard definition (SD) and high definition (HD) video streams. We have developed a simulation model to compare this algorithm with two popular algorithms: the least-loaded algorithm and the most-loaded algorithm. We show that our algorithm, which we call the non-mixing algorithm, performs signi-ficantly better than the two existing algorithms by accommodating more streams thereby lowering the blocking probabilities under a range of assum-ptions of peak concurrent usage rate and percentage of HD streams. Using computer simulation we found that the non-mixing algorithm leads to an average of 4.39% higher allowed peak usage rate than the least-loaded and most-loaded algorithms.