Evaluation of a broadcast scheduling algorithm
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
182 - 195
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27615
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.