Evaluation of a Broadcast Scheduling Algorithm

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.

[1]  Nitin H. Vaidya,et al.  Response Time in Data Broadcast Systems: Mean, Variance and Tradeoff , 2002, Mob. Networks Appl..

[2]  A. Juret.  George Kingsley Zipf, Relative frequency as a determinant of phonetic change (Harvard Studies in Classical Philology, vol. XL), 1929 , .

[3]  Rafael Alonso,et al.  Broadcast disks: data management for asymmetric communication environments , 1995, SIGMOD '95.

[4]  Stanley B. Zdonik,et al.  Dissemination-based data delivery using broadcast disks , 1995, IEEE Wirel. Commun..

[5]  George Kingsley Zipf,et al.  Relative Frequency as a Determinant of Phonetic Change , 1930 .

[6]  BarbaráDaniel.  Mobile Computing and Databases-A Survey , 1999 .

[7]  Nitin H. Vaidya,et al.  Data Broadcast in Asymmetric Wireless Environments , 1996 .

[8]  Michael J. Franklin,et al.  Scheduling for large-scale on-demand data broadcasting , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[9]  Herb Schwetman.  CSIM18—the simulation engine , 1996, Winter Simulation Conference.

[10]  J. Wong,et al.  Broadcast Delivery , 1988, Proc. IEEE.

[11]  G. Zipf,et al.  Relative Frequency as a Determinant of Phonetic Change , 1930 .

[12]  H VaidyaNitin,et al.  Scheduling data broadcast in asymmetric communication environments , 1999 .

[13]  Mostafa H. Ammar,et al.  The Design of Teletext Broadcast Cycles , 1985, Perform. Evaluation.

[14]  Daniel Barbará,et al.  Mobile Computing and Databases - A Survey , 1999, IEEE Trans. Knowl. Data Eng..

[15]  Nitin H. Vaidya,et al.  Log-time algorithms for scheduling single and multiple channel data broadcast , 1997, MobiCom '97.

[16]  AcharyaSwarup,et al.  Balancing push and pull for data broadcast , 1997 .

[17]  Stanley B. Zdonik,et al.  Balancing push and pull for data broadcast , 1997, SIGMOD '97.

[18]  Nitin H. Vaidya,et al.  Efficient algorithms for scheduling data broadcast , 1999 .

[19]  Tomasz Imielinski,et al.  Mobile wireless computing: challenges in data management , 1994, CACM.

[20]  Nitin H. Vaidya,et al.  Scheduling data broadcast to “impatient” users , 1999, MobiDe '99.

[21]  Michael J. Franklin,et al.  R × W: a scheduling approach for large-scale on-demand data broadcast , 1999, TNET.

[22]  Mostafa H. Ammar,et al.  On the optimality of cyclic transmission in teletext systems , 1985, 1985 24th IEEE Conference on Decision and Control.

[23]  Tomasz Imielinski,et al.  Sleepers and workaholics: caching strategies in mobile environments , 1994, SIGMOD '94.

[24]  Nitin H. Vaidya,et al.  Scheduling data broadcast in asymmetric communication environments , 1999, Wirel. Networks.