Abstract
On-demand data broadcasting is a new and important technique for information dissemination. In this paper, we design and analyse a novel online scheduler Balance for scheduling on-demand data broadcasts. Balance has competitive ratio 6 Δ log Δ + O ( Δ 5 / 6 ) , which improves significantly the previous best upper bound of Δ + Δ + 2 . We also prove that any online scheduler for the problem cannot have competitive ratio smaller than Δ 2 ln Δ − 1 . It follows that Balance is optimal within a constant factor.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
