Evaluation of a broadcast scheduling algorithm

Date
2001
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Advances in Databases and Information Systems
Print ISSN
0302-9743
Electronic ISSN
Publisher
Springer, Berlin, Heidelberg
Volume
2151
Issue
Pages
182 - 195
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Series
Abstract

One of the two main approaches of data broadcasting is pull- based data delivery. In this paper, we focus on the problem of scheduling data items to broadcast in such a pull-based environment. Previous work has shown that the Longest Wait First heuristic has the best performance results compared to all other broadcast scheduling algorithms, however the decision overhead avoids its practical implementation. Observing this fact, we propose an efficient broadcast scheduling algorithm which is based on an approximate version of the Longest Wait First heuristic. We also compare the performance of the proposed algorithm against well- known broadcast scheduling algorithms. © Springer-Verlag Berlin Heidelberg 2001.

Course
Other identifiers
Book Title
Keywords
Algorithms, Heuristic algorithms, Information systems, Broadcast scheduling, Data broadcasting, Data delivery, Data items, Scheduling algorithms
Citation
Published Version (Please cite this version)