Competitive analysis of most-request-first for scheduling broadcasts with start-up delay

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:
Theoretical Computer Science
Year:
2008

Citing 18
Cited 0

Videotex/teletext principles & practices

Videotex/teletext principles & practices
Scheduling policies for an on-demand video server with batching

MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Scheduling for Overload in Real-Time Systems

IEEE Transactions on Computers
Scheduling on-demand broadcasts: new metrics and algorithms

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling data broadcast to “impatient” users

Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
Online scheduling with hard deadlines

Journal of Algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Broadcast on Demand: Efficient and Timely Dissemination of Data in Mobile Environments

RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
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
Sharing video on demand

Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Efficient Data Dissemination to Mobile Clients in E-Commerce Applications

WECWIS '01 Proceedings of the Third International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS '01)
Patience is a virtue: the effect of slack on competitiveness for admission control

Journal of Scheduling - Special issue: On-line algorithm part I
On-demand data broadcasting for mobile decision making

Mobile Networks and Applications
Scheduling broadcasts with deadlines

Theoretical Computer Science - Special papers from: COCOON 2003
A Dynamic Hybrid Scheduling Algorithm with Clients' Departure for Impatient Clients in Heterogeneous Environments

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
A maiden analysis of longest wait first

ACM Transactions on Algorithms (TALG)
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	5.23

Visualization

Abstract

In this paper, we give a tight and complete mathematical analysis of the Most-Request-First algorithm for scheduling on-demand broadcasts with start-up delay. The algorithm is natural and simple, yet its practical performance is surprisingly good. We derive tight upper and lower bounds on its competitive ratio under different system configurations. Our results reveal an interesting relationship between the start-up delay and the competitiveness of the algorithm.