On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling data broadcast to “impatient” users
Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Minimizing maximum response time in scheduling broadcasts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Response time in data broadcast systems: mean, variance and tradeoff
Mobile Networks and Applications
A Comparison of Multicast Pull Models
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Scheduling broadcasts with deadlines
Theoretical Computer Science - Special papers from: COCOON 2003
A maiden analysis of longest wait first
ACM Transactions on Algorithms (TALG)
A tight lower bound for job scheduling with cancellation
Information Processing Letters
Online algorithms for the provision of quality of service in networks
Online algorithms for the provision of quality of service in networks
Laxity helps in broadcast scheduling
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
On Job Scheduling with Preemption Penalties
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Online deadline scheduling with preemption penalties
Computers and Industrial Engineering
Online scheduling of bounded length jobs to maximize throughput
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online scheduling of bounded length jobs to maximize throughput
Journal of Scheduling
| Hi-index | 5.23 |
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@Dlog@D+O(@D^5^/^6), which improves significantly the previous best upper bound of @D+@D+2. We also prove that any online scheduler for the problem cannot have competitive ratio smaller than @D2ln@D-1. It follows that Balance is optimal within a constant factor.