Evaluation of a broadcast scheduling algorithm
Date
2001
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
0
views
views
9
downloads
downloads
Citation Stats
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.
Source Title
Advances in Databases and Information Systems
Publisher
Springer, Berlin, Heidelberg
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English