A tight analysis of most-requested-first for on-demand data broadcast

Authors:
Regant Y. S. Hung;H. F. Ting
Affiliations:
Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong;Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 10
Cited 0

Scheduling policies for an on-demand video server with batching

MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Exploring wait tolerance in effective batching for video-on-demand scheduling

Multimedia Systems
Scheduling data broadcast to “impatient” users

Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A Simulation-Based Analysis of Scheduling Policies for Multimedia Servers

ANSS '03 Proceedings of the 36th annual symposium on Simulation
Competitive Analysis of On-line Algorithms for On-demand Data Broadcast Scheduling

ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
A maiden analysis of Longest Wait First

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling broadcasts with deadlines

Theoretical Computer Science - Special papers from: COCOON 2003
A near optimal scheduler for on-demand data broadcasts

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Design and analysis of online batching systems

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives a complete and tight mathematical analysis on the performance of the Most-Requested-First algorithm for on-demand data broadcast. The algorithm is natural and simple, yet its performance is surprisingly good in practice. We derive tight upper and lower bounds on MRF’s competitiveness and thus reveal the exact competitive ratios of the algorithm under different system configurations. We prove that the competitive ratio of MRF is exactly $3 - \frac{\ell}{d}$ when the start-up delay d is a multiple of the page length ℓ; otherwise the ratio is 3.