On-Demand Bounded Broadcast Scheduling with Tight Deadlines

@article{Poon2006OnDemandBB,
  title={On-Demand Bounded Broadcast Scheduling with Tight Deadlines},
  author={Chung Keung Poon and Feifeng Zheng and Yin-Feng Xu},
  journal={Int. J. Found. Comput. Sci.},
  year={2006},
  volume={18},
  pages={251-262}
}
We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be satisfied simultaneously by one broadcast. The HEU algorithm of Woeginger (1994) is proven to be optimal in maximizing the number of satisfied requests when the pages have equal length and the requests have tight deadlines. However, we show that when there are maximum bounds on the number and weight of requests at any… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…