Evaluation of a broadcast scheduling algorithm

Creative Commons License

Karakaya K. M., Ulusoy Ö.

5th East European Conference on Advances in Databases and Information Systems, ADBIS 2001, Vilniaus, Litvanya, 25 - 28 Eylül 2001, cilt.2151, ss.182-195 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 2151
  • Doi Numarası: 10.1007/3-540-44803-9_15
  • Basıldığı Şehir: Vilniaus
  • Basıldığı Ülke: Litvanya
  • Sayfa Sayıları: ss.182-195
  • TED Üniversitesi Adresli: Evet

Özet

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.